• Corpus ID: 119206948

Can Chaotic Quantum Circuits Maintain Quantum Supremacy under Noise

@article{Yung2017CanCQ,
  title={Can Chaotic Quantum Circuits Maintain Quantum Supremacy under Noise},
  author={Man-Hong Yung and Xun Gao},
  journal={arXiv: Quantum Physics},
  year={2017},
  url={https://api.semanticscholar.org/CorpusID:119206948}
}
  • M. YungXun Gao
  • Published 27 June 2017
  • Physics, Computer Science
  • arXiv: Quantum Physics
This work shows that, for a family of chaotic quantum circuits subject to Pauli errors, there exists an non-exponential classical algorithm capable of simulating the noisy chaotic quantum circuit with bounded errors.
[PDF] Semantic Reader
15 Citations
Background Citations
6
Methods Citations
2

15 Citations

Fault-tolerant quantum speedup from constant depth quantum circuits

This work develops a fault-tolerant version of one family of these sampling problems, which it is shown can be implemented using quantum circuits of constant depth, and introduces various new concepts such as constant depth magic state distillation (MSD), and constant depth output routing, which arise naturally in measurement based quantum computation (MBQC), but have no constant-depth analogue in the circuit model.

The sudden death of quantum advantage in correlation generations

As quantum error corrections still cannot be realized physically, quantum noise is the most profound obstacle to the implementations of large-scale quantum algorithms or quantum schemes. It has been…

Efficient classical simulation of noisy quantum computation

It is proved that under general conditions most of the quantum circuits at any constant level of noise per gate can be efficiently simulated classically with the cost increasing only polynomially with the size of the circuits.

Simulating Noisy Variational Quantum Algorithms: A Polynomial Approach.

A novel polynomial-scale method based on the path integral of observable's backpropagation on Pauli paths that efficiently approximates expectation values of operators in variational quantum algorithms with bounded truncation error in the presence of single-qubit Pauli noise.

Efficient classical simulation of noisy random quantum circuits in one dimension

It is numerically demonstrated that for the two-qubit gate error rates the authors considered, there exists a characteristic system size above which adding more qubits does not bring about an exponential growth of the cost of classical MPO simulation of 1D noisy systems, possibly making classical simulation practically not feasible even with state-of-the-art supercomputers.

Quantum supremacy using a programmable superconducting processor

Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute.

Multi-Tensor Contraction for XEB Verification of Quantum Circuits

This work presents a multi-tensor contraction algorithm for speeding up the calculations of XEB for quantum circuits, where the computational cost can be significantly reduced through some form of memoization.

Efficient classical simulation of random shallow 2D quantum circuits

It is proved by exhibiting a shallow circuit family with uniformly random gates that cannot be efficiently classically simulated near-exactly under standard hardness assumptions, but can be simulated approximately for all but a superpolynomially small fraction of circuit instances in time linear in the number of qubits and gates.

Sampling and the complexity of nature (Assessing, testing, and challenging the computational power of quantum devices)

The quantum sign problem is identified as a root of the computational intractability of quantum output probabilities and it turns out that the intricate structure of the probability distributions the sign problem gives rise to, prohibits their verification from few samples.

Experimental cryptographic verification for near-term quantum cloud computing.

7 References

Quantum Computation and Quantum Information (10th Anniversary edition)

Containing a wealth of figures and exercises, this well-known textbook is ideal for courses on the subject, and will interest beginning graduate students and researchers in physics, computer science, mathematics, and electrical engineering.

Classical and Quantum Computation

    S. Yan
    Computer Science, Mathematics
  • 2015
This chapter shall give an account of the basic concepts and results in both classical and quantum computation theories, that will be used in the rest of the book.

I and J