Quantum-inspired permanent identities
The permanent is pivotal to both complexity theory and combinatorics. In quantum computing, the permanent appears in the expression of output amplitudes of linear optical computations, such as in the Boson Sampling model. Taking advantage of this connection, we give quantum-inspired proofs of many e...
Main Authors: | Ulysse Chabaud, Abhinav Deshpande, Saeed Mehraban |
---|---|
Format: | Article |
Language: | English |
Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2022-12-01
|
Series: | Quantum |
Online Access: | https://quantum-journal.org/papers/q-2022-12-19-877/pdf/ |
Similar Items
-
Holomorphic representation of quantum computations
by: Ulysse Chabaud, et al.
Published: (2022-10-01) -
Classical simulation of Gaussian quantum circuits with non-Gaussian input states
by: Ulysse Chabaud, et al.
Published: (2021-07-01) -
Optimal quantum-programmable projective measurements with coherent states
by: Niraj Kumar, et al.
Published: (2021-10-01) -
Experimental cheat-sensitive quantum weak coin flipping
by: Simon Neves, et al.
Published: (2023-04-01) -
The complexity of sampling from a weak quantum computer
by: Mehraban, Saeed.
Published: (2020)