Boundaries of quantum supremacy via random circuit sampling
- URL: http://arxiv.org/abs/2005.02464v2
- Date: Fri, 9 Oct 2020 19:08:09 GMT
- Title: Boundaries of quantum supremacy via random circuit sampling
- Authors: Alexander Zlokapa, Sergio Boixo, Daniel Lidar
- Abstract summary: Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling.
We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
- Score: 69.16452769334367
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Google's recent quantum supremacy experiment heralded a transition point
where quantum computing performed a computational task, random circuit
sampling, that is beyond the practical reach of modern supercomputers. We
examine the constraints of the observed quantum runtime advantage in an
extrapolation to circuits with a larger number of qubits and gates. Due to the
exponential decrease of the experimental fidelity with the number of qubits and
gates, we demonstrate for current fidelities a theoretical classical runtime
advantage for circuits deeper than a few hundred gates, while quantum runtimes
for cross-entropy benchmarking limit the region of a quantum advantage to a few
hundred qubits. However, the quantum runtime advantage boundary in circuit
width and depth grows exponentially with respect to reduced error rates, and
our work highlights the importance of continued progress along this line.
Extrapolations of measured error rates suggest that the limiting circuit size
for which a computationally feasible quantum runtime advantage in cross-entropy
benchmarking can be achieved approximately coincides with expectations for
early implementations of the surface code and other quantum error correction
methods. Thus the boundaries of quantum supremacy via random circuit sampling
may fortuitously coincide with the advent of scalable, error corrected quantum
computing in the near term.
Related papers
- Measurement-Based Long-Range Entangling Gates in Constant Depth [0.46040036610482665]
We show how to reduce the depth of quantum sub-routines to a constant depth using mid-circuit measurements and feed-forward operations.
We verify the feasibility by implementing the measurement-based quantum fan-out gate and long-range CNOT gate on real quantum hardware.
arXiv Detail & Related papers (2024-08-06T09:35:42Z) - Robust Implementation of Discrete-time Quantum Walks in Any Finite-dimensional Quantum System [2.646968944595457]
discrete-time quantum walk (DTQW) model one of most suitable choices for circuit implementation.
In this paper, we have successfully cut down the circuit cost concerning gate count and circuit depth by half.
For the engineering excellence of our proposed approach, we implement DTQW in any finite-dimensional quantum system with akin efficiency.
arXiv Detail & Related papers (2024-08-01T13:07:13Z) - A Quantum-Classical Collaborative Training Architecture Based on Quantum
State Fidelity [50.387179833629254]
We introduce a collaborative classical-quantum architecture called co-TenQu.
Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting.
It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
arXiv Detail & Related papers (2024-02-23T14:09:41Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Maximising Quantum-Computing Expressive Power through Randomised
Circuits [4.604271571912073]
variational quantum algorithms (VQAs) have emerged as a promising avenue to obtain quantum advantage.
We numerically demonstrate a novel approach for VQAs, utilizing randomised quantum circuits to generate the variational wavefunction.
This random-circuit approach presents a trade-off between the expressive power of the variational wavefunction and time cost.
arXiv Detail & Related papers (2023-12-04T15:04:42Z) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - Optimal Partitioning of Quantum Circuits using Gate Cuts and Wire Cuts [1.0507729375838437]
A limited number of qubits, high error rates, and limited qubit connectivity are major challenges for effective near-term quantum computations.
Quantum circuit partitioning divides a quantum computation into a set of computations that include smaller-scale quantum (sub)circuits and classical postprocessing steps.
We develop an optimal partitioning method based on recent advances in quantum circuit knitting.
arXiv Detail & Related papers (2023-08-18T13:59:55Z) - Comparing planar quantum computing platforms at the quantum speed limit [0.0]
We present a comparison of the theoretical minimal gate time, i.e., the quantum speed limit (QSL) for realistic two- and multi-qubit gate implementations in neutral atoms and superconducting qubits.
We analyze these quantum algorithms in terms of circuit run times and gate counts both in the standard gate model and the parity mapping.
arXiv Detail & Related papers (2023-04-04T12:47:00Z) - Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
We present an approach where the quantum computation is supplemented by a classical result.
Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative.
In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
arXiv Detail & Related papers (2022-09-12T15:47:44Z) - Gaussian initializations help deep variational quantum circuits escape
from the barren plateau [87.04438831673063]
Variational quantum circuits have been widely employed in quantum simulation and quantum machine learning in recent years.
However, quantum circuits with random structures have poor trainability due to the exponentially vanishing gradient with respect to the circuit depth and the qubit number.
This result leads to a general belief that deep quantum circuits will not be feasible for practical tasks.
arXiv Detail & Related papers (2022-03-17T15:06:40Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.