• Corpus ID: 53646378

Efficient classical simulation of noisy quantum computation

@article{Gao2018EfficientCS,
  title={Efficient classical simulation of noisy quantum computation},
  author={Xun Gao and Luming Duan},
  journal={arXiv: Quantum Physics},
  year={2018},
  url={https://api.semanticscholar.org/CorpusID:53646378}
}
  • Xun GaoL. Duan
  • Published 7 October 2018
  • Physics, Computer Science
  • arXiv: Quantum Physics
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.
[PDF] Semantic Reader
51 Citations
Highly Influential Citations
6
Background Citations
16
Methods Citations
9
Results Citations
2

Figures from this paper

51 Citations

Classical simulations of noisy variational quantum circuits

A classical simulation algorithm is constructed, lowesa (low weight efficient simulation algorithm), for estimating expectation values of noisy parameterised quantum circuits with a fixed observable, that gives an efficient, polynomial algorithm in the number of qubits (and depth), with approximation error that vanishes exponentially in the physical error rate and a controllable cutoff parameter.

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.

Approximate Equivalence Checking of Noisy Quantum Circuits

This work presents two algorithms, aiming at different situations where the number of noises varies, for computing the fidelity between an ideal quantum circuit and its noisy implementation, and shows that the proposed algorithms outperform in both efficiency and scalability.

Efficient simulation of Clifford circuits with small Markovian errors

This work introduces an efficient algorithm for approximate simulation of Clifford circuits with arbitrary small errors that can be described by sparse $n$-qubit Lindbladians that is used to study the impact of coherent errors on syndrome extract circuits and on deep random 225-qubit circuits containing over a million gates.

Quantum computing simulation and optimization methods: A survey

The basic principles of quantum computing are expounded from quantum bits, quantum gates and quantum circuits, and the ideas and advantages and disadvantages of different methods of amplitude simulation are summarized and analyzed.

Methods for classically simulating noisy networked quantum architectures

A general methodology for constructing realistic simulations emulating the physical system which will both provide a benchmark for realistic devices, and guide experimental research in the quest for quantum-advantage is provided.

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.

Polynomial-Time Classical Simulation of Noisy IQP Circuits with Constant Depth

It is demonstrated that for an arbitrary IQP circuit undergoing dephasing or depolarizing noise, whose depth is greater than a critical $O(1)$ threshold, the output distribution can be efficiently sampled by a classical computer.

Pauli path simulations of noisy quantum circuits beyond average case

This paper considers the classical simulation of local observables in circuits composed of Clifford and T gates, and derives sufficient conditions for simulatability in terms of the noise rate and the fraction of gates that are T gates, and shows that if noise is introduced at a faster rate than T gates, the simulation becomes classically easy.

Classically Simulating Quantum Circuits with Local Depolarizing Noise

It is shown that the presence of small noise drastically affects the classical simulatability of CT-ECS circuits, and an extension of the noise model where the noise rate can vary with each qubit is considered, which provides a similar sufficient condition for classically simulating CT- ECS circuits with anti-concentrated output probability distributions.
...

29 References

Can Chaotic Quantum Circuits Maintain Quantum Supremacy under Noise

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.

Achieving quantum supremacy with sparse and noisy commuting quantum computations

It is shown that purely classical error-correction techniques can be used to design IQP circuits which remain hard to simulate classically, even in the presence of arbitrary amounts of noise of this form.

The Heisenberg Representation of Quantum Computers

A formalism describing the evolution of operators rather than states has proven extremely fruitful in understanding an important class of quantum operations, and a simple group structure is sufficient to allow a rich range of quantum effects, although it falls short of the full power of quantum computation.

Quantum sampling problems, BosonSampling and quantum supremacy

This paper will review sampling problems and the arguments that have been used to deduce when sampling problems are hard for classical computers to simulate, and two classes of quantum sampling problems that demonstrate the supremacy of quantum algorithms are BosonSampling and Instantaneous Quantum Polynomial-time Sampling.

Characterizing quantum supremacy in near-term devices

The computational cost of relevant classical algorithms is studied and it is concluded that quantum supremacy can be achieved with circuits in a two-dimensional lattice of 7 × 7 qubits and around 40 clock cycles.

Average-case complexity versus approximate simulation of commuting quantum computations

It is shown that, if either of two plausible average-case hardness conjectures holds, then IQP computations are hard to simulate classically up to constant additive error.

Quantum computing and the entanglement frontier

This study is motivated by the observation (widely believed but unproven) that classical systems cannot simulate highly entangled quantum systems efficiently, and it hopes to hasten the day when well controlled quantum systems can perform tasks surpassing what can be done in the classical world.

Fourier analysis of sampling from noisy chaotic quantum circuits

It is estimated that state-of-the-art classical supercomputers would fail to simulate high-fidelity chaotic quantum circuits with approximately fifty qubits and depth forty, and a different approximation algorithm to a noisy distribution is proposed, using the statistical properties of the Porter-Thomas distribution.

Can one trust quantum simulators?

It is found that disorder can decrease the reliability of an analog quantum simulator of this model, although large errors in local observables are introduced only for strong levels of disorder.

Local Random Quantum Circuits are Approximate Polynomial-Designs

We prove that local random quantum circuits acting on n qubits composed of O(t10n2) many nearest neighbor two-qubit gates form an approximate unitary t-design. Previously it was unknown whether…