Related papers: Simulating scalar field theories on quantum comput…
Quantum computers, with parallel computing and entanglement effects, excel in cryptography analysis and big data processing. However, they are not fully developed yet, and their performance needs further evaluation. Traditional computer…
Rapid developments of quantum information technology show promising opportunities for simulating quantum field theory in near-term quantum devices. In this work, we formulate the theory of (time-dependent) variational quantum simulation of…
The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian…
Quantum adiabatic algorithm is of vital importance in quantum computation field. It offers us an alternative approach to manipulate the system instead of quantum gate model. Recently, an interesting work arXiv:1805.10549 indicated that we…
In noisy quantum systems, achieving high-fidelity state preparation using the adiabatic approach faces a dilemma: either extending the evolution time to reduce diabatic transitions or shortening it to mitigate decoherence effects. Here, we…
Initializing a single site of a lattice scalar field theory into an arbitrary state with support throughout the quantum register requires ${\cal O}(2^{n_Q})$ entangling gates on a quantum computer with $n_Q$ qubits per site. It is…
Quantum state preparation lies at the heart of quantum computation and quantum simulations, enabling the investigation of complex manybody systems across physics, chemistry, and data science. While existing methods such as Variational…
Maintaining local interactions in the quantum simulation of gauge field theories relegates most states in the Hilbert space to be unphysical -- theoretically benign, but experimentally difficult to avoid. Reformulations of the gauge fields…
Studying phase transitions in interacting quantum field theories generally requires the numerical study of the dynamical system on an N-dimensional lattice, which is, in most cases, computationally quite the challenging task even with…
State selective field ionization detection techniques in physics require a specific progression through a complicated atomic state space to optimize state selectivity and overall efficiency. For large principle quantum number n, the…
Simulations of collisions of fundamental particles on a quantum computer are expected to have an exponential advantage over classical methods and promise to enhance searches for new physics. Furthermore, scattering in scalar field theory…
The accurate computation of Hamiltonian ground, excited, and thermal states on quantum computers stands to impact many problems in the physical and computer sciences, from quantum simulation to machine learning. Given the challenges posed…
The adiabatic theorem refers to a setup where an evolution equation contains a time-dependent parameter whose change is very slow, measured by a vanishing parameter $\epsilon$. Under suitable assumptions the solution of the…
We propose a strategy for modeling the behavior of an adiabatic quantum computer described by an Ising Hamiltonian with $N$ sites and the coordination number $Z$. The method is based on the $1/Z$ expansion for the density matrix of the…
Hybrid classical-quantum algorithms aim at variationally solving optimisation problems, using a feedback loop between a classical computer and a quantum co-processor, while benefitting from quantum resources. Here we present experiments…
Simulating real-time dynamics of gauge theories represents a paradigmatic use case to test the hardware capabilities of a quantum computer, since it can involve non-trivial input states preparation, discretized time evolution, long-distance…
A key goal of digital quantum computing is the simulation of fermionic systems such as molecules or the Hubbard model. Unfortunately, for present and near-future quantum computers the use of quantum error correction schemes is still out of…
Analog models of quantum information processing, such as adiabatic quantum computation and analog quantum simulation, require the ability to subject a system to precisely specified Hamiltonians. Unfortunately, the hardware used to implement…
One of the critical challenges solid-state quantum processors face is the presence of fabrication imperfections and two-level systems, which render certain qubits and gates either inoperable or much noisier than tolerable by quantum error…
A new quantum algorithm is proposed to solve Satisfiability(SAT) problems by taking advantage of non-unitary transformation in ground state quantum computer. The energy gap scale of the ground state quantum computer is analyzed for 3-bit…