Related papers: Realization of programmable Ising models in a trap…
Finding the ground states of the Ising Hamiltonian [1] maps to various combinatorial optimization problems in biology, medicine, wireless communications, artificial intelligence, and social network. So far no efficient classical and quantum…
We introduce quantum fluctuations into the simulated annealing process of optimization problems, aiming at faster convergence to the optimal state. The idea is tested by the two models, the transverse Ising model and the traveling salesman…
We study a hardware-efficient variational quantum algorithm ansatz tailored for the trapped-ion quantum simulator, HEA-TI. We leverage programmable single-qubit rotations and global spin-spin interactions among all ions, reducing the…
The 1+1D Ising model is an ideal benchmark for quantum algorithms, as it is very well understood theoretically. This is true even when expanding the model to include complex coupling constants. In this work, we implement quantum algorithms…
Quantum simulations of spin systems could enable the solution of problems which otherwise require infeasible classical resources. Such a simulation may be implemented using a well-controlled system of effective spins, such as a…
We demonstrate how quantum field theory problems can be embedded on quantum annealers. The general method we use is a discretisation of the field theory problem into a general Ising model, with the continuous field values being encoded into…
Recent experimental progress in quantum information processing with trapped ions have demonstrated most of the fundamental elements required to realize a scalable quantum computer. The next set of challenges lie in realization of a large…
The purpose of this paper is to evaluate the possibility of constructing a large-scale storage-ring-type ion-trap system capable of storing, cooling, and controlling a large number of ions as a platform for scalable quantum computing (QC)…
The computational difficulty of solving fully quantum many-body spin problems is a significant obstacle to understanding the behavior of strongly correlated quantum matter. Experimental ion-trap quantum simulation is a promising approach…
Quantum sensors are an established technology that has created new opportunities for precision sensing across the breadth of science. Using entanglement for quantum-enhancement will allow us to construct the next generation of sensors that…
Quantum annealing is a framework for solving combinatorial optimization problems. While it offers a promising path towards a practical application of quantum hardware, its performance in real-world devices is severely limited by…
Quantum simulators with hundreds of qubits and engineerable Hamiltonians have the potential to explore quantum many-body models that are intractable for classical computers. However, learning the simulated Hamiltonian, a prerequisite for…
Atomic ions trapped in ultra-high vacuum form an especially well-understood and useful physical system for quantum information processing. They provide excellent shielding of quantum information from environmental noise, while strong,…
Finite-range interacting spin models are the simplest models to study the effect of beyond nearest-neighbour interactions and access new effects caused by the range of the interactions. Recent experiments have reached the regime of dominant…
Laser cooled ions trapped in a linear Paul trap are long-standing ideal candidates for realizing quantum simulation, especially of many-body systems. The properties that contribute to this also provide the opportunity to demonstrate…
Ising machines have the potential to realize fast and highly accurate solvers for combinatorial optimization problems. They are classified based on their internal algorithms. Examples include simulated-annealing-based Ising machines…
We present elementary mappings between classical lattice models and quantum circuits. These mappings provide a general framework to obtain efficiently simulable quantum gate sets from exactly solvable classical models. For example, we…
We present protocols for implementation of universal quantum gates on an arbitrary superposition of quantum states in a scalable solid-state Ising spin quantum computer. The spin chain is composed of identical spins 1/2 with the Ising…
A quantum annealer exploits quantum effects to solve a particular type of optimization problem. The advantage of this specialized hardware is that it effectively considers all possible solutions in parallel, thereby potentially…
Quantum processors use the native interactions between effective spins to simulate Hamiltonians or execute quantum gates. In most processors, the native interactions are pairwise, limiting the efficiency of controlling entanglement between…