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

arXiv:2107.13466 · Physical Review A

Proof-of-principle experimental demonstration of quantum gate verification

Maolin Luo, Xiaoqian Zhang, Xiaoqi Zhou

Published Jan 31, 2022• 5 citations
arXivHTMLPDF

Abstract

To employ a quantum device, the performance of the quantum gates in the device needs to be evaluated first. Since the dimensionality of a quantum gate grows exponentially with the number of qubits, evaluating the performance of a quantum gate is a challenging task. Recently, a scheme called quantum gate verification (QGV) has been proposed, which can verifies quantum gates with near-optimal efficiency. In this paper, we implement a proof-of-principle optical experiment to demonstrate this QGV scheme. We show that for a single-qubit quantum gate, only $\ensuremath{\sim}300$ samples are needed to confirm the fidelity of the quantum gate to be, at least, 97% with a 99% confidence level using the QGV method, whereas, at least, $\ensuremath{\sim}3000$ samples are needed to achieve the same result using the standard quantum process tomography method. The QGV method validated by this paper has the potential to be widely used for the evaluation of quantum devices in various quantum information applications.

DOI
10.1103/physreva.105.012614

Related papers

Efficient Experimental Verification of Quantum Gates with Local Operations

Rui-Qi Zhang, Zhibo Hou, Jun-Feng Tang +5 more

Verifying the correct functioning of quantum gates is a crucial step toward reliable quantum information processing, but it becomes an overwhelming challenge as the system size grows due to the dimensionality curse. Recent theoretical breakthroughs show that it is possible to verify various important quantum gates with the optimal sample complexity of O(1/ε) using local operations only, where ε is the estimation precision. In this Letter, we propose a variant of quantum gate verification (QGV) that is robust to practical gate imperfections and experimentally realize efficient QGV on a 2-qubit controlled-not gate and a 3-qubit Toffoli gate using only local state preparations and measurements. The experimental results show that, by using only 1600 and 2600 measurements on average, we can verify with 95% confidence level that the implemented controlled-not gate and Toffoli gate have fidelities of at least 99% and 97%, respectively. Demonstrating the superior low sample complexity and experimental feasibility of QGV, our work promises a solution to the dimensionality curse in verifying large quantum devices in the quantum era.

arXiv:2107.02365•Physical Review Letters•Jan 14, 2022•7 citations

Efficient verification of quantum processes

Ye‐Chao Liu, Jiangwei Shang, Xiao‐Dong Yu +1 more

Quantum processes, such as quantum circuits, quantum memories, and quantum channels, are essential ingredients in almost all quantum information processing tasks. However, the characterization of these processes remains a daunting task due to the exponentially increasing amount of resources required by traditional methods. Here, by first proposing the concept of quantum process verification, we establish two efficient and practical protocols for verifying quantum processes which can provide an exponential improvement over the standard quantum process tomography and a quadratic improvement over the method of direct fidelity estimation. The efficacy of our protocols is illustrated with the verification of various quantum gates as well as the processes of well-known quantum circuits. Moreover, our protocols are readily applicable with current experimental techniques since only local measurements are required. In addition, we show that our protocols for verifying quantum processes can be easily adapted to verify quantum measurements.

arXiv:1910.13730•Physical Review A•Apr 15, 2020•30 citations

Towards experimental classical verification of quantum computation

Roman Stricker, Jose Carrasco, Martin Ringbauer +8 more

Abstract With today’s quantum processors venturing into regimes beyond the capabilities of classical devices, we face the challenge to verify that these devices perform as intended, even when we cannot check their results on classical computers. In a recent breakthrough in computer science, a protocol was developed that allows the verification of the output of a computation performed by an untrusted quantum device based only on classical resources. Here, we follow these ideas, and demonstrate in a first, proof-of-principle experiment the verification of the output of a quantum computation using only classical means on a small trapped-ion quantum processor. We contrast this to verification protocols, which require trust and detailed hardware knowledge, as in gate-level benchmarking, or additional quantum resources in case we do not have access to or trust in the device to be tested. While our experimental demonstration uses a simplified version of Mahadev’s protocol we demonstrate the necessary steps for verifying fully untrusted devices. A scaled-up version of our protocol will allow for classical verification, requiring no hardware access or detailed knowledge of the tested device. Its security relies on post–quantum secure trapdoor functions within an interactive proof. The conceptually straightforward, but technologically challenging scaled-up version of the interactive proofs, considered here, can be used for a variety of additional tasks such as verifying quantum advantage, generating and certifying quantum randomness, or composable remote state preparation.

arXiv:2203.07395•Quantum Science and Technology•Feb 14, 2024•1 citation

Quantum Science and Technology / Towards experimental classical verification of quantum computation

Roman Stricker, José A. Carrasco, Martin Ringbauer +8 more

With today’s quantum processors venturing into regimes beyond the capabilities of classical devices, we face the challenge to verify that these devices perform as intended, even when we cannot check their results on classical computers. In a recent breakthrough in computer science, a protocol was developed that allows the verification of the output of a computation performed by an untrusted quantum device based only on classical resources. Here, we follow these ideas, and demonstrate in a first, proof-of-principle experiment the verification of the output of a quantum computation using only classical means on a small trapped-ion quantum processor. We contrast this to verification protocols, which require trust and detailed hardware knowledge, as in gate-level benchmarking, or additional quantum resources in case we do not have access to or trust in the device to be tested. While our experimental demonstration uses a simplified version of Mahadev’s protocol we demonstrate the necessary steps for verifying fully untrusted devices. A scaled-up version of our protocol will allow for classical verification, requiring no hardware access or detailed knowledge of the tested device. Its security relies on post–quantum secure trapdoor functions within an interactive proof. The conceptually straightforward, but technologically challenging scaled-up version of the interactive proofs, considered here, can be used for a variety of additional tasks such as verifying quantum advantage, generating and certifying quantum randomness, or composable remote state preparation.

•Jan 1, 2024•3 citations

Measurement-device-independent verification of quantum states

Xin-Yu Xu, Yi-Zheng Zhen, Qing Fa Zhou +6 more

Efficient and reliable verification of quantum states is central to quantum information processing applications. If using well-characterized measurement devices, effective methods have been developed for quantum state verification (QSV). In reality, however, measurement devices are generally imperfect or untrusted, which limits significantly the application of standard QSV protocols. Here, we propose the measurement-device-independent QSV (MDI-QSV) scheme for practice. With the help of trusted quantum inputs, we have developed a systematical approach to design MDI-QSV strategies for an arbitrary pure target state. We find that the number of required measurements has an optimal scaling with required accuracy and confidence level, similar to the standard QSV where trusted measurement devices are available. Our results offer a sample-efficient and realistic method for quantum state verification with virtues of a measurement-device-independent manner, and are within reach of current technology.

Physical Review A•May 6, 2024•0 citations

A quantum Fredkin gate (Conference Presentation)

Raj B. Patel, Joseph Ho, Franck Ferreyrol +2 more

One of the greatest challenges in modern science is the realisation of quantum computers which, as their scale increases, will allow enhanced performance of tasks across many areas of quantum information processing. Quantum logic gates play a vital role in realising these applications by carrying out the elementary operations on the qubits; a key aim is minimising the resources needed to build these gates into useful circuits. While the salient features of a quantum computer have been shown in proof-of-principle experiments, e.g., single- and two-qubit gates, difficulties in scaling quantum systems to encode and manipulate multiple qubits has hindered demonstrations of more complex operations. This is exemplified by the classical Fredkin (or controlled-SWAP) gate [1] for which, despite many theoretical proposals [2,3] relying on concatenating multiple two-qubit gates, a quantum analogue has yet to be realised. Here, by directly adding control to a two-qubit SWAP unitary [4], we use photonic qubit logic to report the first experimental demonstration of a quantum Fredkin gate [5]. Our scheme uses linear optics and improves on the overall probability of success by an order of magnitude over previous proposals [2,3]. This optical approach allows us to add control an arbitrary black-box unitary which is otherwise forbidden in the standard circuit model [6]. Additionally, the action of our gate exhibits quantum coherence allowing the generation of the highest fidelity three-photon GHZ states to date. The quantum Fredkin gate has many applications in quantum computing, quantum measurements [7] and cryptography [8,9]. Using our scheme, we apply the Fredkin gate to the task of direct measurements of the purity and state overlap of a quantum system [7] without recourse to quantum state tomography.

•Dec 7, 2016•0 citations
To employ a quantum device, the performance of the quantum gates in the device needs to be evaluated first. Since the dimensionality of a quantum gate grows exponentially with the number of qubits, evaluating the performance of a quantum gate is a challenging task. Recently, a scheme called quantum gate verification (QGV) has been proposed, which can verifies quantum gates with near-optimal efficiency. In this paper, we implement a proof-of-principle optical experiment to demonstrate this QGV scheme. We show that for a single-qubit quantum gate, only \ensuremath∼300\ensuremath{\sim}300\ensuremath∼300 samples are needed to confirm the fidelity of the quantum gate to be, at least, 97% with a 99% confidence level using the QGV method, whereas, at least, \ensuremath∼3000\ensuremath{\sim}3000\ensuremath∼3000 samples are needed to achieve the same result using the standard quantum process tomography method. The QGV method validated by this paper has the potential to be widely used for the evaluation of quantum devices in various quantum information applications.
Verifying the correct functioning of quantum gates is a crucial step toward reliable quantum information processing, but it becomes an overwhelming challenge as the system size grows due to the dimensionality curse. Recent theoretical breakthroughs show that it is possible to verify various important quantum gates with the optimal sample complexity of O(1/ε) using local operations only, where ε is the estimation precision. In this Letter, we propose a variant of quantum gate verification (QGV) that is robust to practical gate imperfections and experimentally realize efficient QGV on a 2-qubit controlled-not gate and a 3-qubit Toffoli gate using only local state preparations and measurements. The experimental results show that, by using only 1600 and 2600 measurements on average, we can verify with 95% confidence level that the implemented controlled-not gate and Toffoli gate have fidelities of at least 99% and 97%, respectively. Demonstrating the superior low sample complexity and experimental feasibility of QGV, our work promises a solution to the dimensionality curse in verifying large quantum devices in the quantum era.
Quantum processes, such as quantum circuits, quantum memories, and quantum channels, are essential ingredients in almost all quantum information processing tasks. However, the characterization of these processes remains a daunting task due to the exponentially increasing amount of resources required by traditional methods. Here, by first proposing the concept of quantum process verification, we establish two efficient and practical protocols for verifying quantum processes which can provide an exponential improvement over the standard quantum process tomography and a quadratic improvement over the method of direct fidelity estimation. The efficacy of our protocols is illustrated with the verification of various quantum gates as well as the processes of well-known quantum circuits. Moreover, our protocols are readily applicable with current experimental techniques since only local measurements are required. In addition, we show that our protocols for verifying quantum processes can be easily adapted to verify quantum measurements.
Abstract With today’s quantum processors venturing into regimes beyond the capabilities of classical devices, we face the challenge to verify that these devices perform as intended, even when we cannot check their results on classical computers. In a recent breakthrough in computer science, a protocol was developed that allows the verification of the output of a computation performed by an untrusted quantum device based only on classical resources. Here, we follow these ideas, and demonstrate in a first, proof-of-principle experiment the verification of the output of a quantum computation using only classical means on a small trapped-ion quantum processor. We contrast this to verification protocols, which require trust and detailed hardware knowledge, as in gate-level benchmarking, or additional quantum resources in case we do not have access to or trust in the device to be tested. While our experimental demonstration uses a simplified version of Mahadev’s protocol we demonstrate the necessary steps for verifying fully untrusted devices. A scaled-up version of our protocol will allow for classical verification, requiring no hardware access or detailed knowledge of the tested device. Its security relies on post–quantum secure trapdoor functions within an interactive proof. The conceptually straightforward, but technologically challenging scaled-up version of the interactive proofs, considered here, can be used for a variety of additional tasks such as verifying quantum advantage, generating and certifying quantum randomness, or composable remote state preparation.
With today’s quantum processors venturing into regimes beyond the capabilities of classical devices, we face the challenge to verify that these devices perform as intended, even when we cannot check their results on classical computers. In a recent breakthrough in computer science, a protocol was developed that allows the verification of the output of a computation performed by an untrusted quantum device based only on classical resources. Here, we follow these ideas, and demonstrate in a first, proof-of-principle experiment the verification of the output of a quantum computation using only classical means on a small trapped-ion quantum processor. We contrast this to verification protocols, which require trust and detailed hardware knowledge, as in gate-level benchmarking, or additional quantum resources in case we do not have access to or trust in the device to be tested. While our experimental demonstration uses a simplified version of Mahadev’s protocol we demonstrate the necessary steps for verifying fully untrusted devices. A scaled-up version of our protocol will allow for classical verification, requiring no hardware access or detailed knowledge of the tested device. Its security relies on post–quantum secure trapdoor functions within an interactive proof. The conceptually straightforward, but technologically challenging scaled-up version of the interactive proofs, considered here, can be used for a variety of additional tasks such as verifying quantum advantage, generating and certifying quantum randomness, or composable remote state preparation.
Efficient and reliable verification of quantum states is central to quantum information processing applications. If using well-characterized measurement devices, effective methods have been developed for quantum state verification (QSV). In reality, however, measurement devices are generally imperfect or untrusted, which limits significantly the application of standard QSV protocols. Here, we propose the measurement-device-independent QSV (MDI-QSV) scheme for practice. With the help of trusted quantum inputs, we have developed a systematical approach to design MDI-QSV strategies for an arbitrary pure target state. We find that the number of required measurements has an optimal scaling with required accuracy and confidence level, similar to the standard QSV where trusted measurement devices are available. Our results offer a sample-efficient and realistic method for quantum state verification with virtues of a measurement-device-independent manner, and are within reach of current technology.
One of the greatest challenges in modern science is the realisation of quantum computers which, as their scale increases, will allow enhanced performance of tasks across many areas of quantum information processing. Quantum logic gates play a vital role in realising these applications by carrying out the elementary operations on the qubits; a key aim is minimising the resources needed to build these gates into useful circuits. While the salient features of a quantum computer have been shown in proof-of-principle experiments, e.g., single- and two-qubit gates, difficulties in scaling quantum systems to encode and manipulate multiple qubits has hindered demonstrations of more complex operations. This is exemplified by the classical Fredkin (or controlled-SWAP) gate [1] for which, despite many theoretical proposals [2,3] relying on concatenating multiple two-qubit gates, a quantum analogue has yet to be realised. Here, by directly adding control to a two-qubit SWAP unitary [4], we use photonic qubit logic to report the first experimental demonstration of a quantum Fredkin gate [5]. Our scheme uses linear optics and improves on the overall probability of success by an order of magnitude over previous proposals [2,3]. This optical approach allows us to add control an arbitrary black-box unitary which is otherwise forbidden in the standard circuit model [6]. Additionally, the action of our gate exhibits quantum coherence allowing the generation of the highest fidelity three-photon GHZ states to date. The quantum Fredkin gate has many applications in quantum computing, quantum measurements [7] and cryptography [8,9]. Using our scheme, we apply the Fredkin gate to the task of direct measurements of the purity and state overlap of a quantum system [7] without recourse to quantum state tomography.