arXiv subjects

Henrik Dreyer

Publications and source records attributed to Henrik Dreyer.

At least 37 records · Page 2Linked to original sources

arXiv2024

Experimental Demonstration of Break-Even for the Compact Fermionic Encoding

The utility of solving the Fermi-Hubbard model has been estimated in the billions of dollars. Digital quantum computers can in principle address this task, but have so far been limited to quasi one-dimensional models. This is because of exponential overheads caused by the interplay of noise and the non-locality of the mapping between fermions and qubits. Here, we show experimentally that a recently developed local encoding can overcome this problem. We develop a new compilation scheme, called "corner hopping", that reduces the cost of simulating fermionic hopping by 42% which allows us to conduct the largest digital quantum simulations of a fermionic model to date, using a trapped ion quantum computer to prepare adiabatically the ground state of a 6 x 6 spinless Fermi-Hubbard model encoded in 48 physical qubits. We also develop two new error mitigation schemes for systems with conserved quantities, one based on local postselection and one on extrapolation of local observables. Our results suggest that Fermi-Hubbard models beyond classical simulability can be addressed by digital quantum computers without large increases in gate fidelity.

quant-ph↗

arXiv2024

Dilution of error in digital Hamiltonian simulation

We provide analytic, numerical and experimental evidence that the amount of noise in digital quantum simulation of local observables can be independent of system size in a number of situations. We provide a microscopic explanation of this dilution of errors based on the "relevant string length" of operators, which is the length of Pauli strings in the operator at time $s$ that belong to the exponentially small subspace of strings that can give a non-zero expectation value at time $t$. We show that this explanation can predict when dilution of errors occurs and when it does not. We propose an error mitigation method whose efficiency relies on this mechanism. Our findings imply that digital quantum simulation with noisy devices is in appropriate cases scalable in the sense that gate errors do not need to be reduced linearly to simulate larger systems.

quant-ph↗

arXiv2024

Practicality of quantum adiabatic algorithm for chemistry applications

Despite its simplicity and strong theoretical guarantees, adiabatic state preparation has received considerably less interest than variational approaches for the preparation of low-energy electronic structure states. Two major reasons for this are the large number of gates required for Trotterising time-dependent electronic structure Hamiltonians, as well as discretisation errors heating the state. We show that a recently proposed randomized algorithm, which implements exact adiabatic evolution without heating and with far fewer gates than Trotterisation, can overcome this problem. We develop three methods for measuring the energy of the prepared state in an efficient and noise-resilient manner, yielding chemically accurate results on a 4-qubit molecule in the presence of realistic gate noise, without the need for error mitigation. These findings suggest that adiabatic approaches to state preparation could play a key role in quantum chemistry simulations both in the era of noisy as well as error-corrected quantum computers.

quant-ph↗

arXiv2024

Robustness of critical U(1) spin liquids and emergent symmetries in tensor networks

We study the response of critical Resonating Valence Bond (RVB) spin liquids to doping with longer-range singlets, and more generally of U(1)-symmetric tensor networks to non-symmetric perturbations. Using a field theory description, we find that in the RVB, doping constitutes a relevant perturbation which immediately opens up a gap, contrary to previous observations. Our analysis predicts a very large correlation length even at significant doping, which we verify using high-accuracy numerical simulations. This emphasizes the need for careful analysis, but also justifies the use of such states as a variational ansatz for critical systems. Finally, we give an example of a PEPS where non-symmetric perturbations do not open up a gap and the U(1) symmetry re-emerges.

cond-mat.str-el↗

arXiv2024

Benchmarking a heuristic Floquet adiabatic algorithm for the Max-Cut problem

According to the adiabatic theorem of quantum mechanics, a system initially in the ground state of a Hamiltonian remains in the ground state if one slowly changes the Hamiltonian. This can be used in principle to solve hard problems on quantum computers. Generically, however, implementation of this Hamiltonian dynamics on digital quantum computers requires scaling Trotter step size with system size and simulation time, which incurs a large gate count. In this work, we argue that for classical optimization problems, the adiabatic evolution can be performed with a fixed, finite Trotter step. This "Floquet adiabatic evolution" reduces by several orders of magnitude the gate count compared to the usual, continuous-time adiabatic evolution. We give numerical evidence using matrix-product-state simulations that it can optimally solve the Max-Cut problem on $3$-regular graphs in a large number of instances, with surprisingly low runtime, even with bond dimensions as low as $D=2$. Extrapolating our numerical results, we estimate the resources needed for a quantum computer to compete with classical exact or approximate solvers for this specific problem.

quant-ph↗

arXiv2024

Non-Abelian Topological Order and Anyons on a Trapped-Ion Processor

Non-Abelian topological order (TO) is a coveted state of matter with remarkable properties, including quasiparticles that can remember the sequence in which they are exchanged. These anyonic excitations are promising building blocks of fault-tolerant quantum computers. However, despite extensive efforts, non-Abelian TO and its excitations have remained elusive, unlike the simpler quasiparticles or defects in Abelian TO. In this work, we present the first unambiguous realization of non-Abelian TO and demonstrate control of its anyons. Using an adaptive circuit on Quantinuum's H2 trapped-ion quantum processor, we create the ground state wavefunction of $D_4$ TO on a kagome lattice of 27 qubits, with fidelity per site exceeding $98.4\%$. By creating and moving anyons along Borromean rings in spacetime, anyon interferometry detects an intrinsically non-Abelian braiding process. Furthermore, tunneling non-Abelions around a torus creates all 22 ground states, as well as an excited state with a single anyon -- a peculiar feature of non-Abelian TO. This work illustrates the counterintuitive nature of non-Abelions and enables their study in quantum devices.

quant-ph↗

arXiv2024

A noise-limiting quantum algorithm using mid-circuit measurements for dynamical correlations at infinite temperature

It is generally considered that the signal output by a quantum circuit is attenuated exponentially fast in the number of gates. This letter explores how algorithms using mid-circuit measurements and classical conditioning as computational tools (and not as error mitigation or correction subroutines) can be naturally resilient to complete decoherence, and maintain quantum states with useful properties even for infinitely deep noisy circuits. Specifically, we introduce a quantum channel built out of mid-circuit measurements and feed-forward, that can be used to compute dynamical correlations at infinite temperature and canonical ensemble expectation values for any Hamiltonian. The unusual property of this algorithm is that in the presence of a depolarizing channel it still displays a meaningful, non-zero signal in the large depth limit. We showcase the noise resilience of this quantum channel on Quantinuum's H1-1 ion-trap quantum computer.

quant-ph↗

arXiv2023

Continuous Hamiltonian dynamics on digital quantum computers without discretization error

We introduce an algorithm to compute Hamiltonian dynamics on digital quantum computers that requires only a finite circuit depth to reach an arbitrary precision, i.e. achieves zero discretization error with finite depth. This finite number of gates comes at the cost of an attenuation of the measured expectation value by a known amplitude, requiring more shots per circuit. The gate count for simulation up to time $t$ is $O(t^2μ^2)$ with $μ$ the $1$-norm of the Hamiltonian, without dependence on the precision desired on the result, providing a significant improvement over previous algorithms. The only dependence in the norm makes it particularly adapted to non-sparse Hamiltonians. The algorithm generalizes to time-dependent Hamiltonians, appearing for example in adiabatic state preparation. These properties make it particularly suitable for present-day relatively noisy hardware that supports only circuits with moderate depth.

quant-ph↗

arXiv2023

Robust Extraction of Thermal Observables from State Sampling and Real-Time Dynamics on Quantum Computers

Simulating properties of quantum materials is one of the most promising applications of quantum computation, both near- and long-term. While real-time dynamics can be straightforwardly implemented, the finite temperature ensemble involves non-unitary operators that render an implementation on a near-term quantum computer extremely challenging. Recently, [Lu, Bañuls and Cirac, PRX Quantum 2, 020321 (2021)] suggested a "time-series quantum Monte Carlo method" which circumvents this problem by extracting finite temperature properties from real-time simulations via Wick's rotation and Monte Carlo sampling of easily preparable states. In this paper, we address the challenges associated with the practical applications of this method, using the two-dimensional transverse field Ising model as a testbed. We demonstrate that estimating Boltzmann weights via Wick's rotation is very sensitive to time-domain truncation and statistical shot noise. To alleviate this problem, we introduce a technique that imposes constraints on the density of states, most notably its non-negativity, and show that this way, we can reliably extract Boltzmann weights from noisy time series. In addition, we show how to reduce the statistical errors of Monte Carlo sampling via a reweighted version of the Wolff cluster algorithm. Our work enables the implementation of the time-series algorithm on present-day quantum computers to study finite temperature properties of many-body quantum systems.

quant-ph↗

arXiv2023

Measuring the Loschmidt amplitude for finite-energy properties of the Fermi-Hubbard model on an ion-trap quantum computer

Calculating the equilibrium properties of condensed matter systems is one of the promising applications of near-term quantum computing. Recently, hybrid quantum-classical time-series algorithms have been proposed to efficiently extract these properties from a measurement of the Loschmidt amplitude $\langle ψ| e^{-i \hat H t}|ψ\rangle$ from initial states $|ψ\rangle$ and a time evolution under the Hamiltonian $\hat H$ up to short times $t$. In this work, we study the operation of this algorithm on a present-day quantum computer. Specifically, we measure the Loschmidt amplitude for the Fermi-Hubbard model on a $16$-site ladder geometry (32 orbitals) on the Quantinuum H2-1 trapped-ion device. We assess the effect of noise on the Loschmidt amplitude and implement algorithm-specific error mitigation techniques. By using a thus-motivated error model, we numerically analyze the influence of noise on the full operation of the quantum-classical algorithm by measuring expectation values of local observables at finite energies. Finally, we estimate the resources needed for scaling up the algorithm.

quant-ph↗

arXiv2023

Topological Order from Measurements and Feed-Forward on a Trapped Ion Quantum Computer

Quantum systems evolve in time in one of two ways: through the Schrödinger equation or wavefunction collapse. So far, deterministic control of quantum many-body systems in the lab has focused on the former, due to the probabilistic nature of measurements. This imposes serious limitations: preparing long-range entangled states, for example, requires extensive circuit depth if restricted to unitary dynamics. In this work, we use mid-circuit measurement and feed-forward to implement deterministic non-unitary dynamics on Quantinuum's H1 programmable ion-trap quantum computer. Enabled by these capabilities, we demonstrate for the first time a constant-depth procedure for creating a toric code ground state in real-time. In addition to reaching high stabilizer fidelities, we create a non-Abelian defect whose presence is confirmed by transmuting anyons via braiding. This work clears the way towards creating complex topological orders in the lab and exploring deterministic non-unitary dynamics via measurement and feed-forward.

quant-ph↗

arXiv2023

Characterization of variational quantum algorithms using free fermions

We study variational quantum algorithms from the perspective of free fermions. By deriving the explicit structure of the associated Lie algebras, we show that the Quantum Approximate Optimization Algorithm (QAOA) on a one-dimensional lattice -- with and without decoupled angles -- is able to prepare all fermionic Gaussian states respecting the symmetries of the circuit. Leveraging these results, we numerically study the interplay between these symmetries and the locality of the target state, and find that an absence of symmetries makes nonlocal states easier to prepare. An efficient classical simulation of Gaussian states, with system sizes up to $80$ and deep circuits, is employed to study the behavior of the circuit when it is overparameterized. In this regime of optimization, we find that the number of iterations to converge to the solution scales linearly with system size. Moreover, we observe that the number of iterations to converge to the solution decreases exponentially with the depth of the circuit, until it saturates at a depth which is quadratic in system size. Finally, we conclude that the improvement in the optimization can be explained in terms of better local linear approximations provided by the gradients.

quant-ph↗

arXiv2023

Experimental demonstration of the advantage of adaptive quantum circuits

Adaptive quantum circuits employ unitary gates assisted by mid-circuit measurement, classical computation on the measurement outcome, and the conditional application of future unitary gates based on the result of the classical computation. In this paper, we experimentally demonstrate that even a noisy adaptive quantum circuit of constant depth can achieve a task that is impossible for any purely unitary quantum circuit of identical depth: the preparation of long-range entangled topological states with high fidelity. We prepare a particular toric code ground state with fidelity of at least $76.9\pm 1.3\%$ using a constant depth ($d=4$) adaptive circuit, and rigorously show that no unitary circuit of the same depth and connectivity could prepare this state with fidelity greater than $50\%$.

quant-ph↗

arXiv2023

Volume-law to area-law entanglement transition in a non-unitary periodic Gaussian circuit

We consider Gaussian quantum circuits that alternate unitary gates and post-selected weak measurements, with spatial translation symmetry and time periodicity. We show analytically that such models can host different kinds of measurement-induced phase transitions detected by entanglement entropy, by mapping the time evolution and weak measurements to Möbius transformations. We demonstrate the existence of a log-law to area-law transition, as well as a volume-law to area-law transition. For the latter, we compute the critical exponent $ν$ for the Hartley, von Neumann and Rényi entropies exactly.

quant-ph↗

arXiv2022

Preentangling Quantum Algorithms -- the Density Matrix Renormalization Group-assisted Quantum Canonical Transformation

We propose the use of parameter-free preentanglers as initial states for quantum algorithms. We apply this idea to the electronic structure problem, combining a quantized version of the Canonical Transformation by Yanai and Chan [J. Chem. Phys. 124, 194106 (2006)] with the Complete Active Space Density Matrix Renormalization Group. This new ansatz allows to shift the computational burden between the quantum and the classical processor. In the vicinity of multi-reference points in the potential energy surfaces of H$_2$O, N$_2$, BeH$_2$ and the P4 system, we find this strategy to require significantly less parameters than corresponding generalized unitary coupled cluster circuits. We propose a new algorithm to prepare Matrix Product States based on the Linear Combination of Unitaries and compare it to the Sequential Unitary Algorithm proposed by Ran in [Phys. Rev. A 101, 032310 (2020)].

quant-ph↗

arXiv2021

Out-of-equilibrium dynamics of the XY spin chain from form factor expansion

We consider the XY spin chain with arbitrary time-dependent magnetic field and anisotropy. We argue that a certain subclass of Gaussian states, called Coherent Ensemble (CE) following [1], provides a natural and unified framework for out-of-equilibrium physics in this model. We show that $all$ correlation functions in the CE can be computed using form factor expansion and expressed in terms of Fredholm determinants. In particular, we present exact out-of-equilibrium expressions in the thermodynamic limit for the previously unknown order parameter one-point function, dynamical two-point function and equal-time three-point function.

cond-mat.stat-mech↗

arXiv2021

Quantum computing critical exponents

We show that the Variational Quantum-Classical Simulation algorithm admits a finite circuit depth scaling collapse when targeting the critical point of the transverse field Ising chain. The order parameter only collapses on one side of the transition due to a slowdown of the quantum algorithm when crossing the phase transition. In order to assess performance of the quantum algorithm and compute correlations in a system of up to 752 qubits, we use techniques from integrability to derive closed-form analytical expressions for expectation values with respect to the output of the quantum circuit. We also reduce a conjecture made by Ho and Hsieh about the exact preparation of the transverse field Ising ground state to a system of equations.

quant-ph↗

arXiv2019

Detecting subsystem symmetry protected topological order via entanglement entropy

Subsystem symmetry protected topological (SSPT) order is a type of quantum order that is protected by symmetries acting on lower-dimensional subsystems of the entire system. In this paper, we show how SSPT order can be characterized and detected by a constant correction to the entanglement area law, similar to the topological entanglement entropy. Focusing on the paradigmatic two-dimensional cluster phase as an example, we use tensor network methods to give an analytic argument that almost all states in the phase exhibit the same correction to the area law, such that this correction may be used to reliably detect the SSPT order of the cluster phase. Based on this idea, we formulate a numerical method that uses tensor networks to extract this correction from ground-state wave functions. We use this method to study the fate of the SSPT order of the cluster state under various external fields and interactions, and find that the correction persists unless a phase transition is crossed, or the subsystem symmetry is explicitly broken. Surprisingly, these results uncover that the SSPT order of the cluster state persists beyond the cluster phase, thanks to a new type of subsystem time-reversal symmetry. Finally, we discuss the correction to the area law found in three-dimensional cluster states on different lattices, indicating rich behavior for general subsystem symmetries

cond-mat.str-el↗