Related papers: Universal Computation with Quantum Fields
Quantum computing has been a fascinating research field in quantum physics. Recent progresses motivate us to study in depth the universal quantum computing models (UQCM), which lie at the foundation of quantum computing and have tight…
We study quantum mechanics in the stochastic formulation, using the functional integral approach. The noise term enters the classical action as a local contribution of anticommuting fields. The partition function is not invariant under…
A quantum simulator is a device engineered to reproduce the properties of an ideal quantum model. It allows the study of quantum systems that cannot be efficiently simulated on classical computers. While a universal quantum computer is also…
We propose a method to study dynamical response of a quantum system by evolving it with an imaginary-time dependent Hamiltonian. The leading non-adiabatic response of the system driven to a quantum-critical point is universal and…
We describe a generalization of the cluster-state model of quantum computation to continuous-variable systems, along with a proposal for an optical implementation using squeezed-light sources, linear optics, and homodyne detection. For…
We show how it is possible to realize quantum computations on a system in which most of the parameters are practically unknown. We illustrate our results with a novel implementation of a quantum computer by means of bosonic atoms in an…
A new model of quantum computing has recently been proposed which, in analogy with a classical lambda-calculus, exploits quantum processes which operate on other quantum processes. One such quantum meta-operator takes N unitary…
The ad-hoc imposition of normal ordering on the Lagrangian, energy-momentum tensor and currents is a standard tool in quantum field theory (QFT) to eliminate infinite vacuum expectation values (v.e.v.) However, for fermionic expressions…
We show that an n-th root of the Walsh-Hadamard transform (obtained from the Hadamard gate and a cyclic permutation of the qubits), together with two diagonal matrices, namely a local qubit-flip (for a fixed but arbitrary qubit) and a…
We show that a class of quantum computations that was recently shown to be efficiently simulatable on a classical computer by Valiant corresponds to a physical model of noninteracting fermions in one dimension. We give an alternative proof…
Systems of spin 1, such as triplet pairs of spin-1/2 fermions (like orthohydrogen nuclei) make useful three-terminal elements for quantum computation, and when interconnected by qubit equality relations are universal for quantum…
Majorana-based quantum gates are not complete for performing universal topological quantum computation while Fibonacci-based gates are difficult to be realized electronically and hardly coincide with the conventional quantum circuit models.…
A potential approach for demonstrating quantum advantage is using quantum computers to simulate fermionic systems. Quantum algorithms for fermionic system simulation usually involve the Hamiltonian evolution and measurements. However, in…
We study a quantum phase transition from a massless to massive Dirac fermion phase in a new two-dimensional bipartite lattice model of electrons that is amenable to sign-free quantum Monte Carlo simulations. Importantly, interactions in our…
Identical quantum particles exhibit only two types of statistics: bosonic and fermionic. Theoretically, this restriction is commonly established through the symmetrization postulate or (anti)commutation constraints imposed on the algebra of…
Majorana-fermionic quantum computation (MFQC) was proposed by Bravyi and Kitaev (See Ref.\cite{Kitaev}), in which a fault-torrent (non-topological) quantum computer built from Majorana fermions may be more efficient than that built from…
Quantum computers can efficiently solve problems which are widely believed to lie beyond the reach of classical computers. In the near-term, hybrid quantum-classical algorithms, which efficiently embed quantum hardware in classical…
Because Majorana zero modes store quantum information non-locally, they are protected from noise, and have been proposed as a building block for a quantum computer. We show how to use the same protection from noise to implement universal…
Coherent quantum control over many-particle quantum systems requires high fidelity dynamics. One way of achieving this is to use adiabatic schemes where the system follows an instantaneous eigenstate of the Hamiltonian over timescales that…
We study the time evolution of a conformal field theory deformed by a relevant operator under a smooth but fast quantum quench which brings it to the conformal point. We argue that when the quench time scale $\delta t$ is small compared to…