Quantum computers have now appeared in our society and are utilized for the investigation of science and engineering. At present, they have been built as intermediate-size computers containing about fifty qubits and are weak against noise effects. Hence, they are called noisy-intermediate scale quantum devices. In order to accomplish efficient quantum computation with using these machines, a key issue is going to be the coherent control of individual and collective quantum noises. In this work, we focus on a latter type and investigate formulations of the collective quantum noises represented as quantum circuits. To simplify our discussions and make them concrete, we analyze collective amplitude damping processes in two-qubit systems. As verifications of our formalisms and the quantum circuits, we demonstrate digital quantum simulations of the collective amplitude damping by examining six different initial conditions with varying the number of execution of an overall operation for our quantum simulations. We observe that our results show good numerical matching with the solution of quantum master equation for the two-qubit systems as we increase such a number. In addition, we explain the essence of the way to extend our formalisms to analyze the collective amplitude damping in larger qubit systems. These results pave the way for establishing systematic approaches to control the quantum noises and designing large-scale quantum computers.
Quantum computers have now appeared in our society and are utilized for the investigation of science and engineering. At present, they have been built as intermediate-size computers containing about fifty qubits and are weak against noise effects. Hence, they are called noisy-intermediate scale quantum devices. In order to accomplish efficient quantum computation with using these machines, a key issue is going to be the coherent control of individual and collective quantum noises. In this work, we focus on a latter type and investigate formulations of the collective quantum noises represented as quantum circuits. To simplify our discussions and make them concrete, we analyze collective amplitude damping processes in two-qubit systems. As verifications of our formalisms and the quantum circuits, we demonstrate digital quantum simulations of the collective amplitude damping by examining six different initial conditions with varying the number of execution of an overall operation for our quantum simulations. We observe that our results show good numerical matching with the solution of quantum master equation for the two-qubit systems as we increase such a number. In addition, we explain the essence of the way to extend our formalisms to analyze the collective amplitude damping in larger qubit systems. These results pave the way for establishing systematic approaches to control the quantum noises and designing large-scale quantum computers.
Near-term quantum computers have been built as intermediate-scale quantum devices and are fragile against quantum noise effects, namely, NISQ devices. Traditional quantum-error-correcting codes are not implemented on such devices and to perform quantum computation in good accuracy with these machines we need to develop alternative approaches for mitigating quantum computational errors. In this work, we propose quantum error mitigation (QEM) scheme for quantum computational errors which occur due to couplings with environments during gate operations, i.e., decoherence. To establish our QEM scheme, first we estimate the quantum noise effects on single-qubit states and represent them as groups of quantum circuits, namely, quantum-noise-effect circuit groups. Then our QEM scheme is conducted by subtracting expectation values generated by the quantum-noise-effect circuit groups from those obtained by the quantum circuits for the quantum algorithms under consideration. As a result, the quantum noise effects are reduced, and we obtain approximately the ideal expectation values via the quantum-noise-effect circuit groups and the numbers of elementary quantum circuits composing them scale polynomial with respect to the products of the depths of quantum algorithms and the numbers of register bits. To numerically demonstrate the validity of our QEM scheme, we run noisy quantum simulations of qubits under amplitude damping effects for four types of quantum algorithms. Furthermore, we implement our QEM scheme on IBM Q Experience processors and examine its efficacy. Consequently, the validity of our scheme is verified via both the quantum simulations and the quantum computations on the real quantum devices. Our QEM scheme is solely composed of quantum-computational operations (quantum gates and measurements), and thus, it can be conducted by any type of quantum device. In addition, it can be applied to error mitigation for many other types of quantum noise effects as well as noisy quantum computing of long-depth quantum algorithms.
The advent of noisy intermediate-scale quantum (NISQ) devices has not only opened up new possibilities to studying quantum computational benefits, but it has also presented new challenges associated with noise and short coherence times. Entanglement is one of the inherent resources that can be used to perform quantum computation and implement the performance and reliability of quantum algorithms. This paper looks at entanglement dynamics in NISQ machines subjected to natural noises. The study focuses on the problem of examining the role of various noise channels in the creation, dynamics, and decay of the entanglement during quantum operations, such as depolarizing, amplitude damping, and phase damping. The study is based on theoretical modeling and numerical simulations of multi-qubit quantum circuits to determine the stability of entangled states with respect to circuit depth and intensity of noise. Concurrence and von Neumann entropy are examples of entanglement measures that are used to characterize correlations between qubits as well as to trace the dynamics of these correlations across computational interactions. The results show that noise has major impacts on entanglement distribution, which tends to cause rapid decays in highly entangled states with increase in circuit complexity. The findings, however, also show that there are some circuit architectures and error-mitigation schemes that can somewhat sustain entanglement with moderate levels of noise. The paper also emphasizes the relevance of minimalizing sequence of gates, and reduced circuit depth in an effort to preserve useful entanglement in present-day quantum hardware. These observations help in understanding the behaviour of quantum correlations better in real world quantum devices and provide a way of developing more resilient quantum algorithms that would work on NISQ systems. In general, the article offers a systematic view on entanglement behavior in disordered quantum systems and highlights its value in the development of quantum computing applications in the near term.
The amplitude-damping time T 1 has long stood as the major factor limiting quantum fidelity in superconducting circuits, prompting concerted efforts in the material science and design of qubits aimed at increasing T 1 .In contrast, the dephasing time T ϕ can usually be extended above T 1 (via, e.g., dynamical decoupling) to the point where it does not limit fidelity.In this article, we propose a scheme for overcoming the conventional T 1 limit on fidelity by designing qubits in a way that amplitude-damping errors can be detected and converted into erasure errors.Compared to standard qubit implementations, our scheme improves the performance of fault-tolerant protocols, as numerically demonstrated by the circuit-noise simulations of the surface code.We describe two simple qubit implementations with superconducting circuits and discuss procedures for detecting amplitude-damping errors, performing entangling gates, and extending T ϕ .Our results suggest that engineering efforts should focus on improving T ϕ and the quality of quantum coherent control, as they effectively become the limiting factor on the performance of faulttolerant protocols.
A major problem in exploiting microscopic systems for developing a new technology based on the principles of quantum information is the influence of noise, which tends to work against the quantum features of such systems. It thus becomes crucial to understand how noise affects the evolution of quantum circuits: several techniques have been proposed, among which stochastic differential equations (SDEs) can represent a very convenient tool. We show how SDEs naturally map any Markovian noise into a linear operator, which we call a noise gate, acting on the wave function describing the state of the circuit, and we discuss some examples. We show that these gates can be manipulated like any standard quantum gate, thus simplifying in certain circumstances the task of computing the overall effect of the noise at each stage of the protocol. This approach yields equivalent results to those derived from the Lindblad equation; yet, as we show, it represents a handy and fast tool for performing computations, and, moreover, it allows for fast numerical simulations and generalizations to non-Markovian noise. In detail we review the depolarizing channel and the generalized amplitude damping channel in terms of this noise gate formalism and show how these techniques can be applied to any quantum circuit.
Quantum computing and quantum information science are two recently discovered and rapidly growing fields of physics that show substantial promise in providing new and valuable technologies in the foreseeable future. Large-scale quantum computers, if ever realized experimentally, are likely to outperform their classical counterparts in a number of important computational tasks, the most important of which may be the accurate simulation of many-body quantum systems such as the ones encountered in physics, chemistry and life sciences. This thesis investigates the problem of controlling quantum systems for the purpose of performing quantum information processing tasks. The problem is approached from a theoretical and simulational viewpoint. The work contained here encompasses a range of levels of abstraction. Firstly, we discuss the decomposition of abstract multiqubit logic gates into sequences of simple elementary gates. Secondly, we study the local commutational properties of two-qubit gates using local gate invariants. Thirdly, we develop methods for the physical implementation of the elementary gates through the control of specific quantum systems, possibly in the presence of noise and decoherence. We present a new, almost optimal n-qubit gate decomposition based on the cosine-sine decomposition, which utilizes a likewise new intermediate quantum circuit structure we call a uniformly controlled gate. We then show how they can be used in constructing a general state transformation circuit. Both of the resulting circuits can be efficiently implemented using nearest-neighbor gates which makes their physical realization simpler. A local gate invariant is introduced which can be used to assess the suitability of two-qubit gates for serving as the entangling gate in elementary gate libraries. Finally, we develop numerical optimization methods for finding near-optimal control sequences for generating oneand two-qubit gates, both in closed quantum systems and in the presence of Markovian noise.
Decoherence of quantum states is a major hurdle towards scalable and reliable quantum computing. Lower decoherence (i.e., higher fidelity) can alleviate the error correction overhead and obviate the need for energy-intensive noise reduction techniques e.g., cryogenic cooling. In this paper, we performed a noise-induced decoherence analysis of single and multi-qubit quantum gates using physics-based simulations. The analysis indicates that (i) decoherence depends on the input state and the gate type. Larger number of ∣1⟩ states worsen the decoherence; (ii) amplitude damping is more detrimental than phase damping; (iii) shorter depth implementation of a quantum function can achieve lower decoherence. Simulations indicate 20\% improvement in the fidelity of a quantum adder when realized using lower depth topology. The insights developed in this paper can be exploited by the circuit designer to choose the right gates and logic implementation to optimize the system-level fidelity.