Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Conference on Quantum Computing and Engineering (QCE)

Estimating Fidelity Lower Bounds of Quantum Subroutines

Karl Mayer, Charlie Baldwin

Published Sep 17, 2023• 0 citations
Publisher

Abstract

We define scalable benchmarks for two important quantum subroutines, namely the quantum Fourier transform (QFT) and the multi-controlled-Z gate. Our benchmarks are based on applying the subroutines to a set of states that are sufficient for lower-bounding the process fidelity from the set of measured output state fidelities. By randomly sampling from the set of input states, the lower boundonthe process fidelity can be estimated. We implement the QFT and multi-controlled-Z circuits with up to 20 and 12 qubits, respectively, on the Quantinuum H1-1 quantum computer. Our circuits make use of parameterized-angle entangling gates, which for these circuits reduces the number of two-qubit gates significantly.

DOI
10.1109/qce57702.2023.10287

Related papers

Scalable Experimental Bounds for Entangled Quantum State Fidelities

Shamminuj Aktar, Andreas Bärtschi, Abdel‐Hameed A. Badawy +1 more

Estimating the state preparation fidelity of highly entangled states on noisy intermediate-scale quantum (NISQ) devices is important for benchmarking and application considerations. Unfortunately, exact fidelity measurements quickly become prohibitively expensive, as they scale exponentially as O (3 N for N -qubit states, using full state tomography with measurements in all Pauli bases combinations. However, Somma et al.established that the complexity could be drastically reduced when looking at fidelity lower bounds for states that exhibit symmetries, such as Dicke states and GHZ states. These bounds must still be tight enough for larger states to provide reasonable estimations on NISQ devices. For the first time and more than 15 years after the theoretical introduction, we report meaningful lower bounds for the state preparation fidelity of all Dicke states up to N =10 and all GHZ states up to N =20 on Quantinuum H1 ion-trap systems using efficient implementations of recently proposed scalable circuits for these states. Our achieved lower bounds match or exceed previously reported exact fidelities on superconducting systems for much smaller states. Furthermore, we provide evidence that for large Dicke states \(\left|\smash{D_{N/2}^{N}} \right\rangle\) , we may resort to a GHZ-based approximate state preparation to achieve better fidelity. This work provides a path forward to benchmarking entanglement as NISQ devices improve in size and quality.

arXiv:2210.03048•ACM Transactions on Quantum Computing•Nov 11, 2024•1 citation

Efficient Experimental Estimation of Fidelity of Linear Optical Quantum Toffoli Gate

Michal Mičuda, Michal Sedlák, Ivo Straka +4 more

We propose an efficiently measurable lower bound on quantum process fidelity of N-qubit controlled-Z gates. This bound is determined by average output state fidelities for N partially conjugate product bases. A distinct advantage of our approach is that only fidelities with product states need to be measured while keeping the total number of measurements much smaller than what is necessary for full quantum process tomography. As an application, we use this method to experimentally estimate quantum process fidelity F of a three-qubit linear optical quantum Toffoli gate and we find that F≥0.83. We also demonstrate the entangling capability of the gate by preparing Greenberger-Horne-Zeilinger-type three-qubit entangled states from input product states.

arXiv:1306.1141•Physical Review Letters•Oct 17, 2013•64 citations

Scalable fast benchmarking for individual quantum gates with local twirling

Yihong Zhang, Wenjun Yu, Pei Zeng +2 more

With the development of controllable quantum systems, fast and practical characterization of multi-qubit gates has become essential for building high-fidelity quantum computing devices. The usual way to fulfill this requirement via randomized benchmarking demands complicated implementation of numerous multi-qubit twirling gates. How to efficiently and reliably estimate the fidelity of a quantum process remains an open problem. This work thus proposes a character-cycle benchmarking protocol and a character-average benchmarking protocol using only local twirling gates to estimate the process fidelity of an individual multi-qubit operation. Our protocols were able to characterize a large class of quantum gates including and beyond the Clifford group via the local gauge transformation, which forms a universal gate set for quantum computing. We demonstrated numerically our protocols for a non-Clifford gate—controlled- ( T X ) and a Clifford gate—five-qubit quantum error-correcting encoding circuit. The numerical results show that our protocols can efficiently and reliably characterize the gate process fidelities. Compared with the cross-entropy benchmarking, the simulation results show that the character-average benchmarking achieves three orders of magnitude improvements in terms of sampling complexity.

arXiv:2203.10320•Photonics Research•Oct 28, 2022•5 citations

Bounds on quantum process fidelity from minimum required number of quantum state fidelity measurements

Jaromı́r Fiurášek, Michal Sedlák

To certify that an experimentally implemented quantum transformation is a certain unitary operation $U$ on a $d$-dimensional Hilbert space, it suffices to determine fidelities of output states for $d+1$ suitably chosen pure input states [Reich et al., Phys. Rev. A 88, 042309 (2013)]. The set of these $d+1$ probe states can consist of $d$ orthogonal states that form a basis and one additional state which is a balanced superposition of all $d$ basis states. Here we provide an analytical lower bound on quantum process fidelity for two-qubit quantum gates which results from the knowledge of average state fidelity for the basis states and the fidelity of the superposition state. We compare this bound with the Hofmann bound that is based on knowledge of average state fidelities for two mutually unbiased bases. We also discuss the possible extension of our findings to $N$-qubit operations.

arXiv:1401.5964•Physical Review A•Jan 22, 2014•7 citations

Benchmarking multi-qubit gates -- I: Metrological aspects

Bharath Hebbe Madhusudhana

Accurate and precise control of large quantum systems is paramount to achieve practical advantages on quantum devices. Therefore, benchmarking the hardware errors in quantum computers has drawn significant attention lately. Existing benchmarks for digital quantum computers involve averaging the global fidelity over a large set of quantum circuits and are therefore unsuitable for specific multi-qubit gates used in analog quantum operations. Moreover, average global fidelity is not the optimal figure-of-merit for some of the applications specific to multi-qubit gates and analog devices , such as the study of many-body physics, which often use local observables. In this two-part paper, we develop a new figure-of-merit suitable for multi-qubit quantum gates based on the reduced Choi matrix of the operation. In the first part, we develop an efficient, scalable protocol to completely characterize the reduced Choi matrix. We identify two sources of sampling errors in measurements of the reduced Choi matrix and we show that there are fundamental limits to the rate of convergence of the sampling errors, analogous to the standard quantum limit and Heisenberg limit. A slow convergence rate of sampling errors would mean that we need a large number of experimental shots. We develop protocols using quantum information scrambling, which has been observed in disordered systems for e.g., to speed up the rate of convergence of the sampling error at state preparation Moreover, we develop protocols using squeezed and entangled initial states to enhance the convergence rate of the sampling error at measurement, which results in a metrologically enhanced reduced process tomography protocol.

arXiv:2210.04330•Oct 9, 2022•0 citations

A quantum hamiltonian simulation benchmark

Yulong Dong, K. Birgitta Whaley, Lin Lin

Abstract Hamiltonian simulation is one of the most important problems in quantum computation, and quantum singular value transformation (QSVT) is an efficient way to simulate a general class of Hamiltonians. However, the QSVT circuit typically involves multiple ancilla qubits and multi-qubit control gates. In order to simulate a certain class of n -qubit random Hamiltonians, we propose a drastically simplified quantum circuit that we refer to as the minimal QSVT circuit, which uses only one ancilla qubit and no multi-qubit controlled gates. We formulate a simple metric called the quantum unitary evolution score (QUES), which is a scalable quantum benchmark and can be verified without any need for classical computation. Under the globally depolarized noise model, we demonstrate that QUES is directly related to the circuit fidelity, and the potential classical hardness of an associated quantum circuit sampling problem. Under the same assumption, theoretical analysis suggests there exists an ‘optimal’ simulation time t opt ≈ 4.81, at which even a noisy quantum device may be sufficient to demonstrate the potential classical hardness.

arXiv:2108.03747•npj Quantum Information•Nov 9, 2022•24 citations
We define scalable benchmarks for two important quantum subroutines, namely the quantum Fourier transform (QFT) and the multi-controlled-Z gate. Our benchmarks are based on applying the subroutines to a set of states that are sufficient for lower-bounding the process fidelity from the set of measured output state fidelities. By randomly sampling from the set of input states, the lower boundonthe process fidelity can be estimated. We implement the QFT and multi-controlled-Z circuits with up to 20 and 12 qubits, respectively, on the Quantinuum H1-1 quantum computer. Our circuits make use of parameterized-angle entangling gates, which for these circuits reduces the number of two-qubit gates significantly.
Estimating the state preparation fidelity of highly entangled states on noisy intermediate-scale quantum (NISQ) devices is important for benchmarking and application considerations. Unfortunately, exact fidelity measurements quickly become prohibitively expensive, as they scale exponentially as O (3 N for N -qubit states, using full state tomography with measurements in all Pauli bases combinations. However, Somma et al.established that the complexity could be drastically reduced when looking at fidelity lower bounds for states that exhibit symmetries, such as Dicke states and GHZ states. These bounds must still be tight enough for larger states to provide reasonable estimations on NISQ devices. For the first time and more than 15 years after the theoretical introduction, we report meaningful lower bounds for the state preparation fidelity of all Dicke states up to N =10 and all GHZ states up to N =20 on Quantinuum H1 ion-trap systems using efficient implementations of recently proposed scalable circuits for these states. Our achieved lower bounds match or exceed previously reported exact fidelities on superconducting systems for much smaller states. Furthermore, we provide evidence that for large Dicke states ∣DN/2N⟩\left|\smash{D_{N/2}^{N}} \right\rangle∣DN/2N​⟩ , we may resort to a GHZ-based approximate state preparation to achieve better fidelity. This work provides a path forward to benchmarking entanglement as NISQ devices improve in size and quality.
We propose an efficiently measurable lower bound on quantum process fidelity of N-qubit controlled-Z gates. This bound is determined by average output state fidelities for N partially conjugate product bases. A distinct advantage of our approach is that only fidelities with product states need to be measured while keeping the total number of measurements much smaller than what is necessary for full quantum process tomography. As an application, we use this method to experimentally estimate quantum process fidelity F of a three-qubit linear optical quantum Toffoli gate and we find that F≥0.83. We also demonstrate the entangling capability of the gate by preparing Greenberger-Horne-Zeilinger-type three-qubit entangled states from input product states.
With the development of controllable quantum systems, fast and practical characterization of multi-qubit gates has become essential for building high-fidelity quantum computing devices. The usual way to fulfill this requirement via randomized benchmarking demands complicated implementation of numerous multi-qubit twirling gates. How to efficiently and reliably estimate the fidelity of a quantum process remains an open problem. This work thus proposes a character-cycle benchmarking protocol and a character-average benchmarking protocol using only local twirling gates to estimate the process fidelity of an individual multi-qubit operation. Our protocols were able to characterize a large class of quantum gates including and beyond the Clifford group via the local gauge transformation, which forms a universal gate set for quantum computing. We demonstrated numerically our protocols for a non-Clifford gate—controlled- ( T X ) and a Clifford gate—five-qubit quantum error-correcting encoding circuit. The numerical results show that our protocols can efficiently and reliably characterize the gate process fidelities. Compared with the cross-entropy benchmarking, the simulation results show that the character-average benchmarking achieves three orders of magnitude improvements in terms of sampling complexity.
To certify that an experimentally implemented quantum transformation is a certain unitary operation UUU on a ddd-dimensional Hilbert space, it suffices to determine fidelities of output states for d+1d+1d+1 suitably chosen pure input states [Reich et al., Phys. Rev. A 88, 042309 (2013)]. The set of these d+1d+1d+1 probe states can consist of ddd orthogonal states that form a basis and one additional state which is a balanced superposition of all ddd basis states. Here we provide an analytical lower bound on quantum process fidelity for two-qubit quantum gates which results from the knowledge of average state fidelity for the basis states and the fidelity of the superposition state. We compare this bound with the Hofmann bound that is based on knowledge of average state fidelities for two mutually unbiased bases. We also discuss the possible extension of our findings to NNN-qubit operations.
Accurate and precise control of large quantum systems is paramount to achieve practical advantages on quantum devices. Therefore, benchmarking the hardware errors in quantum computers has drawn significant attention lately. Existing benchmarks for digital quantum computers involve averaging the global fidelity over a large set of quantum circuits and are therefore unsuitable for specific multi-qubit gates used in analog quantum operations. Moreover, average global fidelity is not the optimal figure-of-merit for some of the applications specific to multi-qubit gates and analog devices , such as the study of many-body physics, which often use local observables. In this two-part paper, we develop a new figure-of-merit suitable for multi-qubit quantum gates based on the reduced Choi matrix of the operation. In the first part, we develop an efficient, scalable protocol to completely characterize the reduced Choi matrix. We identify two sources of sampling errors in measurements of the reduced Choi matrix and we show that there are fundamental limits to the rate of convergence of the sampling errors, analogous to the standard quantum limit and Heisenberg limit. A slow convergence rate of sampling errors would mean that we need a large number of experimental shots. We develop protocols using quantum information scrambling, which has been observed in disordered systems for e.g., to speed up the rate of convergence of the sampling error at state preparation Moreover, we develop protocols using squeezed and entangled initial states to enhance the convergence rate of the sampling error at measurement, which results in a metrologically enhanced reduced process tomography protocol.
Abstract Hamiltonian simulation is one of the most important problems in quantum computation, and quantum singular value transformation (QSVT) is an efficient way to simulate a general class of Hamiltonians. However, the QSVT circuit typically involves multiple ancilla qubits and multi-qubit control gates. In order to simulate a certain class of n -qubit random Hamiltonians, we propose a drastically simplified quantum circuit that we refer to as the minimal QSVT circuit, which uses only one ancilla qubit and no multi-qubit controlled gates. We formulate a simple metric called the quantum unitary evolution score (QUES), which is a scalable quantum benchmark and can be verified without any need for classical computation. Under the globally depolarized noise model, we demonstrate that QUES is directly related to the circuit fidelity, and the potential classical hardness of an associated quantum circuit sampling problem. Under the same assumption, theoretical analysis suggests there exists an ‘optimal’ simulation time t opt ≈ 4.81, at which even a noisy quantum device may be sufficient to demonstrate the potential classical hardness.