English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

When a bug is detected by testing a quantum program on a quantum computer, wewant to determine its location to fix it. To locate the bug, the quantumprogram is divided into several segments, and each segment is tested. However,to prepare a quantum state that is input to a segment, it is necessary toexecute all the segments ahead of that segment in a quantum computer. Thismeans that the cost of testing each segment depends on its location. We canalso locate a buggy segment only if it is confirmed that there are no bugs inall segments ahead of that buggy segment. Since a quantum program is testedstatistically on the basis of measurement results, there is a tradeoff betweentesting accuracy and cost. Although these characteristics are unique to quantumprograms and complicate locating bugs, they have not been investigated. Wesuggest for the first time that these characteristics should be considered toefficiently locate bugs. We are also the first to propose a bug-locating methodthat takes these characteristics into account. The results from experimentsindicate that the bug-locating cost, represented as the number of executedquantum gates, can be reduced with the proposed method compared with naivemethods.

Locating Buggy Segments in Quantum Program Debugging