Enabling Full-Stack Quantum Computing with Changeable Error-Corrected
Qubits
- URL: http://arxiv.org/abs/2305.07072v4
- Date: Mon, 16 Oct 2023 01:27:42 GMT
- Title: Enabling Full-Stack Quantum Computing with Changeable Error-Corrected
Qubits
- Authors: Anbang Wu, Keyi Yin, Andrew W. Cross, Ang Li, Yufei Ding
- Abstract summary: We propose CECQ to explore the large design space for FTQC based on changeable logical qubits.
Experiments on various quantum programs demonstrate the effectiveness of CECQ.
- Score: 14.770636234849444
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Executing quantum applications with quantum error correction (QEC) faces the
gate non-universality problem imposed by the Eastin-Knill theorem. As one
resource-time-efficient solution, code switching changes the encoding of
logical qubits to implement universal logical gates. Unfortunately, it is still
unclear how to perform full-stack fault-tolerant quantum computing (FTQC) based
on the changeable logical qubit. Specifically, three critical problems remain
unsolved: a) how to implement the dynamic logical qubit on hardware; b) how to
determine the appropriate timing for logical qubit varying; c) how to improve
the overall system performance for programs of different features. To overcome
those design problems, We propose CECQ, to explore the large design space for
FTQC based on changeable logical qubits. Experiments on various quantum
programs demonstrate the effectiveness of CECQ.
Related papers
- Quantum circuit compression using qubit logic on qudits [0.0]
We present qubit logic on qudits (QLOQ), a compression scheme in which the qubits from a hardware agnostic circuit are divided into groups of various sizes.
We show that arbitrary qubit-logic unitaries can in principle be implemented with significantly fewer two-level (qubit) physical entangling gates in QLOQ than in qubit encoding.
arXiv Detail & Related papers (2024-11-06T12:49:32Z) - Towards Distributed Quantum Error Correction for Distributed Quantum Computing [15.824983694947573]
A new qubit-based Distributed Quantum Error Correction (DQEC) architecture is proposed in which three physical qubits residing on three Quantum Processing Units (QPU) are used to form a logical qubit.
This paper illustrates how three QPUs collaboratively generate a joint quantum state in which single bit-flip and phase-flip errors can be properly resolved.
The functional correctness of the proposed architecture is evaluated through the Qiskit tool and stabilizer generators.
arXiv Detail & Related papers (2024-09-08T23:10:00Z) - Algorithmic Fault Tolerance for Fast Quantum Computing [37.448838730002905]
We show that fault-tolerant logical operations can be performed with constant time overhead for a broad class of quantum codes.
We prove that the deviation from the ideal measurement result distribution can be made exponentially small in the code distance.
Our work sheds new light on the theory of fault tolerance, potentially reducing the space-time cost of practical fault-tolerant quantum computation by orders of magnitude.
arXiv Detail & Related papers (2024-06-25T15:43:25Z) - Transversal CNOT gate with multi-cycle error correction [1.7359033750147501]
A scalable and programmable quantum computer holds the potential to solve computationally intensive tasks that computers cannot accomplish within a reasonable time frame, achieving quantum advantage.
The vulnerability of the current generation of quantum processors to errors poses a significant challenge towards executing complex and deep quantum circuits required for practical problems.
Our work establishes the feasibility of employing logical CNOT gates alongside error detection on a superconductor-based processor using current generation quantum hardware.
arXiv Detail & Related papers (2024-06-18T04:50:15Z) - Logical quantum processor based on reconfigurable atom arrays [27.489364850707926]
We report the realization of a programmable quantum processor based on encoded logical qubits operating with up to 280 physical qubits.
Results herald the advent of early error-corrected quantum computation.
arXiv Detail & Related papers (2023-12-07T01:54:45Z) - QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks.
Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture.
We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
arXiv Detail & Related papers (2023-04-14T08:03:20Z) - Deep Quantum Error Correction [73.54643419792453]
Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing.
In this work, we efficiently train novel emphend-to-end deep quantum error decoders.
The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
arXiv Detail & Related papers (2023-01-27T08:16:26Z) - Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions.
We explore novel schemes for universal logic that improve resource overheads.
Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
arXiv Detail & Related papers (2021-12-22T19:00:03Z) - 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) - Space-efficient binary optimization for variational computing [68.8204255655161]
We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem.
We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
arXiv Detail & Related papers (2020-09-15T18:17:27Z) - QUANTIFY: A framework for resource analysis and design verification of
quantum circuits [69.43216268165402]
QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits.
It is based on Google Cirq and is developed with Clifford+T circuits in mind.
For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
arXiv Detail & Related papers (2020-07-21T15:36:25Z)
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.