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

arXiv:quant-ph/0502050

Meltdown in quantum computers needs not occur: Nuclear experiments show a way out

Jorge Flores, S. Yu. Kun, T. H. Seligman

Published Feb 8, 2005• 6 citations
arXivHTMLPDF

Abstract

We show that phase memory can be much longer than energy relaxation in systems with exponentially large dimensions of Hilbert space; this finding is documented by fifty years of nuclear experiments, though the information is somewhat hidden. For quantum computers Hilbert spaces of dimension $2^{100}$ or larger will be typical and therefore this effect may contribute significantly to reduce the problems of scaling of quantum computers to a useful number of qubits.

DOI
10.48550/arxiv.quant-ph/0502050

Related papers

Slow phase relaxation as a route to quantum computing beyond the quantum chaos border

Jorge Flores, S. Yu. Kun, T. H. Seligman

We reveal that phase memory can be much longer than energy relaxation in systems with exponentially large dimensions of Hilbert space; this finding is documented by 50 years of nuclear experiments, though the information is somewhat hidden. For quantum computers Hilbert spaces of dimension 2(100) or larger will be typical and therefore this effect may contribute significantly to reduce the problems of scaling of quantum computers to a useful number of qubits.

Physical Review E•Jul 20, 2005•5 citations

Characterization and Control in Large Hilbert spaces.

Colm A. Ryan

Computational devices built on and exploiting quantum phenomena have the potential to revolutionize our understanding of computational complexity by being able to solve certain problems faster than the best known classical algorithms. Unfortunately, unlike the digital computers quantum information processing devices hope to replace, quantum information is fragile by nature and lacks the inherent robustness of digital logic. Indeed, for whatever we can do to control the evolution, nature can also do in some random and unknown fashion ruining the computation. This thesis explores the task of building the classical control architecture to control a large quantum system and how to go about characterizing the behaviour of the system to determine the level of control reached. Both these tasks appear to require an exponential amount of resources as the size of the system grows. The inability to efficiently control and characterize large scale quantum systems will certainly militate against their potential computational usefulness making these important problems to solve. The solutions presented in this thesis are all tested for their practical usefulness by implementing them in either liquid- or solid-state nuclear magnetic resonance.

•Dec 3, 2008•4 citations

Physical-resource demands for scalable quantum computation

Carlton M. Caves, Ivan Deutsch, Robin Blume-Kohout

The primary resource for quantum computation is Hilbert-space dimension. Whereas Hilbert space itself is an abstract construction, the number of dimensions available to a system is a physical quantity that requires physical resources. Avoiding a demand for an exponential amount of these resources places a fundamental constraint on the systems that are suitable for scalable quantum computation. To be scalable, the number of degrees of freedom in the computer must grow nearly linearly with the number of qubits in an equivalent qubit-based quantum computer.

arXiv:quant-ph/0304083•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 16, 2003•7 citations

A new phase in quantum computation

Erik Sjöqvist

Large-scale quantum computers are hard to construct because quantum systems easily lose their coherence through interaction with the environment. Researchers have tried to avoid this problem by using geometric phase shifts in the design of quantum gates to perform information processing. Experiments and simulations have shown that these gates may be tolerant to certain types of faults, and may therefore be useful for robust quantum computation.

Physics•Nov 17, 2008•124 citations

Anomalously Slow Cross Symmetry Phase Relaxation, Thermalized Non-Equilibrated Matter and Quantum Computing Beyond the Quantum Chaos Border

Marc Bienert

Thermalization in highly excited quantum many-body system does not necessarily mean a complete memory loss of the way the system was formed.This effect may pave a way for a quantum computing, with a large number of qubits n 100-1000, far beyond the quantum chaos border.One of the manifestations of such a thermalized nonequilibrated matter is revealed by a strong asymmetry around 90 • c.m. of evaporating proton yield in the Bi(γ,p) photonuclear reaction.The effect is described in terms of anomalously slow cross symmetry phase relaxation in highly excited quantum many-body systems with exponentially large Hilbert space dimensions.In the above reaction this phase relaxation is about eight orders of magnitude slower than energy relaxation (thermalization).

arXiv:quant-ph/0602224•Symmetry Integrability and Geometry Methods and Applications•Feb 27, 2006•6 citations

Techniques For Computing and Approximating Large Optimization Problems in Quantum Information

Ankith Mohan

Many fundamental problems in quantum information theory can be formulated as optimization tasks over quantum states and measurements. While the convex structure of quantum theory often enables powerful semidefinite programming formulations, a major challenge persists: the exponential growth of Hilbert space dimension with system size. This dissertation discusses techniques to address these and related obstacles across several core problems in quantum information. We first study optimization over separable quantum states. Such problems are typically NP-hard and standard semidefinite programming hierarchies suffer from the curse of dimensionality. We introduce a hybrid algorithm that leverages a quantum co-processor to reduce the effective dimension of the problem. While several existing approaches provide only a numerical bound on the optimal value, our method is guaranteed to return an explicit feasible solution: a valid separable state, even in instances where it is not optimal. We apply this framework to approximate the minimum separable energy of many-body Hamiltonians, define an entanglement measure for their ground spaces, and demonstrate numerical scalability to systems of up to 28 qubits. We next consider the general Bayes framework, as introduced by Helstrom, for state discrimination when, instead of a classical description of the candidate states, one has access to their source code: the quantum circuit that prepares them. We show that the typical semidefinite program for the discrimination problem can be reformulated in terms of the Gram matrix of these states, reducing the variable dimensions from dL to NL, where d is the Hilbert space dimension, N is the number of candidate states, and L is the number of possible guesses. Importantly, we further introduce a quantum pre-processing procedure which efficiently constructs the reduced problem from the source code, enabling our method to operate directly on quantum data. We consider two applications. First, we characterize the optimal identifications for quantum changepoint problems under several reward structures whose associated discrimination problems were previously computationally inaccessible. Second, we consider a quantum error classification problem and show how our reduction makes it tractable for systems of hundreds of qubits. We also analyze structural measurement strategies. As a counterpart to the well-known pretty good measurement for minimum-error state discrimination, we introduce the pretty bad measurement for the exclusion variant, in which the goal is to identify a state that was not sent, rather than to identify the one that was, and prove that both are guaranteed to perform at least as well as blind guessing in their respective objectives. Finally, we consider evaluating Boolean functions under severe memory constraints and prove that a simple local "greedy" measurement strategy is globally optimal precisely for affine Boolean functions, while more generally achieving at least the square of the optimal global success probability. Together, these results demonstrate that high-dimensional quantum optimization problems often admit hidden structure enabling dimension reduction, hybrid computation, and provable approximation guarantees.

•Aug 18, 2026•0 citations
We show that phase memory can be much longer than energy relaxation in systems with exponentially large dimensions of Hilbert space; this finding is documented by fifty years of nuclear experiments, though the information is somewhat hidden. For quantum computers Hilbert spaces of dimension 21002^{100}2100 or larger will be typical and therefore this effect may contribute significantly to reduce the problems of scaling of quantum computers to a useful number of qubits.
Computational devices built on and exploiting quantum phenomena have the potential to revolutionize our understanding of computational complexity by being able to solve certain problems faster than the best known classical algorithms. Unfortunately, unlike the digital computers quantum information processing devices hope to replace, quantum information is fragile by nature and lacks the inherent robustness of digital logic. Indeed, for whatever we can do to control the evolution, nature can also do in some random and unknown fashion ruining the computation. This thesis explores the task of building the classical control architecture to control a large quantum system and how to go about characterizing the behaviour of the system to determine the level of control reached. Both these tasks appear to require an exponential amount of resources as the size of the system grows. The inability to efficiently control and characterize large scale quantum systems will certainly militate against their potential computational usefulness making these important problems to solve. The solutions presented in this thesis are all tested for their practical usefulness by implementing them in either liquid- or solid-state nuclear magnetic resonance.
The primary resource for quantum computation is Hilbert-space dimension. Whereas Hilbert space itself is an abstract construction, the number of dimensions available to a system is a physical quantity that requires physical resources. Avoiding a demand for an exponential amount of these resources places a fundamental constraint on the systems that are suitable for scalable quantum computation. To be scalable, the number of degrees of freedom in the computer must grow nearly linearly with the number of qubits in an equivalent qubit-based quantum computer.
Thermalization in highly excited quantum many-body system does not necessarily mean a complete memory loss of the way the system was formed.This effect may pave a way for a quantum computing, with a large number of qubits n 100-1000, far beyond the quantum chaos border.One of the manifestations of such a thermalized nonequilibrated matter is revealed by a strong asymmetry around 90 • c.m. of evaporating proton yield in the Bi(γ,p) photonuclear reaction.The effect is described in terms of anomalously slow cross symmetry phase relaxation in highly excited quantum many-body systems with exponentially large Hilbert space dimensions.In the above reaction this phase relaxation is about eight orders of magnitude slower than energy relaxation (thermalization).
Many fundamental problems in quantum information theory can be formulated as optimization tasks over quantum states and measurements. While the convex structure of quantum theory often enables powerful semidefinite programming formulations, a major challenge persists: the exponential growth of Hilbert space dimension with system size. This dissertation discusses techniques to address these and related obstacles across several core problems in quantum information. We first study optimization over separable quantum states. Such problems are typically NP-hard and standard semidefinite programming hierarchies suffer from the curse of dimensionality. We introduce a hybrid algorithm that leverages a quantum co-processor to reduce the effective dimension of the problem. While several existing approaches provide only a numerical bound on the optimal value, our method is guaranteed to return an explicit feasible solution: a valid separable state, even in instances where it is not optimal. We apply this framework to approximate the minimum separable energy of many-body Hamiltonians, define an entanglement measure for their ground spaces, and demonstrate numerical scalability to systems of up to 28 qubits. We next consider the general Bayes framework, as introduced by Helstrom, for state discrimination when, instead of a classical description of the candidate states, one has access to their source code: the quantum circuit that prepares them. We show that the typical semidefinite program for the discrimination problem can be reformulated in terms of the Gram matrix of these states, reducing the variable dimensions from dL to NL, where d is the Hilbert space dimension, N is the number of candidate states, and L is the number of possible guesses. Importantly, we further introduce a quantum pre-processing procedure which efficiently constructs the reduced problem from the source code, enabling our method to operate directly on quantum data. We consider two applications. First, we characterize the optimal identifications for quantum changepoint problems under several reward structures whose associated discrimination problems were previously computationally inaccessible. Second, we consider a quantum error classification problem and show how our reduction makes it tractable for systems of hundreds of qubits. We also analyze structural measurement strategies. As a counterpart to the well-known pretty good measurement for minimum-error state discrimination, we introduce the pretty bad measurement for the exclusion variant, in which the goal is to identify a state that was not sent, rather than to identify the one that was, and prove that both are guaranteed to perform at least as well as blind guessing in their respective objectives. Finally, we consider evaluating Boolean functions under severe memory constraints and prove that a simple local "greedy" measurement strategy is globally optimal precisely for affine Boolean functions, while more generally achieving at least the square of the optimal global success probability. Together, these results demonstrate that high-dimensional quantum optimization problems often admit hidden structure enabling dimension reduction, hybrid computation, and provable approximation guarantees.