Related papers: Dual Field Theories of Quantum Computation
Investigation of strongly interacting, nonlinear quantum field theories (QFT-s) remains one of the outstanding challenges of modern physics. Here, we describe analog quantum simulators for nonlinear QFT-s using mesoscopic superconducting…
We argue that the model of a quantum computer with N qubits on a quantum space background, which is a fuzzy sphere with n=2^N elementary cells, can be viewed as the minimal model for Quantum Gravity. In fact, it is discrete, has no free…
The quantum simulation of fermionic gauge field theories is one of the anticipated uses of quantum computers in the NISQ era. Recently work has been done to simulate properties of the fermionic Z2 gauge field theory in (1+1) D and the pure…
We propose a method for implementation of an universal set of one- and two-quantum-bit gates for quantum computation in the system of two coupled electrons with constant non-diagonal exchange interaction. Suppression of the exchange…
The quantum link~\cite{Brower:1997ha} Hamiltonian was introduced two decades ago as an alternative to Wilson's Euclidean lattice QCD with gauge fields represented by bi-linear fermion/anti-fermion operators. When generalized this new…
Motivated by recent studies of holographic complexity, we examine the question of circuit complexity in quantum field theory. We provide a quantum circuit model for the preparation of Gaussian states, in particular the ground state, in a…
Analog quantum simulation has the potential to be an indispensable technique in the investigation of complex quantum systems. In this work, we numerically investigate a one-dimensional, faithful, analog, quantum electronic circuit simulator…
The current noisy intermediate-scale quantum (NISQ) era is characterized by substantial errors and noise, which limit the practical feasibility of deep, many-qubit circuits. To address these constraints, quantum circuit cutting has emerged…
One-way quantum computing achieves the full power of quantum computation by performing single particle measurements on some many-body entangled state, known as the resource state. As single particle measurements are relatively easy to…
A new approach in the quantum theory of few-electron nanoelectronic devices -- the S-matrix approach -- is presented in a simple example: a single-electron transistor consisting of a single-level quantum dot connected with two metallic…
A promising approach to solving hard binary optimisation problems is quantum adiabatic annealing (QA) in a transverse magnetic field. An instantaneous ground state --- initially a symmetric superposition of all possible assignments of $N$…
We study theoretically a double quantum dot hydrogen molecule in the GaAs conduction band as the basic elementary gate for a quantum computer with the electron spins in the dots serving as qubits. Such a two-dot system provides the…
The qubit routing problem, also known as the swap minimization problem, is a (classical) combinatorial optimization problem that arises in the design of compilers of quantum programs. We study the qubit routing problem from the viewpoint of…
We propose an implementation of a two-dimensional $\mathbb{Z}_2$ lattice gauge theory model on a shallow quantum circuit, involving a number of single and two-qubits gates comparable to what can be achieved with present-day and near-future…
On a two-level quantum system driven by an external field, we consider the population transfer problem from the first to the second level, minimizing the time of transfer, with bounded field amplitude. On the Bloch sphere (i.e. after a…
Given an undirected, weighted graph, with $n$ vertices and $m$ edges, and two special vertices $s$ and $t$, the problem is to find the shortest path between them. We give two bounded-error quantum algorithms with improved runtime in the…
Recently, quantum simulation of low-dimensional lattice gauge theories (LGTs) has attracted many interests, which may improve our understanding of strongly correlated quantum many-body systems. Here, we propose an implementation to…
Quantum computation represents an emerging framework to solve lattice gauge theories (LGT) with arbitrary gauge groups, a general and long-standing problem in computational physics. While quantum computers may encode LGT using only…
Using the coherent state functional integral expression of the partition function, we show that the sine-Gordon model on an analogue curved spacetime arises as the effective quantum field theory for phase fluctuations of a weakly imperfect…
To date, all proposed quantum algorithms for simulating quantum field theory (QFT) simulate (continuous-time) Hamiltonian lattice QFT as a stepping stone. Two overlooked issues are how large we can take the timestep in these simulations…