Format results
-
Dissipative State Preparation and the Dissipative Quantum Eigensolver
Toby Cubitt - University College London
-
Dissipative Quantum Gibbs Sampling
Daniel Zhang - Phasecraft (United Kingdom)
-
Measurement Quantum Cellular Automata and Anomalies in Floquet Codes
Zhi Li - Perimeter Institute for Theoretical Physics
-
Quantum thermal state preparation
Chi-Fang Chen - California Institute of Technology (Caltech)
-
Discrete holography in dual-unitary circuits
Lluis Masanes - University College London
-
Errors from Dynamical Structural Instabilities of Floquet Maps in Quantum Simulation
Karthik Chinni - Polytechnique Montreal
-
Exponential quantum speedup in simulating coupled classical oscillators
Nathan Wiebe - University of Toronto
-
Universal lower bound on topological entanglement entropy
Isaac Kim - University of California, Davis
-
Local Quantum Codes from Subdivided Manifolds
Elia Portnoy - Massachusetts Institute of Technology (MIT)
-
Beware the (log)logjam: Quantum error mitigation becomes hard at polyloglog(n) depth
Yihui Quek - Massachusetts Institute of Technology (MIT)
-
Classical simulation of short-time quantum dynamics
Alvaro Alhambra - Universidad Autonoma de Madrid
-
Learning to predict arbitrary quantum processes
Hsin-Yuan Huang - California Institute of Technology (Caltech)
-
Dissipative State Preparation and the Dissipative Quantum Eigensolver
Toby Cubitt - University College London
Finding ground states of quantum many-body systems is one of the most important---and one of the most notoriously difficult---problems in physics, both in scientific research and in practical applications. Indeed, we know from a complexity-theoretic perspective that all methods (quantum or classical… -
Dissipative Quantum Gibbs Sampling
Daniel Zhang - Phasecraft (United Kingdom)
Systems in thermal equilibrium at non-zero temperature are described by their Gibbs state. For classical many-body systems, the Metropolis-Hastings algorithm gives a Markov process with a local update rule that samples from the Gibbs distribution. For quantum systems, sampling from the Gibbs state… -
Measurement Quantum Cellular Automata and Anomalies in Floquet Codes
Zhi Li - Perimeter Institute for Theoretical Physics
We investigate the evolution of quantum information under Pauli measurement circuits. We focus on the case of one- and two-dimensional systems, which are relevant to the recently introduced Floquet topological codes. We define local reversibility in context of measurement circuits, which allows us… -
Quantum thermal state preparation
Chi-Fang Chen - California Institute of Technology (Caltech)
A key subroutine in quantum computing, especially in quantum simulation, is to prepare thermal states or ground states of Hamiltonians. Today, I will talk about a new family of quantum algorithms for this task. Physically, our algorithms distill the essence of system-bath interaction by simulating… -
Discrete holography in dual-unitary circuits
Lluis Masanes - University College London
I will introduce a family of dual-unitary circuits in 1+1 dimensions which are invariant under the joint action of Lorentz and scale transformations. With the same dual unitaries I will construct tensor-network states for this 1+1 model and interpret them as spatial slices of curved 2+1 discrete… -
Errors from Dynamical Structural Instabilities of Floquet Maps in Quantum Simulation
Karthik Chinni - Polytechnique Montreal
We study the behavior of errors in the quantum simulation of spin systems with long-range multibody interactions resulting from the Trotter-Suzuki decomposition of the time evolution operator. We identify a regime where the Floquet operator underlying the Trotter decomposition undergoes sharp… -
Exponential quantum speedup in simulating coupled classical oscillators
Nathan Wiebe - University of Toronto
We present a quantum algorithm for simulating the classical dynamics of 2^n coupled oscillators (e.g., masses coupled by springs). Our approach leverages a mapping between the Schrodinger equation and Newton's equations for harmonic potentials such that the amplitudes of the evolved quantum state… -
Universal lower bound on topological entanglement entropy
Isaac Kim - University of California, Davis
Entanglement entropies of two-dimensional gapped ground states are expected to satisfy an area law, with a constant correction term known as the topological entanglement entropy (TEE). In many models, the TEE takes a universal value that characterizes the underlying topological phase. However, the… -
Local Quantum Codes from Subdivided Manifolds
Elia Portnoy - Massachusetts Institute of Technology (MIT)
For n≥3, we demonstrate the existence of quantum codes which are local in dimension n with V qubits, distance V^{(n−1)/n}, and dimension V^{(n−2)/n}, up to a polylog(V) factor. The distance is optimal up to the polylog factor. The dimension is also optimal for this distance up to the polylog factor… -
Beware the (log)logjam: Quantum error mitigation becomes hard at polyloglog(n) depth
Yihui Quek - Massachusetts Institute of Technology (MIT)
Quantum error mitigation has been proposed as a means to combat unwanted and unavoidable errors in near-term quantum computing using no or few additional quantum resources, in contrast to fault-tolerant schemes that come along with heavy overheads. Error mitigation has been successfully applied to… -
Classical simulation of short-time quantum dynamics
Alvaro Alhambra - Universidad Autonoma de Madrid
Recent progress in the development of quantum technologies has enabled the direct investigation of dynamics of increasingly complex quantum many-body systems. This motivates the study of the complexity of classical algorithms for this problem in order to benchmark quantum simulators and to delineate… -
Learning to predict arbitrary quantum processes
Hsin-Yuan Huang - California Institute of Technology (Caltech)
We present an efficient machine learning (ML) algorithm for predicting any unknown quantum process over n qubits. For a wide range of distributions D on arbitrary n-qubit states, we show that this ML algorithm can learn to predict any local property of the output from the unknown process, with a…