• Corpus ID: 239016296

Evaluating NISQ Devices with Quadratic Nonresidues

  title={Evaluating NISQ Devices with Quadratic Nonresidues},
  author={Thomas G. Draper},
Comparing the relative quality of NISQ devices is difficult. Algorithms showing a quantum advantage are often tailored precisely to what a particular NISQ does well. We present a new algorithm for evaluating NISQs using quadratic nonresidues. We prove quantum computers can find quadratic nonresidues in deterministic polynomial time, whereas the classical version of this problem remains unsolved after hundreds of years. Using a restrictive computational rule set for finding quadratic nonresidues… 
1 Citations
Quantum Computers Can Find Quadratic Nonresidues in Deterministic Polynomial Time
A quantum algorithm is presented which generates a random quadratic nonresidue in deterministic polynomial time and without assuming the Generalized Riemann Hypothesis.


Characterizing quantum supremacy in near-term devices
A critical question for quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of
Quantum superiority for verifying NP-complete problems with linear optics
A team of researchers led by Iordanis Kerenidis has shown that the running time for a particular verification algorithm is drastically reduced when using a quantum protocol, rather than a classical one.
Quantum advantage with shallow circuits
It is shown that parallel quantum algorithms running in a constant time period are strictly more powerful than their classical counterparts; they are provably better at solving certain linear algebra problems associated with binary quadratic forms.
Complexity-Theoretic Foundations of Quantum Supremacy Experiments
General theoretical foundations are laid for how to use special-purpose quantum computers with 40--50 high-quality qubits to demonstrate "quantum supremacy": that is, a clear quantum speedup for some task, motivated by the goal of overturning the Extended Church-Turing Thesis as confidently as possible.
Quantum Computability
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.
Exact quantum Fourier transforms and discrete logarithm algorithms
We show how the Quantum Fast Fourier Transform (QFFT) can be made exact for arbitrary orders (first showing it for large primes). Most quantum algorithms only need a good approximation of the quantum
The Solovay-Kitaev algorithm
The algorithm can be used to compile Shor's algorithm into an efficient fault-tolerant form using only Hadamard, controlled-not, and π/8 gates, and is generalized to apply to multi-qubit gates and togates from SU(d).
A fast quantum mechanical algorithm for database search
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) .
Efficient Clifford+T approximation of single-qubit operators
  • P. Selinger
  • Mathematics, Physics
    Quantum Inf. Comput.
  • 2015
An efficient randomized algorithm for approximating an arbitrary element of SU(2) by a product of Clifford+T operators, up to any given error threshold e > 0.05, which is within an additive constant of optimal for certain z-rotations.
Experimental demonstration of quantum advantage for one-way communication complexity surpassing best-known classical protocol
The authors define a more feasible variant of the Hidden Matching problem, called sampling matching problem, and realise a proof-of-principle implementation beating the best known classical protocol.