Ahmed Younes - Academia.edu (original) (raw)

Papers by Ahmed Younes

Symmetry, Apr 8, 2023

This article is an open access article distributed under the terms and conditions of the Creative... more This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY

Annals of Physics, May 1, 2017

Acquiring information about an unknown qubit in a superposition of two states is essential in any... more Acquiring information about an unknown qubit in a superposition of two states is essential in any computation process. Quantum measurement, or sharp measurement, is usually used to read the information contents of that unknown qubit system. Quantum measurement is an irreversible operation that makes the superposition collapses to one of the two possible states in a probabilistic way. In this paper, a quantum algorithm will be proposed to read the information in an unknown qubit without applying sharp measurement on that qubit. The proposed algorithm will use a quantum feedback control scheme by applying sharp measurement iteratively on an auxiliary qubit weakly entangled with the unknown qubit. The information contents of the unknown qubit can be read by counting the outcomes from the sharp measurement on the auxiliary qubit. Iterative measurements on the auxiliary qubit will make the amplitudes of the superposition move in a random walk manner where a weak measurement is applied on the unknown qubit which can be reversed when the random walk takes opposite steps to decrease the disturbance introduced to the system. The proposed algorithm will define the strength of the weak measurement so that it can be controlled by adding an arbitrary number of dummy qubits µ to the system. This will make the measurement process slowdown to an arbitrary scale so that the effect of the sharp measurement on the unknown qubit is reached after O(µ 2) measurements on the auxiliary qubit.

Symmetry, Jul 10, 2021

This article is an open access article distributed under the terms and conditions of the Creative... more This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY

Cogent engineering, 2021

Abstract Test-suite minimization problem is an essential problem in software engineering as its a... more Abstract Test-suite minimization problem is an essential problem in software engineering as its application helps to improve the software quality. This paper proposes a quantum algorithm to solve the test-suite minimization problem with high probability in , where is the number of test cases. It generates an incomplete superposition to find the best solution. It also handles the non-uniform amplitudes’ distribution case for the system with multisolutions. The proposed algorithm uses amplitude amplification techniques to search for the minimum number of test cases required to test all the requirements. The proposed algorithm employs two quantum search algorithms, Younes et al. algorithm for quantum searching via entanglement and partial diffusion to prepare incomplete superpositions that represent different search spaces such that the number of test cases is incremented in each search space, and updated Arima’s algorithm to handle the multisolutions case. The updated Arima’s algorithm searches for a quantum state that satisfies an oracle that represent the instance of the test-suite minimization problem.

WSEAS transactions on computers, Aug 17, 2020

Test Suite Minimization problem is a nondeterministic polynomial time (NP) complete problem in so... more Test Suite Minimization problem is a nondeterministic polynomial time (NP) complete problem in software engineering that has a special importance in software testing. In this problem, a subset with a minimal size that contains a number of test cases that cover all the test requirements should be found. A bruteforce approach to solving this problem is to assume a size for the minimal subset and then search to find if there is a subset of test cases with the assumed size that solves the problem. If not, the assumed minimal size is gradually incremented, and the search is repeated. In this paper, a quantuminspired genetic algorithm (QIGA) will be proposed to solve this problem. In it, quantum superposition, quantum rotation and quantum measurement will be used in an evolutionary algorithm. The paper will show that the adopted quantum techniques can speed up the convergence of the classical genetic algorithm. The proposed method has an advantage in that it reduces the assumed minimal number of test cases using quantum measurements, which makes it able to discover the minimal number of test cases without any prior assumptions.

Quantum 2.0 Conference and Exhibition, 2022

We propose an algorithm that offers higher control and security levels over entanglement-based qu... more We propose an algorithm that offers higher control and security levels over entanglement-based quantum networks. The merits, cost, and performance of the proposed algorithm are discussed.

Symmetry, Jun 7, 2021

This article is an open access article distributed under the terms and conditions of the Creative... more This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY

Journal of physics, 2020

There is a direct equivalence between Boolean functions represented in Reed-Muller logic and Bool... more There is a direct equivalence between Boolean functions represented in Reed-Muller logic and Boolean Quantum Circuits. Different polarity Reed-Muller expansions will give different Boolean quantum circuits with different cost for the same Boolean function. For a given Boolean function with n variables there are 2 n possible expansions. Searching for the expansion that gives a Boolean quantum circuit with minimum quantum cost within the search space is a hard problem for large n. This paper will use genetic algorithms to find the fixed/mixed polarity Reed-Muller expansion that gives a Boolean quantum circuit with minimum quantum cost to optimize the circuit realization of a given Boolean function.

Symmetry, Nov 23, 2022

This article is an open access article distributed under the terms and conditions of the Creative... more This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY

arXiv (Cornell University), Dec 30, 2015

We present new algorithms to synthesize exact universal reversible gate library for various types... more We present new algorithms to synthesize exact universal reversible gate library for various types of gates and costs. We use the powerful algebraic software GAP for implementation and examination of our algorithms and the reversible logic synthesis problems have been reduced to group theory problems. It is shown that minimization of arbitrary cost functions of gates and orders of magnitude are faster than its previously counterparts for reversible logic synthesis. Experimental results show that a significant improvement over the previously proposed synthesis algorithm is obtained compared with the existing approaches to reversible logic synthesis.

arXiv (Cornell University), Apr 21, 2013

The reversible circuit synthesis problem can be reduced to permutation group. This allows Schreie... more The reversible circuit synthesis problem can be reduced to permutation group. This allows Schreier-Sims Algorithm for the strong generating set-finding problem to be used to find tight bounds on the synthesis of 3-bit reversible circuits using the NFT library. The tight bounds include the maximum and minimum length of 3-bit reversible circuits, the maximum and minimum cost of 3-bit reversible circuits. The analysis shows better results than that found in the literature for the lower bound of the cost. The analysis also shows that there are 1960 universal reversible sub-libraries from the main NFT library.

Applied Mathematics & Information Sciences, 2015

Many universal reversible libraries of gates that contain more than one gate type have been propo... more Many universal reversible libraries of gates that contain more than one gate type have been proposed in the literature. Synthesis of reversible circuits is much simpler and more practical if a single gate type is used in the circuit construction. This paper proposes a novel reversible n-bit gate that is universal for reversible circuits synthesis. The proposed gate is extendable according to the number of bits in the circuit. The paper shows that the size of the synthesized circuits using the proposed gate is comparable with the size of the synthesized circuits using the known reversible libraries of gates.

Multimedia Tools and Applications, Aug 31, 2021

Quantum Information Processing, Sep 1, 2021

The quantum state discrimination problem is to distinguish between non-orthogonal quantum states.... more The quantum state discrimination problem is to distinguish between non-orthogonal quantum states. This problem has many applications in quantum information theory, quantum communication and quantum cryptography. In this paper a quantum algorithm using weak measurement and partial negation will be proposed to solve the quantum state discrimination problem using a single copy of an unknown qubit. The usage of weak measurement makes it possible to reconstruct the qubit after measurement since the superposition will not be destroyed due to measurement. The proposed algorithm will be able to determine, with high probability of success, the state of the unknown qubit and whether it is encoded in the Hadamard or the computational basis by counting the outcome of the successive measurements on an auxiliary qubit.

International Journal of Theoretical Physics, Jun 1, 2019

Reversible logic has been considered as an important solution to the power dissipation problem in... more Reversible logic has been considered as an important solution to the power dissipation problem in the existing electronic devices. Many universal reversible libraries that include more than one type of gates have been proposed in the literature. This paper proposes a novel reversible n-bit gate that is proved to be universal for synthesizing reversible circuits. Reducing the reversible circuit synthesis problem to permutation group allows Schreier-Sims Algorithm for the strong generating set-finding problem to be used in the synthesize of reversible circuits using the proposed gate. A novel optimization rules will be proposed to further optimize the synthesized circuits in terms of the number of gates, the quantum cost and the utilization of library to achieve better results than that shown in the literature.

Symmetry

The problem of pattern classification in quantum data has been of great importance over the past ... more The problem of pattern classification in quantum data has been of great importance over the past few years. This study investigates the effect of deploying Grover’s, the partial diffusion, and the fixed-phase algorithms separately to amplify the amplitudes of a desired pattern in an unstructured dataset. These quantum search operators were applied to symmetric and antisymmetric input superpositions on a three-qubit system for 20 iterations each. After each iteration, different probabilities of classification were calculated in order to determine the accuracy of classification for each of the three quantum search operators. The results indicated that, in the case of applying the three quantum search operators to incomplete superposition input states, the partial diffusion operator outperformed the other operators with a probability of correct classification that reached 100% in certain iterations. It also showed that the classification accuracy of the fixed-phase operator exceeded th...

arXiv (Cornell University), Jun 5, 2013

Many universal reversible libraries that contain more than one gate type have been proposed in th... more Many universal reversible libraries that contain more than one gate type have been proposed in the literature. Practical implementation of reversible circuits is much easier if a single gate type is used in the circuit construction. This paper proposes a reversible n-bit gate that is universal for reversible circuits synthesis. The proposed gate is extendable according to the size of the circuit. The paper shows that the size of the synthesized circuits using the proposed gate is comparable with the size of the synthesized circuits using the hybrid reversible libraries for 3-in/out reversible circuits.

arXiv (Cornell University), Jul 16, 2015

The aim of the paper is to answer a long-standing open problem on the relationship between NP and... more The aim of the paper is to answer a long-standing open problem on the relationship between NP and BQP. The paper shows that BQP contains NP by proposing a BQP quantum algorithm for the MAX-E3-SAT problem which is a fundamental NP-hard problem. Given an E3-CNF Boolean formula, the aim of the MAX-E3-SAT problem is to find the variable assignment that maximizes the number of satisfied clauses. The proposed algorithm runs in O(m 2) for an E3-CNF Boolean formula with m clauses and in the worst case runs in O(n 6) for an E3-CNF Boolean formula with n inputs. The proposed algorithm maximizes the set of satisfied clauses using a novel iterative partial negation and partial measurement technique. The algorithm is shown to achieve an arbitrary high probability of success of 1 − for small > 0 using a polynomial resources. In addition to solving the MAX-E3-SAT problem, the proposed algorithm can also be used to decide if an E3-CNF Boolean formula is satisfiable or not, which is an NP-complete problem, based on the maximum number of satisfied clauses.

Quantum 2.0 Conference and Exhibition

We propose an algorithm that offers higher control and security levels over entanglement-based qu... more We propose an algorithm that offers higher control and security levels over entanglement-based quantum networks. The merits, cost, and performance of the proposed algorithm are discussed.

Symmetry

The synthesis and optimization of quantum circuits are essential for the construction of quantum ... more The synthesis and optimization of quantum circuits are essential for the construction of quantum computers. This paper proposes two methods to reduce the quantum cost of 3-bit reversible circuits. The first method utilizes basic building blocks of gate pairs using different Toffoli decompositions. These gate pairs are used to reconstruct the quantum circuits where further optimization rules will be applied to synthesize the optimized circuit. The second method suggests using a new universal library, which provides better quantum cost when compared with previous work in both cost015 and cost115 metrics; this proposed new universal library “Negative NCT” uses gates that operate on the target qubit only when the control qubit’s state is zero. A combination of the proposed basic building blocks of pairs of gates and the proposed Negative NCT library is used in this work for synthesis and optimization, where the Negative NCT library showed better quantum cost after optimization compared ...

Symmetry, Apr 8, 2023

This article is an open access article distributed under the terms and conditions of the Creative... more This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY

Annals of Physics, May 1, 2017

Acquiring information about an unknown qubit in a superposition of two states is essential in any... more Acquiring information about an unknown qubit in a superposition of two states is essential in any computation process. Quantum measurement, or sharp measurement, is usually used to read the information contents of that unknown qubit system. Quantum measurement is an irreversible operation that makes the superposition collapses to one of the two possible states in a probabilistic way. In this paper, a quantum algorithm will be proposed to read the information in an unknown qubit without applying sharp measurement on that qubit. The proposed algorithm will use a quantum feedback control scheme by applying sharp measurement iteratively on an auxiliary qubit weakly entangled with the unknown qubit. The information contents of the unknown qubit can be read by counting the outcomes from the sharp measurement on the auxiliary qubit. Iterative measurements on the auxiliary qubit will make the amplitudes of the superposition move in a random walk manner where a weak measurement is applied on the unknown qubit which can be reversed when the random walk takes opposite steps to decrease the disturbance introduced to the system. The proposed algorithm will define the strength of the weak measurement so that it can be controlled by adding an arbitrary number of dummy qubits µ to the system. This will make the measurement process slowdown to an arbitrary scale so that the effect of the sharp measurement on the unknown qubit is reached after O(µ 2) measurements on the auxiliary qubit.

Symmetry, Jul 10, 2021

This article is an open access article distributed under the terms and conditions of the Creative... more This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY

Cogent engineering, 2021

Abstract Test-suite minimization problem is an essential problem in software engineering as its a... more Abstract Test-suite minimization problem is an essential problem in software engineering as its application helps to improve the software quality. This paper proposes a quantum algorithm to solve the test-suite minimization problem with high probability in , where is the number of test cases. It generates an incomplete superposition to find the best solution. It also handles the non-uniform amplitudes’ distribution case for the system with multisolutions. The proposed algorithm uses amplitude amplification techniques to search for the minimum number of test cases required to test all the requirements. The proposed algorithm employs two quantum search algorithms, Younes et al. algorithm for quantum searching via entanglement and partial diffusion to prepare incomplete superpositions that represent different search spaces such that the number of test cases is incremented in each search space, and updated Arima’s algorithm to handle the multisolutions case. The updated Arima’s algorithm searches for a quantum state that satisfies an oracle that represent the instance of the test-suite minimization problem.

WSEAS transactions on computers, Aug 17, 2020

Test Suite Minimization problem is a nondeterministic polynomial time (NP) complete problem in so... more Test Suite Minimization problem is a nondeterministic polynomial time (NP) complete problem in software engineering that has a special importance in software testing. In this problem, a subset with a minimal size that contains a number of test cases that cover all the test requirements should be found. A bruteforce approach to solving this problem is to assume a size for the minimal subset and then search to find if there is a subset of test cases with the assumed size that solves the problem. If not, the assumed minimal size is gradually incremented, and the search is repeated. In this paper, a quantuminspired genetic algorithm (QIGA) will be proposed to solve this problem. In it, quantum superposition, quantum rotation and quantum measurement will be used in an evolutionary algorithm. The paper will show that the adopted quantum techniques can speed up the convergence of the classical genetic algorithm. The proposed method has an advantage in that it reduces the assumed minimal number of test cases using quantum measurements, which makes it able to discover the minimal number of test cases without any prior assumptions.

Quantum 2.0 Conference and Exhibition, 2022

We propose an algorithm that offers higher control and security levels over entanglement-based qu... more We propose an algorithm that offers higher control and security levels over entanglement-based quantum networks. The merits, cost, and performance of the proposed algorithm are discussed.

Symmetry, Jun 7, 2021

This article is an open access article distributed under the terms and conditions of the Creative... more This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY

Journal of physics, 2020

There is a direct equivalence between Boolean functions represented in Reed-Muller logic and Bool... more There is a direct equivalence between Boolean functions represented in Reed-Muller logic and Boolean Quantum Circuits. Different polarity Reed-Muller expansions will give different Boolean quantum circuits with different cost for the same Boolean function. For a given Boolean function with n variables there are 2 n possible expansions. Searching for the expansion that gives a Boolean quantum circuit with minimum quantum cost within the search space is a hard problem for large n. This paper will use genetic algorithms to find the fixed/mixed polarity Reed-Muller expansion that gives a Boolean quantum circuit with minimum quantum cost to optimize the circuit realization of a given Boolean function.

Symmetry, Nov 23, 2022

This article is an open access article distributed under the terms and conditions of the Creative... more This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY

arXiv (Cornell University), Dec 30, 2015

We present new algorithms to synthesize exact universal reversible gate library for various types... more We present new algorithms to synthesize exact universal reversible gate library for various types of gates and costs. We use the powerful algebraic software GAP for implementation and examination of our algorithms and the reversible logic synthesis problems have been reduced to group theory problems. It is shown that minimization of arbitrary cost functions of gates and orders of magnitude are faster than its previously counterparts for reversible logic synthesis. Experimental results show that a significant improvement over the previously proposed synthesis algorithm is obtained compared with the existing approaches to reversible logic synthesis.

arXiv (Cornell University), Apr 21, 2013

The reversible circuit synthesis problem can be reduced to permutation group. This allows Schreie... more The reversible circuit synthesis problem can be reduced to permutation group. This allows Schreier-Sims Algorithm for the strong generating set-finding problem to be used to find tight bounds on the synthesis of 3-bit reversible circuits using the NFT library. The tight bounds include the maximum and minimum length of 3-bit reversible circuits, the maximum and minimum cost of 3-bit reversible circuits. The analysis shows better results than that found in the literature for the lower bound of the cost. The analysis also shows that there are 1960 universal reversible sub-libraries from the main NFT library.

Applied Mathematics & Information Sciences, 2015

Many universal reversible libraries of gates that contain more than one gate type have been propo... more Many universal reversible libraries of gates that contain more than one gate type have been proposed in the literature. Synthesis of reversible circuits is much simpler and more practical if a single gate type is used in the circuit construction. This paper proposes a novel reversible n-bit gate that is universal for reversible circuits synthesis. The proposed gate is extendable according to the number of bits in the circuit. The paper shows that the size of the synthesized circuits using the proposed gate is comparable with the size of the synthesized circuits using the known reversible libraries of gates.

Multimedia Tools and Applications, Aug 31, 2021

Quantum Information Processing, Sep 1, 2021

The quantum state discrimination problem is to distinguish between non-orthogonal quantum states.... more The quantum state discrimination problem is to distinguish between non-orthogonal quantum states. This problem has many applications in quantum information theory, quantum communication and quantum cryptography. In this paper a quantum algorithm using weak measurement and partial negation will be proposed to solve the quantum state discrimination problem using a single copy of an unknown qubit. The usage of weak measurement makes it possible to reconstruct the qubit after measurement since the superposition will not be destroyed due to measurement. The proposed algorithm will be able to determine, with high probability of success, the state of the unknown qubit and whether it is encoded in the Hadamard or the computational basis by counting the outcome of the successive measurements on an auxiliary qubit.

International Journal of Theoretical Physics, Jun 1, 2019

Reversible logic has been considered as an important solution to the power dissipation problem in... more Reversible logic has been considered as an important solution to the power dissipation problem in the existing electronic devices. Many universal reversible libraries that include more than one type of gates have been proposed in the literature. This paper proposes a novel reversible n-bit gate that is proved to be universal for synthesizing reversible circuits. Reducing the reversible circuit synthesis problem to permutation group allows Schreier-Sims Algorithm for the strong generating set-finding problem to be used in the synthesize of reversible circuits using the proposed gate. A novel optimization rules will be proposed to further optimize the synthesized circuits in terms of the number of gates, the quantum cost and the utilization of library to achieve better results than that shown in the literature.

Symmetry

The problem of pattern classification in quantum data has been of great importance over the past ... more The problem of pattern classification in quantum data has been of great importance over the past few years. This study investigates the effect of deploying Grover’s, the partial diffusion, and the fixed-phase algorithms separately to amplify the amplitudes of a desired pattern in an unstructured dataset. These quantum search operators were applied to symmetric and antisymmetric input superpositions on a three-qubit system for 20 iterations each. After each iteration, different probabilities of classification were calculated in order to determine the accuracy of classification for each of the three quantum search operators. The results indicated that, in the case of applying the three quantum search operators to incomplete superposition input states, the partial diffusion operator outperformed the other operators with a probability of correct classification that reached 100% in certain iterations. It also showed that the classification accuracy of the fixed-phase operator exceeded th...

arXiv (Cornell University), Jun 5, 2013

Many universal reversible libraries that contain more than one gate type have been proposed in th... more Many universal reversible libraries that contain more than one gate type have been proposed in the literature. Practical implementation of reversible circuits is much easier if a single gate type is used in the circuit construction. This paper proposes a reversible n-bit gate that is universal for reversible circuits synthesis. The proposed gate is extendable according to the size of the circuit. The paper shows that the size of the synthesized circuits using the proposed gate is comparable with the size of the synthesized circuits using the hybrid reversible libraries for 3-in/out reversible circuits.

arXiv (Cornell University), Jul 16, 2015

The aim of the paper is to answer a long-standing open problem on the relationship between NP and... more The aim of the paper is to answer a long-standing open problem on the relationship between NP and BQP. The paper shows that BQP contains NP by proposing a BQP quantum algorithm for the MAX-E3-SAT problem which is a fundamental NP-hard problem. Given an E3-CNF Boolean formula, the aim of the MAX-E3-SAT problem is to find the variable assignment that maximizes the number of satisfied clauses. The proposed algorithm runs in O(m 2) for an E3-CNF Boolean formula with m clauses and in the worst case runs in O(n 6) for an E3-CNF Boolean formula with n inputs. The proposed algorithm maximizes the set of satisfied clauses using a novel iterative partial negation and partial measurement technique. The algorithm is shown to achieve an arbitrary high probability of success of 1 − for small > 0 using a polynomial resources. In addition to solving the MAX-E3-SAT problem, the proposed algorithm can also be used to decide if an E3-CNF Boolean formula is satisfiable or not, which is an NP-complete problem, based on the maximum number of satisfied clauses.

Quantum 2.0 Conference and Exhibition

We propose an algorithm that offers higher control and security levels over entanglement-based qu... more We propose an algorithm that offers higher control and security levels over entanglement-based quantum networks. The merits, cost, and performance of the proposed algorithm are discussed.

Symmetry

The synthesis and optimization of quantum circuits are essential for the construction of quantum ... more The synthesis and optimization of quantum circuits are essential for the construction of quantum computers. This paper proposes two methods to reduce the quantum cost of 3-bit reversible circuits. The first method utilizes basic building blocks of gate pairs using different Toffoli decompositions. These gate pairs are used to reconstruct the quantum circuits where further optimization rules will be applied to synthesize the optimized circuit. The second method suggests using a new universal library, which provides better quantum cost when compared with previous work in both cost015 and cost115 metrics; this proposed new universal library “Negative NCT” uses gates that operate on the target qubit only when the control qubit’s state is zero. A combination of the proposed basic building blocks of pairs of gates and the proposed Negative NCT library is used in this work for synthesis and optimization, where the Negative NCT library showed better quantum cost after optimization compared ...