A new quantum circuit method computes spectral functions A(k,ω) by simulating ARPES-like system-environment coupling, cutting sampling overhead by O(N) and demonstrated on a 54-qubit ion-trap processor for a 27-site chain.
The quantum adiabatic algorithm suppresses the prolif- eration of errors
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
fields
quant-ph 4verdicts
UNVERDICTED 4representative citing papers
Using solvable fermionic Hamiltonians with depolarizing noise, the work derives energy-error scaling and shows multi-frequency cooling outperforms adiabatic evolution in the topological phase while QAOA competes in the trivial phase.
A quantum MCMC algorithm leveraging the MBL phase and its thermal-to-localized transition to tune acceptance rates and sample thermal distributions on programmable quantum simulators for combinatorial optimization.
Trotterized near-thermal dynamics are substantially more robust to gate and Trotter errors than assumed, enabled by linear gate-error scaling with entanglement and a random product state ensemble approximating thermal states.
citing papers explorer
-
Spectral functions on a quantum computer through system-environment interaction
A new quantum circuit method computes spectral functions A(k,ω) by simulating ARPES-like system-environment coupling, cutting sampling overhead by O(N) and demonstrated on a 54-qubit ion-trap processor for a 27-site chain.
-
Benchmark of quantum algorithms for ground state preparation in the presence of noise
Using solvable fermionic Hamiltonians with depolarizing noise, the work derives energy-error scaling and shows multi-frequency cooling outperforms adiabatic evolution in the topological phase while QAOA competes in the trivial phase.
-
Quantum Markov chain Monte Carlo method with programmable quantum simulators
A quantum MCMC algorithm leveraging the MBL phase and its thermal-to-localized transition to tune acceptance rates and sample thermal distributions on programmable quantum simulators for combinatorial optimization.
-
Robustness of near-thermal dynamics on digital quantum computers
Trotterized near-thermal dynamics are substantially more robust to gate and Trotter errors than assumed, enabled by linear gate-error scaling with entanglement and a random product state ensemble approximating thermal states.