Early Fault-Tolerant Quantum Computing
- URL: http://arxiv.org/abs/2311.14814v1
- Date: Fri, 24 Nov 2023 19:12:47 GMT
- Title: Early Fault-Tolerant Quantum Computing
- Authors: Amara Katabarwa, Katerina Gratsea, Athena Caesura, Peter D. Johnson
- Abstract summary: We develop a model for the performance of early fault-tolerant quantum computing (EFTQC) architectures.
We show that, for the canonical task of phase estimation, in a regime of moderate scalability and using just over one million physical qubits, the reach'' of the quantum computer can be extended.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Over the past decade, research in quantum computing has tended to fall into
one of two camps: near-term intermediate scale quantum (NISQ) and
fault-tolerant quantum computing (FTQC). Yet, a growing body of work has been
investigating how to use quantum computers in transition between these two
eras. This envisions operating with tens of thousands to millions of physical
qubits, able to support fault-tolerant protocols, though operating close to the
fault-tolerant threshold. Two challenges emerge from this picture: how to model
the performance of devices that are continually improving and how to design
algorithms to make the most use of these devices? In this work we develop a
model for the performance of early fault-tolerant quantum computing (EFTQC)
architectures and use this model to elucidate the regimes in which algorithms
suited to such architectures are advantageous. As a concrete example, we show
that, for the canonical task of phase estimation, in a regime of moderate
scalability and using just over one million physical qubits, the ``reach'' of
the quantum computer can be extended (compared to the standard approach) from
90-qubit instances to over 130-qubit instances using a simple early
fault-tolerant quantum algorithm, which reduces the number of operations per
circuit by a factor of 100 and increases the number of circuit repetitions by a
factor of 10,000. This clarifies the role that such algorithms might play in
the era of limited-scalability quantum computing.
Related papers
- Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties?
We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.
We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
We develop a reinforcement learning-based quantum compiler for a superconducting processor.
We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths.
Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
arXiv Detail & Related papers (2024-06-18T01:49:48Z) - Unlocking Quantum Optimization: A Use Case Study on NISQ Systems [0.0]
This paper considers two industrial relevant use cases: one in the realm of optimizing charging schedules for electric vehicles, the other concerned with the optimization of truck routes.
Our central contribution are systematic series of examples derived from these uses cases that we execute on different processors of the gate-based quantum computers of IBM as well as on the quantum annealer of D-Wave.
arXiv Detail & Related papers (2024-04-10T17:08:07Z) - Scalable Quantum Algorithms for Noisy Quantum Computers [0.0]
This thesis develops two main techniques to reduce the quantum computational resource requirements.
The aim is to scale up application sizes on current quantum processors.
While the main focus of application for our algorithms is the simulation of quantum systems, the developed subroutines can further be utilized in the fields of optimization or machine learning.
arXiv Detail & Related papers (2024-03-01T19:36:35Z) - 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) - 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) - Quantum Neuron with Separable-State Encoding [0.0]
It is not yet possible to test advanced quantum neuron models on a large scale in currently available quantum processors.
We propose a quantum perceptron (QP) model that uses a reduced number of multi-qubit gates.
We demonstrate the performance of the proposed model by implementing a few qubits version of the QP in a simulated quantum computer.
arXiv Detail & Related papers (2022-02-16T19:26:23Z) - Minimizing estimation runtime on noisy quantum computers [0.0]
"engineered likelihood function" (ELF) is used for carrying out Bayesian inference.
We show how the ELF formalism enhances the rate of information gain in sampling as the physical hardware transitions from the regime of noisy quantum computers.
This technique speeds up a central component of many quantum algorithms, with applications including chemistry, materials, finance, and beyond.
arXiv Detail & Related papers (2020-06-16T17:46:18Z) - Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
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.
arXiv Detail & Related papers (2020-05-05T20:11:53Z)
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.