analiza aiqbench
The paper argues that generative AI can speed up writing quantum circuits, but the added effort of verifying those circuits offsets some of the gain. Its proposal splits each implementation into a mathematical specification, a circuit, and a machine-checked proof that the two agree, so humans review the specification and theorem statements rather than the circuit itself. The worked example, a stochastic particle system, is a useful test of whether this workflow scales beyond a single case.
Reducing Trust Cost in Quantum Application Development Using AI
arXiv:2610.14665v1 Announce Type: new Abstract: Generative AI can be a powerful tool for supporting the design and implementation of quantum applications, whereas the burden of checking whether generated circuits realize the intended computation increases. In this study, we regard this burden of human understanding, checking, and judgment as ``trust cost,'' and propose a development methodology that integrates AI and formal verification to reduce it. In the proposed development methodology, the implementation is divided into three components: a target mathematical specification, a quantum circuit, and a correspondence theorem and its proof that prove the agreement between the two. This division separates the specifications and theorem statements checked by humans from the theorem proofs entrusted to mechanical checking. As a concrete development example of this proposal, we describe an implementation for the time evolution of a stochastic particle system and its results.
Abstract:Generative AI can be a powerful tool for supporting the design and implementation of quantum applications, whereas the burden of checking whether generated circuits realize the intended computation increases. In this study, we regard this burden of human understanding, checking, and judgment as ``trust cost,'' and propose a development methodology that integrates AI and formal verification to reduce it. In the proposed development methodology, the implementation is divided into three components: a target mathematical specification, a quantum circuit, and a correspondence theorem and its proof that prove the agreement between the two. This division separates the specifications and theorem statements checked by humans from the theorem proofs entrusted to mechanical checking. As a concrete development example of this proposal, we describe an implementation for the time evolution of a stochastic particle system and its results.
arXiv:2610.14665 [quant-ph]
(or arXiv:2610.14665v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2610.14665 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 226 cuvinte
