We analyse dissipation in quantum computation and its destructive impact on efficiency of quantum algorithms. Using a general model of decoherence, we study the time evolution of a quantum register of arbitrary length coupled with an environment of arbitrary coherence length. We discuss relations between decoherence and computational complexity and show that the quantum factorization algorithm must be modified in order to be regarded as efficient and realistic.
We analyse dissipation in quantum computation and its destructive impact on efficiency of quantum algorithms. Using a general model of decoherence, we study the time evolution of a quantum register of arbitrary length coupled with an environment of arbitrary coherence length. We discuss relations between decoherence and computational complexity and show that the quantum factorization algorithm must be modified in order to be regarded as efficient and realistic.
The dynamical evolution of a quantum register of arbitrary length coupled to an environment of arbitrary coherence length is predicted within a relevant model of decoherence. The results are reported for quantum bits (qubits) coupling individually to different environments (``independent decoherence'') and qubits interacting collectively with the same reservoir (``collective decoherence''). In both cases, explicit decoherence functions are derived for any number of qubits. The decay of the coherences of the register is shown to strongly depend on the input states: We show that this sensitivity is a characteristic of both types of coupling (collective and independent) and not only of the collective coupling, as has been reported previously. A nontrivial behavior (``recoherence'') is found in the decay of the off-diagonal elements of the reduced density matrix in the specific situation of independent decoherence. Our results lead to the identification of decoherence-free states in the collective decoherence limit. These states belong to subspaces of the system's Hilbert space that do not get entangled with the environment, making them ideal elements for the engineering of ``noiseless'' quantum codes. We also discuss the relations between decoherence of the quantum register and computational complexity based on the dynamical results obtained for the register density matrix.
A model for a quantum register R made of N replicas of a d-dimensional quantum system (cell) coupled with the environment is studied by means of a Born-Markov master equation (ME). Dissipation and decoherence are discussed in various cases in which a subdecoherent encoding can be rigorously found. For the quantum-bit case (d=2) we have solved, for small N, the ME by numerical direct integration and studied, as a function of the coherence length ${\ensuremath{\xi}}_{c}$ of the bath, fidelity and decoherence rates of states of the register. For large enough ${\ensuremath{\xi}}_{c}$ the singlet states of the global su(2) pseudo spin algebra of the register (noiseless at ${\ensuremath{\xi}}_{c}=\ensuremath{\infty})$ are shown to have a much smaller decoherence rates than the rest of the Hilbert space.
Quantum computing, with its transformative potential in solving complex problems, faces a critical challenge: coupling with the environment and the consequent decoherence of quantum systems. This article examines the state of the art on the subject, providing a theoretical basis for understanding how environmental interactions impact quantum algorithms. Quantum coherence, a fundamental element of quantum mechanics, allows quantum states to exist in superposition. However, interaction with the environment triggers decoherence, resulting in the loss of this coherence and affecting the accuracy of the results of quantum algorithms. The study investigates the mechanisms of environmental coupling, such as interactions with photons, fluctuations in magnetic fields, and other external factors. Additionally, the impact of decoherence on notable algorithms, such as Shor's algorithm, is explored, analyzing its implications for the efficiency in determining results. Contemporary mitigation strategies, including quantum error correction techniques applied to this algorithm, are also discussed. The results highlight that decoherence represents a significant obstacle to the practical application of quantum computing in scientific, organizational and social problems. In parallel, a promising set of tools to mitigate or avoid the effects of decoherence is being developed, advancing the viability of quantum computers as applicable technologies.
This Thesis focuses on different aspects of quantum computation theory: adiabatic quantum algorithms, decoherence during the adiabatic evolution and quantum simulators. After an overview on the area of quantum computation and setting up the formal ground for the rest of the Thesis we derive a general error estimate for adiabatic quantum computing. We demonstrate that the first-order correction, which has frequently been used as a condition for adiabatic quantum computation, does not yield a good estimate for the computational error. Therefore, a more general criterion is proposed, which includes higher-order corrections and shows that the computational error can be made exponentially small – which facilitates significantly shorter evolution times than the first-order estimate in certain situations. Based on this criterion and rather general arguments and assumptions, it can be demonstrated that a run-time of order of the inverse minimum energy gap is sufficient and necessary. Furthermore, exploiting the similarity between adiabatic quantum algorithms and quantum phase transitions, we study the impact of decoherence on the sweep through a second-order quantum phase transition for the prototypical example of the Ising chain in a transverse field and compare it to the adiabatic version of Grover’s search algorithm. It turns out that (in contrast to first-order transitions) the impact of decoherence caused by a weak coupling to a rather general environment increases with system size (i.e., number of spins/qubits), which might limit the scalability of the system. Finally, we propose the use of electron systems to construct laboratory systems based on present-day technology which reproduce and thereby simulate the quantum dynamics of the Ising model and the O(3) nonlinear sigma model.
We describe an array of quantum gates implementing Shor's algorithm [in Proceedings of the 35th Annual Symposium on Foundations of Computer Science, edited by S. Goldwasser (IEEE Computer Society, Los Alamitos, CA, 1994), p. 116; (unpublished); Phys. Rev. A 53, R2493 (1995)] for prime factorization in a quantum computer. The array includes a circuit for modular exponentiation with several subcomponents (such as controlled multipliers and adders) that are described in terms of elementary Toffoli gates. We present a simple analysis of the impact of losses and decoherence on the performance of this quantum factoring circuit. For that purpose, we simulate a quantum computer that is running the program to factor N=15 while interacting with a dissipative environment. As a consequence of this interaction, randomly selected quantum bits (qubits) may spontaneously decay. Using the results of our numerical simulations, we analyze the efficiency of some simple error correction techniques. \textcopyright{} 1996 The American Physical Society.
Accurate quantum computing relies on the precision of quantum gates. However, quantum gates in practice are generally affected by dissipative environments, which can significantly reduce their fidelity. In this paper, we elucidate the fundamental relations between the average fidelity of generic quantum gates and the dissipation that occurs during the computing processes. Considering scenarios in which a quantum gate is subject to Markovian environments, we rigorously derive fidelity-dissipation relations that hold for arbitrary operational times. Intriguingly, when the quantum gate undergoes thermal relaxation, the result can be used as a valuable tool for estimating dissipation through experimentally measurable fidelity, without requiring detailed knowledge of the dissipative structure. For the case of arbitrary environments, we uncover a trade-off relation between the average fidelity and energy dissipation, implying that these quantities cannot be large simultaneously. Our results unveil the computational limitations imposed by thermodynamics, shedding light on the profound connection between thermodynamics and quantum computing. Published by the American Physical Society 2024