A scalable 2-local architecture for quantum annealing of all-to-all Ising models
- URL: http://arxiv.org/abs/2404.06861v2
- Date: Mon, 6 May 2024 18:07:24 GMT
- Title: A scalable 2-local architecture for quantum annealing of all-to-all Ising models
- Authors: Ana Palacios, Artur Garcia-Saez, Marta P. Estarellas,
- Abstract summary: We present a scalable architecture for quantum annealers defined on a graph of degree $d=3$.
This amounts to an efficient braiding of logical chains of qubits which can be derived from a description of the problem in terms of triangles.
We also devise strategies to address the challenges of scalable architectures, such as the faster shrinking of the gap due to the larger physical Hilbert space.
- 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 defined on a graph of degree $d=3$ and containing exclusively 2-local interactions to realize an all-to-all connected Ising model. This amounts to an efficient braiding of logical chains of qubits which can be derived from a description of the problem in terms of triangles. We also devise strategies to address the challenges of scalable architectures, such as the faster shrinking of the gap due to the larger physical Hilbert space, based on driver Hamiltonians more suited to the symmetries of the logical solution space. We thus show an alternative 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) - 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) - Quantum Neural Architecture Search with Quantum Circuits Metric and
Bayesian Optimization [2.20200533591633]
We propose a new quantum gates distance that characterizes the gates' action over every quantum state.
Our approach significantly outperforms the benchmark on three empirical quantum machine learning problems.
arXiv Detail & Related papers (2022-06-28T16:23:24Z) - 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) - Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks.
Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts.
We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
arXiv Detail & Related papers (2021-06-11T18:00:09Z) - Space-efficient binary optimization for variational computing [68.8204255655161]
We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem.
We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
arXiv Detail & Related papers (2020-09-15T18:17:27Z) - 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.