Verifying BQP Computations on Noisy Devices with Minimal Overhead

Leichtle, Dominik; Music, Luka; Kashefi, Elham; Ollivier, H

doi:10.1103/prxquantum.2.040302

Cited by 19 publications

(45 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We consider the case where the network path is used to support an advanced quantum application, namely Verified Blind Quantum Computation (VBQC) [54], with a client located in Eindhoven and a powerful quantum-computing server located in Delft. Specifically, we consider the smallest instance of VBQC, where two entangled pairs are generated between the client and the server.…”

Section: Resultsmentioning

confidence: 99%

“…We show in Appendix B that this can be done through remote state preparation [55]. To set the requirements of our quantum-network path, we impose that its hardware must be good enough to execute VBQC with the largest acceptable error rate [54]. This demand can be translated to requirements on the fidelity and rate at which entanglement is produced.…”

Section: Resultsmentioning

confidence: 99%

“…We investigate hardware requirements on three processing nodes (two end nodes and one repeater node) so that a client in Eindhoven can perform 2-qubit VBQC, a particular case of the protocol described in [54], using the Delft server. In this protocol, the client prepares qubits at the server, which are then used to perform either computation or test rounds.…”

Section: B Blind Quantum Computationmentioning

confidence: 99%

See 2 more Smart Citations

Requirements for a processing-node quantum repeater on a real-world fiber grid

Avis¹,

Silva²,

Coopmans³

et al. 2022

Preprint

View full text Add to dashboard Cite

We numerically study the distribution of entanglement between the Dutch cities of Delft and Eindhoven realized with a processing-node quantum repeater and determine minimal hardware requirements for verified blind quantum computation using group-IV color centers and trapped ions. Our results are obtained considering restrictions imposed by a real-world fiber grid and using detailed hardware-specific models. By comparing our results to those we would obtain in idealized settings we show that simplifications lead to a distorted picture of hardware demands, particularly on memory coherence and photon collection. We develop general machinery suitable for studying arbitrary processing-node repeater chains using NetSquid, a discrete-event simulator for quantum networks. This enables us to include time-dependent noise models and simulate repeater protocols with cut-offs, including the required classical control communication. We find minimal hardware requirements by solving an optimization problem using genetic algorithms on a high-performancecomputing cluster. Our work provides guidance for further experimental progress, and showcases limitations of studying quantum-repeater requirements in idealized situations.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Resultsmentioning

confidence: 99%

Section: B Blind Quantum Computationmentioning

confidence: 99%

See 1 more Smart Citation

Requirements for a processing-node quantum repeater on a real-world fiber grid

Avis¹,

Silva²,

Coopmans³

et al. 2022

Preprint

View full text Add to dashboard Cite

show abstract

“…Prior to our work, as far as we know, only two types of verification methods were developed for NISQ computers [50,51,52]. Our method can estimate the fidelity between ideal and actual output states, unlike the methods in Refs.…”

Section: Introductionmentioning

confidence: 99%

“…The method in Refs. [52] achieves both verifiability and the security, i.e., it enables us to securely and verifiably delegate quantum computing to a remote server even if the server's quantum computer is noisy. Its error robustness is promising.…”

Section: Introductionmentioning

confidence: 99%

Divide-and-conquer verification method for noisy intermediate-scale quantum computation

Takeuchi¹,

Takahashi

Morimae

et al. 2022

Quantum

View full text Add to dashboard Cite

Several noisy intermediate-scale quantum computations can be regarded as logarithmic-depth quantum circuits on a sparse quantum computing chip, where two-qubit gates can be directly applied on only some pairs of qubits. In this paper, we propose a method to efficiently verify such noisy intermediate-scale quantum computation. To this end, we first characterize small-scale quantum operations with respect to the diamond norm. Then by using these characterized quantum operations, we estimate the fidelity ⟨ψt|ρ^out|ψt⟩ between an actual n-qubit output state ρ^out obtained from the noisy intermediate-scale quantum computation and the ideal output state (i.e., the target state) |ψt⟩. Although the direct fidelity estimation method requires O(2n) copies of ρ^out on average, our method requires only O(D3212D) copies even in the worst case, where D is the denseness of |ψt⟩. For logarithmic-depth quantum circuits on a sparse chip, D is at most O(log⁡n), and thus O(D3212D) is a polynomial in n. By using the IBM Manila 5-qubit chip, we also perform a proof-of-principle experiment to observe the practical performance of our method.

show abstract