Fault-tolerant quantum computation by hybrid qubits with bosonic cat-code and single photons

• URL: http://arxiv.org/abs/2401.00450v1
• Date: Sun, 31 Dec 2023 10:57:31 GMT
• Title: Fault-tolerant quantum computation by hybrid qubits with bosonic cat-code and single photons
• Authors: Jaehak Lee, Nuri Kang, Seok-Hyung Lee, Hyunseok Jeong, Liang Jiang, Seung-Woo Lee
• Abstract summary: We introduce a fault-tolerant hybrid quantum computation by taking the advantages of both discrete variable (DV) and continuous variable (CV) systems. We define a CV-DV hybrid qubit with bosonic cat-code and single photon, which is implementable in current photonic platforms.
• Score: 2.37194089509778
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Hybridizing different degrees of freedom or physical platforms potentially offers various advantages in building scalable quantum architectures. We here introduce a fault-tolerant hybrid quantum computation by taking the advantages of both discrete variable (DV) and continuous variable (CV) systems. Particularly, we define a CV-DV hybrid qubit with bosonic cat-code and single photon, which is implementable in current photonic platforms. By the cat-code encoded in the CV part, the dominant loss errors are readily correctable without multi-qubit encoding, while the logical basis is inherently orthogonal due to the DV part. We design fault-tolerant architectures by concatenating hybrid qubits and an outer DV quantum error correction code such as topological codes, exploring their potential merits in developing scalable quantum computation. We demonstrate by numerical simulations that our scheme is at least an order of magnitude more resource-efficient over all previous proposals in photonic platforms, allowing to achieve a record-high loss threshold among existing CV and hybrid approaches. We discuss its realization not only in all-photonic platforms but also in other hybrid platforms including superconduting and trapped-ion systems, which allows us to find various efficient routes towards fault-tolerant quantum computing.

Related papers

• Deterministic generation of concatenated graph codes from quantum emitters [0.0]
  Concatenation of a fault-tolerant construction with a code able to efficiently correct loss is a promising approach to achieve this. We propose schemes for generatingd graph codes using multi-photon emission from two quantum emitters or a single quantum emitter coupled to a memory. We show that these schemes enable fault-tolerant fusion-based quantum regimes in practical computation with high photon loss and standard fusion gates.
  arXiv  Detail & Related papers  (2024-06-24T14:44:23Z)
• Hybrid quantum transfer learning for crack image classification on NISQ hardware [62.997667081978825]
  We present an application of quantum transfer learning for detecting cracks in gray value images. We compare the performance and training time of PennyLane's standard qubits with IBM's qasm_simulator and real backends.
  arXiv  Detail & Related papers  (2023-07-31T14:45:29Z)
• Experimental realization of deterministic and selective photon addition in a bosonic mode assisted by an ancillary qubit [50.591267188664666]
  Bosonic quantum error correcting codes are primarily designed to protect against single-photon loss. Error correction requires a recovery operation that maps the error states -- which have opposite parity -- back onto the code states. Here, we realize a collection of photon-number-selective, simultaneous photon addition operations on a bosonic mode.
  arXiv  Detail & Related papers  (2022-12-22T23:32:21Z)
• 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)
• Distributed quantum computing with photons and atomic memories [0.0]
  We propose a universal distributed quantum computing scheme based on photons and atomic-ensemble-based quantum memories. Taking the established photonic advantages, we mediate two-qubit nonlinear interaction by converting photonic qubits into quantum memory states. Our results show photon-atom network hybrid approach can be an alternative solution to universal quantum computing.
  arXiv  Detail & Related papers  (2022-07-05T22:52:33Z)
• 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)
• 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)
• Fault-tolerant quantum computation with static linear optics [0.0]
  In this work we propose a topologically error-corrected architecture that does away with these elements at no cost. Our computer consists of three modules: a 2D array of probabilistic sources of GKP states; a depth-four circuit of static beamsplitters, phase shifters, and single-time-step delay lines. The symmetry of our proposed circuit allows us to combine the effects of finite squeezing and uniform photon loss within the noise model, resulting in more comprehensive threshold estimates.
  arXiv  Detail & Related papers  (2021-04-07T16:43:34Z)
• 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 protected qubits in a silicon photonic chip [0.6815987996019325]
  General purpose quantum computers can entangle a number of noisy physical qubits to realise composite qubits protected against errors. Architectures for measurement-based quantum computing intrinsically support error-protected qubits. We show an integrated silicon photonic architecture that both entangles multiple photons, and encodes multiple physical qubits on individual photons, to produce error-protected qubits.
  arXiv  Detail & Related papers  (2020-09-17T14:37:12Z)
• Efficient simulatability of continuous-variable circuits with large Wigner negativity [62.997667081978825]
  Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures. We identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable. We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes.
  arXiv  Detail & Related papers  (2020-05-25T11:03:42Z)

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.