QMA is the complexity class of computational problems that are efficiently verifiable by a quantum algorithm with the help of a witness in contrast to the smaller class BQP of problems efficiently solvable by a quantum algorithm without a witness. Like their classical counterparts NP and P, the class QMA is believed to be strictly larger than BQP, but the definitive answer remains one of the most fundamental open problems of complexity theory. An equality of QMA and BQP would imply that quantum computers can solve many physically and logically relevant problems efficiently, including the Local Hamiltonian problem and the Satisfiability problem for Boolean formulas. New approaches to gain more insight into the structure of BQP and QMA as well as which witness forms are sufficient for QMA are hence worth pursuing. This thesis comprises three research focuses: Firstly, we extend the uniform diagonalization theorem to complexity classes of promise problems in order to construct strictly intermediate problems between QMA and BQP under the assumption that these classes are unequal. The existence of strictly intermediate problems motivates our definition of noisy QMA classes, which form hierarchies of intermediate classes between QMA and BQP by restricting the witnesses to outputs of certain quantum channels. In our second research focus we apply the tool of concatenated coding to prove a bound on the witness noise up to which QMA stays robust. Besides a bound for general i.i.d. channels, we can prove that QMA stays robust if each witness qubit is disturbed by 18 % depolarizing or 27 % dephasing noise, while for complete depolarization or dephasing the noisy class obviously collapses to BQP and QCMA, respectively. In the third research focus we interpret the famous QPCP conjecture as robustness of the class QMA against high witness disturbance. Moreover, we consider a multiprover protocol by Fitzsimons and Vidick that constitutes a first step towards an important alternative formulation of the QPCP conjecture and achieve a reduction of the number of provers and an improvement of the acceptance probability for this protocol.
QMA is the complexity class of computational problems that are efficiently verifiable by a quantum algorithm with the help of a witness in contrast to the smaller class BQP of problems efficiently solvable by a quantum algorithm without a witness. Like their classical counterparts NP and P, the class QMA is believed to be strictly larger than BQP, but the definitive answer remains one of the most fundamental open problems of complexity theory. An equality of QMA and BQP would imply that quantum computers can solve many physically and logically relevant problems efficiently, including the Local Hamiltonian problem and the Satisfiability problem for Boolean formulas. New approaches to gain more insight into the structure of BQP and QMA as well as which witness forms are sufficient for QMA are hence worth pursuing. This thesis comprises three research focuses: Firstly, we extend the uniform diagonalization theorem to complexity classes of promise problems in order to construct strictly intermediate problems between QMA and BQP under the assumption that these classes are unequal. The existence of strictly intermediate problems motivates our definition of noisy QMA classes, which form hierarchies of intermediate classes between QMA and BQP by restricting the witnesses to outputs of certain quantum channels. In our second research focus we apply the tool of concatenated coding to prove a bound on the witness noise up to which QMA stays robust. Besides a bound for general i.i.d. channels, we can prove that QMA stays robust if each witness qubit is disturbed by 18 % depolarizing or 27 % dephasing noise, while for complete depolarization or dephasing the noisy class obviously collapses to BQP and QCMA, respectively. In the third research focus we interpret the famous QPCP conjecture as robustness of the class QMA against high witness disturbance. Moreover, we consider a multiprover protocol by Fitzsimons and Vidick that constitutes a first step towards an important alternative formulation of the QPCP conjecture and achieve a reduction of the number of provers and an improvement of the acceptance probability for this protocol.
Using the tool of concatenated stabilizer coding, we prove that the complexity class QMA remains unchanged even if every witness qubit is disturbed by constant noise. This result may not only be relevant for physical implementations of verifying protocols but also attacking the relationship between the complexity classes QMA, QCMA and BQP, which can be reformulated in this unified framework of a verifying protocol receiving a disturbed witness. While QCMA and BQP are described by fully dephasing and depolarizing channels on the witness qubits, respectively, our result proves QMA to be robust against 27% dephasing and 18% depolarizing noise.
The class QMA plays a fundamental role in quantum complexity theory and it has found surprising connections to condensed matter physics and in particular in the study of the minimum energy of quantum systems.In this paper, we further investigate the class QMA and its related class QCMA by asking what makes quantum witnesses potentially more powerful than classical ones.We provide a definition of a new class, SQMA, where we restrict the possible quantum witnesses to the "simpler" subset states, i.e. a uniform superposition over the elements of a subset of n-bit strings.Surprisingly, we prove that this class is equal to QMA, hence providing a new characterisation of the class QMA.We also prove the analogous result for QMA(2) and describe a new complete problem for QMA and a stronger lower bound for the class QMA 1 .
The new computational paradigms of quantum computing change the current ideas of what can be efficiently computed. The chapter discusses the theory of quantum complexity classes such as bounderd-error quantum polynomial time (BQP), quantum Merlin-Arthur (QMA), and others, their theoretical foundations, their definition and their relationship with classical complexity classes like P, NP, and PSPACE. The special attention here is on the use of superposition, entanglement and interference to be able to solve problems more efficiently than with classical algorithms using quantum algorithms. The reduction relation, the completeness and separations of quantum complexity classes are discussed, along with some open problems including the quantum-classical separation of computational power. Case studies of important quantum algorithms, relevant to cryptography, optimization, and scientific computing like Shor's factoring algorithm, Grover's search algorithm, and quantum simulation methods follow the classes.
QMA is the class of languages that can be decided by an efficient quantum verifier given a quantum witness, whereas QCMA is the class of such languages where the efficient quantum verifier only is given a classical witness. A challenging fundamental goal in quantum query complexity is to find a classical oracle separation for these classes. In this work, we offer a new approach towards proving such a separation that is qualitatively different than prior work, and show that our approach is sound assuming a natural statistical conjecture which may have other applications to quantum query complexity lower bounds.
Prior work has established that all problems in NP admit classical zero-knowledge proof systems, and under reasonable hardness assumptions for quantum computations, these proof systems can be made secure against quantum attacks. We prove a result representing a further quantum generalization of this fact, which is that every problem in the complexity class QMA has a quantum zero-knowledge proof system. More specifically, assuming the existence of an unconditionally binding and quantum computationally concealing commitment scheme, we prove that every problem in the complexity class QMA has a quantum interactive proof system that is zero-knowledge with respect to efficient quantum computations. Our QMA proof system is sound against arbitrary quantum provers, but only requires an honest prover to perform polynomial-time quantum computations, provided that it holds a quantum witness for a given instance of the QMA problem under consideration. The proof system relies on a new variant of the QMA-complete local Hamiltonian problem in which the local terms are described by Clifford operations and standard basis measurements. We believe that the QMA-completeness of this problem may have other uses in quantum complexity.
This dissertation studies the interplay between quantum and classical computational resources through the lens of computational complexity theory. Part I considers low-energy states of quantum systems. We study the complexity of estimating ground- and excited-state energies of local Hamiltonians, given access to a guiding state promised to have non-negligible overlap with the relevant eigenspace. We formalise access models for such guiding states, examine their properties and relations, and study the problem for physically motivated Hamiltonians. We also study the task of obtaining approximate descriptions of ground states, given QMA-oracle access, in the setting of low-locality reduced density matrices. Part II focuses on quantum probabilistically checkable proof systems (QPCPs). We define a general class of QPCPs that allows adaptivity and multiple unentangled provers, and study its relationship to constant-gap local Hamiltonian problems via quantum reductions. Additionally, we investigate quantum–classical PCPs (QCPCPs), where a quantum verifier has either classical or quantum query access to a classical proof. Part III explores alternative complexity measures: unitary query complexity and sample complexity. For unitary query complexity, we develop a lower-bound technique based on unitary channel discrimination. In the context of sample complexity, we introduce and analyse a new sample-to-sample task, called complement sampling, and study the power of quantum computation with quantum samples over their classical counterparts.