Nonadiabatic Holonomic Quantum Computation via Path Optimization

• URL: http://arxiv.org/abs/2205.09288v2
• Date: Wed, 19 Oct 2022 12:33:40 GMT
• Title: Nonadiabatic Holonomic Quantum Computation via Path Optimization
• Authors: Li-Na Ji, Yan Liang, Pu Shen and Zheng-Yuan Xue
• Abstract summary: We present a path-optimized NHQC scheme based on the non-Abelian geometric phase. We show that a geometric gate can be constructed by different evolution paths, which have different responses to systematic noises. In addition, we propose to implement our strategy on superconducting quantum circuits with decoherence-free subspace encoding.
• Score: 3.0726135239588164
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Nonadiabatic holonomic quantum computation (NHQC) is implemented by fast evolution processes in a geometric way to withstand local noises. However, recent works of implementing NHQC are sensitive to the systematic noise and error. Here, we present a path-optimized NHQC (PONHQC) scheme based on the non-Abelian geometric phase, and find that a geometric gate can be constructed by different evolution paths, which have different responses to systematic noises. Due to the flexibility of the PONHQC scheme, we can choose an optimized path that can lead to excellent gate performance. Numerical simulation shows that our optimized scheme can greatly outperform the conventional NHQC scheme, in terms of both fidelity and robustness of the gates. In addition, we propose to implement our strategy on superconducting quantum circuits with decoherence-free subspace encoding with the experiment-friendly two-body exchange interaction. Therefore, we present a flexible NHQC scheme that is promising for the future robust quantum computation.

Related papers

• Dynamically Optimized Nonadiabatic Holonomic Quantum Computation [3.536421391532772]
  We propose a dynamically optimized NHQC scheme based on dynamically corrected gate technique. It is found that our scheme can correct the $X$ error up to fourth order. Our proposed scheme offers a prospective way to the realization of scalable fault-tolerant holonomic quantum computation.
  arXiv  Detail & Related papers  (2024-09-24T02:03:05Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Nonadiabatic geometric quantum gates with on-demand trajectories [2.5539863252714636]
  We propose a general protocol for constructing geometric quantum gates with on-demand trajectories. Our scheme adopts reverse engineering of the target Hamiltonian using smooth pulses. Because a particular geometric gate can be induced by various different trajectories, we can further optimize the gate performance.
  arXiv  Detail & Related papers  (2024-01-20T06:57:36Z)
• QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
  We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
  arXiv  Detail & Related papers  (2023-04-14T08:03:20Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Robust nonadiabatic geometric quantum computation by dynamical correction [0.0]
  We propose a robust scheme for nonadiabatic geometric quantum computation (NGQC) combining with the dynamical correction technique. We numerically show that our scheme can greatly improve the gate robustness in previous protocols. Our scheme provides a promising alternation for the future scalable fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2022-08-02T14:09:48Z)
• Robust resource-efficient quantum variational ansatz through evolutionary algorithm [0.46180371154032895]
  Vari quantum algorithms (VQAsational) are promising methods to demonstrate quantum advantage on near-term devices. We show that a fixed VQA circuit design, such as the widely-used hardware efficient ansatz, is not necessarily robust against imperfections. We propose a genome-length-adjustable evolutionary algorithm to design a robust VQA circuit that is optimized over variations of both circuit ansatz and gate parameters.
  arXiv  Detail & Related papers  (2022-02-28T12:14:11Z)
• Composite Short-path Nonadiabatic Holonomic Quantum Gates [6.798901075222994]
  We present to implement NHQC with the shortest path under some conditions, through the inverse Hamiltonian engineering technique. Our scheme represents a promising progress towards future fault-tolerant quantum computation in atomic systems.
  arXiv  Detail & Related papers  (2021-11-11T14:13:12Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Cross Entropy Hyperparameter Optimization for Constrained Problem Hamiltonians Applied to QAOA [68.11912614360878]
  Hybrid quantum-classical algorithms such as Quantum Approximate Optimization Algorithm (QAOA) are considered as one of the most encouraging approaches for taking advantage of near-term quantum computers in practical applications. Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem. In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical parameter to find better parameters more easily and hence results in an improved performance.
  arXiv  Detail & Related papers  (2020-03-11T13:52:41Z)

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.