Towards Efficient Verification of Computation in Quantum Devices Article Swipe

PDF

Peng Yan , Nengkun Yu ·

YOU? · · 2025 · Open Access · · DOI: https://doi.org/10.48550/arxiv.2508.00262

Designing quantum processors is a complex task that demands advanced verification methods to ensure their correct functionality. However, traditional methods of comprehensively verifying quantum devices, such as quantum process tomography, face significant limitations because of the exponential growth in computational resources. These limitations arise from treating the system as a black box and ignoring its design structure. Consequently, new testing methods must be developed considering the design structure. In this paper, we investigate the structure of computations on the hardware, focusing on the layered interruptible quantum circuit model and designing a scalable algorithm to verify it comprehensively. Specifically, for a given quantum hardware that claims to process an unknown $n$ qubit $d$ layer circuit via a finite set of quantum gates, our method completely reconstructs the circuits within a time complexity of $O(d^2 t \log (n/δ))$, guaranteeing success with a probability of at least $1-δ$. Here, $t$ represents the maximum execution time for each circuit layer. Our approach significantly reduces execution time for completely verifying computations in quantum devices, achieving double logarithmic scaling in the problem size. Furthermore, we validate our algorithm through experiments using IBM's quantum cloud service, demonstrating its potential applicability in the noisy intermediate-scale quantum era.

Related Topics

Concepts

No concepts available.

Metadata

Type: preprint
Language: en
Landing Page: http://arxiv.org/abs/2508.00262
PDF: https://arxiv.org/pdf/2508.00262
OA Status: green
OpenAlex ID: https://openalex.org/W4416548626

All OpenAlex metadata

Raw OpenAlex JSON

OpenAlex ID: https://openalex.org/W4416548626

Canonical identifier for this work in OpenAlex
DOI: https://doi.org/10.48550/arxiv.2508.00262

Digital Object Identifier
Title: Towards Efficient Verification of Computation in Quantum Devices

Work title
Type: preprint

OpenAlex work type
Language: en

Primary language
Publication year: 2025

Year of publication
Publication date: 2025-08-01

Full publication date if available
Authors: Peng Yan, Nengkun Yu

List of authors in order
Landing page: https://arxiv.org/abs/2508.00262

Publisher landing page
PDF URL: https://arxiv.org/pdf/2508.00262

Direct link to full text PDF
Open access: Yes

Whether a free full text is available
OA status: green

Open access status per OpenAlex
OA URL: https://arxiv.org/pdf/2508.00262

Direct OA link when available
Cited by: 0

Total citation count in OpenAlex

Full payload

id	https://openalex.org/W4416548626
doi	https://doi.org/10.48550/arxiv.2508.00262
ids.doi	https://doi.org/10.48550/arxiv.2508.00262
ids.openalex	https://openalex.org/W4416548626
fwci
type	preprint
title	Towards Efficient Verification of Computation in Quantum Devices
biblio.issue
biblio.volume
biblio.last_page
biblio.first_page
is_xpac	False
apc_list
apc_paid
language	en
locations[0].id	pmh:oai:arXiv.org:2508.00262
locations[0].is_oa	True
locations[0].source.id	https://openalex.org/S4306400194
locations[0].source.issn
locations[0].source.type	repository
locations[0].source.is_oa	True
locations[0].source.issn_l
locations[0].source.is_core	False
locations[0].source.is_in_doaj	False
locations[0].source.display_name	arXiv (Cornell University)
locations[0].source.host_organization	https://openalex.org/I205783295
locations[0].source.host_organization_name	Cornell University
locations[0].source.host_organization_lineage	https://openalex.org/I205783295
locations[0].license
locations[0].pdf_url	https://arxiv.org/pdf/2508.00262
locations[0].version	submittedVersion
locations[0].raw_type	text
locations[0].license_id
locations[0].is_accepted	False
locations[0].is_published	False
locations[0].raw_source_name
locations[0].landing_page_url	http://arxiv.org/abs/2508.00262
locations[1].id	doi:10.48550/arxiv.2508.00262
locations[1].is_oa	True
locations[1].source.id	https://openalex.org/S4306400194
locations[1].source.issn
locations[1].source.type	repository
locations[1].source.is_oa	True
locations[1].source.issn_l
locations[1].source.is_core	False
locations[1].source.is_in_doaj	False
locations[1].source.display_name	arXiv (Cornell University)
locations[1].source.host_organization	https://openalex.org/I205783295
locations[1].source.host_organization_name	Cornell University
locations[1].source.host_organization_lineage	https://openalex.org/I205783295
locations[1].license
locations[1].pdf_url
locations[1].version
locations[1].raw_type	article
locations[1].license_id
locations[1].is_accepted	False
locations[1].is_published
locations[1].raw_source_name
locations[1].landing_page_url	https://doi.org/10.48550/arxiv.2508.00262
indexed_in	arxiv, datacite
authorships[0].author.id	https://openalex.org/A5100318729
authorships[0].author.orcid	https://orcid.org/0000-0003-2930-7447
authorships[0].author.display_name	Peng Yan
authorships[0].author_position	last
authorships[0].raw_author_name	Yan, Peng
authorships[0].is_corresponding	False
authorships[1].author.id	https://openalex.org/A5088217238
authorships[1].author.orcid	https://orcid.org/0000-0003-1188-3032
authorships[1].author.display_name	Nengkun Yu
authorships[1].author_position	middle
authorships[1].raw_author_name	Yu, Nengkun
authorships[1].is_corresponding	False
has_content.pdf	False
has_content.grobid_xml	False
is_paratext	False
open_access.is_oa	True
open_access.oa_url	https://arxiv.org/pdf/2508.00262
open_access.oa_status	green
open_access.any_repository_has_fulltext	False
created_date	2025-10-10T00:00:00
display_name	Towards Efficient Verification of Computation in Quantum Devices
has_fulltext	False
is_retracted	False
updated_date	2025-11-28T17:05:49.561351
primary_topic
cited_by_count	0
locations_count	2
best_oa_location.id	pmh:oai:arXiv.org:2508.00262
best_oa_location.is_oa	True
best_oa_location.source.id	https://openalex.org/S4306400194
best_oa_location.source.issn
best_oa_location.source.type	repository
best_oa_location.source.is_oa	True
best_oa_location.source.issn_l
best_oa_location.source.is_core	False
best_oa_location.source.is_in_doaj	False
best_oa_location.source.display_name	arXiv (Cornell University)
best_oa_location.source.host_organization	https://openalex.org/I205783295
best_oa_location.source.host_organization_name	Cornell University
best_oa_location.source.host_organization_lineage	https://openalex.org/I205783295
best_oa_location.license
best_oa_location.pdf_url	https://arxiv.org/pdf/2508.00262
best_oa_location.version	submittedVersion
best_oa_location.raw_type	text
best_oa_location.license_id
best_oa_location.is_accepted	False
best_oa_location.is_published	False
best_oa_location.raw_source_name
best_oa_location.landing_page_url	http://arxiv.org/abs/2508.00262
primary_location.id	pmh:oai:arXiv.org:2508.00262
primary_location.is_oa	True
primary_location.source.id	https://openalex.org/S4306400194
primary_location.source.issn
primary_location.source.type	repository
primary_location.source.is_oa	True
primary_location.source.issn_l
primary_location.source.is_core	False
primary_location.source.is_in_doaj	False
primary_location.source.display_name	arXiv (Cornell University)
primary_location.source.host_organization	https://openalex.org/I205783295
primary_location.source.host_organization_name	Cornell University
primary_location.source.host_organization_lineage	https://openalex.org/I205783295
primary_location.license
primary_location.pdf_url	https://arxiv.org/pdf/2508.00262
primary_location.version	submittedVersion
primary_location.raw_type	text
primary_location.license_id
primary_location.is_accepted	False
primary_location.is_published	False
primary_location.raw_source_name
primary_location.landing_page_url	http://arxiv.org/abs/2508.00262
publication_date	2025-08-01
publication_year	2025
referenced_works_count	0
abstract_inverted_index.a	4, 49, 90, 99, 115, 128, 139
abstract_inverted_index.t	133
abstract_inverted_index.In	68
abstract_inverted_index.an	107
abstract_inverted_index.as	26, 48
abstract_inverted_index.at	142
abstract_inverted_index.be	62
abstract_inverted_index.in	38, 166, 173, 193
abstract_inverted_index.is	3
abstract_inverted_index.it	95
abstract_inverted_index.of	20, 34, 75, 118, 131, 141
abstract_inverted_index.on	77, 81
abstract_inverted_index.to	12, 93, 105
abstract_inverted_index.we	71, 178
abstract_inverted_index.$d$	111
abstract_inverted_index.$n$	109
abstract_inverted_index.$t$	146
abstract_inverted_index.Our	156
abstract_inverted_index.and	52, 88
abstract_inverted_index.box	51
abstract_inverted_index.for	98, 152, 162
abstract_inverted_index.its	54, 190
abstract_inverted_index.new	58
abstract_inverted_index.our	121, 180
abstract_inverted_index.set	117
abstract_inverted_index.the	35, 46, 65, 73, 78, 82, 125, 148, 174, 194
abstract_inverted_index.via	114
abstract_inverted_index.\log	134
abstract_inverted_index.each	153
abstract_inverted_index.era.	198
abstract_inverted_index.face	30
abstract_inverted_index.from	44
abstract_inverted_index.must	61
abstract_inverted_index.such	25
abstract_inverted_index.task	6
abstract_inverted_index.that	7, 103
abstract_inverted_index.this	69
abstract_inverted_index.time	129, 151, 161
abstract_inverted_index.with	138
abstract_inverted_index.Here,	145
abstract_inverted_index.IBM's	185
abstract_inverted_index.These	41
abstract_inverted_index.arise	43
abstract_inverted_index.black	50
abstract_inverted_index.cloud	187
abstract_inverted_index.given	100
abstract_inverted_index.layer	112
abstract_inverted_index.least	143
abstract_inverted_index.model	87
abstract_inverted_index.noisy	195
abstract_inverted_index.qubit	110
abstract_inverted_index.size.	176
abstract_inverted_index.their	14
abstract_inverted_index.using	184
abstract_inverted_index.$O(d^2	132
abstract_inverted_index.claims	104
abstract_inverted_index.design	55, 66
abstract_inverted_index.double	170
abstract_inverted_index.ensure	13
abstract_inverted_index.finite	116
abstract_inverted_index.gates,	120
abstract_inverted_index.growth	37
abstract_inverted_index.layer.	155
abstract_inverted_index.method	122
abstract_inverted_index.paper,	70
abstract_inverted_index.system	47
abstract_inverted_index.verify	94
abstract_inverted_index.within	127
abstract_inverted_index.$1-δ$.	144
abstract_inverted_index.because	33
abstract_inverted_index.circuit	86, 113, 154
abstract_inverted_index.complex	5
abstract_inverted_index.correct	15
abstract_inverted_index.demands	8
abstract_inverted_index.layered	83
abstract_inverted_index.maximum	149
abstract_inverted_index.methods	11, 19, 60
abstract_inverted_index.problem	175
abstract_inverted_index.process	28, 106
abstract_inverted_index.quantum	1, 23, 27, 85, 101, 119, 167, 186, 197
abstract_inverted_index.reduces	159
abstract_inverted_index.scaling	172
abstract_inverted_index.success	137
abstract_inverted_index.testing	59
abstract_inverted_index.through	182
abstract_inverted_index.unknown	108
abstract_inverted_index.However,	17
abstract_inverted_index.advanced	9
abstract_inverted_index.approach	157
abstract_inverted_index.circuits	126
abstract_inverted_index.devices,	24, 168
abstract_inverted_index.focusing	80
abstract_inverted_index.hardware	102
abstract_inverted_index.ignoring	53
abstract_inverted_index.scalable	91
abstract_inverted_index.service,	188
abstract_inverted_index.treating	45
abstract_inverted_index.validate	179
abstract_inverted_index.(n/δ))$,	135
abstract_inverted_index.Designing	0
abstract_inverted_index.achieving	169
abstract_inverted_index.algorithm	92, 181
abstract_inverted_index.designing	89
abstract_inverted_index.developed	63
abstract_inverted_index.execution	150, 160
abstract_inverted_index.hardware,	79
abstract_inverted_index.potential	191
abstract_inverted_index.structure	74
abstract_inverted_index.verifying	22, 164
abstract_inverted_index.completely	123, 163
abstract_inverted_index.complexity	130
abstract_inverted_index.processors	2
abstract_inverted_index.represents	147
abstract_inverted_index.resources.	40
abstract_inverted_index.structure.	56, 67
abstract_inverted_index.considering	64
abstract_inverted_index.experiments	183
abstract_inverted_index.exponential	36
abstract_inverted_index.investigate	72
abstract_inverted_index.limitations	32, 42
abstract_inverted_index.logarithmic	171
abstract_inverted_index.probability	140
abstract_inverted_index.significant	31
abstract_inverted_index.tomography,	29
abstract_inverted_index.traditional	18
abstract_inverted_index.Furthermore,	177
abstract_inverted_index.computations	76, 165
abstract_inverted_index.guaranteeing	136
abstract_inverted_index.reconstructs	124
abstract_inverted_index.verification	10
abstract_inverted_index.Consequently,	57
abstract_inverted_index.Specifically,	97
abstract_inverted_index.applicability	192
abstract_inverted_index.computational	39
abstract_inverted_index.demonstrating	189
abstract_inverted_index.interruptible	84
abstract_inverted_index.significantly	158
abstract_inverted_index.functionality.	16
abstract_inverted_index.comprehensively	21
abstract_inverted_index.comprehensively.	96
abstract_inverted_index.intermediate-scale	196
cited_by_percentile_year
countries_distinct_count	0
institutions_distinct_count	2
citation_normalized_percentile