Quantum and classical tradeoffs

@article{Shi2004QuantumAC,
  title={Quantum and classical tradeoffs},
  author={Yaoyun Shi},
  journal={Electron. Colloquium Comput. Complex.},
  year={2004}
}
  • Yaoyun Shi
  • Published 30 December 2003
  • Computer Science
  • Electron. Colloquium Comput. Complex.
The Quantum Frontier
TLDR
This work describes aspects of quantum mechanics that are at the heart of a quantum view of information processing, and gives its own idiosyncratic view of a number of these topics in the hopes of correcting common misconceptions and highlighting aspects that are often overlooked.
Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy
TLDR
A promise problem to decide whether output probability distributions of two quantum circuits are far apart or close is defined, and it is shown that PDD-Max is BQP-complete, but if the two circuits are restricted to some types in the second level of the Fourier hierarchy, such as the HC1Q model or the IQP model, PDd-Max has a Merlin-Arthur system with quantum polynomial-time Merlin and classical probabilistic polyn coefficients.
On the Role of Hadamard Gates in Quantum Circuits
We study a reduced quantum circuit computation paradigm in which the only allowable gates either permute the computational basis states or else apply a “global Hadamard operation”, i.e. apply a
Changing the circuit-depth complexity of measurement-based quantum computation with hypergraph states
TLDR
By developing techniques to analyze Pauli measurements on multi-qubit hypergraph states generated by the Controlled-Controlled-Z gates, this work introduces a deterministic scheme of universal measurement-based computation that enjoys massive parallelization of CCZ and SWAP gates.
Rational proofs for quantum computing
TLDR
This paper shows that the client can be completely classical if the server is rational (i.e., economically motivated), following the ``rational proofs" framework of Azar and Micali.
Fine-grained quantum computational supremacy
TLDR
This paper studies "fine-grained" version of quantum supremacy that excludes some exponential-time classical simulations, and shows that output probability distributions of Clifford-$T quantum computing cannot be classically sampled within a constant multiplicative error.
Classical verification of quantum circuits containing few basis changes
TLDR
The task of verifying the correctness of quantum computation for a restricted class of circuits which contain at most two basis changes is considered, and it is shown that, when the circuit has an outcome with probability at least the inverse of some polynomial in the circuit size, the outcome can be checked inPolynomial time with bounded error.
Delegating Quantum Computation Using Only Hash Functions
TLDR
A new scheme for delegating a large circuit family, which is not based on quantum one time pad, but on a new encoding called "entanglement encoding", which can be proved secure in the quantum random oracle model, without relying on additional assumptions.
N ov 2 01 8 Delegating Quantum Computation Using Only Hash Functions
TLDR
A new scheme for delegating a large circuit family, which is not based on quantum one time pad, but on a new encoding called ”entanglement encoding”, which can be proved secure in the quantum random oracle model, without relying on additional assumptions.
Delegating Quantum Computation in the Quantum Random Oracle Model
TLDR
A new scheme for delegating a large circuit family, which is non-interactive, requires very little quantum computation from the client, and can be proved secure in the quantum random oracle model, without relying on additional assumptions, such as the existence of fully homomorphic encryption.
...
...

References

SHOWING 1-10 OF 30 REFERENCES
Quantum lower bounds by quantum arguments
TLDR
Two new Ω(√N) lower bounds on computing AND of ORs and inverting a permutation and more uniform proofs for several known lower bounds which have been previously proven via a variety of different techniques are proved.
Both Toffoli and controlled-NOT need little help to do universal quantum computing
TLDR
It is proved that Controlled-NOT plus any single-qubit real gate that does not preserve the computational basis and is not Hadamard (or its alike) are universal for quantum computing.
Strengths and Weaknesses of Quantum Computing
TLDR
It is proved that relative to an oracle chosen uniformly at random with probability 1 the class $\NP$ cannot be solved on a quantum Turing machine (QTM) in time $o(2^{n/2})$.
Tight bounds on quantum searching
TLDR
A lower bound on the efficiency of any possible quantum database searching algorithm is provided and it is shown that Grover''s algorithm nearly comes within a factor 2 of being optimal in terms of the number of probes required in the table.
A fast quantum mechanical algorithm for database search
TLDR
In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) .
Quantum walk algorithm for element distinctness
  • A. Ambainis
  • Computer Science
    45th Annual IEEE Symposium on Foundations of Computer Science
  • 2004
TLDR
An O(N/sup k/(k+1)/) query quantum algorithm is given for the generalization of element distinctness in which the authors have to find k equal items among N items.
Quantum query algorithms and lower bounds
TLDR
The main results and techniques in this query (oracle) model, where input is given by a black box that answers queries and the complexity of the algorithm is measured by the number of queries to the black box, are surveyed.
Quantum lower bound for recursive fourier sampling
I correct a technical error in [1]. The conclusions about Recursive Fourier Sampling are unaffected.
Classical and Quantum Computation
Introduction Classical computation Quantum computation Solutions Elementary number theory Bibliography Index.
Both Toffoli and Hadamard need little help to do universal quantum computation
  • Quantum Information and Computation,
  • 2003
...
...