Realization of Conditional Operations through Transition Pathway Engineering
- URL: http://arxiv.org/abs/2407.06687v2
- Date: Thu, 11 Jul 2024 02:24:51 GMT
- Title: Realization of Conditional Operations through Transition Pathway Engineering
- Authors: Sheng Zhang, Peng Duan, Yun-Jie Wang, Tian-Le Wang, Peng Wang, Ren-Ze Zhao, Xiao-Yan Yang, Ze-An Zhao, Liang-Liang Guo, Yong Chen, Hai-Feng Zhang, Lei Du, Hao-Ran Tao, Zhi-Fei Li, Yuan Wu, Zhi-Long Jia, Wei-Cheng Kong, Zhao-Yun Chen, Yu-Chun Wu, Guo-Ping Guo,
- Abstract summary: We propose a transition composite gate (TCG) scheme grounded on state-selective transition path engineering.
To demonstrate the capability of circuit compression, we use TCG scheme to prepare 3-qubit Greenberger-Horne-Zeilinger (GHZ) and W states, with the fidelity of 96.77% and 95.72%.
The TCG scheme exhibits advantages in certain quantum circuits and shows significant potential for large-scale quantum algorithms.
- Score: 13.289258466005991
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In the NISQ era, achieving large-scale quantum computing demands compact circuits to mitigate decoherence and gate error accumulation. Quantum operations with diverse degrees of freedom hold promise for circuit compression, but conventional approaches encounter challenges in simultaneously adjusting multiple parameters. Here, we propose a transition composite gate (TCG) scheme grounded on state-selective transition path engineering, enabling more expressive conditional operations. We experimentally validate a controlled unitary (CU) gate as an example, with independent and continuous parameters. By adjusting the parameters of $\rm X^{12}$ gate, we obtain the CU family with a fidelity range of 95.2% to 99.0% leveraging quantum process tomography (QPT). To demonstrate the capability of circuit compression, we use TCG scheme to prepare 3-qubit Greenberger-Horne-Zeilinger (GHZ) and W states, with the fidelity of 96.77% and 95.72%. TCG can achieve the reduction in circuit depth of about 40% and 44% compared with the use of CZ gates only. Moreover, we show that short-path TCG (SPTCG) can further reduce the state-preparation circuit time cost. The TCG scheme exhibits advantages in certain quantum circuits and shows significant potential for large-scale quantum algorithms.
Related papers
- Towards Efficient Quantum Computing for Quantum Chemistry: Reducing Circuit Complexity with Transcorrelated and Adaptive Ansatz Techniques [0.0]
This work demonstrates how to reduce circuit depth by combining the transcorrelated (TC) approach with adaptive quantum ans"atze.
Our study demonstrates that combining the TC method with adaptive ans"atze yields compact, noise-resilient, and easy-to-optimize quantum circuits.
arXiv Detail & Related papers (2024-02-26T15:31:56Z) - Improving fidelity of multi-qubit gates using hardware-level pulse
parallelization [0.0]
We present the parallelization of pre-calibrated pulses at the hardware level as an easy-to-implement strategy to optimize quantum gates.
We show that such parallelization leads to improved fidelity and gate time reduction, when compared to serial concatenation.
arXiv Detail & Related papers (2023-12-20T19:00:02Z) - High-fidelity parallel entangling gates on a neutral atom quantum
computer [41.74498230885008]
We report the realization of two-qubit entangling gates with 99.5% fidelity on up to 60 atoms in parallel.
These advances lay the groundwork for large-scale implementation of quantum algorithms, error-corrected circuits, and digital simulations.
arXiv Detail & Related papers (2023-04-11T18:00:04Z) - Quantum process tomography of continuous-variable gates using coherent
states [49.299443295581064]
We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit.
We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
arXiv Detail & Related papers (2023-03-02T18:08:08Z) - Reqomp: Space-constrained Uncomputation for Quantum Circuits [4.703757073704313]
We present Reqomp, a method to automatically synthesize correct and efficient uncomputation of ancillae.
Our evaluation demonstrates that Reqomp can significantly reduce the number of required ancilla qubits by up to 96%.
arXiv Detail & Related papers (2022-12-20T16:23:04Z) - Error Mitigation-Aided Optimization of Parameterized Quantum Circuits:
Convergence Analysis [42.275148861039895]
Variational quantum algorithms (VQAs) offer the most promising path to obtaining quantum advantages via noisy processors.
gate noise due to imperfections and decoherence affects the gradient estimates by introducing a bias.
Quantum error mitigation (QEM) techniques can reduce the estimation bias without requiring any increase in the number of qubits.
QEM can reduce the number of required iterations, but only as long as the quantum noise level is sufficiently small.
arXiv Detail & Related papers (2022-09-23T10:48:04Z) - Approaching the theoretical limit in quantum gate decomposition [0.0]
We propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count.
Our approach is based on a sequential optimization of parameters related to the single-qubit rotation gates involved in a pre-designed quantum circuit used for the decomposition.
arXiv Detail & Related papers (2021-09-14T15:36:22Z) - 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) - Ultrafast Holonomic Quantum Gates [4.354697470999286]
We propose a nonadiabatic holonomic quantum scheme with detuned interactions on $Delta$-type three-level system.
Our numerical simulations show that the gate robustness is also stronger than previous schemes.
We present an implementation of our proposal on superconducting quantum circuits, with a decoherence-free subspace encoding.
arXiv Detail & Related papers (2021-08-03T14:31:38Z) - Realization of high-fidelity CZ and ZZ-free iSWAP gates with a tunable
coupler [40.456646238780195]
Two-qubit gates at scale are a key requirement to realize the full promise of quantum computation and simulation.
We present a systematic approach that goes beyond the dispersive approximation to exploit the engineered level structure of the coupler and optimize its control.
We experimentally demonstrate CZ and $ZZ$-free iSWAP gates with two-qubit interaction fidelities of $99.76 pm 0.07$% and $99.87 pm 0.23$%, respectively.
arXiv Detail & Related papers (2020-11-02T19:09:43Z) - Improving the Performance of Deep Quantum Optimization Algorithms with
Continuous Gate Sets [47.00474212574662]
Variational quantum algorithms are believed to be promising for solving computationally hard problems.
In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances.
Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
arXiv Detail & Related papers (2020-05-11T17:20:51Z)
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.