Quantum complexity of time evolution with chaotic Hamiltonians
V Balasubramanian, M DeCross, A Kar… - Journal of High Energy …, 2020 - Springer
A bstract We study the quantum complexity of time evolution in large-N chaotic systems, with
the SYK model as our main example. This complexity is expected to increase linearly for …
the SYK model as our main example. This complexity is expected to increase linearly for …
Going beyond gadgets: the importance of scalability for analogue quantum simulators
D Harley, I Datta, FR Klausen, A Bluhm… - Nature …, 2024 - nature.com
Quantum hardware has the potential to efficiently solve computationally difficult problems in
physics and chemistry to reap enormous practical rewards. Analogue quantum simulation …
physics and chemistry to reap enormous practical rewards. Analogue quantum simulation …
[图书][B] Quantum Machine Learning and Optimisation in Finance: On the Road to Quantum Advantage
Learn the principles of quantum machine learning and how to apply them While focus is on
financial use cases, all the methods and techniques are transferable to other fields Purchase …
financial use cases, all the methods and techniques are transferable to other fields Purchase …
Security of quantum position-verification limits Hamiltonian simulation via holography
A bstract We investigate the link between quantum position-verification (QPV) and
holography established in [1] using holographic quantum error correcting codes as toy …
holography established in [1] using holographic quantum error correcting codes as toy …
Toy models of holographic duality between local Hamiltonians
A bstract Holographic quantum error correcting codes (HQECC) have been proposed as toy
models for the AdS/CFT correspondence, and exhibit many of the features of the duality …
models for the AdS/CFT correspondence, and exhibit many of the features of the duality …
Quantum speedup for graph sparsification, cut approximation, and Laplacian solving
Graph sparsification underlies a large number of algorithms, ranging from approximation
algorithms for cut problems to solvers for linear systems in the graph Laplacian. In its …
algorithms for cut problems to solvers for linear systems in the graph Laplacian. In its …
The complexity of translationally invariant problems beyond ground state energies
It is known that three fundamental questions regarding local Hamiltonians--approximating
the ground state energy (the Local Hamiltonian problem), simulating local measurements on …
the ground state energy (the Local Hamiltonian problem), simulating local measurements on …
Security of position-based quantum cryptography limits hamiltonian simulation via holography
We investigate the link between position-based quantum cryptography (PBQC) and
holography established in [MPS19] using holographic quantum error correcting codes as toy …
holography established in [MPS19] using holographic quantum error correcting codes as toy …
Translationally invariant universal quantum hamiltonians in 1d
Recent work has characterized rigorously what it means for one quantum system to simulate
another and demonstrated the existence of universal Hamiltonians—simple spin lattice …
another and demonstrated the existence of universal Hamiltonians—simple spin lattice …
The complexity of simulating local measurements on quantum systems
S Gharibian, J Yirka - Quantum, 2019 - quantum-journal.org
An important task in quantum physics is the estimation of local quantities for ground states of
local Hamiltonians. Recently,[Ambainis, CCC 2014] defined the complexity class …
local Hamiltonians. Recently,[Ambainis, CCC 2014] defined the complexity class …