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

Solid State Communications

Remark on the application of the effective hamiltonian method for random systems

Z. Mrozińska, Andrzej Pękalski

Published Feb 1, 1980• 0 citations
Publisher
DOI
10.1016/0038-1098(80)90832-7

Related papers

Comment on "Ground-State Instability of a Random System"

M. V. Feigel’man, V. M. Vinokur

Physical Review Letters•Aug 29, 1988•18 citations

Fluctuation-guided adaptive random compiler for Hamiltonian simulation

Yu-Xia Wu, Yun-Zhuo Fan, Dan-Bo Zhang

Stochastic methods offer an effective way to suppress coherent errors in quantum simulation. In particular, the randomized compilation protocol may reduce circuit depth by randomly sampling Hamiltonian terms rather than following the deterministic Trotter-Suzuki sequence. However, its fixed sampling distribution does not adapt to the dynamics of the system, limiting its accuracy. In this work, we propose a fluctuation-guided adaptive algorithm that adaptively updates sampling probabilities based on fluctuations of Hamiltonian terms to achieve higher simulation fidelity. Remarkably, the protocol renders an intuitive physical understanding: Hamiltonian terms with greater sensitivity to the state evolution should be prioritized during sampling. The overload of measuring fluctuations necessary for updating the sampling probability is affordable, and can be further largely reduced by classical shadows. We demonstrate the effectiveness of the method with numeral simulations across discrete-variable, continuous-variable and hybrid-variable systems.

arXiv:2509.10158•Physical Review Applied•Apr 22, 2026•0 citations

Randomization Times under Quantum Chaotic Hamiltonian Evolution

Souradeep Ghosh, Nicholas Hunter-Jones, Joaquin F. Rodriguez-Nieva

Randomness generation through quantum-chaotic evolution underpins foundational questions in statistical mechanics and applications across quantum information science, including benchmarking, tomography, metrology, and demonstrations of quantum computational advantage. While statistical mechanics successfully captures the temporal averages of local observables, understanding randomness at the level of higher statistical moments remains a daunting challenge, with analytic progress largely confined to random quantum circuit models or fine-tuned systems exhibiting space-time duality. Here we study how much randomness can be dynamically generated by generic quantum-chaotic evolution under physical, non-random Hamiltonians. Combining theoretical insights with numerical simulations, we show that for broad classes of initially unentangled states, the dynamics become effectively Haar-random well before the system can ergodically explore the physically accessible Hilbert space. Both local and highly nonlocal observables, including entanglement measures, equilibrate to their Haar expectation values and fluctuations on polynomial timescales with remarkably high numerical precision, and with the fastest randomization occurring in regions of parameter space previously identified as maximally chaotic. Interestingly, this effective randomization can occur on timescales linear in system size, suggesting that the sub-ballistic growth of Renyi entropies typically observed in systems with conservation laws can be bypassed in non-random Hamiltonians with an appropriate choice of initial conditions.

cond-mat.stat-mechCross-listedarXiv:2512.25074•Jan 1, 2026•0 citations

The stochastic approach for non-Hamiltonian systems

Rodanthy Tzani

Theoretical and Mathematical Physics•Jul 1, 1994•0 citations

Concentration for Random Product Formulas

Chi-Fang Chen, Hsin-Yuan Huang, Richard Kueng +1 more

Quantum simulation has wide applications in quantum chemistry and physics.Recently, scientists have begun exploring the use of randomized methods for accelerating quantum simulation.Among them, a simple and powerful technique, called QDRIFT, is known to generate random product formulas for which the average quantum channel approximates the ideal evolution.QDRIFT achieves a gate count that does not explicitly depend on the number of terms in the Hamiltonian, which contrasts with Suzuki formulas.This work aims to understand the origin of this speedup by comprehensively analyzing a single realization of the random product formula produced by QDRIFT.The main results prove that a typical realization of the randomized product formula approximates the ideal unitary evolution up to a small diamond-norm error.The gate complexity is already independent of the number of terms in the Hamiltonian, but it depends on the system size and the sum of the interaction strengths in the Hamiltonian.Remarkably, the same random evolution starting from an arbitrary, but fixed, input state yields a much shorter circuit suitable for that input state.In contrast, in deterministic settings, such an improvement usually requires initial state knowledge.The proofs depend on concentration inequalities for vector and matrix martingales, and the framework is applicable to other randomized product formulas.Our bounds are saturated by certain commuting Hamiltonians.

arXiv:2008.11751•PRX Quantum•Oct 7, 2021•68 citations

Dynamics of Random One-Dimensional ±J Systems

G. Ismail, Khalid Bannora

Czechoslovak Journal of Physics•Dec 1, 2003•1 citation
Stochastic methods offer an effective way to suppress coherent errors in quantum simulation. In particular, the randomized compilation protocol may reduce circuit depth by randomly sampling Hamiltonian terms rather than following the deterministic Trotter-Suzuki sequence. However, its fixed sampling distribution does not adapt to the dynamics of the system, limiting its accuracy. In this work, we propose a fluctuation-guided adaptive algorithm that adaptively updates sampling probabilities based on fluctuations of Hamiltonian terms to achieve higher simulation fidelity. Remarkably, the protocol renders an intuitive physical understanding: Hamiltonian terms with greater sensitivity to the state evolution should be prioritized during sampling. The overload of measuring fluctuations necessary for updating the sampling probability is affordable, and can be further largely reduced by classical shadows. We demonstrate the effectiveness of the method with numeral simulations across discrete-variable, continuous-variable and hybrid-variable systems.
Randomness generation through quantum-chaotic evolution underpins foundational questions in statistical mechanics and applications across quantum information science, including benchmarking, tomography, metrology, and demonstrations of quantum computational advantage. While statistical mechanics successfully captures the temporal averages of local observables, understanding randomness at the level of higher statistical moments remains a daunting challenge, with analytic progress largely confined to random quantum circuit models or fine-tuned systems exhibiting space-time duality. Here we study how much randomness can be dynamically generated by generic quantum-chaotic evolution under physical, non-random Hamiltonians. Combining theoretical insights with numerical simulations, we show that for broad classes of initially unentangled states, the dynamics become effectively Haar-random well before the system can ergodically explore the physically accessible Hilbert space. Both local and highly nonlocal observables, including entanglement measures, equilibrate to their Haar expectation values and fluctuations on polynomial timescales with remarkably high numerical precision, and with the fastest randomization occurring in regions of parameter space previously identified as maximally chaotic. Interestingly, this effective randomization can occur on timescales linear in system size, suggesting that the sub-ballistic growth of Renyi entropies typically observed in systems with conservation laws can be bypassed in non-random Hamiltonians with an appropriate choice of initial conditions.
Quantum simulation has wide applications in quantum chemistry and physics.Recently, scientists have begun exploring the use of randomized methods for accelerating quantum simulation.Among them, a simple and powerful technique, called QDRIFT, is known to generate random product formulas for which the average quantum channel approximates the ideal evolution.QDRIFT achieves a gate count that does not explicitly depend on the number of terms in the Hamiltonian, which contrasts with Suzuki formulas.This work aims to understand the origin of this speedup by comprehensively analyzing a single realization of the random product formula produced by QDRIFT.The main results prove that a typical realization of the randomized product formula approximates the ideal unitary evolution up to a small diamond-norm error.The gate complexity is already independent of the number of terms in the Hamiltonian, but it depends on the system size and the sum of the interaction strengths in the Hamiltonian.Remarkably, the same random evolution starting from an arbitrary, but fixed, input state yields a much shorter circuit suitable for that input state.In contrast, in deterministic settings, such an improvement usually requires initial state knowledge.The proofs depend on concentration inequalities for vector and matrix martingales, and the framework is applicable to other randomized product formulas.Our bounds are saturated by certain commuting Hamiltonians.