相关论文: Type-II Quantum Algorithms

A general class of discrete unitary models are described whose behavior in the continuum limit corresponds to a many-body Schrodinger equation. On a quantum computer, these models could be used to simulate quantum many-body systems with an…

Transport phenomena still stand as one of the most challenging problems in computational physics. By exploiting the analogies between Dirac and lattice Boltzmann equations, we develop a quantum simulator based on pseudospin-boson quantum…

In recent years, quantum Boltzmann methods have gained more and more interest as they might provide a viable path towards solving fluid dynamics problems on quantum computers once this emerging compute technology has matured and…

While the treatment of chemically relevant systems containing hundreds or even thousands of electrons remains beyond the reach of quantum devices, the development of quantum-classical hybrid algorithms to resolve electronic correlation…

Quantum gas systems are ideal analog quantum simulation platforms for tackling some of the most challenging problems in strongly correlated quantum matter. However, they also expose the urgent need for new theoretical frameworks. Simple…

Quantum computing is a game-changing technology for global academia, research centers and industries including computational science, mathematics, finance, pharmaceutical, materials science, chemistry and cryptography. Although it has seen…

State-of-the-art noisy intermediate-scale quantum devices (NISQ), although imperfect, enable computational tasks that are manifestly beyond the capabilities of modern classical supercomputers. However, present quantum computations are…

Although the Hamiltonian formalism is so far favored for quantum computation of lattice gauge theory, the path integral formalism would never be useless. The advantages of the path integral formalism are the knowledge and experience…

Quantum many-body systems exhibit an extremely diverse range of phases and physical phenomena. Here, we prove that the entire physics of any other quantum many-body system is replicated in certain simple, "universal" spin-lattice models. We…

This work proposes a multi-circuit quantum lattice Boltzmann method (QLBM) algorithm that leverages parallel quantum computing to reduce quantum resource requirements. Computational fluid dynamics (CFD) simulations often entail a large…

Quantum computing using two-dimensional NMR has recently been described using scalar coupling evolution technique [J. Chem. Phys.,109,10603 (1998)]. In the present paper, we describe two-dimensional NMR quantum computing with the help of…

A novel quantum algorithm for solving the Boltzmann-Maxwell equations of the 6D collisionless plasma is proposed. The equation describes the kinetic behavior of plasma particles in electromagnetic fields and is known for the classical…

In recent years, quantum computing has drawn significant interest within the field of high-energy physics. We explore the potential of quantum algorithms to resolve the combinatorial problems in particle physics experiments. As a concrete…

Particle-style token machines are a way to interpret proofs and programs, when the latter are defined according to the principles of linear logic. In this paper, we show that token machines also make sense when the programs at hand are…

The success of quantum physics in description of various physical interaction phenomena relies primarily on the accuracy of analytical methods used. In quantum mechanics, many of such interactions such as those found in quantum…

Quantum machine learning aims to release the prowess of quantum computing to improve machine learning methods. By combining quantum computing methods with classical neural network techniques we aim to foster an increase of performance in…

Starting from the Pauli Hamiltonian operator, we derive a scalar quantum kinetic equations for spin-1/2 systems. Here the regular Wigner two-state matrix is replaced by a scalar distribution function in extended phase space. Apart from…

Can near-term gate model based quantum processors offer quantum advantage for practical applications in the pre-fault tolerance noise regime? A class of algorithms which have shown some promise in this regard are the so-called…

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…

Quantum computing promises the possibility of studying the real-time dynamics of nonperturbative quantum field theories while avoiding the sign problem that obstructs conventional lattice approaches. Current and near-future quantum devices…