6 papers
SAQR-QC: A Logic for Scalable but Approximate Quantitative Reasoning about Quantum Circuits
Nengkun Yu, Jens Palsberg, Thomas Reps
Reasoning about quantum programs remains a fundamental challenge, regardless of the programming model or computational paradigm. Despite extensive research, existing verification t…
Manjushri: A Tool for Equivalence Checking of Quantum Circuits
Xuan Du Trinh, Meghana Sistla, Nengkun Yu +1
Verifying whether two quantum circuits are equivalent is a central challenge in the compilation and optimization of quantum programs. We introduce \textsc{Manjushri}, a new automat…
Adaptivity is not helpful for Pauli channel learning
Xuan Du Trinh, Nengkun Yu
We prove that adaptive strategies offer no advantage over non-adaptive ones for learning and testing Pauli channels using entangled inputs. This key observation allows us to charac…
Entanglement Certification by Measuring Nonlocality
Xuan Du Trinh, Zhengyu Wu, Junlin Bai +3
Reliable verification of entanglement is a central requirement for quantum networks. This paper presents a practical verification approach based on violations of the Clauser-Horne-…
Towards Efficient Verification of Computation in Quantum Devices
Keren Li, Peng Yan, Hanru Jiang +1
Designing quantum processors is a complex task that demands advanced verification methods to ensure their correct functionality. However, traditional methods of comprehensively ver…
Scalable Equivalence Checking and Verification of Shallow Quantum Circuits
Nengkun Yu, Xuan Du Trinh, Thomas Reps
This paper concerns the problem of checking if two shallow (i.e., constant-depth) quantum circuits perform equivalent computations. Equivalence checking is a fundamental correctnes…