Verifying commuting quantum computations via fidelity estimation of weighted graph states
The instantaneous quantum polynomial time (IQP) model is one of promising models to demonstrate a quantum computational advantage over classical computers. If the IQP model can be efficiently simulated by a classical computer, an unlikely consequence in computer science can be obtained (under some u...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IOP Publishing
2019-01-01
|
| Series: | New Journal of Physics |
| Subjects: | |
| Online Access: | https://doi.org/10.1088/1367-2630/ab3d88 |
| _version_ | 1797749966928609280 |
|---|---|
| author | Masahito Hayashi Yuki Takeuchi |
| author_facet | Masahito Hayashi Yuki Takeuchi |
| author_sort | Masahito Hayashi |
| collection | DOAJ |
| description | The instantaneous quantum polynomial time (IQP) model is one of promising models to demonstrate a quantum computational advantage over classical computers. If the IQP model can be efficiently simulated by a classical computer, an unlikely consequence in computer science can be obtained (under some unproven conjectures). In order to experimentally demonstrate the advantage using medium or large-scale IQP circuits, it is inevitable to efficiently verify whether the constructed IQP circuits faithfully work. There exist two types of IQP models, each of which is the sampling on hypergraph states or weighted graph states. For the first-type IQP model, polynomial-time verification protocols have already been proposed. In this paper, we propose verification protocols for the second-type IQP model. To this end, we propose polynomial-time fidelity estimation protocols of weighted graph states for each of the following four situations where a verifier can (i) choose any measurement basis and perform adaptive measurements, (ii) only choose restricted measurement bases and perform adaptive measurements, (iii) choose any measurement basis and only perform non-adaptive measurements, and (iv) only choose restricted measurement bases and only perform non-adaptive measurements. In all of our verification protocols, the verifier’s quantum operations are only single-qubit measurements. Since we assume no independent and identically distributed property on quantum states, our protocols work in any situation. |
| first_indexed | 2024-03-12T16:26:10Z |
| format | Article |
| id | doaj.art-1d4928bf3b794cd88be56d7ecdbcdcf6 |
| institution | Directory Open Access Journal |
| issn | 1367-2630 |
| language | English |
| last_indexed | 2024-03-12T16:26:10Z |
| publishDate | 2019-01-01 |
| publisher | IOP Publishing |
| record_format | Article |
| series | New Journal of Physics |
| spelling | doaj.art-1d4928bf3b794cd88be56d7ecdbcdcf62023-08-08T15:42:09ZengIOP PublishingNew Journal of Physics1367-26302019-01-0121909306010.1088/1367-2630/ab3d88Verifying commuting quantum computations via fidelity estimation of weighted graph statesMasahito Hayashi0https://orcid.org/0000-0003-3104-1000Yuki Takeuchi1Graduate School of Mathematics, Nagoya University , Nagoya, 464-8602, Japan; Shenzhen Institute for Quantum Science and Engineering, Southern University of Science and Technology , Shenzhen 518055, People’s Republic of China; Centre for Quantum Technologies, National University of Singapore , 3 Science Drive 2, 117542, SingaporeNTT Communication Science Laboratories, NTT Corporation, 3-1 Morinosato Wakamiya, Atsugi, Kanagawa 243-0198, JapanThe instantaneous quantum polynomial time (IQP) model is one of promising models to demonstrate a quantum computational advantage over classical computers. If the IQP model can be efficiently simulated by a classical computer, an unlikely consequence in computer science can be obtained (under some unproven conjectures). In order to experimentally demonstrate the advantage using medium or large-scale IQP circuits, it is inevitable to efficiently verify whether the constructed IQP circuits faithfully work. There exist two types of IQP models, each of which is the sampling on hypergraph states or weighted graph states. For the first-type IQP model, polynomial-time verification protocols have already been proposed. In this paper, we propose verification protocols for the second-type IQP model. To this end, we propose polynomial-time fidelity estimation protocols of weighted graph states for each of the following four situations where a verifier can (i) choose any measurement basis and perform adaptive measurements, (ii) only choose restricted measurement bases and perform adaptive measurements, (iii) choose any measurement basis and only perform non-adaptive measurements, and (iv) only choose restricted measurement bases and only perform non-adaptive measurements. In all of our verification protocols, the verifier’s quantum operations are only single-qubit measurements. Since we assume no independent and identically distributed property on quantum states, our protocols work in any situation.https://doi.org/10.1088/1367-2630/ab3d88weighted graph stateverificationinstantaneous quantum polynomial time (IQP) modelquantum supremacy |
| spellingShingle | Masahito Hayashi Yuki Takeuchi Verifying commuting quantum computations via fidelity estimation of weighted graph states New Journal of Physics weighted graph state verification instantaneous quantum polynomial time (IQP) model quantum supremacy |
| title | Verifying commuting quantum computations via fidelity estimation of weighted graph states |
| title_full | Verifying commuting quantum computations via fidelity estimation of weighted graph states |
| title_fullStr | Verifying commuting quantum computations via fidelity estimation of weighted graph states |
| title_full_unstemmed | Verifying commuting quantum computations via fidelity estimation of weighted graph states |
| title_short | Verifying commuting quantum computations via fidelity estimation of weighted graph states |
| title_sort | verifying commuting quantum computations via fidelity estimation of weighted graph states |
| topic | weighted graph state verification instantaneous quantum polynomial time (IQP) model quantum supremacy |
| url | https://doi.org/10.1088/1367-2630/ab3d88 |
| work_keys_str_mv | AT masahitohayashi verifyingcommutingquantumcomputationsviafidelityestimationofweightedgraphstates AT yukitakeuchi verifyingcommutingquantumcomputationsviafidelityestimationofweightedgraphstates |