Succinct quantum proofs for properties of finite groups

@article{Watrous2000SuccinctQP,
  title={Succinct quantum proofs for properties of finite groups},
  author={John Watrous},
  journal={Proceedings 41st Annual Symposium on Foundations of Computer Science},
  year={2000},
  pages={537-546}
}
  • J. Watrous
  • Published 7 September 2000
  • Mathematics, Computer Science
  • Proceedings 41st Annual Symposium on Foundations of Computer Science
The article considers a quantum computational variant of nondeterminism based on the notion of a quantum proof, which is a quantum state that plays a role similar to a certificate in an NP-type proof. Specifically, we consider quantum proofs for properties of black-box groups, which are finite groups whose elements are encoded as strings of a given length and whose group operations are performed by a group oracle. We prove that for an arbitrary group oracle, there exist succinct (polynomial… 

Figures from this paper

Quantum Proofs
TLDR
An overview of many of the known results concerning quantum proofs, computational models based on this concept, and properties of the complexity classes they define is provided.
Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups
TLDR
The result shows that computing the order of a solvable group, which is one of the most general problems for which quantum computing exhibits an exponential speed-up with respect to classical computing, can be realized in this model.
An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem
TLDR
This paper presents a quantum algorithm solving instances of the nonabelian group isomorphism problem exponentially faster than the best known classical algorithms.
Quantum versus Classical Proofs and Advice
  • S. Aaronson, G. Kuperberg
  • Mathematics, Computer Science
    Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)
  • 2007
TLDR
This paper shows that any quantum algorithm needs Omega (radic2n-m+1) queries to find an n-qubit "marked state"Psi rang, and gives an explicit QCMA protocol that nearly achieves this lower bound.
On quantum computing and pseudorandomness
TLDR
Evidence is given that BQP \not\subset \PH, relating the classes of languages decidable with a quantum computer to a generalization of \NP, and an instantiation of the Nisan-Wigderson pseudorandom generator that can be broken with quantum computers, but not with the relevant mode of classical computation.
Quantum algorithms for solvable groups
  • J. Watrous
  • Mathematics, Computer Science
    STOC '01
  • 2001
TLDR
An important byproduct of this polynomial-time quantum algorithm is able to produce a pure quantum state that is uniform over the elements in any chosen subgroup of a solvable group, which yields a natural way to apply existing quantum algorithms to factor groups of solvable groups.
Towards Perfect Completeness in QMA
TLDR
It is proved that classical-witness quantum Merlin-Arthur proof systems can achieve perfect completeness, and any problem in QMA has a two-message quantum interactive proof system ofperfect completeness with constant soundness error.
Experimental verification of group non-membership in optical circuits
TLDR
This work provides an efficient way to verify GNM problems, in which each quantum circuit only contains O(1) group of oracle calls, and the number of qubits in each circuit is reduced by half.
Robust verification of quantum computation
TLDR
This work considers a single-prover verification protocol developed by Fitzsimons and Kashefi and shows that this protocol is indeed robust with respect to deviations on the quantum state prepared by the verifier, and proves a rigidity result for a type of quantum correlations known as steering correlations.
The Acrobatics of BQP
TLDR
It is shown that, in the black-box setting, the behavior of quantum polynomial-time ( BQP ) can be remarkably decoupled from that of classical complexity classes like NP .
...
...

References

SHOWING 1-10 OF 36 REFERENCES
Bounded Round Interactive Proofs in Finite Groups
  • L. Babai
  • Mathematics
    SIAM J. Discret. Math.
  • 1992
This paper considers “black box groups,” i.e., finite groups whose elements are uniquely encoded by strings of uniform length, with group operations being performed by a group oracleB. Let G, H be
Quantum Computability
TLDR
It is shown that when quantum Turing machines are restricted to have transition amplitudes which are algebraic numbers, BQP, EQP, and nondeterministic quantum polynomial time (NQP) are all contained in PP, hence in P and PSPACE.
Quantum complexity theory
TLDR
This paper gives the first formal evidence that quantum Turing machines violate the modern (complexity theoretic) formulation of the Church--Turing thesis, and proves that bits of precision suffice to support a step computation.
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
TLDR
It is proved that any polynomial-round quan tum interactiveProof system with two-sided bounded error can be parallelized to a quantum interactive proof system with exponentially small one-sided error, in which the prover and verifier exchange only 3 messages.
PSPACE has constant-round quantum interactive proof systems
  • J. Watrous
  • Computer Science, Mathematics
    40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
  • 1999
TLDR
It is proved that every language in PSPACE has a quantum interactive proof system that requires a total of only three messages to be sent between the prover and verifier and has exponentially small (one-sided) probability of error.
Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy
TLDR
It is shown that the complexity class NQP (a quantum analogue of NP) of Adleman, Demarrais and Huang, is equal to the counting class coC=P.
Quantum circuits with mixed states
TLDR
A solution for the subroutine problem: the general function that a quantum circuit outputs is a probabilistic function, but using pure state language, such a function can not be used as a black box in other computations.
On the Complexity of Matrix Group Problems I
TLDR
A theory of black box groups is built, and it is proved that for such subgroups, membership and divisor of the order are in NPB, and under a plausible mathematical hypothesis on short presentations of finite simple groups, nom membership and exaact order will also be inNPB.
Local expansion of vertex-transitive graphs and random generation in finite groups
  • L. Babai
  • Mathematics, Computer Science
    STOC '91
  • 1991
TLDR
A Monte Carlo algorithm is presented which constructs an efficient nearly uniform random generator for finite groups G in a very general setting and presumes a priori knowledge of an upper bound n on log |G|.
On universal and fault-tolerant quantum computing: a novel basis and a new constructive proof of universality for Shor's basis
TLDR
A novel universal and fault-tolerant basis (set of gates) for quantum computation is described, which achieves universality by including only one additional elementary gate and is potentially the simplest universal basis that one can construct.
...
...