Nonadiabatic holonomic quantum computation based on commutation relation

• URL: http://arxiv.org/abs/2308.06674v1
• Date: Sun, 13 Aug 2023 03:30:13 GMT
• Title: Nonadiabatic holonomic quantum computation based on commutation relation
• Authors: P. Z. Zhao, D. M. Tong
• Abstract summary: A crucial step in realizing nonadiabatic holonomic quantum computation is to remove the dynamical phase from the total phase. In this paper, we put forward a strategy to design nonadiabatic holonomic quantum computation based on a commutation relation rather than the parallel transport condition.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Nonadiabatic holonomic quantum computation has received increasing attention due to the merits of both robustness against control errors and high-speed implementation. A crucial step in realizing nonadiabatic holonomic quantum computation is to remove the dynamical phase from the total phase. For this reason, previous schemes of nonadiabatic holonomic quantum computation have to resort to the parallel transport condition, i.e., requiring the instantaneous dynamical phase to be always zero. In this paper, we put forward a strategy to design nonadiabatic holonomic quantum computation, which is based on a commutation relation rather than the parallel transport condition. Instead of requiring the instantaneous dynamical phase to be always zero, the dynamical part of the total phase is separated from the geometric part and then removed by properly choosing evolution parameters. This strategy enhances the flexibility to realize nonadiabatic holonomic quantum computation as the commutation relation is more relaxed than the parallel transport condition. It provides more options for realizing nonadiabatic holonomic quantum computation and hence allows us to optimize realizations such as the evolution time and evolution paths.

Related papers

• Fully optimised variational simulation of a dynamical quantum phase transition on a trapped-ion quantum computer [0.039583175274885335]
  We time-evolve a translationally invariant quantum state on the Quantinuum H1-1 trapped-ion quantum processor. This physics requires a delicate cancellation of phases in the many-body wavefunction and presents a tough challenge for current quantum devices. Our results demonstrate the feasibility of variational quantum time-evolution and reveal a hitherto hidden simplicity of the evolution of the transverse-field Ising model.
  arXiv  Detail & Related papers  (2025-02-10T19:01:28Z)
• Quantum error mitigation in optimized circuits for particle-density correlations in real-time dynamics of the Schwinger model [0.0]
  In principle, it is possible to calculate non-equal-time correlation functions, from which one can detect interesting phenomena. In practice, these calculations are strongly affected by noise, due to the complexity of the required quantum circuits. We derive a digital circuit implementation of the time-evolution of particle-density correlation operators and their correlation, comparing results from exact evolution, bare noisy simulations and simulations with different error mitigation techniques.
  arXiv  Detail & Related papers  (2025-01-18T17:32:59Z)
• Dissipation-induced Quantum Homogenization for Temporal Information Processing [44.99833362998488]
  Quantum reservoirs have great potential as they utilize the complex real-time dissipative dynamics of quantum systems for information processing and target time-series generation without precise control or fine-tuning of the Hamiltonian parameters. We propose the disordered quantum homogenizer as an alternative platform, and prove it satisfies the necessary and sufficient conditions - stability and contractivity - of the reservoir dynamics. The results indicate that the quantum homogenization protocol, physically implementable as either nuclear magnetic resonance ensemble or a photonic system, can potentially function as a reservoir computer.
  arXiv  Detail & Related papers  (2024-12-13T09:05:41Z)
• Parallel transport in rotating frames and projective holonomic quantum computation [0.0]
  We develop a framework for nonadiabatic holonomic quantum computation with projective gates. 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)
• Solving reaction dynamics with quantum computing algorithms [42.408991654684876]
  We study quantum algorithms for response functions, relevant for describing different reactions governed by linear response. We focus on nuclear-physics applications and consider a qubit-efficient mapping on the lattice, which can efficiently represent the large volumes required for realistic scattering simulations.
  arXiv  Detail & Related papers  (2024-03-30T00:21:46Z)
• General approach to realize optimized nonadiabatic holonomic quantum computation [0.0]
  We put forward the general form of reverse Hamiltonian to realize the optimized nonadiabatic holonomic quantum computation gate. Our approach might give a new horizon to realize high-fidelity quantum gate.
  arXiv  Detail & Related papers  (2023-10-17T02:10:22Z)
• Real-time dynamics of false vacuum decay [49.1574468325115]
  We investigate false vacuum decay of a relativistic scalar field in the metastable minimum of an asymmetric double-well potential. We employ the non-perturbative framework of the two-particle irreducible (2PI) quantum effective action at next-to-leading order in a large-N expansion.
  arXiv  Detail & Related papers  (2023-10-06T12:44:48Z)
• 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)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Quantum-Classical Hybrid Algorithm for the Simulation of All-Electron Correlation [58.720142291102135]
  We present a novel hybrid-classical algorithm that computes a molecule's all-electron energy and properties on the classical computer. We demonstrate the ability of the quantum-classical hybrid algorithms to achieve chemically relevant results and accuracy on currently available quantum computers.
  arXiv  Detail & Related papers  (2021-06-22T18:00:00Z)
• Approach to realizing nonadiabatic geometric gates with prescribed evolution paths [0.0]
  Nonadiabatic geometric phases are robust against control errors. Quantum computation based on nonadiabatic geometric phases is robust against control errors.
  arXiv  Detail & Related papers  (2020-06-06T10:37:18Z)

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.