Minimal action control method in quantum critical models

Ainur, Kazhybekova,; Campbell, Steve; Kiely, Anthony

doi:10.1088/2399-6528/aca3fa

Cited by 3 publications

(1 citation statement)

References 52 publications

(56 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This scenario serves to illustrate that the design of shortcuts can be tricky. Solutions to this problem could be to go to higher orders in the development of the CD term or to explore other λ(t) functions as in [63,64], where geometric arguments are used to obtain the optimal way to vary the time dependent parameters in the adiabatic evolution. We can repeat the study in Eq.…”

Section: Complexity In Adiabatic Algorithmsmentioning

confidence: 99%

Circuit Complexity through phase transitions: Consequences in quantum state preparation

Roca-Jerat,

Sancho-Lorente,

Román-Roche

et al. 2023

SciPost Phys.

View full text Add to dashboard Cite

In this paper, we analyze the circuit complexity for preparing ground states of quantum many-body systems. In particular, how this complexity grows as the ground state approaches a quantum phase transition. We discuss different definitions of complexity, namely the one following the Fubini-Study metric or the Nielsen complexity. We also explore different models: Ising, ZZXZ or Dicke. In addition, different forms of state preparation are investigated: analytic or exact diagonalization techniques, adiabatic algorithms (with and without shortcuts), and Quantum Variational Eigensolvers. We find that the divergence (or lack thereof) of the complexity near a phase transition depends on the non-local character of the operations used to reach the ground state. For Fubini-Study based complexity, we extract the universal properties and their critical exponents. In practical algorithms, we find that the complexity depends crucially on whether or not the system passes close to a quantum critical point when preparing the state. For both VQE and Adiabatic algorithms, we provide explicit expressions and bound the growth of complexity with respect to the system size and the execution time, respectively.

show abstract

Section: Complexity In Adiabatic Algorithmsmentioning

confidence: 99%

Circuit Complexity through phase transitions: Consequences in quantum state preparation

Roca-Jerat,

Sancho-Lorente,

Román-Roche

et al. 2023

SciPost Phys.

View full text Add to dashboard Cite

show abstract

Efficiency optimization in quantum computing: balancing thermodynamics and computational performance

Śmierzchalski,

Mzaouali,

Deffner

et al. 2024

Sci Rep

View full text Add to dashboard Cite

We investigate the computational efficiency and thermodynamic cost of the D-Wave quantum annealer under reverse-annealing with and without pausing. Our demonstration on the D-Wave 2000Q annealer shows that the combination of reverse-annealing and pausing leads to improved computational efficiency while minimizing the thermodynamic cost compared to reverse-annealing alone. Moreover, we find that the magnetic field has a positive impact on the performance of the quantum annealer during reverse-annealing but becomes detrimental when pausing is involved. Our results, which are reproducible, provide strategies for optimizing the performance and energy consumption of quantum annealing systems employing reverse-annealing protocols.

show abstract