A quantum computer is an information processing systems that utilizes invertible logic elements to perform reversible logic operations. It can also perform irreversible logic operations. Thus, in principle, it can compute the information transformation rule of any physical system for which the rules are known. A quantum computer can be designed to perform parallel computation on a massive scale, and therefore can have fast execution time. The basic structure of a quantum computer includes 1) a quantum register, or a configuration of quantum-mechanical energy states to store quantum bits (qubits) of information, 2) a quantum processor designed to induce quantum mechanical interactions between any arbitrary pair of qubits to perform a specified logic operations. 3) a quantum bus or network for transferring qubits from the registers to the processor and vice versa, and 4) a physical mechanisms for non-destructive measurements on the qubits. Quantum mechanical systems with the potential for realizing quantum computers include ion-trap quantum computers, cavity quantum electrodynamics quantum computers, photon-trap quantum computers, nuclear magnetic resonance quantum computers, and superconducting quantum computers. Decoherence [1 ,2] possesses the greatest challenge to the practical realization of quantum computers, because it causes the collapse of the quantum superposition states that contain the vital results of qubit manipulations. Decoherence processes are measurement-induced, noise-induced, and environment-induced [3] . Schemes to correct or circumvent the detrimental effects of decoherence in quantum processors fall into active error-correction schemes, and passive error-correction schemes [4]. Active error-correction schemes are designed to detect and correct for errors during computation. Algorithmic fault-tolerant computing [5, 6] is the most promising active-error correction scheme. In fault-tolerant computing, ancillary qubits are encoded into data blocks of the quantum registers. They are then used to detect errors. Once detected appropriate error-correction algorithms are then employed to rectify the errors. The implementation of fault-tolerant quantum computing has been hampered by the lack of practical universal set of quantum gates that can process an encoded data without propagating or introducing additional errors. Passive-error correction schemes [7] attempt to finding Hilbert subspaces that are intrinsically free of decoherence effects [8]. The key to quantum computing in such a decoherence-free subspace is the identification of mechanisms that can effect quantum mechanical interactions between the decoherence-free states without taking the system out of the decoherence-free environment. The challenge is to identify and employ physical processes that can achieve these goals.
A quantum computer is an information processing systems that utilizes invertible logic elements to perform reversible logic operations. It can also perform irreversible logic operations. Thus, in principle, it can compute the information transformation rule of any physical system for which the rules are known. A quantum computer can be designed to perform parallel computation on a massive scale, and therefore can have fast execution time. The basic structure of a quantum computer includes 1) a quantum register, or a configuration of quantum-mechanical energy states to store quantum bits (qubits) of information, 2) a quantum processor designed to induce quantum mechanical interactions between any arbitrary pair of qubits to perform a specified logic operations. 3) a quantum bus or network for transferring qubits from the registers to the processor and vice versa, and 4) a physical mechanisms for non-destructive measurements on the qubits. Quantum mechanical systems with the potential for realizing quantum computers include ion-trap quantum computers, cavity quantum electrodynamics quantum computers, photon-trap quantum computers, nuclear magnetic resonance quantum computers, and superconducting quantum computers. Decoherence [1 ,2] possesses the greatest challenge to the practical realization of quantum computers, because it causes the collapse of the quantum superposition states that contain the vital results of qubit manipulations. Decoherence processes are measurement-induced, noise-induced, and environment-induced [3] . Schemes to correct or circumvent the detrimental effects of decoherence in quantum processors fall into active error-correction schemes, and passive error-correction schemes [4]. Active error-correction schemes are designed to detect and correct for errors during computation. Algorithmic fault-tolerant computing [5, 6] is the most promising active-error correction scheme. In fault-tolerant computing, ancillary qubits are encoded into data blocks of the quantum registers. They are then used to detect errors. Once detected appropriate error-correction algorithms are then employed to rectify the errors. The implementation of fault-tolerant quantum computing has been hampered by the lack of practical universal set of quantum gates that can process an encoded data without propagating or introducing additional errors. Passive-error correction schemes [7] attempt to finding Hilbert subspaces that are intrinsically free of decoherence effects [8]. The key to quantum computing in such a decoherence-free subspace is the identification of mechanisms that can effect quantum mechanical interactions between the decoherence-free states without taking the system out of the decoherence-free environment. The challenge is to identify and employ physical processes that can achieve these goals.
Today's computers work on bits that exist as either 0 or 1. Quantum computers aren't limited to two states; they encode information as quantum bits, or qubits, which can exist in superposition. Qubits represent atoms, ions, photons or electrons and their respective control devices that are working together to act as computer memory and a processor. Because a quantum computer can contain these multiple states simultaneously, it has the potential to be millions of times more powerful than today's most powerful supercomputers. A processor that can use registers of qubits will be able to perform calculations using all the possible values of the input registers simultaneously. This superposition causes a phenomenon called quantum parallelism, and is the motivating force behind the research being carried out in quantum computing. Due to technical obstacles, till date, a quantum computer has not yet been realized. But the concepts and ideas of quantum computing has been demonstrated using various methods like NMR, Ion Trap, Quantum Dot, Optical Methods, etc. A quantum computer manipulates qubits by executing a series of quantum gates, each a unitary transformation acting on a single qubit or pair of qubits. In applying these gates in succession, a quantum computer can perform a complicated unitary transformation to a set of qubits in some initial state. The qubits can then be measured, with this measurement serving as the final computational result. Research must devise a way to maintain decoherence and other potential sources of error at an acceptable level. Probably the most important idea in this field is the application of error correction in phase coherence as a means to extract information and reduce error in a quantum system without actually measuring that system. Thereby, quantum computers will emerge as the superior computational devices and perhaps one day make today's modern computer obsolete.
Over the past several decades, quantum information science has emerged to seek answers to the question: can we gain some advantage by storing, transmitting and processing information encoded in systems that exhibit unique quantum properties? Today it is understood that the answer is yes, and many research groups around the world are working towards the highly ambitious technological goal of building a quantum computer, which would dramatically improve computational power for particular tasks. A number of physical systems, spanning much of modern physics, are being developed for quantum computation. However, it remains unclear which technology, if any, will ultimately prove successful. Here we describe the latest developments for each of the leading approaches and explain the major challenges for the future. This review outlines the principles of operation of quantum computers and their elements. The theory of ideal computers that do not interact with the environment and are immune to quantum decohering processes is presented. Decohering processes in quantum computers are investigated. The review considers methods for correcting quantum computing errors arising from the decoherence of the state of the quantum computer, as well as possible methods for the suppression of the decohering processes. A brief enumeration of proposed quantum computer realizations concludes the review.
Quantum computing holds the promise of solving problems that are intractable for classical computers, with applications ranging from optimization and materials simulation to cryptography. It achieves this by leveraging the exponentially scaling dimensionality of the space encoding quantum information and by executing algorithms on quantum registers in superposition states – a feature often referred to as quantum parallelism. However, while encoding information in computational units capable of exploring a continuous set of quantum states enables exponential scaling of computational power with system size, quantum systems are also more susceptible to errors than their classical counterparts. These errors take the form of both control errors, where miscalibration of the control pulses causes coherent errors on the qubit states, as well as incoherent errors due to energy relaxation and dephasing. Scaling quantum systems to run useful algorithms involving hundreds or thousands of logical qubits will require quantum error correction. In this approach, quantum information is redundantly encoded across an entangled state of many physical qubits. This has enabled experimental demonstrations across various platforms – including ion traps, superconducting circuits, and neutral atoms – showing that encoded quantum states can be preserved beyond the coherence times of the constituting physical qubits. However, quantum state preservation is only one component needed for scalable quantum computing. To execute algorithms, it is also necessary to implement quantum gates on and between encoded qubits, in a way that maintains fault tolerance by preserving the ability to correct errors as they occur during the computation. In the first part of this thesis, we demonstrate the implementation of an error-corrected quantum operation that entangles two logical qubits. This is achieved by performing lattice surgery on a distance-three surface code qubit, resulting in a logical Bell state encoded in distance-three repetition codes, which enable the correction of single bit-flip errors. We further introduce techniques to benchmark and characterize the performance of logical operations, including applying the protocol to arbitrary logical input states and performing logical quantum process tomography. Together, these results constitute one of the first realizations of error-corrected lattice surgery in superconducting circuits. While quantum error correction can correct errors provided they occur with sufficiently low frequency, it may fail when many qubits experience errors simultaneously. In the second part of this thesis, we therefore shift focus to a specific error mechanism known to cause correlated errors in superconducting circuits – quasiparticle-induced decoherence. In this case, various forms of energy deposition on the quantum device can break Cooper pairs into quasiparticles, which may subsequently diffuse to the tunnel junction and interact with the qubit state, thereby causing decoherence. In this thesis, we investigate the impact of quasiparticle tunneling on qubit performance, with a focus on infrared-induced quasiparticles. We compare the sensitivity of niobium-based qubits to those made from tantalum – a material that has gained interest in recent years following demonstrations of qubits with improved coherence times based on this material. Using a thermal radiator source, we show that the performance of tantalum qubits may be limited by infrared-induced quasiparticles in typical superconducting circuit experimental setups. By employing both ambient and in-line infrared filters, we investigate the effectiveness of different filtering strategies and develop best practices for engineering cryogenic environments for superconducting quantum processors. The results presented in this thesis contribute to the advancement of quantum computing based on superconducting circuits by implementing and characterizing quantum error-corrected operations, and by investigating quasiparticles as a source of decoherence, along with strategies to improve infrared filtering and signal conditioning in cryogenic environments for future fault-tolerant quantum computing.
Quantum computers promise to solve computational problems that are inaccessible to classical machines. The reliable execution of large-scale quantum algorithms requires robust operations in the presence of noise. Quantum error correction addresses this challenge by encoding quantum information redundantly across several physical qubits, such that errors can be detected and corrected during a computation. However, no single error-correcting code intrinsically supports an inherently robust, fault-tolerant implementation of all gates needed for universal quantum computing. Moreover, most modern approaches to both quantum error correction and the implementation of universal logical operations on encoded qubits rely on mid-circuit measurements and feed-forward control. These types of operations are technologically demanding, often slow, and prone to high error rates, and they limit the overall success probability of quantum algorithms. In this thesis, we develop fault-tolerant protocols and circuits for quantum error correction and universal logical computation, with an emphasis on implementations compatible with current hardware systems. We first focus on fault-tolerant quantum error correction on small codes. By comparing different protocols, we identify trade-offs between compact circuit constructions and their robustness to noise. We then assess their practical performance by comparing numerical simulations of noisy circuits with experimental data. Beyond the preservation of encoded information, we study how universal logic can be implemented in a fault-tolerant manner on encoded qubits. A central approach considered in this thesis is code switching, in which logical information is transferred between two distinct error-correcting codes that support complementary sets of inherently fault-tolerant logical gates. In combination, these codes give access to a complete universal fault-tolerant logical gate set. In this thesis, we determine conditions that allow us to construct fault-tolerant protocols for code switching. We adapt these protocols to the capabilities of current hardware, thereby enabling the first experimental realization of universal fault-tolerant logic by means of code switching. However, the overall performance of these schemes is limited by slow and noisy mid-circuit measurements. To address this bottleneck, we construct a suite of measurement-free fault-tolerant universal operations that do not require any measurements during the execution of an algorithm. In this framework, error correction and logical operations are implemented coherently as part of the quantum circuit, without mid-circuit measurements or in-sequence classical control. We introduce measurement-free code-switching schemes that can be scaled to arbitrary code distances through concatenation, and which thereby provide, in principle, arbitrarily strong error suppression. We further tailor our approach to the capabilities of current trapped-ion quantum processors. New circuit constructions support the first experimental implementation of a logical quantum algorithm without mid-circuit measurements, demonstrated through Grover's search on three encoded qubits. Together, the results of this thesis expand the toolbox for early fault-tolerant quantum computation. They show how protocols for quantum error correction and universal logical gates can be designed without mid-circuit measurements with realistic hardware constraints in mind, opening new pathways towards universal quantum logic.
Quantum Computing, which is considered as the combination of both quantum physics and computer science, is exciting a global wave of research and technology that is positioned to radically overhaul in addressing computational problems. However, quantum computers obtain their exponential computational power using yet other distinct quantum phenomena, including superposition, entanglement, and quantum tunneling, precisely in situations involving cryptography, optimization and quantum simulation. Yet, since fulfilling these challenges involves robust error correction, scalable qubit architectures and efficient quantum algorithms, practical quantum computing has tremendous promise and is quite challenging to achieve. This paper presents an overview of the basics of quantum computing tracing its origins in theory, the transition to modern hardware and software, the current state of quantum computing including challenges and issues, and an exploration of future of quantum computing
Abstract The ability to perform quantum error correction (QEC) and robust gate operations on encoded qubits opens the door to demonstrations of quantum algorithms. Contemporary QEC schemes typically require mid-circuit measurements with feed-forward control, which are challenging for qubit control, often slow, and susceptible to relatively high error rates. In this work, we propose and experimentally demonstrate a universal toolbox of fault-tolerant logical operations without mid-circuit measurements on a trapped-ion quantum processor. We present modular logical state teleportation between two four-qubit error-detecting codes without measurements during algorithm execution. Moreover, we realize a fault-tolerant universal gate set on an eight-qubit error-detecting code hosting three logical qubits, based on state injection, which can be executed by coherent gate operations only. We apply this toolbox to experimentally realize Grover's quantum search algorithm fault-tolerantly on three logical qubits encoded in eight physical qubits, with the implementation displaying clear identification of the desired solution states. Our work demonstrates the practical feasibility and provides first steps into the largely unexplored direction of measurement-free quantum computation.