We present a novel approach to quantum computing based on the Binary Flow theory. We propose that quantum bits (qubits) can be implemented as phase modes of the vacuum, specifically the 90◦ phase mode, which is decoupled from ordinary matter. This phase qubit would be inherently fault-tolerant, as it is immune to thermal and electromagneticdecoherence. We outline a design for a phase qubit based on a resonant cavity, and describe how quantum gates could be implemented using phase interference. This work opens a new avenue for scalable, room-temperature quantum computing, pending experimental validation of the underlying phase mode.
We present a novel approach to quantum computing based on the Binary Flow theory. We propose that quantum bits (qubits) can be implemented as phase modes of the vacuum, specifically the 90◦ phase mode, which is decoupled from ordinary matter. This phase qubit would be inherently fault-tolerant, as it is immune to thermal and electromagneticdecoherence. We outline a design for a phase qubit based on a resonant cavity, and describe how quantum gates could be implemented using phase interference. This work opens a new avenue for scalable, room-temperature quantum computing, pending experimental validation of the underlying phase mode.
This thesis is concerned with certain theoretical problems that arise naturally in the context of fault-tolerant quantum computation. Fault-tolerance can be defined as the art of building reliable devices from unreliable components, and is of particular importance for quantum computers that aim to precisely control the dynamics of extremely sensitive quantum systems. A model of quantum computation is a specification of the basic building blocks by which a quantum computation is implemented. The best known model is the quantum circuit model, where computations are implemented by means of unitary quantum gates that are applied to two-level quantum systems known as qubits. In a physical implementation of a quantum circuit, the gates and qubits will inevitably be affected by noise. Fault-tolerant quantum circuits are designed to be resilient against the effects of this noise, provided that it is not too strong. Fault-tolerance in the quantum circuit model is well developed thanks to the theory of quantum error-correcting codes. These codes allow for the correction of small numbers of errors introduced by a variety of noise processes. In a fault-tolerant quantum circuit, qubits are replaced with encoded qubits, and quantum gates with encoded gates that are immediately followed by special quantum circuits for error correction. Provided the rate at which errors occur is below a constant threshold value, the accumulation of errors can be checked so that the correct output of the computation correctly determined. The threshold acts as both a measure of how good the design of a quantum circuit is, and also as a target for experimenters aiming to implement quantum circuits. Much current research in quantum computation is aimed at designing quantum circuits that increase the noise threshold, hopefully to the point where it becomes within the reach of experimenters. A fault-tolerant encoded quantum gate must limit the propagation of errors so that the code’s corrective capabilities are not overwhelmed. It is not so easy to design encoded gates that satisfy this property, and to date only a finite handful of such gates are known. In a faulttolerant quantum circuit, all quantum gates must be decomposed or compiled in terms of those that may be implemented fault-tolerantly. In the first part of this thesis, we present two results that may be applied to this problem of gate compilation. The first is a generic method based on the Solovay-Kitaev theorem that may be applied to all quantum gates, but is most effective for those that act on single qubits. We present the Solovay-Kitaev theorem in its simples known form as an algorithm, together with novel constructions that can be used to implement it. Following this we give a two specialized methods for two-qubit gate decomposition, based on the Cartan decomposition of the Lie group SU(4). The cluster-state model of computation is an alternative to the quantum circuit model, and makes use of quantum measurements and highly entangled cluster-states to implement a quantum computation. The fault-tolerant techniques developed for quantum circuits are not immediately applicable in this model, so in order for it to be a realistic candidate for performing computations we prove that such techniques are possible. In the second part of the thesis we prove that constant fault-tolerance thresholds may be achieved in the cluster-state model, and in particular in an adaption to an optical implementation. Following this we design a complete error correction scheme for optical cluster-state computation, and numerically determine the threshold of this model in the face of the dominant noise models likely to affect such an implementation.
Blind quantum computing (BQC) is a computational paradigm that allows a client with limited quantum capabilities to delegate quantum computations to a more powerful server while keeping both the algorithm and data hidden. However, in practice, existing BQC protocols face significant challenges when scaling to large-scale computations due to photon losses, low efficiencies, and high overheads associated with fault-tolerant operations, requiring the client to compile both logical operations and error correction primitives. We use a recently demonstrated hybrid light-matter approach [PRL 132, 150604 (2024); Science 388, 509-513 (2025)] to develop an architecture for scalable fault-tolerant blind quantum computation. By combining high-fidelity local gates on the server's matter qubits with delegated blind rotations using photons, we construct loss-tolerant delegated gates that enable efficient algorithm compilation strategies and a scalable approach for fault-tolerant blind logical algorithms. Our approach improves the error-correction threshold and increases the speed and depth of blind logical circuits. Finally, we outline how this architecture can be implemented on state-of-the-art quantum hardware, including neutral atom arrays and solid-state spin defects. These new capabilities open up new opportunities for deep circuit blind quantum computing.
Fault-tolerant quantum computation with bosonic qubits often necessitates the use of noisy discrete-variable ancillae. In this work, we establish a comprehensive and practical fault-tolerance framework for such a hybrid system and synthesize it with fault-tolerant protocols by combining bosonic quantum error correction (QEC) and advanced quantum control techniques. We introduce essential building blocks of error-corrected gadgets by leveraging ancilla-assisted bosonic operations using a generalized variant of path-independent quantum control. Using these building blocks, 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. Notably, our construction requires only dispersive coupling between bosonic modes and ancillae, as well as beam-splitter coupling between bosonic modes, both of which have been experimentally demonstrated with strong strengths and high accuracy. Moreover, each error-corrected bosonic qubit is comprised of only a single bosonic mode and a three-level ancilla, featuring the hardware efficiency of bosonic QEC in the full fault-tolerant setting. We numerically demonstrate the feasibility of our schemes using current experimental parameters in the circuit-QED platform. Finally, we present a hardware-efficient architecture for fault-tolerant quantum computing by concatenating the four-legged cat qubits with an outer qubit code utilizing only beam-splitter couplings. Our estimates suggest that the overall noise threshold can be reached using existing hardware. These developed fault-tolerant schemes extend beyond their applicability to four-legged cat qubits and can be adapted for other rotation-symmetrical codes, offering a promising avenue toward scalable and robust quantum computation with bosonic qubits. Published by the American Physical Society 2024
Quantum computing can help solve complex problems classical computers cannot solve. Current quantum systems, especially when using conventional qubits sensitive to environmental noise, face key scalability and fault tolerance hurdles. This has been identified as a promising path and is, in principle, fault-tolerant, but it still suffers from control and scalability issues. This work presents a new paradigm of quantum computation based on a hybrid quantum system combining topological qubits for error correction and traditional qubits for computing. The final hybrid system can reduce the bit-flip error probability from 0.05 to 0.02 and the phase-flip error probability from 0.08 to 0.01. The fidelity of quantum states after gate operations reached 0.92, surpassing both that of conventional (0.85) and topological (0.90) qubits. Moreover, this approach achieved a strength of interaction (0.90) and operation time (0.01 ms) higher than conventional qubits. Hybrid architecture significantly improves quantum systems' efficiency, scalability, and fault tolerance. Even with these advancements, controlling topological qubits and measuring the braiding of anyons are still challenging. Soon, research will concentrate on overcoming these technical challenges and paving the way for scaling up the hybrid system to more complex quantum computations.
Build quantum computers using superconducting qubits and microwave cavity technology Creating qubits with sufficiently long coherence times remains one of the central challenges in building practical quantum computers. Quantum Computing with Superconducting Qubits and Cavities unites the latest advances in superconducting qubits, ultra-high-Q microwave cavities, and cavity–transmon architectures that are emerging as one of the leading platforms for scalable, fault-tolerant quantum computing. By combining conceptual insight with practical implementation, the book equips readers to understand not only how these systems work, but why they are at the forefront of the quantum technology revolution. The book explores quantum computation using bosonic modes, Fock states, qudits, quantum memories, and modern bosonic error-correcting codes including cat, binomial, and GKP encodings. Fundamental concepts are developed through clear physical explanations, while rigorous mathematical treatments are introduced where needed to provide a deeper understanding. Dedicated reviews of the underlying principles of quantum physics make the material accessible to newcomers without sacrificing the depth expected by researchers and practicing engineers. Quantum Computing with Superconducting Qubits and Cavities also includes: Design principles and operation of superconducting transmon qubits integrated with high-coherence microwave cavities for scalable quantum architectures. Bosonic quantum error-correction strategies that dramatically extend coherence and move quantum computing closer to fault-tolerant operation. Applications of quantum computing, including integer factoring, database searching, quantum chemistry, condensed-matter physics, and materials science simulations beyond the reach of classical computers. Materials science, fabrication methods, and surface treatments that continue to drive record improvements in qubit and cavity coherence. The global race toward quantum computing, including major international investments and the rapidly expanding role of superconducting quantum technologies. Written for physicists, materials scientists, electrical engineers, computer scientists, graduate students, and researchers entering quantum information science, this book provides both the theoretical foundation and the practical knowledge needed to engage with one of the fastest-growing fields in modern science and engineering.
Fault-tolerant quantum computation with bosonic qubits often necessitates the use of noisy discrete-variable ancillae. In this work, we establish a comprehensive and practical fault-tolerance framework for such a hybrid system and synthesize it with fault-tolerant protocols by combining bosonic quantum error correction (QEC) and advanced quantum control techniques. We introduce essential building blocks of error-corrected gadgets by leveraging ancilla-assisted bosonic operations using a generalized variant of path-independent quantum control. Using these building blocks, 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. Notably, our construction requires only dispersive coupling between bosonic modes and ancillae, as well as beam-splitter coupling between bosonic modes, both of which have been experimentally demonstrated with strong strengths and high accuracy. Moreover, each error-corrected bosonic qubit is comprised of only a single bosonic mode and a three-level ancilla, featuring the hardware efficiency of bosonic QEC in the full fault-tolerant setting. We numerically demonstrate the feasibility of our schemes using current experimental parameters in the circuit-QED platform. Finally, we present a hardware-efficient architecture for fault-tolerant quantum computing by concatenating the four-legged cat qubits with an outer qubit code utilizing only beam-splitter couplings. Our estimates suggest that the overall noise threshold can be reached using existing hardware. These developed fault-tolerant schemes extend beyond their applicability to four-legged cat qubits and can be adapted for other rotation-symmetrical codes, offering a promising avenue toward scalable and robust quantum computation with bosonic qubits.