Related papers: Efficient numerical simulation of complex Josephso…
Based on recently introduced efficient quantum state tomography schemes, we propose a scalable method for the tomography of unitary processes and the reconstruction of one-dimensional local Hamiltonians. As opposed to the exponential…
As quantum computers of non-trivial size become available in the near future, it is imperative to develop tools to emulate small quantum computers. This allows for validation and debugging of algorithms as well as exploring…
This study introduces a method for simulating quantum systems using electrical networks. Our approach leverages a generalized similarity transformation, which connects different Hamiltonians, enabling well-defined paths for quantum system…
We introduce a generalizable framework for learning to identify effective Hamiltonians directly from experimental data in solid-state quantum systems. Our approach is based on a physics-informed neural network architecture that embeds…
Simulating quantum mechanics is known to be a difficult computational problem, especially when dealing with large systems. However, this difficulty may be overcome by using some controllable quantum system to study another less controllable…
The quantum simulation of real molecules and materials is one of the most highly anticipated applications of quantum computing. Algorithms for simulating electronic structure using a first-quantized plane wave representation are especially…
Ionic pseudopotentials are widely used in classical simulations of materials to model the effective potential due to the nucleus and the core electrons. Modeling fewer electrons explicitly results in a reduction in the number of plane waves…
In this work, we present a new diagrammatic method for computing the effective Hamiltonian of driven nonlinear oscillators. At the heart of our method is a self-consistent perturbation expansion developed in phase space, which establishes a…
In this short review we describe the process of designing a superconducting circuit device for quantum information applications. We discuss the factors that must be considered to implement a desired effective Hamiltonian on a device. We…
By coupling pairs of superconducting qubits through a small Josephson junction with a time-dependent flux bias, we show that arbitrary interactions involving any combination of Pauli matrices can be generated with a small number of drive…
Product formulas can be used to simulate Hamiltonian dynamics on a quantum computer by approximating the exponential of a sum of operators by a product of exponentials of the individual summands. This approach is both straightforward and…
We present a general approach for analyzing arbitrary parametric processes in Josephson circuits within a single degree of freedom approximation. Introducing a systematic normal-ordered expansion for the Hamiltonian of parametrically driven…
In this book chapter, we provide a tutorial introduction to one-way quantum computation and many of the techniques one can use to understand it. The techniques which are described include the stabilizer formalism and the logical Heisenberg…
The efficient simulation of complex quantum systems remains a central challenge due to the exponential growth of Hilbert space with system size. Tensor network methods have long been established as powerful approximation schemes, and their…
Hamiltonian simulation on quantum computers is strongly constrained by gate counts, motivating techniques to reduce circuit depths. While tensor networks are natural competitors to quantum computers, we instead leverage them to support…
Simulation of quantum systems is notoriously challenging for classical computers, while quantum hardware is naturally well-suited for this task. However, the imperfections of contemporary quantum systems poses a considerable challenge in…
We describe methods for simulating general second-quantized Hamiltonians using the compact encoding, in which qubit states encode only the occupied modes in physical occupation number basis states. These methods apply to second-quantized…
We investigate the quantum algorithm of Babbush et al. (arXiv:2303.13012v3) for simulating coupled harmonic oscillators, which promises exponential speedups over classical methods. Focusing on linearly connected oscillator chains, we bridge…
Quantum computing has potential to provide exponential speedups over classical computing for many important applications. However, today's quantum computers are in their early stages, and hardware quality issues hinder the scale of program…
Conventional methods of quantum simulation involve trade-offs that limit their applicability to specific contexts where their use is optimal. In particular, the interaction picture simulation has been found to provide substantial asymptotic…