Rapid solution of logical equivalence problems by quantum computation algorithm

We present a quantum computation algorithm that enables solving the problem of logical equivalence verification in exponentially less time than the classical deterministic computation. In this novel quantum algorithm, the oracles of the two evaluated functions are executed in series to yield a commo...

Full description

Saved in:
Bibliographic Details
Published in:Applied soft computing Vol. 132; p. 109844
Main Authors: Zidan, Mohammed, Hegazy, Salem F., Abdel-Aty, Mahmoud, Obayya, Salah S.A.
Format: Journal Article
Language:English
Published: Elsevier B.V 01.01.2023
Subjects:
Logical equivalence
Quantum algorithms
Quantum computing
Quantum verification
Quantum algorithms
Quantum computing
Logical equivalence
Quantum verification
ISSN:1568-4946
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present a quantum computation algorithm that enables solving the problem of logical equivalence verification in exponentially less time than the classical deterministic computation. In this novel quantum algorithm, the oracles of the two evaluated functions are executed in series to yield a common target qubit which then interacts with an ancillary qubit. We found that the degree of entanglement (measured by the concurrence) of the target and ancillary qubits is a reliable witness for the logical equivalence property of the two functions. The steps number of the quantum algorithm is inversely proportional to the square of the standard error ϵ2 of the measured concurrence value, with no dependence on the input size ′n′ of each function. This corresponds to a number of evaluations of the two functions: O(ϵ−2) for the quantum algorithm compared with O(2n) for the classical approach. To assess the algorithm performance, two sets of experiments are conducted using the IBM Q Experience simulator for input sizes: 2 and 12 variables per function. While the former verifies that the results of the experiment are in a good match with the theory, the latter showcases the quantum supremacy of the presented algorithm. In particular, The latter shows that the quantum algorithm requires only 200 oracles queries compared with 213 queries for the classical algorithm. •Logical equivalence is determined in exponentially less time than classical computation.•As a quantum measure, concurrence witnesses the logical equivalence property.•No. of queries is inversely proportional to the standard error of measured concurrence value.•The exponential speedup is demonstrated by simulation on IBMQ Experience simulator.•In 12-bit experiments, quantum algorithm required 200 queries vs. 213 classical queries.
ISSN:1568-4946
DOI:10.1016/j.asoc.2022.109844