Nonadiabatic geometric quantum gates with on-demand trajectories

• URL: http://arxiv.org/abs/2401.11147v3
• Date: Thu, 27 Jun 2024 08:30:59 GMT
• Title: Nonadiabatic geometric quantum gates with on-demand trajectories
• Authors: Yan Liang, Zheng-Yuan Xue,
• Abstract summary: 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.
• Score: 2.5539863252714636
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: High-fidelity quantum gates are an essential prerequisite for large-scale quantum computation. When manipulating practical quantum systems, environmentally and operationally induced errors are inevitable, and thus, in addition to being fast, it is preferable that operations should be intrinsically robust against different errors. Here, we propose a general protocol for constructing geometric quantum gates with on-demand trajectories by modulating the applied pulse shapes that define the system's evolution trajectory. Our scheme adopts reverse engineering of the target Hamiltonian using smooth pulses, which also eliminates the difficulty of calculating geometric phases for an arbitrary trajectory. Furthermore, because a particular geometric gate can be induced by various different trajectories, we can further optimize the gate performance under different scenarios; the results of numerical simulations indicate that this optimization can greatly enhance the quality of the gate. In addition, we present an implementation of our proposal using superconducting circuits, showcasing substantial enhancements in gate performance compared with conventional schemes. Our protocol thus presents a promising approach for high-fidelity and strong-robust geometric quantum gates for large-scale quantum computation.

Related papers

• Optimizing quantum gates towards the scale of logical qubits [78.55133994211627]
  A foundational assumption of quantum gates theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance. Here we report on a strategy that can overcome such problems. We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunablebits to execute single qubit while superconducting errors.
  arXiv  Detail & Related papers  (2023-08-04T13:39:46Z)
• 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)
• Analytical and experimental study of center line miscalibrations in M\o lmer-S\o rensen gates [51.93099889384597]
  We study a systematic perturbative expansion in miscalibrated parameters of the Molmer-Sorensen entangling gate. We compute the gate evolution operator which allows us to obtain relevant key properties. We verify the predictions from our model by benchmarking them against measurements in a trapped-ion quantum processor.
  arXiv  Detail & Related papers  (2021-12-10T10:56:16Z)
• Nonadiabatic geometric quantum computation with shortened path on superconducting circuits [3.0726135239588164]
  We present an effective scheme to find the shortest geometric path under the conventional conditions of geometric quantum computation. High-fidelity and robust geometric gates can be realized by only single-loop evolution. Our scheme is promising for large-scale fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2021-11-02T08:03:38Z)
• Path-optimized nonadiabatic geometric quantum computation on superconducting qubits [3.98625523260655]
  We propose a path-optimized scheme for geometric quantum computation on superconducting transmon qubits. We find that the constructed geometric gates can be superior to their corresponding dynamical ones under different local errors. Our scheme provides a new perspective for geometric quantum computation, making it more promising in the application of large-scale fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2021-10-12T15:26:26Z)
• 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)
• Accurate methods for the analysis of strong-drive effects in parametric gates [94.70553167084388]
  We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach. We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
  arXiv  Detail & Related papers  (2021-07-06T02:02:54Z)
• Nonadiabatic geometric quantum gates that are insensitive to qubit-frequency drifts [8.750801670077806]
  In the current implementation of nonadiabatic geometric phases, operational and/or random errors tend to destruct the conditions that induce geometric phases. Here, we apply the path-design strategy to explain in detail why both configurations can realize universal quantum gates in a single-loop way. Our scheme provides a promising way towards practical realization of high-fidelity and robust nonadiabatic geometric quantum gates.
  arXiv  Detail & Related papers  (2021-03-16T12:05:45Z)
• High-fidelity geometric quantum gates with short paths on superconducting circuits [5.666193021459319]
  We propose a scheme to realize nonadiabatic geometric quantum gates with short paths based on simple pulse control techniques. Specifically, we illustrate the idea on a superconducting quantum circuit, which is one of the most promising platforms for realizing practical quantum computer.
  arXiv  Detail & Related papers  (2021-02-06T10:13:05Z)
• Noncyclic Geometric Quantum Gates with Smooth Paths via Invariant-based Shortcuts [4.354697470999286]
  We propose a scheme to realize geometric quantum gates with noncyclic and nonadiabatic evolution via invariant-based shortcuts. Our scheme provides a promising way to realize high-fidelity fault-tolerant quantum gates for scalable quantum computation.
  arXiv  Detail & Related papers  (2021-02-01T15:05:29Z)
• 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.