Related papers: Efficient Simulation of Pre-Born-Oppenheimer Dynam…
We present a quantum algorithm for the dynamical simulation of time-dependent Hamiltonians. Our method involves expanding the interaction-picture Hamiltonian as a sum of generalized permutations, which leads to an integral-free Dyson series…
Long ranged electrostatic interactions are time consuming to calculate in molecular dynamics and Monte-Carlo simulations. We introduce an algorithmic framework for simulating charged particles which modifies the dynamics so as to allow…
The quantum circuit model is the de-facto way of designing quantum algorithms. Yet any level of abstraction away from the underlying hardware incurs overhead. In the era of near-term, noisy, intermediate-scale quantum (NISQ) hardware with…
We address the effects of natural three-qubit interactions on the computational power of one-way quantum computation (\QC). A benefit of using more sophisticated entanglement structures is the ability to construct compact and economic…
We consider simulating the BCS Hamiltonian, a model of low temperature superconductivity, on a quantum computer. In particular we consider conducting the simulation on the qubus quantum computer, which uses a continuous variable ancilla to…
In this paper we develop a quantum algorithm to realize finite temperature simulation on a quantum computer. As quantum computers use real-time evolution we did not use the imaginary time methods popular on classical algorithms. Instead, we…
Efficient simulation of quantum circuits has become indispensable with the rapid development of quantum hardware. The primary simulation methods are based on state vectors and tensor networks. As the number of qubits and quantum gates grows…
The simulation of quantum dynamics calls for quantum algorithms working in first quantized grid encodings. Here, we propose a variational quantum algorithm for performing quantum dynamics in first quantization. In addition to the usual…
Electronic structure simulation is an anticipated application for quantum computers. Due to high-dimensional quantum entanglement in strongly correlated systems, the quantum resources required to perform such simulations are far beyond the…
Quantum simulation algorithms often require numerous ancilla qubits and deep circuits, prohibitive for near-term hardware. We introduce a framework for simulating quantum channels using ensembles of low-depth circuits in place of many-qubit…
Constructing appropriate unitary matrix operators for new quantum algorithms and finding the minimum cost gate sequences for the implementation of these unitary operators is of fundamental importance in the field of quantum information and…
Simulating the time evolution of a physical system at quantum mechanical levels of detail -- known as Hamiltonian Simulation (HS) -- is an important and interesting problem across physics and chemistry. For this task, algorithms that run on…
Quasi-2D Coulomb systems are of fundamental importance and have attracted much attention in many areas nowadays. Their reduced symmetry gives rise to interesting collective behaviors, but also brings great challenges for particle-based…
Numerical simulation of turbulent fluid dynamics needs to either parameterize turbulence-which introduces large uncertainties-or explicitly resolve the smallest scales-which is prohibitively expensive. Here we provide evidence through…
Relativistic spin effects drive subtle molecular phenomena ranging from intersystem crossing in photodynamic therapy to spin-mediated catalysis and high-resolution spectroscopy. These effects are described by the Pauli-Breit Hamiltonian,…
Quantum simulators have made a remarkable progress towards exploring the dynamics of many-body systems, many of which offer a formidable challenge to both theoretical and numerical methods. While state-of-the-art quantum simulators are in…
Quantum computers can efficiently simulate Lindbladian dynamics, enabling powerful applications in open system simulation, thermal and ground-state preparation, autonomous quantum error correction, dissipative engineering, and more. Despite…
We propose an iterative algorithm to simulate the dynamics generated by any $n$-qubit Hamiltonian. The simulation entails decomposing the unitary time evolution operator $U$ (unitary) into a product of different time-step unitaries. The…
With the continuous growth of processing power for scientific computing, first principles Born-Oppenheimer molecular dynamics (MD) simulations are becoming increasingly popular for the study of a wide range of problems in materials science,…
Digital-analog quantum computation aims to reduce the currently infeasible resource requirements needed for near-term quantum information processing by replacing sequences of one- and two-qubit gates with a unitary transformation generated…