The canonical anticommutation relations (CAR) for fermion systems can be represented by finite-dimensional matrix algebra, but it is impossible for canonical commutation relations (CCR) for bosons. After description of more simple case with representation of CAR and (bounded) quantum computational networks via Clifford algebras in the paper are discussed CCR. For representation of the algebra it is not enough to use quantum networks with fixed number of qubits and it is more convenient to consider Turing machine with essential operation of appending new cells for description of infinite tape in finite terms --- it has straightforward generalization for quantum case, but for CCR it is necessary to work with symmetrized version of the quantum Turing machine. The system is called here quantum abacus due to understanding analogy with the ancient counting devices (abacus).
We present a quantum error correcting code with dynamically generated logical qubits. When viewed as a subsystem code, the code has no logical qubits. Nevertheless, our measurement patterns generate logical qubits, allowing the code to act as a fault-tolerant quantum memory. Our particular code gives a model very similar to the two-dimensional toric code, but each measurement is a two-qubit Pauli measurement.
Quantum error correction procedures have the potential to enable faithful operation of large-scale quantum computers. They protect information from environmental decoherence by storing it in logical qubits, built from ensembles of entangled physical qubits according to suitably tailored quantum error correcting encodings. To date, no generally accepted framework to characterise the behaviour of logical qubits as quantum memories has been developed. In this work, we show that generalisations of well-established figures of merit of physical qubits, such as relaxation times, to logical qubits fai…
Future quantum computers will require quantum error correction for faithful operation. The correction capabilities come with an overhead for performing fault-tolerant logical operations on the encoded qubits. One of the most resource efficient ways to implement logical operations is lattice surgery, where groups of physical qubits, arranged on lattices, can be merged and split to realize entangling gates and teleport logical information. Here, we report on the experimental realization of lattice surgery between two topologically encoded qubits in a 10-qubit ion trap quantum information process…
Quantum information stored in a qubit is rapidly lost to the environment. The realization of robust qubits is one of the most important challenges in quantum computing. Herein we propose to embed a logical qubit within the manifold of a qudit as a scheme to preserve quantum information over extended periods of time. Under identical conditions (e.g. decoherence channels) the submanifold of the logical qubit exhibits extended lifetimes compared to a pure two-level system (qubit). The retention of quantum information further improves with separation between the sublevels of the logical qubit. Lif…
Geometric quantum computation offers a practical strategy toward robust quantum computation due to its inherently error tolerance. However, the rigorous geometric conditions lead to complex and/or error-disturbed quantum controls, especially for logical qubits that involve more physical qubits, whose error tolerance is effective in principle though, their experimental demonstration is still demanding. Thus, how to best simplify the needed control and manifest its full advantage has become the key to widespread applications of geometric quantum computation. Here we propose a new fast and robust…
The big challenge in quantum computing is to realize scalable multi-qubit systems with cross-talk free addressability and efficient coupling of arbitrarily selected qubits. Quantum networks promise a solution by integrating smaller qubit modules to a larger computing cluster. Such a distributed architecture, however, requires the capability to execute quantum-logic gates between distant qubits. Here we experimentally realize such a gate over a distance of 60m. We employ an ancillary photon that we successively reflect from two remote qubit modules, followed by a heralding photon detection whic…
Stabilization of encoded logical qubits using quantum error correction is key to the realization of reliable quantum computers. While qubit codes require many physical systems to be controlled, oscillator codes offer the possibility to perform error correction on a single physical entity. One powerful encoding for oscillators is the grid state or GKP encoding, which allows small displacement errors to be corrected. Here we introduce and implement a dissipative map designed for physically realistic finite GKP codes which performs quantum error correction of a logical qubit implemented in the mo…
Lattice surgery for near-term experimental logical qubit entanglement creation in planar architectures
Institute for Theoretical Nanoelectronics (PGI-2), Forschungszentrum Jülich(于利希研究中心理论纳米电子学研究所);Institute for Quantum Information, RWTH Aachen University(亚琛工业大学量子信息研究所);Department of Physics, ETH Zurich(苏黎世联邦理工学院物理系);ETH Zurich - PSI Quantum Computing Hub, Paul Scherrer Institute(保罗谢勒研究所苏黎世联邦理工学院-PSI量子计算中心);Quantum Center, ETH Zurich(苏黎世联邦理工学院量子中心)
Demonstration of High-Fidelity Entangled Logical Qubits using Transmons
University of Southern California(南加州大学);Quantum Elements, Inc.(量子元素公司);IBM Quantum(IBM量子);RWTH Aachen University(亚琛工业大学);Forschungszentrum Jülich(于利希研究中心)
Genuine Multipartite Entanglement between Logical Qubits via Cross-Code Lattice Surgery
Universität Innsbruck(因斯布鲁克大学);Technische Universität Wien(维也纳工业大学);Institute for Theoretical Physics, University of Innsbruck(因斯布鲁克大学理论物理研究所);neQxt GmbH(neQxt有限公司);Alpine Quantum Technologies GmbH(阿尔卑斯量子技术有限公司)
Design and optimisation of quantum logic circuits for a three-qubit Deutsch-Jozsa algorithm implemented with optically-controlled, solid-state quantum logic gates
We study variants of Shor's code that are adept at handling single-axis correlated idling errors, which are commonly observed in many quantum systems. By using the repetition code structure of the Shor's code basis states, we calculate the logical channel applied to the encoded information when subjected to coherent and correlated single qubit idling errors, followed by stabilizer measurement. Changing the signs of the stabilizer generators allows us to change how the coherent errors interfere, leading to a quantum error correcting code which performs as well as a classical repetition code of …
In a digital quantum simulator, basic two-qubit interactions are manipulated by means of fast local control operations to establish a desired target Hamiltonian. Here we consider a quantum simulator based on logical systems, i.e. where several physical qubits are used to represent a single logical two-level system to obtain enhanced and simple control over effective interactions between logical systems. Fixed, distance-dependent pairwise interactions between the physical qubits lead to effective interactions between the logical systems, which can be fully controlled solely by the choice of the…