Explore Simpler Eigenmarking: Quantum Entailment Model Checking

TL;DR

This paper refines Eigenmarking quantum search for entailment model checking, reducing hardware complexity by using only one extra qubit and demonstrating its effectiveness in two-qubit simulations.

Contribution

It introduces a simplified Eigenmarking scheme requiring only one extra qubit, easing hardware demands while maintaining search effectiveness.

Findings

Effective in two-qubit simulations with minimal local winning margin W=3.17.

Achieved distinguishability D=0.769, outperforming previous schemes.

Reduced entanglement requirements for practical quantum hardware implementation.

Abstract

Targeting entailment model checking, a recent study has pioneered an idea of Eigenmarking search, an improvement over Grover search using extra qubits. The extra qubits condition the quantum state evolution such that the answer states (if exist) are always in the minority. The minority criteria is essential to Grover probability-amplitude amplification and consequently the effectiveness of Grover search. In addition to enforce the minority criteria, Eigenmarking also employs complementary states (through well-orchestrated phase rotation) for easy identification of a no-answer case (related to a no-violation case in the context of model checking). Eigenmarking search has been shown effective in two-qubit simulations. The three Eigenmarking schemes have been previously proposed. Two schemes require two extra qubits. One scheme (called ``subtle marking'') requires one extra qubit with a multiple-qubit-controlled phase rotation. Our study refines the mechanism using only one extra qubit with only two-qubit-controlled phase rotation, commonly known as \texttt{ccz}, regardless of how many qubits the input has. Using a multiple-qubit-controlled phase rotation (as in subtle marking) associates with highly entangled states. Highly entangled states in a real quantum hardware are difficult (or in some cases may even be unachievable) particularly in a scaled up scenario involving many qubits. Our proposed new Eigenmarking scheme has lightened the burden for the hardware requirement. The new Eigenmarking search has been experimented in two-qubit-system simulations and shown viable, achieving the minimal relative local winning margin of W=3.17 and the worst-case distinguishability of D=0.769 (cf. W=0.67; D=0.19 from conventional marking and W=0.28; D=0.55 from subtle marking).