Related papers: Measuring Trotter error and its application to pre…
Quantum computers can efficiently simulate highly entangled quantum systems, offering a solution to challenges facing classical simulation of Quantum Field Theories (QFTs). This paper presents an alternative to traditional methods for…
Quantum simulation of dynamics is an important goal in the NISQ era, within which quantum error mitigation may be a viable path towards modifying or eliminating the effects of noise. Most studies on quantum error mitigation have been…
The Fermi-Hubbard model (FHM) is a simple yet rich model of strongly interacting electrons with complex dynamics and a variety of emerging quantum phases. These properties make it a compelling target for digital quantum simulation.…
Convergence of path integral simulations requires a substantial number of beads when quantum effects are significant. Traditional Trotter scaling approaches estimate the continuum limit through extrapolation, however they are restricted to…
The problem of simulating the thermal behavior of quantum systems remains a central open challenge in quantum computing. Unlike well-established quantum algorithms for unitary dynamics, \emph{provably efficient} algorithms for preparing…
Large-scale classical simulation of quantum computers is crucial for benchmarking quantum algorithms, establishing boundaries of quantum advantage and exploring heuristic quantum algorithms. We present a full-state vector simulation…
We consider the dynamics $t\mapsto\tau_t$ of an infinite quantum lattice system that is generated by a local interaction. If the interaction decomposes into a finite number of terms that are themselves local interactions, we show that…
Variational algorithms may enable classically intractable simulations on near-future quantum computers. However, their potential is limited by hardware errors. It is therefore crucial to develop efficient ways to mitigate these errors.…
Because of their long coherence time and compatibility with industrial foundry processes, electron spin qubits are a promising platform for scalable quantum processors. A full-fledged quantum computer will need quantum error correction,…
We study the efficiency of algorithms simulating a system evolving with Hamiltonian $H=\sum_{j=1}^m H_j$. We consider high order splitting methods that play a key role in quantum Hamiltonian simulation. We obtain upper bounds on the number…
Measurements on near-term quantum processors are inevitably subject to hardware imperfections that lead to readout errors. Mitigation of such unavoidable errors is crucial to better explore and extend the power of near-term quantum…
The Lie--Trotter product formula is a foundational approximation for the quantum partition function, yet obtaining rigorous error bounds for the unbounded Hamiltonians common in physics remains a significant challenge. This paper provides a…
Quantum simulation has shown great potential in many fields due to its powerful computational capabilities. However, the limited fidelity can lead to a severe limitation on the number of gate operations, which requires us to find optimized…
We describe methods to construct digital quantum simulation algorithms for quantum spin systems on a regular lattice with local interactions. In addition to tools such as the Trotter-Suzuki expansion and graph coloring, we also discuss the…
Quantum Hamiltonian identification is important for characterizing the dynamics of quantum systems, calibrating quantum devices and achieving precise quantum control. In this paper, an effective two-step optimization (TSO) quantum…
Hamiltonian simulations are key subroutines in adiabatic quantum computation, quantum control, and quantum many-body physics, where quantum dynamics often happen in the low-energy sector. In contrast to time-independent Hamiltonian…
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…
Large-scale quantum computation will only be achieved if experimentally implementable quantum error correction procedures are devised that can tolerate experimentally achievable error rates. We describe a quantum error correction procedure…
Hamiltonian simulation is known to be one of the fundamental building blocks of a variety of quantum algorithms such as its most immediate application, that of simulating many-body systems to extract their physical properties. In this work,…
Suzuki-Trotter decomposition is a well-known technique used to calculate the partition function of quantum spin systems, in which the imaginary-time dependence of the partition function occurs inevitably. Since it is very difficult to…