Related papers: Gluon Digitization via Character Expansion for Qua…
In the fundamental laws of physics, gauge fields mediate the interaction between charged particles. An example is quantum electrodynamics -- the theory of electrons interacting with the electromagnetic field -- based on U(1) gauge symmetry.…
Density matrices evolved according the von Neumann equation are commonly used to simulate the dynamics of driven quantum systems. However, computational methods using density matrices are often too slow to explore the large parameter spaces…
Electrostatically defined quantum dot arrays offer a compelling platform for quantum computation and simulation. However, tuning up such arrays with existing techniques becomes impractical when going beyond a handful of quantum dots. Here,…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
A reliable method for characterizing quantum operations that is suitable for improving and validating their accuracies is indispensable for realizing a practical quantum computer. Known methods are still not sufficient because they lack…
We realize, for the first time, a non-Abelian gauge theory with both gauge and matter fields on a quantum computer. This enables the observation of hadrons and the calculation of their associated masses. The SU(2) gauge group considered…
We numerically analyze the feasibility of a platform-neutral, general strategy to perform quantum simulations of fermionic lattice field theories under open boundary conditions. The digital quantum simulator requires solely one- and…
We present a new truncation scheme for the Schwinger-Dyson equations of QCD that respects gauge invariance at any level of the dressed loop expansion. When applied to the gluon self-energy, it allows for its non-perturbative treatment…
Digital quantum simulation of electron-phonon systems requires truncating infinite phonon levels into $N$ basis states and then encoding them with qubit computational basis. Unary encoding and the more compact binary/Gray encoding are the…
Construction of explicit quantum circuits follows the notion of the "standard circuit model" introduced in the solid and profound analysis of elementary gates providing quantum computation. Nevertheless the model is not always optimal (e.g.…
While spin qubits based on gate-defined quantum dots have demonstrated very favorable properties for quantum computing, one remaining hurdle is the need to tune each of them into a good operating regime by adjusting the voltages applied to…
In quantum computing, the connectivity of qubits placed on two-dimensional chips limits the scalability and functionality of solid-state quantum computers. This paper presents two approaches to constructing complex quantum networks from…
Resource-efficient and high-precision approximate synthesis of quantum circuits expressed in the Clifford+T gate set is vital for Fault-Tolerant quantum computing. Efficient optimal methods are known for single-qubit RZ unitaries, otherwise…
Quantum computing with qudits, an extension of qubits to multiple levels, is a research field less mature than qubit-based quantum computing. However, qudits can offer some advantages over qubits, by representing information with fewer…
We show that a quantum computer operating with a small number of qubits can simulate the dynamical localization of classical chaos in a system described by the quantum sawtooth map model. The dynamics of the system is computed efficiently…
A general scheme is presented for simulating gauge theories, with matter fields, on a digital quantum computer. A Trotterized time-evolution operator that respects gauge symmetry is constructed, and a procedure for obtaining time-separated,…
We develop a scalable architecture for quantum computation using controllable electrons of double-dot molecules coupled to a microwave stripline resonator on a chip, which satisfies all Divincenzo criteria. We analyze the performance and…
We propose an efficient method to numerically simulate the dissipative dynamics of large numbers of quantum emitters in ordered arrays in the presence of long-range dipole-dipole interactions mediated by the vacuum electromagnetic field.…
We present an iterative generalisation of the quantum subspace expansion algorithm used with a Krylov basis. The iterative construction connects a sequence of subspaces via their lowest energy states. Diagonalising a Hamiltonian in a given…
This work proposes double-bracket iterations as a framework for obtaining diagonalizing quantum circuits. Their implementation on a quantum computer consists of interlacing evolutions generated by the input Hamiltonian with diagonal…