Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physical Review A

Collective decoherence of the superpositional entangled states in the quantum Shor algorithm

G. P. Berman, D. I. Kamenev, V. I. Tsifrinovich

Published Mar 28, 2005• 12 citations
Publisher

Abstract

We consider collective decoherence for the quantum Shor algorithm. A quantum computer which interacts with its environment is modeled by a spin-$1∕2$ chain interacting with harmonic oscillators at a given temperature. We calculate the nondiagonal matrix elements of the density matrix which are important for implementation of the quantum Shor algorithm, and study the decay rate and the Lamb phase shift for these elements. It is shown that the probability of superdecoherence in the quantum Shor algorithm is extremely small. The conditions for preserving quantum entanglement are formulated.

DOI
10.1103/physreva.71.032346

Related papers

Decoherence of quantum registers

John Henry Reina, Luis Quiroga, Neil F. Johnson

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.

arXiv:quant-ph/0105029•Physical Review A•Mar 1, 2002•214 citations

Decoherence and relevant universality in quantum algorithms via a dynamic theory for quantum measurement

C. P. Sun, Huijuan Zhan, X. F. Liu

It is well known that environment may decohere a quantum bit (qubit) system immersed in it, making a quantum computation invalid. But the quantitative features of the decoherence seem to depend on both the constitution of the environment and the details of its coupling with the qubit system. In this paper, based on the dynamic approach for quantum measurement developed from the Hepp-Coleman model [K. Hepp, Helv. Phys. Acta 45, 237 (1972)], we generally model the environment as a collection of a large number of subsystems and then consider to what extent and in which way the environment and its coupling with the qubit system may affect a quantum computation process. In the weak-coupling limit, we find that as far as decoherence time is concerned, there is no essential difference between an environment of two-level subsystems and an environment of harmonic oscillators. This implies that there exists some universality independent of specific constitutions of environments. However, it is also shown that this is not true at finite temperature or in the case of strong coupling. So only if the coupling is weak and the temperature low does there exist the possibility of developing a universal scheme of controlling a qubit system such that the decoherence is avoided. The possible effect of environment on the efficiency of a quantum algorithm is also explicitly illustrated through the example of Shor's prime factorization algorithm.

arXiv:quant-ph/9802029•Physical Review A•Sep 1, 1998•44 citations

QUANTUM COMPUTING CHALLENGES: EXPLORING DECOHERENCE THROUGH THE LENS OF SHOR'S ALGORITHM

António César Galhardi, Rodrigo De Souza

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.

Aracê.•Dec 26, 2024•1 citation

Decoherence in a N -qubit solid-state quantum register

Boris Ischi, Michael Hilke, Martin Dubé

We investigate the decoherence process for a quantum register composed of $N$ qubits coupled to an environment. We consider an environment composed of one common phonon bath and several electronic baths. This environment is relevant to the implementation of a charge based solid-state quantum computer. We explicitly compute the time evolution of all off-diagonal terms of the register's reduced density matrix. We find that in realistic configurations, ``superdecoherence'' and ``decoherence-free subspaces'' do not exist for an $N$-qubit system. This means that all off-diagonal terms decay, but not faster than ${e}^{\ensuremath{-}q(t)N}$, where $q(t)$ is of the same order as the decay function of a single qubit.

arXiv:quant-ph/0411086•Physical Review B•May 26, 2005•24 citations

Coherence and decoherence in generalized Shor’s algorithm

Linlin 琳琳 Ye 叶, Zhaoqi Wu, Nanrun 南润 Zhou 周

Abstract Quantum coherence constitutes a fundamental physical mechanism essential to the study of quantum algorithms. We study coherence and decoherence in the generalized Shor’s algorithm where the register A is initialized in an arbitrary pure state, or the combined register AB is initialized in a pseudo-pure state, which encompasses the standard Shor’s algorithm as a special case. We derive both lower and upper bounds on the performance of the generalized Shor’s algorithm, and establish the relation between the probability of calculating the order r when register AB is initialized in a pseudo-pure state and that when register A is initialized in an arbitrary pure state. Moreover, we study coherence and decoherence in the noisy Shor’s algorithm and give a lower bound on the probability that we can calculate the order r .

arXiv:2508.11962•Chinese Physics B•Feb 11, 2026•0 citations

Decoherence problem in quantum state transfer via an engineered spin chain

Lan Zhou, Jing Lü, Tao Shi +1 more

A perfect quantum state transfer(QST) has been shown in an engineered spin chain with "always-on interaction". Here, we consider a more realistic problem for such a protocol, the quantum decoherence induced by a spatially distributed environment, which is universally modeled as a bath of harmonic oscillators. By making use of the irreducible tensor method in angular momentum theory, we investigate the effect of decoherence on the efficiency of QST for both cases at zero and finite temperatures. We not only show the generic exponential decay of QST efficiency as the number of sites increase, but also find some counterintuitive effect, the QST can be enhanced as temperature increase.

arXiv:quant-ph/0608135•Aug 17, 2006•12 citations
We consider collective decoherence for the quantum Shor algorithm. A quantum computer which interacts with its environment is modeled by a spin-1∕21∕21∕2 chain interacting with harmonic oscillators at a given temperature. We calculate the nondiagonal matrix elements of the density matrix which are important for implementation of the quantum Shor algorithm, and study the decay rate and the Lamb phase shift for these elements. It is shown that the probability of superdecoherence in the quantum Shor algorithm is extremely small. The conditions for preserving quantum entanglement are formulated.
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.
It is well known that environment may decohere a quantum bit (qubit) system immersed in it, making a quantum computation invalid. But the quantitative features of the decoherence seem to depend on both the constitution of the environment and the details of its coupling with the qubit system. In this paper, based on the dynamic approach for quantum measurement developed from the Hepp-Coleman model [K. Hepp, Helv. Phys. Acta 45, 237 (1972)], we generally model the environment as a collection of a large number of subsystems and then consider to what extent and in which way the environment and its coupling with the qubit system may affect a quantum computation process. In the weak-coupling limit, we find that as far as decoherence time is concerned, there is no essential difference between an environment of two-level subsystems and an environment of harmonic oscillators. This implies that there exists some universality independent of specific constitutions of environments. However, it is also shown that this is not true at finite temperature or in the case of strong coupling. So only if the coupling is weak and the temperature low does there exist the possibility of developing a universal scheme of controlling a qubit system such that the decoherence is avoided. The possible effect of environment on the efficiency of a quantum algorithm is also explicitly illustrated through the example of Shor's prime factorization algorithm.
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.
We investigate the decoherence process for a quantum register composed of NNN qubits coupled to an environment. We consider an environment composed of one common phonon bath and several electronic baths. This environment is relevant to the implementation of a charge based solid-state quantum computer. We explicitly compute the time evolution of all off-diagonal terms of the register's reduced density matrix. We find that in realistic configurations, ``superdecoherence'' and ``decoherence-free subspaces'' do not exist for an NNN-qubit system. This means that all off-diagonal terms decay, but not faster than ${e}^{\ensuremath{-}q(t)N}$, where q(t)q(t)q(t) is of the same order as the decay function of a single qubit.
Abstract Quantum coherence constitutes a fundamental physical mechanism essential to the study of quantum algorithms. We study coherence and decoherence in the generalized Shor’s algorithm where the register A is initialized in an arbitrary pure state, or the combined register AB is initialized in a pseudo-pure state, which encompasses the standard Shor’s algorithm as a special case. We derive both lower and upper bounds on the performance of the generalized Shor’s algorithm, and establish the relation between the probability of calculating the order r when register AB is initialized in a pseudo-pure state and that when register A is initialized in an arbitrary pure state. Moreover, we study coherence and decoherence in the noisy Shor’s algorithm and give a lower bound on the probability that we can calculate the order r .
A perfect quantum state transfer(QST) has been shown in an engineered spin chain with "always-on interaction". Here, we consider a more realistic problem for such a protocol, the quantum decoherence induced by a spatially distributed environment, which is universally modeled as a bath of harmonic oscillators. By making use of the irreducible tensor method in angular momentum theory, we investigate the effect of decoherence on the efficiency of QST for both cases at zero and finite temperatures. We not only show the generic exponential decay of QST efficiency as the number of sites increase, but also find some counterintuitive effect, the QST can be enhanced as temperature increase.