Related papers: Collective neutrino oscillations on a quantum comp…
We present a scalable quantum simulation framework for real-time dynamics of the multi-flavor Gross-Neveu model in 1+1 dimensions. Using superconducting quantum processors at utility scale, we develop a hardware-efficient Trotterization…
Neutrino oscillations can be efficiently simulated on a quantum computer using the Pontecorvo-Maki-Nakagawa-Sakata (PMNS) theory in close analogy to the physical processes realized in experiments. We simulate three-flavor neutrino…
In this paper we provide a framework for combining multiple quantum simulation methods, such as Trotter-Suzuki formulas and QDrift into a single Composite channel that builds upon older coalescing ideas for reducing gate counts. The central…
The time evolution operator plays a crucial role in the precise computation of chemical experiments on quantum computers and holds immense promise for advancing the fields of physical and computer sciences, with applications spanning…
We describe a simple quantum algorithm to simulate time-dependent Hamiltonian, extending the methodology of quantum signal processing. The framework achieves optimal scaling up to some factor with respect to other parameters, and nearly…
Quantum simulation is a foundational application for quantum computers, projected to offer insights into complex quantum systems beyond the reach of classical computation. However, with the exception of Trotter-based methods, which suffer…
In this study, we investigate Trotter evolution in the Gross-Neveu and hyperbolic Ising models in two spacetime dimensions, using quantum computers. We identify different sources of errors prevalent in various quantum processing units and…
One of the key applications for quantum computers will be the simulation of other quantum systems that arise in chemistry, materials science, etc, in order to accelerate the process of discovery. It is important to ask: Can this be achieved…
Quantum harmonic oscillators are central to many modern quantum technologies. We introduce a method to determine the frequency noise spectrum of oscillator modes through coupling them to a qubit with continuously driven…
Hybrid quantum-classical (HQC) algorithms make it possible to use near-term quantum devices supported by classical computational resources by useful control schemes. In this paper, we develop an HQC algorithm using an efficient variational…
Given the Hamiltonian, the evaluation of unitary operators has been at the heart of many quantum algorithms. Motivated by existing deterministic and random methods, we present a hybrid approach, where Hamiltonians with large amplitude are…
With advances in quantum computing, new opportunities arise to tackle challenging calculations in quantum field theory. We show that trotterized time-evolution operators can be related by analytic continuation to the Euclidean transfer…
A critical step in developing circuits for quantum simulation is to synthesize a desired unitary operator using the circuit building blocks. Studying unitaries and their generators from the Lie algebraic perspective has given rise to…
Quantum simulation is a cornerstone application of quantum computing, yet how fundamental quantum resources--entanglement and non-stabilizerness (``magic")--shape simulation fidelity remains an open question. In this work, we establish a…
Universal quantum simulation may provide insights into those many-body systems that cannot be described classically, and that cannot be efficiently simulated with current technology. The Trotter formula, which decomposes a desired unitary…
As a milestone for general-purpose computing machines, we demonstrate that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. Moreover, on noisy devices without error correction, we…
Imaginary-time evolution plays an important role in algorithms for computing ground-state and thermal equilibrium properties of quantum systems, but can be challenging to simulate on classical computers. Many quantum algorithms for…
Path integrals are usually formulated in discrete Euclidean time using the Trotter formula. We propose a new method to study discrete quantum systems, in which we work directly in the Euclidean time continuum. The method is of general…
We analyze the complexity of classically simulating continuous-time dynamics of locally interacting quantum spin systems with a constant rate of entanglement breaking noise. We prove that a polynomial time classical algorithm can be used to…
Two and three flavor oscillating neutrinos are shown to exhibit the properties bipartite and tripartite quantum entanglement. The two and three flavor neutrinos are mapped to qubit states used in quantum information theory. Such quantum…