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

Quantum programs exhibit inherent non-deterministic behavior, which posesmore significant challenges for error discovery compared to classical programs.While several testing methods have been proposed for quantum programs, theyoften overlook fundamental questions in black-box testing. In this paper, webridge this gap by presenting three novel algorithms specifically designed toaddress the challenges of equivalence, identity, and unitarity checking inblack-box testing of quantum programs. We also explore optimization techniquesfor these algorithms, including specialized versions for equivalence andunitarity checking, and provide valuable insights into parameter selection tomaximize performance and effectiveness. To evaluate the effectiveness of ourproposed methods, we conducted comprehensive experimental evaluations, whichdemonstrate that our methods can rigorously perform equivalence, identity, andunitarity checking, offering robust support for black-box testing of quantumprograms.

Equivalence, Identity, and Unitarity Checking in Black-Box Testing of Quantum Programs