Quantum nonexpander problem is quantum-Merlin-Arthur-complete
A quantum expander is a unital quantum channel that is rapidly mixing, has only a few Kraus operators, and can be implemented efficiently on a quantum computer. We consider the problem of estimating the mixing time (i.e., the spectral gap) of a quantum expander. We show that the problem of deciding...
Main Authors: | Jordan, Stephen P., Liu, Yi-Kai, Wocjan, Pawel, Bookatz, Adam D. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Center for Theoretical Physics |
Format: | Article |
Language: | en_US |
Published: |
American Physical Society
2014
|
Online Access: | http://hdl.handle.net/1721.1/88738 https://orcid.org/0000-0001-9475-2091 |
Similar Items
-
Quantum-Merlin-Arthur-complete problems for stoquastic Hamiltonians and Markov matrices
by: Gosset, David Nicholas, et al.
Published: (2010) -
Hamiltonian quantum simulation with bounded-strength controls
by: Bookatz, Adam D., et al.
Published: (2014) -
PCPs for Arthur-Merlin games and communication protocols
by: Drucker, Andrew Donald
Published: (2010) -
Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity
by: Akmal, Shyan, et al.
Published: (2023) -
Control, gates, and error suppression with Hamiltonians in quantum computation
by: Bookatz, Adam Darryl
Published: (2016)