An assessment of quantum phase estimation protocols for early
fault-tolerant quantum computers
- URL: http://arxiv.org/abs/2403.00077v1
- Date: Thu, 29 Feb 2024 19:08:42 GMT
- Title: An assessment of quantum phase estimation protocols for early
fault-tolerant quantum computers
- Authors: Jacob S. Nelson and Andrew D. Baczewski
- Abstract summary: We compare several quantum phase estimation protocols intended for early fault-tolerant quantum computers.
We estimate the logical and physical resources required to use these protocols to calculate the ground state energy of molecular hydrogen.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We compare several quantum phase estimation (QPE) protocols intended for
early fault-tolerant quantum computers (EFTQCs) in the context of models of
their implementations on a surface code architecture. We estimate the logical
and physical resources required to use these protocols to calculate the ground
state energy of molecular hydrogen in a minimal basis with error below
$10^{-3}$ atomic units in the presence of depolarizing logical errors.
Accounting for the overhead of rotation synthesis and magic state distillation,
we find that the total $T$-gate counts do not vary significantly among the EFT
QPE protocols at fixed state overlap. In addition to reducing the number of
ancilla qubits and circuit depth, the noise robustness of the EFT protocols can
be leveraged to reduce resource requirements below those of textbook QPE,
realizing approximately a 300-fold reduction in computational volume in some
cases. Even so, our estimates are well beyond the scale of existing early
fault-tolerance demonstrations.
Related papers
- Partially Fault-tolerant Quantum Computing Architecture with
Error-corrected Clifford Gates and Space-time Efficient Analog Rotations [0.5658123802733283]
We propose a quantum computing architecture to close the gap between NISQ and FTQC.
For early-FTQC devices, we can perform roughly $1.72 times 107$ Clifford operations and $3.75 times 104$ arbitrary rotations on 64 logical qubits.
arXiv Detail & Related papers (2023-03-23T11:21:41Z) - Averaging gate approximation error and performance of Unitary Coupled Cluster ansatz in Pre-FTQC Era [0.0]
Fault-tolerant quantum computation (FTQC) is essential to implement quantum algorithms in a noise-resilient way.
In FTQC, a quantum circuit is decomposed into universal gates that can be fault-tolerantly implemented.
In this paper, we propose that the Clifford+$T$ decomposition error for a given quantum circuit can be modeled as the depolarizing noise.
arXiv Detail & Related papers (2023-01-10T19:00:01Z) - A Remote Quantum Error-correcting Code Preparation Protocol on Cluster
State [5.5534193467961055]
The blind quantum computation (BQC) protocol allows for privacy-preserving remote quantum computations.
We introduce a remote quantum error correction code preparation protocol for BQC using a cluster state and analyze its blindness in the measurement-based quantum computation model.
arXiv Detail & Related papers (2023-01-05T10:13:52Z) - End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
We provide a complete quantum circuit-level description of the algorithm from problem input to problem output.
We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
arXiv Detail & Related papers (2022-11-22T18:54:48Z) - Experimental validation of the Kibble-Zurek Mechanism on a Digital
Quantum Computer [62.997667081978825]
The Kibble-Zurek mechanism captures the essential physics of nonequilibrium quantum phase transitions with symmetry breaking.
We experimentally tested the KZM for the simplest quantum case, a single qubit under the Landau-Zener evolution.
We report on extensive IBM-Q experiments on individual qubits embedded in different circuit environments and topologies.
arXiv Detail & Related papers (2022-08-01T18:00:02Z) - Resource analysis for quantum-aided Byzantine agreement with the four-qubit singlet state [1.2094859111770522]
In distributed computing, a Byzantine fault is a condition where a component behaves inconsistently, showing different symptoms to different components of the system.
Our work highlights important engineering aspects of the future deployment of quantum communication protocols with multi-qubit entangled states.
arXiv Detail & Related papers (2022-07-11T15:17:58Z) - Measuring NISQ Gate-Based Qubit Stability Using a 1+1 Field Theory and
Cycle Benchmarking [50.8020641352841]
We study coherent errors on a quantum hardware platform using a transverse field Ising model Hamiltonian as a sample user application.
We identify inter-day and intra-day qubit calibration drift and the impacts of quantum circuit placement on groups of qubits in different physical locations on the processor.
This paper also discusses how these measurements can provide a better understanding of these types of errors and how they may improve efforts to validate the accuracy of quantum computations.
arXiv Detail & Related papers (2022-01-08T23:12:55Z) - Numerical Simulations of Noisy Quantum Circuits for Computational
Chemistry [51.827942608832025]
Near-term quantum computers can calculate the ground-state properties of small molecules.
We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
arXiv Detail & Related papers (2021-12-31T16:33:10Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg
Atoms [55.41644538483948]
We provide the first complete characterization of sources of error in a neutral-atom quantum computer.
We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace.
Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
arXiv Detail & Related papers (2021-05-27T23:29:53Z) - Polylog-overhead highly fault-tolerant measurement-based quantum
computation: all-Gaussian implementation with Gottesman-Kitaev-Preskill code [3.6748639131154315]
We develop a fault-tolerant quantum computation protocol for measurement-based quantum computation (MBQC)
Our protocol achieves the threshold $7.8$ dB in terms of the squeezing level of the best existing protocol for fault-tolerant quantum computation.
Our results open a new way towards realization of a large class of quantum speedups.
arXiv Detail & Related papers (2020-06-09T17:30:41Z)
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.