Holonomic quantum computation: a scalable adiabatic architecture

• URL: http://arxiv.org/abs/2502.17188v1
• Date: Mon, 24 Feb 2025 14:24:04 GMT
• Title: Holonomic quantum computation: a scalable adiabatic architecture
• Authors: Clara Wassner, Tommaso Guaita, Jens Eisert, Jose Carrasco,
• Abstract summary: Holonomic quantum computation exploits the geometric evolution of eigenspaces of a degenerate Hamiltonian to implement unitary evolution of computational states.<n>We introduce a framework for performing scalable quantum computation in atom experiments through a universal set of fully holonomic adiabatic gates.
• Score: 0.29998889086656577
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Holonomic quantum computation exploits the geometric evolution of eigenspaces of a degenerate Hamiltonian to implement unitary evolution of computational states. In this work we introduce a framework for performing scalable quantum computation in atom experiments through a universal set of fully holonomic adiabatic gates. Through a detailed differential geometric analysis, we elucidate the geometric nature of these gates and their inherent robustness against classical control errors and other noise sources. The concepts that we introduce here are expected to be widely applicable to the understanding and design of error robustness in generic holonomic protocols. To underscore the practical feasibility of our approach, we contextualize our gate design within recent advancements in Rydberg-based quantum computing and simulation.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Parallel transport in rotating frames and projective holonomic quantum computation [0.0]
  We develop a framework for nonadiabatic holonomic quantum computation with projective gates.<n>We extend the isoholonomic inequality, which provides a fundamental bound on the efficiency of protocols used to implement holonomic quantum gates.
  arXiv  Detail & Related papers  (2024-05-31T14:08:55Z)
• Estimate of the time required to perform a nonadiabatic holonomic quantum computation [0.0]
  Nonadiabatic holonomic quantum computation has been proposed as a method to implement quantum logic gates with robustness comparable to that of adiabatic holonomic gates but with shorter execution times. We show that the procedures for implementing a universal set of holonomic gates proposed in a pioneering paper on nonadiabatic holonomic quantum computation saturate the isoholonomic inequality and are thus time optimal.
  arXiv  Detail & Related papers  (2024-04-08T20:15:38Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Nonadiabatic Holonomic Quantum Computation and Its Optimal Control [6.798901075222994]
  This article reviews recent advances in nonadiabatic holonomic quantum computation. It focuses on various optimal control approaches that can improve the gate performance.
  arXiv  Detail & Related papers  (2023-06-29T03:56:02Z)
• Topological Quantum Gates in Homotopy Type Theory [0.0]
  We explain how the specification of realistic topological quantum gates has a surprisingly slick formulation in parameterized point-set topology. We propose that this confluence of concepts may jointly kickstart the development of topological quantum programming proper. In a companion article, we will explain how further passage to "dependent linear" homotopy data types naturally extends this scheme to a full-blown quantum programming/certification language.
  arXiv  Detail & Related papers  (2023-03-04T11:25:49Z)
• The Quantum Path Kernel: a Generalized Quantum Neural Tangent Kernel for Deep Quantum Machine Learning [52.77024349608834]
  Building a quantum analog of classical deep neural networks represents a fundamental challenge in quantum computing. Key issue is how to address the inherent non-linearity of classical deep learning. We introduce the Quantum Path Kernel, a formulation of quantum machine learning capable of replicating those aspects of deep machine learning.
  arXiv  Detail & Related papers  (2022-12-22T16:06:24Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Geometric and holonomic quantum computation [1.4644151041375417]
  Quantum gates based on geometric phases and quantum holonomies possess built-in resilience to certain kinds of errors. This review provides an introduction to the topic as well as gives an overview of the theoretical and experimental progress for constructing geometric and holonomic quantum gates.
  arXiv  Detail & Related papers  (2021-10-07T16:31:54Z)
• The Hintons in your Neural Network: a Quantum Field Theory View of Deep Learning [84.33745072274942]
  We show how to represent linear and non-linear layers as unitary quantum gates, and interpret the fundamental excitations of the quantum model as particles. On top of opening a new perspective and techniques for studying neural networks, the quantum formulation is well suited for optical quantum computing.
  arXiv  Detail & Related papers  (2021-03-08T17:24:29Z)
• Experimental implementation of universal holonomic quantum computation on solid-state spins with optimal control [12.170408456188934]
  We experimentally implement nonadiabatic holonomic quantum computation with solid spins in diamond at room-temperature. Compared with previous geometric methods, the fidelities of a universal set of holonomic single-qubit and two-qubit quantum logic gates are improved. This work makes an important step towards fault-tolerant scalable geometric quantum computation in realistic systems.
  arXiv  Detail & Related papers  (2021-02-18T09:02:02Z)
• Experimental Realization of Nonadiabatic Holonomic Single-Qubit Quantum Gates with Two Dark Paths in a Trapped Ion [41.36300605844117]
  We show nonadiabatic holonomic single-qubit quantum gates on two dark paths in a trapped $171mathrmYb+$ ion based on four-level systems with resonant drives. We find that nontrivial holonomic two-qubit quantum gates can also be realized within current experimental technologies.
  arXiv  Detail & Related papers  (2021-01-19T06:57:50Z)
• Quantum simulation of gauge theory via orbifold lattice [47.28069960496992]
  We propose a new framework for simulating $textU(k)$ Yang-Mills theory on a universal quantum computer. We discuss the application of our constructions to computing static properties and real-time dynamics of Yang-Mills theories.
  arXiv  Detail & Related papers  (2020-11-12T18:49:11Z)

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.