arXiv subjects

Dylan Harley

Publications and source records attributed to Dylan Harley.

5 recordsLinked to original sources

arXiv2026

Analogue quantum simulation with polylogarithmic interaction strengths by extrapolating within phases of matter

Simple families of quantum Hamiltonians can simulate general many-body systems at arbitrary precision through the use of perturbative gadgets, however this generally requires interaction strengths spanning many orders of magnitude which scale polynomially in the system size and inverse precision, resulting in physically unrealisable systems. In this work, we show that for non-critical systems these required scalings can be exponentially reduced through classical post-processing, by simulating the model at smaller energy scales and extrapolating observables to the perturbative limit. In particular, we show that both local and extensive properties of thermal states with exponentially decaying correlations and ground states with a sufficiently stable gap can be simulated using gadgets whose interaction strengths scale only polylogarithmically in the inverse precision and the system size. As a key tool, we develop a generalised treatment of the local Schrieffer-Wolff transformation for geometrically quasi-local Hamiltonians over many energy scales, facilitating the analysis of perturbative gadget Hamiltonians without extensive global energy penalities, which may be of independent interest.

quant-ph↗

arXiv2026

Fault-Tolerant One-Shot Entanglement Generation with Constant-Sized Quantum Devices in the Plane

Consider a rectangular grid of qubits in 2D with single-qubit and nearest-neighbor two-qubit operations subject to local stochastic Pauli noise. At different length scales, this setup describes both a single quantum computing device with geometrically limited connectivity between qubits arranged on a disc, and planar networks composed of quantum repeater stations of constant size. We give a protocol which robustly generates entanglement between distant qubits in this setup. For noise below a constant threshold error strength, it generates a constant-fidelity Bell pair between qubits separated by an arbitrarily large distance $R$. To generate distance-$R$ entanglement, a rectangular grid of qubits of dimensions $\Theta(R)\times \Theta(\mathsf{poly}(\log R))$ suffices. Our protocol applies quantum operations in one shot, establishing a Bell state in a constant time up to a known Pauli correction. In contrast, existing entanglement generation protocols either require local quantum devices controlling a number of qubits growing with the targeted distance, or are not single-shot, i.e., have a distance-dependent execution time. The protocol leverages many-body entanglement in networks and provides the first example of a short-range entangled state in 2D with long-range localizable entanglement robust to local stochastic Pauli noise. As an immediate corollary, we construct a 2D-local stabilizer Hamiltonian whose Gibbs states possess long-range localizable entanglement at constant positive temperature.

quant-ph↗

arXiv2025

Computational complexity of injective projected entangled pair states

Projected entangled pair states (PEPS) constitute a variational family of quantum states with area-law entanglement. PEPS are particularly relevant and successful for studying ground states of spatially local Hamiltonians. However, computing local expectation values in these states is known to be \postBQP-hard. Injective PEPS, where all constituent tensors fulfil an injectivity constraint, are generally believed to be better behaved, because they are unique ground states of spatially local Hamiltonians. In this work, we therefore examine how the computational hardness of contraction depends on the injectivity. We establish that below a constant positive injectivity threshold, evaluating local observables remains \postBQP-complete, while above a different constant nontrivial threshold there exists an efficient classical algorithm for the task, resolving an open question from (Anshu et al., STOC `24). We do this by proving that noisy postselected quantum computation can be made fault-tolerant.

quant-ph↗

arXiv2024

High ground state overlap via quantum embedding methods

Quantum computers can accurately compute ground state energies using phase estimation, but this requires a guiding state that has significant overlap with the true ground state. For large molecules and extended materials, it becomes difficult to find guiding states with good ground state overlap for growing molecule sizes. Additionally, the required number of qubits and quantum gates may become prohibitively large. One approach for dealing with these challenges is to use a quantum embedding method, which allows a reduction to one or multiple smaller quantum cores embedded in a larger quantum region. In such situations it is unclear how the embedding method affects the hardness of constructing good guiding states. In this work, we therefore investigate the preparation of guiding states in the context of quantum embedding methods. We extend previous work on quantum impurity problems, a framework in which we can rigorously analyze the embedding of a subset of orbitals. While there exist results for optimal active orbital space selection in terms of energy minimization, we rigorously demonstrate how the same principles can be used to define selected orbital spaces for state preparation in terms of the overlap with the ground state. Moreover, we perform numerical studies of molecular systems relevant to biochemistry, one field in which quantum embedding methods are required due to the large size of biomacromolecules such as proteins and nucleic acids. We investigate two different embedding strategies which can exhibit qualitatively different orbital entanglement. In all cases we demonstrate that the easy-to-obtain mean-field state will have a sufficiently high overlap with the target state to perform quantum phase estimation.

quant-ph↗

arXiv2023

Going Beyond Gadgets: The Importance of Scalability for Analogue Quantum Simulators

Quantum hardware has the potential to efficiently solve computationally difficult problems in physics and chemistry to reap enormous practical rewards. Analogue quantum simulation accomplishes this by using the dynamics of a controlled many-body system to mimic those of another system; such a method is feasible on near-term devices. We show that previous theoretical approaches to analogue quantum simulation suffer from fundamental barriers which prohibit scalable experimental implementation. By introducing a new mathematical framework and going beyond the usual toolbox of Hamiltonian complexity theory with an additional resource of engineered dissipation, we show that these barriers can be overcome. This provides a powerful new perspective for the rigorous study of analogue quantum simulators.

quant-ph↗