Fusion-based quantum computation
- URL: http://arxiv.org/abs/2101.09310v1
- Date: Fri, 22 Jan 2021 20:00:22 GMT
- Title: Fusion-based quantum computation
- Authors: Sara Bartolucci, Patrick Birchall, Hector Bombin, Hugo Cable, Chris
Dawson, Mercedes Gimeno-Segovia, Eric Johnston, Konrad Kieling, Naomi
Nickerson, Mihir Pant, Fernando Pastawski, Terry Rudolph and Chris Sparrow
- Abstract summary: Fusion-based quantum computing (FBQC) is a model of universal quantum computation in which entangling measurements, called fusions, are performed on qubits of small constant-sized entangled resource states.
We introduce a stabilizer formalism for analyzing fault tolerance and computation in these schemes.
This framework naturally captures the error structure that arises in certain physical systems for quantum computing, such as photonics.
- Score: 43.642915252379815
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We introduce fusion-based quantum computing (FBQC) - a model of universal
quantum computation in which entangling measurements, called fusions, are
performed on the qubits of small constant-sized entangled resource states. We
introduce a stabilizer formalism for analyzing fault tolerance and computation
in these schemes. This framework naturally captures the error structure that
arises in certain physical systems for quantum computing, such as photonics.
FBQC can offer significant architectural simplifications, enabling hardware
made up of many identical modules, requiring an extremely low depth of
operations on each physical qubit and reducing classical processing
requirements. We present two pedagogical examples of fault-tolerant schemes
constructed in this framework and numerically evaluate their threshold under a
hardware agnostic fusion error model including both erasure and Pauli error. We
also study an error model of linear optical quantum computing with
probabilistic fusion and photon loss. In FBQC the non-determinism of fusion is
directly dealt with by the quantum error correction protocol, along with other
errors. We find that tailoring the fault-tolerance framework to the physical
system allows the scheme to have a higher threshold than schemes reported in
literature. We present a ballistic scheme which can tolerate a 10.4%
probability of suffering photon loss in each fusion.
Related papers
- Replication-based quantum annealing error mitigation [1.0878040851638]
We propose a new approach called replication based mitigation (RBM) based on parallel quantum annealing.
In RBM, physical qubits representing the same logical qubit are dispersed across different copies of the problem embedded in the hardware.
This mitigates hardware biases, is compatible with limited qubit connectivity in current annealers, and is suited for available noisy intermediate-scale quantum (NISQ) annealers.
arXiv Detail & Related papers (2024-04-09T19:06:26Z) - Analysis of optical loss thresholds in the fusion-based quantum computing architecture [41.94295877935867]
We show that fault-tolerant quantum computing is possible with currently achievable levels of optical losses in an integrated photonic implementation.
Our results show that fault-tolerant quantum computing in the FBQC model is possible with currently achievable levels of optical losses in an integrated photonic implementation.
arXiv Detail & Related papers (2024-03-21T19:54:25Z) - 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 Quantum Algorithm for Computing All Diagnoses of a Switching Circuit [73.70667578066775]
Faults are by nature while most man-made systems, and especially computers, work deterministically.
This paper provides such a connecting via quantum information theory which is an intuitive approach as quantum physics obeys probability laws.
arXiv Detail & Related papers (2022-09-08T17:55:30Z) - Parity-encoding-based quantum computing with Bayesian error tracking [0.0]
Measurement-based quantum computing (MBQC) in linear optical systems is promising for near-future quantum computing architecture.
We propose a linear optical topological MBQC protocol employing multiphoton qubits based on the parity encoding.
We show that our protocol is advantageous over several other existing approaches in terms of fault-tolerance, resource overhead, or feasibility of basic elements.
arXiv Detail & Related papers (2022-07-14T10:32:05Z) - 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) - 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) - Interleaving: Modular architectures for fault-tolerant photonic quantum
computing [50.591267188664666]
Photonic fusion-based quantum computing (FBQC) uses low-loss photonic delays.
We present a modular architecture for FBQC in which these components are combined to form "interleaving modules"
Exploiting the multiplicative power of delays, each module can add thousands of physical qubits to the computational Hilbert space.
arXiv Detail & Related papers (2021-03-15T18:00:06Z) - Error mitigation and quantum-assisted simulation in the error corrected
regime [77.34726150561087]
A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations.
We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
arXiv Detail & Related papers (2021-03-12T20:58: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.