相关论文: Polynomial-Time Simulation of Pairing Models on a …
We present a quantum-classical hybrid algorithm that simulates electronic structures of periodic systems such as ground states and quasiparticle band structures. By extending the unitary coupled cluster (UCC) theory to describe crystals in…
We investigate the sample complexity of Hamiltonian simulation: how many copies of an unknown quantum state are required to simulate a Hamiltonian encoded by the density matrix of that state? We show that the procedure proposed by Lloyd,…
The one-dimensional Ising model with its connections to several physical concepts plays a vital role in comprehension of several principles, phenomena and numerical methods. The Hamiltonian of a coupled one-dimensional dissipative spin…
One of the most promising applications of noisy intermediate-scale quantum computers is the simulation of molecular Hamiltonians using the variational quantum eigensolver. We show that encoding symmetries of the simulated Hamiltonian in the…
Quantum nanosystems involve the coupled dynamics of fermions or bosons across multiple scales in space and time. Examples include quantum dots, superconducting or magnetic nanoparticles, molecular wires, and graphene nanoribbons. The number…
We present a method to experimentally realize large-scale permutation-symmetric Hamiltonians for continuous-time quantum protocols such as quantum walk and adiabatic quantum computation. In particular, the method can be used to perform an…
We present a quantum algorithm for the simulation of molecular systems that is asymptotically more efficient than all previous algorithms in the literature in terms of the main problem parameters. As in previous work [Babbush et al., New…
The motivation for studying non-Hermitian systems and the role of $\mathcal{PT}$-symmetry is discussed. We investigate the use of a quantum algorithm to find the eigenvalues and eigenvectors of non-Hermitian Hamiltonians, with applications…
By using the properties of orthogonal polynomials, we present an exact unitary transformation that maps the Hamiltonian of a quantum system coupled linearly to a continuum of bosonic or fermionic modes to a Hamiltonian that describes a…
Simulation of quantum systems is expected to be one of the most important applications of quantum computing, with much of the theoretical work so far having focused on fermionic and spin-$\frac{1}{2}$ systems. Here, we instead consider…
Neural network approaches to approximate the ground state of quantum hamiltonians require the numerical solution of a highly nonlinear optimization problem. We introduce a statistical learning approach that makes the optimization trivial by…
We report ab initio calculations of the S wave pairing gap in neutron matter calculated using realistic nuclear Hamiltonians that include two- and three-body interactions. We use a trial state, properly optimized to capture the essential…
With a view toward addressing the explosive growth in the computational demands of nuclear structure and reactions modeling, we develop a novel quantum algorithm for neutron-nucleus simulations with general potentials, which provides…
Combinatorial optimization is of general interest for both theoretical study and real-world applications. Fast-developing quantum algorithms provide a different perspective on solving combinatorial optimization problems. In this paper, we…
We propose a method for simulating the behaviour of small clusters of particles that explicitly accounts for all mean-field and binary-correlation effects. Our approach leads to a set of variational equations that can be used to study both…
We present an efficient quantum algorithm for beyond-Born-Oppenheimer molecular energy computations. Our approach combines the quantum full configuration interaction method with the nuclear orbital plus molecular orbital (NOMO) method. We…
Today's quantum computers are comprised of tens of qubits interacting with each other and the environment in increasingly complex networks. In order to achieve the best possible performance when operating such systems, it is necessary to…
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…
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…
Many-body entangled systems, in particular topologically ordered spin systems proposed as resources for quantum information processing tasks, often involve highly non-local interaction terms. While one may approximate such systems through…