A scalable 2-local architecture for quantum annealing of Ising models with arbitrary dimensions

• URL: http://arxiv.org/abs/2404.06861v3
• Date: Thu, 8 Aug 2024 17:44:15 GMT
• Title: A scalable 2-local architecture for quantum annealing of Ising models with arbitrary dimensions
• Authors: Ana Palacios, Artur Garcia-Saez, Marta P. Estarellas,
• Abstract summary: We present a scalable architecture for quantum annealers described by a hardware graph of degree $d=3$. By describing the problem graph in terms of triangles, we derive this resource-efficient configuration based on logical chains of qubits.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Achieving dense connectivities is a challenge for most quantum computing platforms today, and a particularly crucial one for the case of quantum annealing applications. In this context, we present a scalable architecture for quantum annealers described by a hardware graph of degree $d=3$ and containing exclusively 2-local interactions to realize Ising models of arbitrary dimension. By describing the problem graph in terms of triangles, we derive this resource-efficient configuration based on logical chains of qubits. We also devise strategies to address the challenges of scaling this architecture, identifying driver Hamiltonians more suited to the symmetries of the logical solution space. We thus show a promising new route to scale up devices dedicated to classical optimization tasks within the quantum annealing paradigm.

Related papers

• Quantum Gate Optimization for Rydberg Architectures in the Weak-Coupling Limit [55.05109484230879]
  We demonstrate machine learning assisted design of a two-qubit gate in a Rydberg tweezer system. We generate optimal pulse sequences that implement a CNOT gate with high fidelity. We show that local control of single qubit operations is sufficient for performing quantum computation on a large array of atoms.
  arXiv  Detail & Related papers  (2023-06-14T18:24:51Z)
• Mapping quantum algorithms to multi-core quantum computing architectures [1.8602413562219944]
  Multi-core quantum computer architecture poses new challenges such as expensive inter-core communication. A detailed critical discussion of the quantum circuit mapping problem for multi-core quantum computing architectures is provided. We further explore the performance of a mapping method, which is formulated as a partitioning over time graph problem.
  arXiv  Detail & Related papers  (2023-03-28T16:46:59Z)
• Tensor Networks or Decision Diagrams? Guidelines for Classical Quantum Circuit Simulation [65.93830818469833]
  tensor networks and decision diagrams have independently been developed with differing perspectives, terminologies, and backgrounds in mind. We consider how these techniques approach classical quantum circuit simulation, and examine their (dis)similarities with regard to their most applicable abstraction level. We provide guidelines for when to better use tensor networks and when to better use decision diagrams in classical quantum circuit simulation.
  arXiv  Detail & Related papers  (2023-02-13T19:00:00Z)
• Assessing requirements to scale to practical quantum advantage [56.22441723982983]
  We develop a framework for quantum resource estimation, abstracting the layers of the stack, to estimate resources required for large-scale quantum applications. We assess three scaled quantum applications and find that hundreds of thousands to millions of physical qubits are needed to achieve practical quantum advantage. A goal of our work is to accelerate progress towards practical quantum advantage by enabling the broader community to explore design choices across the stack.
  arXiv  Detail & Related papers  (2022-11-14T18:50:27Z)
• Modularized and scalable compilation for quantum program in double quantum dots [0.0]
  We train the Ansatz circuit and exemplarily realize high-fidelity compilation of a series of universal quantum gates for singlet-triplet qubits in semiconductor double quantum dots. Our work constitutes an important stepping-stone for exploiting the potential of this physical resource for advanced and complicated quantum algorithms.
  arXiv  Detail & Related papers  (2022-11-10T02:32:39Z)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• Feasible Architecture for Quantum Fully Convolutional Networks [4.849886707973093]
  We propose a feasible pure quantum architecture that can be operated on noisy intermediate-scale quantum devices. Our study represents the successful training of a pure quantum fully convolutional network and discusses advantages by comparing it with the hybrid solution.
  arXiv  Detail & Related papers  (2021-10-05T01:06:54Z)
• 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)
• Programmable Quantum Annealing Architectures with Ising Quantum Wires [2.808255698770643]
  A quantum annealer aims at preparing the ground state of an Ising spin-Hamiltonian quantum mechanically. We discuss an architecture, where the required spin interactions are implemented via two-port, or in general multi-port quantum Ising wires connecting the spins of interest. We illustrate the approach for few spin devices solving Max-Cut and prime factorization problems, and discuss the potential scaling to large atom based systems.
  arXiv  Detail & Related papers  (2020-07-31T18:00:01Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)

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.