Practical designs for permutation symmetric problem Hamiltonians on hypercubes
arXiv:1812.07885 · doi:10.1103/PhysRevA.100.032320
Abstract
We present a method to experimentally realize large-scale permutation-symmetric Hamiltonians for continuous-time quantum protocols such as quantum walk and adiabatic quantum computation. In particular, the method can be used to perform an encoded continuous-time quantum search on a hypercube graph with 2^n vertices encoded into 2n qubits. We provide details for a realistically achievable implementation in Rydberg atomic systems. Although the method is perturbative, the realization is always achieved at second order in perturbation theory, regardless of the size of the mapped system. This highly efficient mapping provides a natural set of problems which are tractable both numerically and analytically, thereby providing a powerful tool for benchmarking quantum hardware and experimentally investigating the physics of continuous-time quantum protocols.
arXiv comment9 pages 4 figures, accepted by PRA, v2 matches accepted version
References in corpus (43)
- Quantum Mechanics helps in searching for a needle in a haystack
- Ising formulations of many NP problems
- Adiabatic Quantum Computing
- Strengths and Weaknesses of Quantum Computing
- Spatial search by quantum walk
- Quantum computing with atomic qubits and Rydberg interactions: Progress and challenges
- Quantum Search by Local Adiabatic Evolution
- Synthetic three-dimensional atomic structures assembled atom by atom
- Experimental realization of a symmetry protected topological phase of interacting bosons with Rydberg atoms
- Quantum Computation by Adiabatic Evolution
- High-fidelity control and entanglement of Rydberg atom qubits
- Quantum Boltzmann Machine
- Experimental Implementation of Discrete Time Quantum Random Walk on an NMR Quantum Information Processor
- What is the Computational Value of Finite Range Tunneling?
- Experimental Implementation of the Quantum Random-Walk Algorithm
- Reverse Quantum Annealing Approach to Portfolio Optimization Problems
- Computational Role of Multiqubit Tunneling in a Quantum Annealer
- Alkaline earth atoms in optical tweezers
- Estimation of effective temperatures in quantum annealers for sampling applications: A case study with possible applications in deep learning
- Microscopic control and detection of ultracold strontium in optical-tweezer arrays
- Entanglement in a quantum annealing processor
- Realizable Hamiltonians for Universal Adiabatic Quantum Computers
- Narrow-line cooling and imaging of Ytterbium atoms in an optical tweezer array
- A Tutorial on Formulating and Using QUBO Models
- All-optical quantum information processing using Rydberg gates
- Quantum-Assisted Learning of Hardware-Embedded Probabilistic Graphical Models
- Efficient Quantum Walk on a Quantum Processor
- Experimental determination of Ramsey numbers
- Perturbative Gadgets at Arbitrary Orders
- Quantum Adiabatic Evolution Algorithms versus Simulated Annealing
- Tunneling and speedup in quantum optimization for permutation-symmetric problems
- Circuit design for multi-body interactions in superconducting quantum annealing system with applications to a scalable architecture
- Forecasting financial crashes with quantum computing
- A Direct Mapping of Max k-SAT and High Order Parity Checks to a Chimera Graph
- Quantum search with hybrid adiabatic-quantum walk algorithms and realistic noise
- Maximum-Entropy Inference with a Programmable Annealer
- A Rydberg-dressed Magneto-Optical Trap
- Experimental simulation and limitations of quantum walks with trapped ions
- Quantum Monte Carlo Simulations of Tunneling in Quantum Adiabatic Optimization
- Necessary Adiabatic Run Times in Quantum Optimization
- High-fidelity adiabatic quantum computation using the intrinsic Hamiltonian of a spin system: Application to the experimental factorization of 291311
- Quadratization in discrete optimization and quantum mechanics
- Tunneling through high energy barriers in simulated quantum annealing
Cited by in corpus (12)
- Reverse quantum annealing of the -spin model with relaxation
- Quantum Computing for Quantum Tunnelling
- Quantum search with hybrid adiabatic-quantum walk algorithms and realistic noise
- Finding spin-glass ground states using quantum walks
- Maximum power heat engines and refrigerators in the fast-driving regime
- Understanding domain-wall encoding theoretically and experimentally
- Optimal Thermometers with Spin Networks
- How to Compute Using Quantum Walks
- Grover Speedup from Many Forms of the Zeno Effect
- Robust Diabatic Quantum Search by Landau-Zener-Stückelberg Oscillations
- Quantum annealing and condensed matter physics
- Weyl's Relations, Integrable Matrix Models and Quantum Computation