相关论文: Classical simulation of noninteracting-fermion qua…

Quantum theory has the intriguing feature that is inconsistent with noncontextual hidden variable models, for which the outcome of a measurement does not depend on which other compatible measurements are being performed concurrently. While…

Simple constructions and protocols are demonstrated to allow the implementation of universal quantum computation on an arbitrarily large quantum system by controlling a fixed number of spins, vastly reducing the engineering requirements in…

We implement in systems of fermions the formalism of pseudoclassical paths that we recently developed for systems of bosons and show that quantum states of fermionic fields can be described, in the Heisenberg picture, as linear combinations…

Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…

The partition function for a system of non-interacting $N-$particles can be found by summing over all the states of the system. The classical partition function for an ideal gas differs from Bosonic or Fermionic partition function in the…

Simulating out-of-equilibrium dynamics of quantum field theories in nature is challenging with classical methods, but is a promising application for quantum computers. Unfortunately, simulating interacting bosonic fields involves a high…

In recent years, analog quantum simulators have reached unprecedented quality, both in qubit numbers and coherence times. Most of these simulators natively implement Ising-type Hamiltonians, which limits the class of models that can be…

In this work, we have studied classical and quantum systems in interaction by means of geometric reduction procedure. The main target is the description in these terms of fundamental interactions. We have shown that, to describe in a…

Magic states are essential for universal quantum computation and are widely viewed as a key source of quantum advantage, yet in realistic devices they are inevitably noisy. In this work, we characterize how noise on injected magic resources…

A sequence of controlled collisions between a quantum system and its environment (composed of a set of quantum objects) naturally simulates (with arbitrary precision) any Markovian quantum dynamics of the system under consideration. In this…

We propose an implementation of quantum logic gates via virtual vibrational excitations in an ion trap quantum computer. Transition paths involving unpopulated, vibrational states interfere destructively to eliminate the dependence of rates…

Interactions between particles are usually a resource for quantum computing, making quantum many-body systems intractable by any known classical algorithm. In contrast, noise is typically considered as being inimical to quantum many-body…

A number of elegant approaches have been developed for the identification of quantum circuits which can be efficiently simulated on a classical computer. Recently, these methods have been employed to demonstrate the classical simulability…

Universal quantum computation requires the implementation of arbitrary control operations on the quantum register. In most cases, this is achieved by external control fields acting selectively on each qubit to drive single-qubit operations.…

The Fermi-Hubbard model, a fundamental framework for studying strongly correlated phenomena could significantly benefit from quantum simulations when exploring non-trivial settings. However, simulating this problem requires twice as many…

While much of the current study on quantum computation employs low-level formalisms such as quantum circuits, several high-level languages/calculi have been recently proposed aiming at structured quantum programming. The current work…

Algorithms are described for efficiently simulating quantum mechanical systems on quantum computers. A class of algorithms for simulating the Schrodinger equation for interacting many-body systems are presented in some detail. These…

Simulating quantum algorithms with classical resources generally requires exponential resources. However, heuristic classical approaches are often very efficient in approximately simulating special circuit structures, for example with…

This work proposes a digital quantum simulation protocol for the linear scattering process of bosons, which provides a simple extension to partially distinguishable boson cases. Our protocol is achieved by combining the boson-fermion…

Qubits are neither fermions nor bosons. A Fock space description of qubits leads to a mapping from qubits to parafermions: particles with a hybrid boson-fermion quantum statistics. We study this mapping in detail, and use it to provide a…