相关论文: Generation of all-to-all connections in a two-dime…
We analyze the performance of quantum annealing as formulated by Lechner, Hauke, and Zoller (LHZ), by which a Hamiltonian with all-to-all two-body interactions is reduced to a corresponding Hamiltonian with local many-body interactions.…
There is a large ongoing research effort towards obtaining a quantum advantage in the solution of combinatorial optimization problems on near-term quantum devices. A particularly promising platform for testing and developing quantum…
Long-range and multi-body interactions are crucial for quantum simulation and quantum computation. Yet, their practical realization using elementary pairwise interactions remains an outstanding challenge. We propose an experimental scheme…
We theoretically present new unit circuits of Kerr parametric oscillators (KPOs) with four-body interactions, which enable the scalable embedding of all-to-all connected logical Ising spins using the Lechner-Hauke-Zoller (LHZ) scheme. These…
Quantum annealing aims to exploit quantum mechanics to speed up the search for the solution to optimization problems. Most problems exhibit complete connectivity between the logical spin variables after they are mapped to the Ising spin…
In a recent paper Lechner, Hauke and Zoller (LHZ) described a means to translate a Hamiltonian of $N$ spin-$\frac{1}{2}$ particles with 'all-to-all' interactions into a larger physical lattice with only on-site energies and local parity…
Quantum annealing provides a way of solving optimization problems by encoding them as Ising spin models which are implemented using physical qubits. The solution of the optimization problem then corresponds to the ground state of the…
There is a significant ongoing effort in realizing quantum annealing with different physical platforms. The challenge is to achieve a fully programmable quantum device featuring coherent adiabatic quantum dynamics. Here we show that…
Fewer-qubit quantum logic gate, serving as a basic unit for constructing universal multiqubit gates, has been widely applied in quantum computing and quantum information. However, traditional constructions for fewer-qubit gates often…
High-fidelity single- and two-qubit gates are essential building blocks for a fault-tolerant quantum computer. While there has been much progress in suppressing single-qubit gate errors in superconducting qubit systems, two-qubit gates…
Quantum annealing may provide advantages over simulated annealing on solving some problems such as Kth order binary optimization problem. No feasible architecture exists to implement the high-order optimization problem (K > 2) on current…
A two-dimensional array of Kerr-nonlinear parametric oscillators (KPOs) with local four-body interactions is a promising candidate for realizing an Ising machine with all-to-all spin couplings, based on adiabatic quantum computation in the…
There are well-known protocols for performing CNOT quantum logic with qubits coupled by particular high-symmetry (Ising or Heisenberg) interactions. However, many architectures being considered for quantum computation involve qubits or…
The $N$-qubit Greenberger-Horne-Zeilinger (GHZ) state is an important resource for quantum technologies. We consider the task of GHZ encoding using all-to-all interactions, which prepares the GHZ state in a special case, and is furthermore…
Programmable arrays of neutral Rydberg atoms are one of the leading platforms today for scalable quantum simulation and computation. In these systems, the dipole-dipole interactions between the individual atoms, or qubits, typically result…
Recently there has been interest in the idea of quantum computing without control of the physical interactions between component qubits. This is highly appealing since the 'switching' of such interactions is a principal difficulty in…
There are various gate sets that can be used to describe a quantum computation. A particularly popular gate set in the literature on quantum computing consists of arbitrary single-qubit gates and 2-qubit CNOT gates. A CNOT gate is however…
In order to demonstrate non-trivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to understand how to decompose a desired quantum computation into the shortest possible sequence…
We investigate quantum circuits built from arbitrary single-qubit operations combined with programmable all-to-all multiqubit entangling gates that are native to, among other systems, trapped-ion quantum computing platforms. We report a…
Synthesizing many-body interaction Hamiltonian is a central task in quantum simulation. However, it is challenging to synthesize interactions including more than two spins. Borrowing tools from quantum optics, we synthesize five-body…