Measurement-free preparation of grid states

• URL: http://arxiv.org/abs/1912.12645v1
• Date: Sun, 29 Dec 2019 13:12:46 GMT
• Title: Measurement-free preparation of grid states
• Authors: Jacob Hastrup, Kimin Park, Jonatan Bohr Brask, Radim Filip and Ulrik Lund Andersen
• Abstract summary: The Gottesman-Kitaev-Preskill code is a promising approach towards fault-tolerant quantum computing. For the code to be fault tolerant, the quality of the grid states has to be extremely high. Here we propose a measurement-free preparation protocol which deterministically prepares arbitrary logical grid states with a rectangular or hexagonal lattice.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computing potentially offers exponential speed-ups over classical computing for certain tasks. A central, outstanding challenge to making quantum computing practical is to achieve fault tolerance, meaning that computations of any length or size can be realised in the presence of noise. The Gottesman-Kitaev-Preskill code is a promising approach towards fault-tolerant quantum computing, encoding logical qubits into grid states of harmonic oscillators. However, for the code to be fault tolerant, the quality of the grid states has to be extremely high. Approximate grid states have recently been realized experimentally, but their quality is still insufficient for fault tolerance. Current implementable protocols for generating grid states rely on measurements of ancillary qubits combined with either postselection or feed forward. Implementing such measurements take up significant time during which the states decohere, thus limiting their quality. Here we propose a measurement-free preparation protocol which deterministically prepares arbitrary logical grid states with a rectangular or hexagonal lattice. The protocol can be readily implemented in trapped-ion or superconducting-circuit platforms to generate high-quality grid states using only a few interactions, even with the noise levels found in current systems.

Related papers

• Unitary fault-tolerant encoding of Pauli states in surface codes [0.8314040122511801]
  We present a unitary, scalable, distance-preserving encoding scheme for preparing Pauli eigenstates in surface codes.<n>Our work bridges the gap between measurement-based and unitary encodings of surface-code states.
  arXiv  Detail & Related papers  (2026-01-08T17:00:25Z)
• Realization of a Quantum Error Detection Code with a Dynamically Reassigned Ancillary Qubit [0.0]
  superconducting qubits are among the most promising candidates for scalable QEC.<n>limited nearest-neighbor connectivity presents significant challenges for implementing a wide range of error correction codes.<n>We experimentally demonstrate a quantum error detection scheme that employs a dynamically reassigned ancillary qubit on a chain of three linearly connected transmon qubits.
  arXiv  Detail & Related papers  (2025-06-25T15:16:56Z)
• Suppressing Measurement Noise in Logical Qubits Through Measurement Scheduling [1.419616346522232]
  Noise in single-shot measurements limits logical readout fidelity, forming a critical bottleneck for quantum computation.<n>We propose a dynamic measurement scheduling protocol that suppresses logical readout errors by adaptively redistributing measurement tasks from error-prone qubits to stable nodes.<n> Numerical simulations show that logical error rates can be reduced by up to 34% across code distances for 3 to 11, with enhanced robustness in measurement-noise-dominated systems.
  arXiv  Detail & Related papers  (2025-05-12T01:54:40Z)
• Assessing Teleportation of Logical Qubits in a Distributed Quantum Architecture under Error Correction [4.352368481242436]
  We show that logical qubits can be teleported between nodes with very low logical error rates, even with network noise in near-term regimes. We use circuit-level simulations to assess physical and network noise regimes ranging from $10-1$ to $10-6$.
  arXiv  Detail & Related papers  (2025-04-08T01:56:19Z)
• Deterministic generation of multi-qubit entangled states among distant parties using indefinite causal order [1.556591713973462]
  We present protocols for generating $N$-qubit entangled states across multiple network nodes. The results indicate that our protocols significantly improve the efficiency of long-distance entanglement generation.
  arXiv  Detail & Related papers  (2025-03-05T11:40:19Z)
• Learning dynamic quantum circuits for efficient state preparation [0.0]
  Dynamic quantum circuits (DQCs) incorporate mid-circuit measurements and gates conditioned on these measurement outcomes. We develop scalable tensor network algorithms which find high-fidelity DQC preparations for generic states. Our work demonstrates the power of an algorithmic approach to generating DQC circuits, broadening their scope of applications to new areas of quantum computing.
  arXiv  Detail & Related papers  (2024-10-11T17:47:46Z)
• Non-local resources for error correction in quantum LDPC codes [0.0]
  Surface code suffers from a low encoding rate, requiring a vast number of physical qubits for large-scale quantum computation. hypergraph product codes present a promising alternative, as both their encoding rate and distance scale with block size. Recent advancements have shown how to deterministically perform high-fidelity cavity enabled non-local many-body gates.
  arXiv  Detail & Related papers  (2024-09-09T17:28:41Z)
• Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error Correction Codes [4.2955091080396075]
  We propose an automated approach for fault-tolerant state preparation circuits for arbitrary CSS codes. We provide a general construction for non-deterministic state preparation circuits beyond distance 3. The resulting methods are publicly available as part of the Munich Quantum Toolkit.
  arXiv  Detail & Related papers  (2024-08-21T18:00:01Z)
• Transversal Injection: Using the Surface Code to Prepare Non-Pauli Eigenstates [37.94431794242543]
  Quantum Error Correction (QEC) allows us to use systems with a large number of physical qubits and a favourable logical error rate. Transversal Injection is a new method of preparing logical non-Pauliigen estates that can be used as resource states for quantum computation.
  arXiv  Detail & Related papers  (2023-12-27T03:32:03Z)
• Tangling schedules eases hardware connectivity requirements for quantum error correction [3.0040661953201475]
  We introduce a method of tangled syndrome extraction circuits, which enables measurement of observables between distant qubits. We show how to measure the aforementioned irregular non-local stabilisers, without physically modifying the hardware itself.
  arXiv  Detail & Related papers  (2023-07-19T17:21:50Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• 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)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• Dynamical learning of a photonics quantum-state engineering process [48.7576911714538]
  Experimentally engineering high-dimensional quantum states is a crucial task for several quantum information protocols. We implement an automated adaptive optimization protocol to engineer photonic Orbital Angular Momentum (OAM) states. This approach represents a powerful tool for automated optimizations of noisy experimental tasks for quantum information protocols and technologies.
  arXiv  Detail & Related papers  (2022-01-14T19:24:31Z)
• 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)
• Hardware-Encoding Grid States in a Non-Reciprocal Superconducting Circuit [62.997667081978825]
  We present a circuit design composed of a non-reciprocal device and Josephson junctions whose ground space is doubly degenerate and the ground states are approximate codewords of the Gottesman-Kitaev-Preskill (GKP) code. We find that the circuit is naturally protected against the common noise channels in superconducting circuits, such as charge and flux noise, implying that it can be used for passive quantum error correction.
  arXiv  Detail & Related papers  (2020-02-18T16:45:09Z)

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.