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

The ability of quantum information processing under the resource-restricted circumstances

Yumiko Murakami

Published Jan 1, 2008• 0 citations
Publisher
DOI
10.34413/dr.00801

Related papers

Quantum Information Processing with Finite Resources

Marco Tomamichel

arXiv:1504.00233•SpringerBriefs in mathematical physics•Oct 8, 2015•397 citations

Markovian evolution of quantum coherence under symmetric dynamics

Matteo Lostaglio, Kamil Korzekwa, Antony Milne

Both conservation laws and practical restrictions impose symmetry constraints on the dynamics of open quantum systems. In the case of time-translation symmetry, which arises naturally in many physically relevant scenarios, the quantum coherence between energy eigenstates becomes a valuable resource for quantum information processing. In this work, we identify the minimum amount of decoherence compatible with this symmetry for a given population dynamics. This yields a generalization to higher-dimensional systems of the relation ${T}_{2}\ensuremath{\le}2{T}_{1}$ for qubit decoherence and relaxation times. It also enables us to witness and assess the role of non-Markovianity as a resource for coherence preservation and transfer. Moreover, we discuss the relationship between ergodicity and the ability of Markovian dynamics to indefinitely sustain a superposition of different energy states. Finally, we establish a formal connection between the resource-theoretic and the master equation approaches to thermodynamics, with the former being a non-Markovian generalization of the latter. Our work thus brings the abstract study of quantum coherence as a resource towards the realm of actual physical applications.

arXiv:1703.01826•Physical Review A•Sep 11, 2017•39 citations

Complexity-Constrained Quantum Thermodynamics

Anthony Munson, Naga Bhavya Teja Kothakonda, Jonas Haferkamp +3 more

Quantum complexity measures the difficulty of realizing a quantum process, such as preparing a state or implementing a unitary. We present an approach to quantifying the thermodynamic resources required to implement a process if the process’s complexity is restricted. We focus on the prototypical task of information erasure, or Landauer erasure, wherein an n -qubit memory is reset to the all-zero state. We show that the minimum thermodynamic work required to reset an arbitrary state in our model, via a complexity-constrained process, is quantified by the state’s . The complexity entropy therefore quantifies a trade-off between the work cost and complexity cost of resetting a state. If the qubits have a nontrivial (but product) Hamiltonian, the optimal work cost is determined by the . The complexity entropy quantifies the amount of randomness a system appears to have to a computationally limited observer. Similarly, the complexity relative entropy quantifies such an observer’s ability to distinguish two states. We prove elementary properties of the complexity (relative) entropy. In a random circuit—a simple model for quantum chaotic dynamics—the complexity entropy transitions from zero to its maximal value around the time corresponding to the observer’s computational-power limit. Also, we identify information-theoretic applications of the complexity entropy. The complexity entropy quantifies the resources required for data compression if the compression algorithm must use a restricted number of gates. We further introduce a , which arises naturally in a complexity-constrained variant of information-theoretic decoupling. Assuming that this entropy obeys a conjectured chain rule, we show that the entropy bounds the number of qubits that one can decouple from a reference system, as judged by a computationally bounded referee. Overall, our framework extends the resource-theoretic approach to thermodynamics to integrate a notion of , as quantified by .

arXiv:2403.04828•PRX Quantum•Mar 10, 2025•24 citations

Quantum information processing with a minimal control

Peter J. Pemberton-Ross, Sonia G. Schirmer, I. C. H. Pullen

Bulletin of the American Physical Society•Mar 11, 2008•0 citations

Unknown measurement statistics cannot be redundantly copied using finite resources

Tiago Debarba, Marcus Huber, Nicolai Friis

Measurements can be viewed as interactions between a measured system and a pointer system that imprint information about the system on the pointer. For so-called unbiased interactions, the measurement statistics--the information corresponding to the diagonal of the system's initial density operator--with respect to a chosen measurement basis are transferred accurately, even if the pointer is initially in a mixed state. However, establishing measurement outcomes as objective facts also requires redundancy. We therefore consider the problem of unitarily distributing the outcome statistics to several pointers or quantum memories. We show that the accuracy of this process is limited by thermodynamic restrictions on preparing the memories in pure states: exact duplication of unknown outcome statistics is impossible using finite resources. For finite-temperature memories, we put forward a lower bound on the entropy production of the duplication process. This \emph{Holevo-Landauer} bound demonstrates that the mixedness of the initial memory limits the ability to accurately transfer the same information to more than one memory component, thus fundamentally restricting the creation of redundancies while maintaining the integrity of the original information. Finally, we show how the outcome statistics can be recovered exactly in the classical limit--via coarse-graining or asymptotically as the number of subsystems of each memory component increases--thus elucidating how objective properties can emerge despite inherent imperfections.

arXiv:2403.07660•Mar 12, 2024•8 citations

POSSIBILITIES FOR QUANTUM INFORMATION PROCESSING

Štěpán Holub

Springer eBooks•May 16, 2007•0 citations
Both conservation laws and practical restrictions impose symmetry constraints on the dynamics of open quantum systems. In the case of time-translation symmetry, which arises naturally in many physically relevant scenarios, the quantum coherence between energy eigenstates becomes a valuable resource for quantum information processing. In this work, we identify the minimum amount of decoherence compatible with this symmetry for a given population dynamics. This yields a generalization to higher-dimensional systems of the relation ${T}_{2}\ensuremath{\le}2{T}_{1}$ for qubit decoherence and relaxation times. It also enables us to witness and assess the role of non-Markovianity as a resource for coherence preservation and transfer. Moreover, we discuss the relationship between ergodicity and the ability of Markovian dynamics to indefinitely sustain a superposition of different energy states. Finally, we establish a formal connection between the resource-theoretic and the master equation approaches to thermodynamics, with the former being a non-Markovian generalization of the latter. Our work thus brings the abstract study of quantum coherence as a resource towards the realm of actual physical applications.
Quantum complexity measures the difficulty of realizing a quantum process, such as preparing a state or implementing a unitary. We present an approach to quantifying the thermodynamic resources required to implement a process if the process’s complexity is restricted. We focus on the prototypical task of information erasure, or Landauer erasure, wherein an n -qubit memory is reset to the all-zero state. We show that the minimum thermodynamic work required to reset an arbitrary state in our model, via a complexity-constrained process, is quantified by the state’s . The complexity entropy therefore quantifies a trade-off between the work cost and complexity cost of resetting a state. If the qubits have a nontrivial (but product) Hamiltonian, the optimal work cost is determined by the . The complexity entropy quantifies the amount of randomness a system appears to have to a computationally limited observer. Similarly, the complexity relative entropy quantifies such an observer’s ability to distinguish two states. We prove elementary properties of the complexity (relative) entropy. In a random circuit—a simple model for quantum chaotic dynamics—the complexity entropy transitions from zero to its maximal value around the time corresponding to the observer’s computational-power limit. Also, we identify information-theoretic applications of the complexity entropy. The complexity entropy quantifies the resources required for data compression if the compression algorithm must use a restricted number of gates. We further introduce a , which arises naturally in a complexity-constrained variant of information-theoretic decoupling. Assuming that this entropy obeys a conjectured chain rule, we show that the entropy bounds the number of qubits that one can decouple from a reference system, as judged by a computationally bounded referee. Overall, our framework extends the resource-theoretic approach to thermodynamics to integrate a notion of , as quantified by .
Measurements can be viewed as interactions between a measured system and a pointer system that imprint information about the system on the pointer. For so-called unbiased interactions, the measurement statistics--the information corresponding to the diagonal of the system's initial density operator--with respect to a chosen measurement basis are transferred accurately, even if the pointer is initially in a mixed state. However, establishing measurement outcomes as objective facts also requires redundancy. We therefore consider the problem of unitarily distributing the outcome statistics to several pointers or quantum memories. We show that the accuracy of this process is limited by thermodynamic restrictions on preparing the memories in pure states: exact duplication of unknown outcome statistics is impossible using finite resources. For finite-temperature memories, we put forward a lower bound on the entropy production of the duplication process. This \emph{Holevo-Landauer} bound demonstrates that the mixedness of the initial memory limits the ability to accurately transfer the same information to more than one memory component, thus fundamentally restricting the creation of redundancies while maintaining the integrity of the original information. Finally, we show how the outcome statistics can be recovered exactly in the classical limit--via coarse-graining or asymptotically as the number of subsystems of each memory component increases--thus elucidating how objective properties can emerge despite inherent imperfections.