Pulse-efficient circuit transpilation for quantum applications on cross-resonance-based hardware

• URL: http://arxiv.org/abs/2105.01063v1
• Date: Mon, 3 May 2021 17:59:55 GMT
• Title: Pulse-efficient circuit transpilation for quantum applications on cross-resonance-based hardware
• Authors: Nathan Earnest, Caroline Tornow, Daniel J. Egger
• Abstract summary: We show a pulse-efficient circuit transpilation framework for noisy quantum hardware. This is achieved by scaling cross-resonance pulses and exposing each pulse as a gate to remove redundant single-qubit operations with the transpiler. We observe up to a 50% error reduction in the fidelity of RZZ(theta) and arbitrary SU(4) gates on IBM Quantum devices.
• Score: 0.8057006406834467
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We show a pulse-efficient circuit transpilation framework for noisy quantum hardware. This is achieved by scaling cross-resonance pulses and exposing each pulse as a gate to remove redundant single-qubit operations with the transpiler.Crucially, no additional calibration is needed to yield better results than a CNOT-based transpilation. This pulse-efficient circuit transpilation therefore enables a better usage of the finite coherence time without requiring knowledge of pulse-level details from the user. As demonstration, we realize a continuous family of cross-resonance-based gates for SU(4) by leveraging Cartan's decomposition. We measure the benefits of a pulse-efficient circuit transpilation with process tomography and observe up to a 50% error reduction in the fidelity of RZZ({\theta}) and arbitrary SU(4) gates on IBM Quantum devices.We apply this framework for quantum applications by running circuits of the Quantum Approximate Optimization Algorithm applied to MAXCUT. For an 11 qubit non-hardware native graph, our methodology reduces the overall schedule duration by up to 52% and errors by up to 38%

Related papers

• A Superconducting Qubit-Resonator Quantum Processor with Effective All-to-All Connectivity [44.72199649564072]
  This architecture can be used as a test-bed for algorithms that benefit from high connectivity.<n>We show that the central resonator can be used as a computational element.<n>We achieve a genuinely multi-qubit entangled Greenberger-Horne-Zeilinger (GHZ) state over all six qubits with a readout-error mitigated fidelity of $0.86$.
  arXiv  Detail & Related papers  (2025-03-13T21:36:18Z)
• SU(4) gate design via unitary process tomography: its application to cross-resonance based superconducting quantum devices [0.0]
  We present a novel approach for implementing pulse-efficient SU(4) gates on superconducting quantum devices. Our method introduces a parameterized unitary derived from the CR-Hamiltonian propagator, which accounts for static-$ZZ$ interactions. We evaluate the average fidelity and gate time of various SU(4) gates generated using the $R_ZZ(theta)$ to confirm the advantages of our implementation.
  arXiv  Detail & Related papers  (2025-03-12T12:39:53Z)
• Memory-optimised Cubic Splines for High-fidelity Quantum Operations [0.0]
  Radio-frequency pulses are widespread for the control of quantum bits and the execution of operations in quantum computers. The ability to tune key pulse parameters such as time-dependent amplitude, phase, and frequency is essential to achieve maximal gate fidelity and errors. As systems scale, a larger fraction of the control electronic processing will move closer to the qubits. This will constrain the space available in the memory of the control electronics to load time-resolved pulse parameters at high sampling rates.
  arXiv  Detail & Related papers  (2024-08-15T17:33:37Z)
• Realizing Scalable Conditional Operations through Auxiliary Energy Levels [12.939689760182203]
  We propose a transition composite gate scheme based on transition pathway engineering. We demonstrate the controlled-unitary (CU) family and its applications.
  arXiv  Detail & Related papers  (2024-07-09T09:01:04Z)
• FragQC: An Efficient Quantum Error Reduction Technique using Quantum Circuit Fragmentation [4.2754140179767415]
  We present it FragQC, a software tool that cuts a quantum circuit into sub-circuits when its error probability exceeds a certain threshold. We achieve an increase of fidelity by 14.83% compared to direct execution without cutting the circuit, and 8.45% over the state-of-the-art ILP-based method.
  arXiv  Detail & Related papers  (2023-09-30T17:38:31Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Toward Consistent High-fidelity Quantum Learning on Unstable Devices via Efficient In-situ Calibration [5.0854551390284]
  In the near-term noisy intermediate-scale quantum (NISQ) era, high noise will significantly reduce the fidelity of quantum computing. In this paper, we propose a novel quantum pulse-based noise adaptation framework, namely QuPAD. Experiments show that the runtime on quantum devices of QuPAD with 8-10 qubits is less than 15 minutes, which is up to 270x faster than the parameter-shift approach.
  arXiv  Detail & Related papers  (2023-09-12T15:39:06Z)
• Enhancing Dispersive Readout of Superconducting Qubits Through Dynamic Control of the Dispersive Shift: Experiment and Theory [47.00474212574662]
  A superconducting qubit is coupled to a large-bandwidth readout resonator. We show a beyond-state-of-the-art two-state-readout error of only 0.25,%$ in 100 ns integration time. The presented results are expected to further boost the performance of new and existing algorithms and protocols.
  arXiv  Detail & Related papers  (2023-07-15T10:30:10Z)
• Circuit Cutting with Non-Maximally Entangled States [59.11160990637615]
  Distributed quantum computing combines the computational power of multiple devices to overcome the limitations of individual devices. circuit cutting techniques enable the distribution of quantum computations through classical communication. Quantum teleportation allows the distribution of quantum computations without an exponential increase in shots. We propose a novel circuit cutting technique that leverages non-maximally entangled qubit pairs.
  arXiv  Detail & Related papers  (2023-06-21T08:03:34Z)
• Pulse-controlled qubit in semiconductor double quantum dots [57.916342809977785]
  We present a numerically-optimized multipulse framework for the quantum control of a single-electron charge qubit. A novel control scheme manipulates the qubit adiabatically, while also retaining high speed and ability to perform a general single-qubit rotation.
  arXiv  Detail & Related papers  (2023-03-08T19:00:02Z)
• Pulse-efficient quantum machine learning [0.0]
  We investigate the impact of pulse-efficient circuits on quantum machine learning algorithms. We find that pulse-efficient transpilation vastly reduces average circuit durations. We conclude by applying pulse-efficient transpilation to the Hamiltonian Variational Ansatz and show that it delays the onset of noise-induced barren plateaus.
  arXiv  Detail & Related papers  (2022-11-02T18:00:01Z)
• Suppression of crosstalk in superconducting qubits using dynamical decoupling [0.0]
  Super superconducting quantum processors with interconnected transmon qubits are noisy and prone to various errors. ZZ-coupling between qubits in fixed frequency transmon architectures is always present and contributes to both coherent and incoherent crosstalk errors. We propose the use of dynamical decoupling to suppress the crosstalk, and demonstrate the success of this scheme through experiments on several IBM quantum cloud processors.
  arXiv  Detail & Related papers  (2021-08-10T09:16:05Z)
• 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)
• 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.