A Compact One-Way Fault-Tolerant Optical Quantum Computation

• URL: http://arxiv.org/abs/2502.12429v2
• Date: Tue, 18 Mar 2025 00:26:05 GMT
• Title: A Compact One-Way Fault-Tolerant Optical Quantum Computation
• Abstract summary: One-way quantum computation is a promising approach to achieving universal, scalable computation and fault-tolerant quantum cluster.<n>Here, an experimental scheme is proposed for building large-scale canonical three-dimensional cubic states, which are compatible with the majority of error-correcting codes.<n>Our scheme drastically simplify experimental configurations, paving the way for compact realizations of one-way fault-tolerant optical quantum computation.
• Score: 5.861533836466957
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: One-way quantum computation is a promising approach to achieving universal, scalable, and fault-tolerant quantum computation. However, a main challenge lies in the creation of universal, scalable three-dimensional cluster states. Here, an experimental scheme is proposed for building large-scale canonical three-dimensional cubic cluster states, which are compatible with the majority of qubit error-correcting codes, using the spatiospectral modes of an optical parametric oscillator. Combining with Gottesman-Kitaev-Preskill states, one-way fault-tolerant optical quantum computation can be achieved with a lower fault-tolerant squeezing threshold. Our scheme drastically simplify experimental configurations, paving the way for compact realizations of one-way fault-tolerant optical quantum computation.

Related papers

• A Flexible GKP-State-Embedded Fault-Tolerant Quantum Computation Configuration Based on a Three-Dimensional Cluster State [6.901147498661532]
  We propose a flexible Gottesman-Kitaev-Preskill-state-embedded fault-tolerant quantum computation architecture.<n>Specifically, we design optical entanglement generators to produce three diverse entangled pairs.<n>We present a partially squeezed surface-GKP code to achieve fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2026-03-19T11:30:50Z)
• Heisenberg limited quantum algorithm for estimating the fidelity susceptibility [4.524082537369606]
  We present a quantum algorithm that achieves efficient and Heisenberg-limited estimation of fidelity susceptibility.<n>Our work bridges quantum many-body physics and algorithmic design, enabling scalable exploration of quantum criticality.
  arXiv  Detail & Related papers  (2025-09-01T10:56:50Z)
• Single-shot and measurement-based quantum error correction via fault complexes [0.0]
  Photonics provides a viable path to a scalable fault-tolerant quantum computer. Foliation is the construction of fault-tolerant graph states. We introduce the fault complex, a representation of dynamic quantum error correction protocols.
  arXiv  Detail & Related papers  (2024-10-16T18:52:24Z)
• 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)
• 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)
• Fault-Tolerant Operation of Bosonic Qubits with Discrete-Variable Ancillae [4.478211895257931]
  We introduce essential building blocks of error-corrected gadgets by leveraging ancilla-assisted bosonic operations. We construct a universal set of error-corrected gadgets that tolerate a single photon loss and an arbitrary ancilla fault for four-legged cat qubits. Our estimates suggest that the overall noise threshold can be reached using existing hardware.
  arXiv  Detail & Related papers  (2023-10-31T16:13:04Z)
• 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)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• All-optical quantum computing using cubic phase gates [0.0]
  We show how elements of all-optical, universal, and fault-tolerant quantum computation can be implemented. Our approach is based on a decomposition technique combining exact gate decompositions and approximate Trotterization.
  arXiv  Detail & Related papers  (2022-11-16T17:21:30Z)
• Low-overhead quantum error correction codes with a cyclic topology [0.0]
  We show an approach to construct the quantum circuit of a correction code with ancillas entangled with non-neighboring data qubits.<n>We introduce a neural network-based decoding algorithm supported by an improved lookup table decoder.
  arXiv  Detail & Related papers  (2022-11-06T12:22:23Z)
• Error-Tolerant Geometric Quantum Control for Logical Qubits with Minimal Resource [4.354697470999286]
  We propose a new fast and robust geometric scheme, with the decoherence-free-subspace encoding, and present its physical implementation on superconducting quantum circuits. Our scheme can consolidate both error suppression methods for logical-qubit control, which sheds light on the future large-scale quantum computation.
  arXiv  Detail & Related papers  (2021-12-16T12:10:41Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• 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)
• Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
  Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware. The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
  arXiv  Detail & Related papers  (2021-07-08T17:59:55Z)
• 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)
• Deterministic correction of qubit loss [48.43720700248091]
  Loss of qubits poses one of the fundamental obstacles towards large-scale and fault-tolerant quantum information processors. We experimentally demonstrate the implementation of a full cycle of qubit loss detection and correction on a minimal instance of a topological surface code.
  arXiv  Detail & Related papers  (2020-02-21T19:48: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.