Related papers: Primitive Quantum Gates for an SU(2) Discrete Subg…
We consider simulating an $n$-qubit Hamiltonian with nearest-neighbor interactions evolving for time $t$ on a quantum computer. We show that this simulation has gate complexity $(nt)^{1+o(1)}$ using product formulas, a straightforward…
Local implementation of non-local quantum gates is necessary in a distributed quantum computer. Here, we demonstrate the non-local implementation of controlled-unitary quantum gates proposed by Eisert et al. (Phys Rev A 62:052317, 2000)…
Variational quantum algorithms use non-convex optimization methods to find the optimal parameters for a parametrized quantum circuit in order to solve a computational problem. The choice of the circuit ansatz, which consists of…
In this paper we apply the canonical decomposition of two qubit unitaries to find pulse schemes to control the proposed Kane quantum computer. We explicitly find pulse sequences for the CNOT, swap, square root of swap and controlled Z…
A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The best previous result had shown the…
Quantum computers have the potential to expand the utility of lattice gauge theory to investigate non-perturbative particle physics phenomena that cannot be accessed using a standard Monte Carlo method due to the sign problem. Thanks to the…
We consider a generic elementary gate sequence which is needed to implement a general quantum gate acting on n qubits -- a unitary transformation with 4^n degrees of freedom. For synthesizing the gate sequence, a method based on the…
We show a certain kind of non-local operations can be simulated by sampling a set of local operations with a quasi-probability distribution when the task of a quantum circuit is to evaluate an expectation value of observables. Utilizing the…
We explore the utility of $d=8$ qudits, qu8its, for quantum simulations of the dynamics of 1+1D SU(3) lattice quantum chromodynamics, including a mapping for arbitrary numbers of flavors and lattice size and a re-organization of the…
Quantum simulations of lattice gauge theories for the foreseeable future will be hampered by limited resources. The historical success of improved lattice actions in classical simulations strongly suggests that Hamiltonians with improved…
We propose a universal approach based on Hamiltonian inverse engineering to realize a set of parameterized two-qubit gates. This method possesses unique advantages to simultaneous control of transitions among four energy levels, providing a…
We use a random search technique to find quantum gate sequences that implement perfect quantum state preparation or unitary operator synthesis with arbitrary targets. This approach is based on the recent discovery that there is a large…
We demonstrate that conditional as well as unconditional basic operations which are prerequisite for universal quantum gates can be performed with almost 100% fidelity within a strongly interacting two-electron quantum ring. Both sets of…
In this work, we present a quantum circuit for a binary classification prediction algorithm using a random forest model. The quantum prediction algorithm is presented in our previous works. We construct a circuit and implement it using…
Gauge theory is the framework of the Standard Model of particle physics and is also important in condensed matter physics. As its major non-perturbative approach, lattice gauge theory is traditionally implemented using Monte Carlo…
Efficient verification of the functioning of quantum devices is a key to the development of quantum technologies, but is a daunting task as the system size increases. Here we propose a simple and general framework for verifying unitary…
We propose and validate on real quantum computing hardware a new method for extended two-qubit gate set design, replacing iterative, fine calibration with fast characterization of a small number of gate parameters which are then tracked and…
We study the resources required to achieve universal quantum computing via the gate sets that provide the fundamental instructions from which quantum algorithms are built. While single-gate universal sets are known, they rely on precisely…
While thousands of experimental physicists and chemists are currently trying to build scalable quantum computers, it appears that simulation of quantum computation will be at least as critical as circuit simulation in classical VLSI design.…
Quantum circuit transformation (QCT, a.k.a. qubit mapping) is a critical step in quantum circuit compilation. Typically, QCT is achieved by finding an appropriate initial mapping and using SWAP gates to route the qubits such that all…