Practical implementation of a single-qubit rotation algorithm

• URL: http://arxiv.org/abs/2410.18746v2
• Date: Tue, 29 Oct 2024 12:16:59 GMT
• Title: Practical implementation of a single-qubit rotation algorithm
• Authors: Christoffer Hindlycke, Jan-Åke Larsson,
• Abstract summary: The Toffoli is an important universal quantum gate, and will alongside the Clifford gates be available in future Fault-Tolerant Quantum Computing hardware. We evaluate the performance of a recently proposed single-qubit rotation algorithm using the Clifford+Toffoli gate set.
• Score: 0.0
• License:
• Abstract: The Toffoli is an important universal quantum gate, and will alongside the Clifford gates be available in future Fault-Tolerant Quantum Computing hardware. Many quantum algorithms rely on performing arbitrarily small single-qubit rotations for their function, and these rotations may also be used to construct any unitary from a limited (but universal) gate set; it is then of significant interest how to carry out such rotations. In this work, we evaluate the performance of a recently proposed single-qubit rotation algorithm using the Clifford+Toffoli gate set by implementation on both a real and simulated quantum computer. We test the algorithm under various simulated noise levels utilizing a per-qubit depolarizing error noise model, finding that the errors are seemingly explained by a binomial distribution wherein these errors change controlling ancilla measurements from $0$ into $1$. Similar observations appear to hold when conducting live runs; noise levels here make further meaningful conclusions difficult, although for the smallest possible number of ancillary controls we do note that error mitigation is helpful. Our results suggest that the algorithm will perform well under up to $1\%$ noise, under the noise model we chose. Our results also suggest the algorithm could be used as a benchmark for Quantum Processing Units, given its linear increase in total number of qubits and Toffoli gates required.

Related papers

• Resilience-Runtime Tradeoff Relations for Quantum Algorithms [0.7371081631199642]
  A leading approach to algorithm design aims to minimize the number of operations in an algorithm's compilation. We develop a framework to characterize the resilience of an algorithm to perturbative noises. We show how this framework can be leveraged to identify compilations of an algorithm that are better suited to withstand certain noises.
  arXiv  Detail & Related papers  (2024-08-05T18:31:14Z)
• A quantum implementation of high-order power method for estimating geometric entanglement of pure states [39.58317527488534]
  This work presents a quantum adaptation of the iterative higher-order power method for estimating the geometric measure of entanglement of multi-qubit pure states. It is executable on current (hybrid) quantum hardware and does not depend on quantum memory. We study the effect of noise on the algorithm using a simple theoretical model based on the standard depolarising channel.
  arXiv  Detail & Related papers  (2024-05-29T14:40:24Z)
• Optimized Noise Suppression for Quantum Circuits [0.40964539027092917]
  Crosstalk noise is a severe error source in, e.g., cross-resonance based superconducting quantum processors. Intrepid programming algorithm extends previous work on optimized qubit routing by swap insertion. We evaluate the proposed method by characterizing crosstalk noise for two chips with up to 127 qubits.
  arXiv  Detail & Related papers  (2024-01-12T07:34:59Z)
• Accurate and Honest Approximation of Correlated Qubit Noise [39.58317527488534]
  We propose an efficient systematic construction of approximate noise channels, where their accuracy can be enhanced by incorporating noise components with higher qubit-qubit correlation degree. We find that, for realistic noise strength typical for fixed-frequency superconducting qubits, correlated noise beyond two-qubit correlation can significantly affect the code simulation accuracy.
  arXiv  Detail & Related papers  (2023-11-15T19:00:34Z)
• Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
  We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
  arXiv  Detail & Related papers  (2023-05-03T11:27:50Z)
• QuEst: Graph Transformer for Quantum Circuit Reliability Estimation [32.89844497610906]
  Python library called TorchQuantum can construct, simulate, and train PQC for machine learning tasks. We propose to leverage a graph transformer model to predict noise impact on circuit fidelity. Compared with circuit simulators, the predictor has over 200X speedup for estimating the fidelity.
  arXiv  Detail & Related papers  (2022-10-30T02:35:31Z)
• Approximate quantum gates compiling with self-navigation algorithm [0.0]
  We propose an algorithm to approximately compile single-qubit gates with arbitrary accuracy. Evaluation results show that the overall rotation distance generated by our algorithm is significantly shorter than the commonly used $U3$ gate.
  arXiv  Detail & Related papers  (2022-04-06T03:07:17Z)
• Quantum error mitigation via matrix product operators [27.426057220671336]
  Quantum error mitigation (QEM) can suppress errors in measurement results via repeated experiments and post decomposition of data. MPO representation increases the accuracy of modeling noise without consuming more experimental resources. Our method is hopeful of being applied to circuits in higher dimensions with more qubits and deeper depth.
  arXiv  Detail & Related papers  (2022-01-03T16:57:43Z)
• Error mitigation with Clifford quantum-circuit data [0.8258451067861933]
  We propose a novel, scalable error-mitigation method that applies to gate-based quantum computers. The method generates training data $X_itextnoisy,X_itextexact$ via quantum circuits composed largely of Clifford gates. We analyze the performance of our method versus the number of qubits, circuit depth, and number of non-Clifford gates.
  arXiv  Detail & Related papers  (2020-05-20T16:53: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.