Quantum annealing of Cayley-tree Ising spins at small scales

• URL: http://arxiv.org/abs/2011.01653v2
• Date: Fri, 19 Feb 2021 02:46:38 GMT
• Title: Quantum annealing of Cayley-tree Ising spins at small scales
• Authors: Yunheung Song, Minhyuk Kim, Hansub Hwang, Woojun Lee, and Jaewook Ahn
• Abstract summary: Ising Hamiltonians programmed with up to $N=22$ spins mapped on various Cayley tree graphs. This demonstrates the possibilities of high-dimensional qubit connection in quantum simulators.
• Score: 0.7046417074932257
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Significant efforts are being directed towards developing a quantum annealer capable of solving combinatorial optimization problems. The challenges are Hamiltonian programming and large-scale implementations. Here we report quantum annealing demonstration of Ising Hamiltonians programmed with up to $N=22$ spins mapped on various Cayley tree graphs. Experiments are performed with a Rydberg-atom quantum simulator, in which rubidium single atoms are arranged in three dimensional space in such a way that their Rydberg atoms and blockaded strong couplings respectively represent the nodes and edges of each graph. Three different Cayley-tree graphs of $Z=3$ neighbors and of up to $S=4$ shells are constructed, and their ground-state phases and N\'{e}el's order formations are probed. In good agreement with model calculations, the anti-ferromagnetic phase in regular Cayley trees and frustrated competing ground-states in a dual-center Cayley tree are directly observed. This demonstrates the possibilities of high-dimensional qubit connection programming in quantum simulators.

Related papers

• Comparison of encoding schemes for quantum computing of $S > 1/2$ spin chains [0.0]
  We compare four different encoding schemes for the quantum computing of spin chains with a spin quantum number $S>1/2$. The three different qubit encoding schemes are assessed by conducting Hamiltonian simulation for $1/2 le S le 5/2$ using a trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2025-02-26T05:26:49Z)
• Fault-tolerant fermionic quantum computing [39.58317527488534]
  We introduce fermionic fault-tolerant quantum computing, a framework which removes this overhead altogether.<n>We show how our framework can be implemented in neutral atoms, overcoming the apparent inability of neutral atoms to implement non-number-conserving gates.
  arXiv  Detail & Related papers  (2024-11-13T19:00:02Z)
• Slow Mixing of Quantum Gibbs Samplers [47.373245682678515]
  We present a quantum generalization of these tools through a generic bottleneck lemma. This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles. Even with sublinear barriers, we use Feynman-Kac techniques to lift classical to quantum ones establishing tight lower bound $T_mathrmmix = 2Omega(nalpha)$.
  arXiv  Detail & Related papers  (2024-11-06T22:51:27Z)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Preparing angular momentum eigenstates using engineered quantum walks [1.0232954388448414]
  We develop a quantum-walk scheme that does not require inputting $O(j)$ nonzero Clebsch-Gordan (CG) coefficients classically. Our scheme prepares angular momentum eigenstates using a sequence of Hamiltonians to move an initial state deterministically to desired final states. We test our state preparation scheme on classical computers, reproducing CG coefficients, and implement small test problems on current quantum hardware.
  arXiv  Detail & Related papers  (2024-08-26T23:20:00Z)
• Systematic input scheme of many-boson Hamiltonians with applications to the two-dimensional $φ^4$ theory [0.0]
  We present our discussion of this input scheme based on the light-front Hamiltonian of the two-dimensional $phi 4$ theory. In our input scheme, we employ a set of quantum registers, where each register encodes the occupation of a distinct boson mode as binaries. We present the spectral calculations of the Hamiltonian utilizing the hybrid quantum-classical symmetry-adapted quantum Krylov subspace diagonalization algorithm.
  arXiv  Detail & Related papers  (2024-07-18T16:47:53Z)
• Efficiently preparing Schr\"odinger's cat, fractons and non-Abelian topological order in quantum devices [0.0]
  Long-range entangled quantum states -- like cat states and topological order -- are key for quantum metrology and information purposes. We propose how to scalably prepare a broad range of long-range entangled states with the use of existing experimental platforms. Remarkably, this protocol can prepare the 1D Greenberger-Horne-Zeilinger (GHZ) 'cat' state and 2D toric code with fidelity per site exceeding $0.9999$.
  arXiv  Detail & Related papers  (2021-12-02T18:58:34Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Parallel Quantum Algorithm for Hamiltonian Simulation [9.680246554758343]
  A parallel quantum algorithm is proposed for simulating the dynamics of a large class of Hamiltonians. The running time of our parallel quantum simulation algorithm measured by the quantum circuit depth has a doubly (poly-)logarithmic dependence. We show that the total gate depth of our algorithm has a $operatornamepolyloglog (1/epsilon)$ dependence in the parallel setting.
  arXiv  Detail & Related papers  (2021-05-25T12:46:33Z)
• Programmable quantum simulation of 2D antiferromagnets with hundreds of Rydberg atoms [43.55994393060723]
  Quantum simulation using synthetic systems is a promising route to solve outstanding quantum many-body problems. Here, we use programmable arrays of individual atoms trapped in optical tweezers to implement an iconic many-body problem. We push this platform to an unprecedented regime with up to 196 atoms manipulated with high fidelity.
  arXiv  Detail & Related papers  (2020-12-22T19:00:00Z)
• Improved spectral gaps for random quantum circuits: large local dimensions and all-to-all interactions [0.0]
  We show that $1D$ random quantum circuits have a spectral gap scaling as $Omega(n-1)$, provided that $t$ is small compared to the local dimension: $t2leq O(q)$. Our second result is an unconditional spectral gap bounded below by $Omega(n-1log-1(n) t-alpha(q))$ for random quantum circuits with all-to-all interactions.
  arXiv  Detail & Related papers  (2020-12-09T19:00:50Z)
• Variational Monte Carlo calculations of $\mathbf{A\leq 4}$ nuclei with an artificial neural-network correlator ansatz [62.997667081978825]
  We introduce a neural-network quantum state ansatz to model the ground-state wave function of light nuclei. We compute the binding energies and point-nucleon densities of $Aleq 4$ nuclei as emerging from a leading-order pionless effective field theory Hamiltonian.
  arXiv  Detail & Related papers  (2020-07-28T14:52:28Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.