Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Theoretical Physics

Quantum Algorithm for Evaluating Two of Logical Functions Simultaneously

Koji Nagata, Tadao Nakamura

Published May 27, 2020• 1 citation
Publisher
DOI
10.1007/s10773-020-04493-2

Related papers

Quaternary quantum algorithm for determining properties of quaternary logic function

Mozammel H. A. Khan

A multiple-valued (d-dimensional with d >; 2) quantum system enables a much more compact and efficient information encoding than for binary (d = 2) quantum system. As multiple-valued quantum system is physically realizable, it is worth to explore multiple-valued quantum algorithm. In this paper, we propose quaternary (4-dimensional) quantum algorithm for testing whether a quaternary logic function is either constant or balanced. In classical computer, this test would require at least 4n-1+1 function evaluations, where n is the number of inputs of the function. But the proposed quantum algorithm requires only one function evaluation.

International Conference on Computer and Information Technology (ICCIT)•Dec 1, 2011•0 citations

Quantum Computation and Logic

María Luisa Dalla Chiara, Roberto Giuntini, Roberto Leporini +1 more

Trends in logic•Jan 1, 2018•16 citations

Quantum computational logic

M. Dalla Chiara, Roberto Giuntini, Richard J. Greechie

Trends in logic•Jan 1, 2004•3 citations

Ultimate Algorithm for Quantum Computers

Koji Nagata, Tadao Nakamura

We first propose herein a novel parallel computation, even though today's algorithm methodology for quantum computing, for all of the combinations of values in variables of a logical function. Our concern so far has been to obtain an attribute of some function. In fact such a task is only for one task problem solving. However, we could treat positively the plural evaluations of some logic function in parallel instead of testing the function for finding out its attribute. In fact, these evaluations of the function are naturally included and evaluated, in parallel, in normal quantum computing discussing a function in a Boolean algebra stemmed from atoms in it. As is naturally understandable with mathematics, quantum computing with qubit systems naturally is included and exemplified by a Boolean algebra, which treats only both 0 and 1. Namely, the theory in this paper is quite natural in logical sense even though physics domain. Therefore, quantum computing has an ability to solve some mathematical problems described in a Boolean algebra. The reason why we positively introduce a Boolean algebra here is because we have multiple evaluations of a function in quantum computing general.

•Mar 1, 2019•0 citations

Quantum Computational Logic

Stanley Gudder

International Journal of Theoretical Physics•Jan 1, 2003•80 citations

Quantum cryptography based on an algorithm for determining simultaneously all the mappings of a logical function

Koji Nagata, Do Ngoc Diep, Ahmed Farouk +1 more

Institute of Physics eBooks•Jul 1, 2022•1 citation
A multiple-valued (d-dimensional with d >; 2) quantum system enables a much more compact and efficient information encoding than for binary (d = 2) quantum system. As multiple-valued quantum system is physically realizable, it is worth to explore multiple-valued quantum algorithm. In this paper, we propose quaternary (4-dimensional) quantum algorithm for testing whether a quaternary logic function is either constant or balanced. In classical computer, this test would require at least 4n-1+1 function evaluations, where n is the number of inputs of the function. But the proposed quantum algorithm requires only one function evaluation.
We first propose herein a novel parallel computation, even though today's algorithm methodology for quantum computing, for all of the combinations of values in variables of a logical function. Our concern so far has been to obtain an attribute of some function. In fact such a task is only for one task problem solving. However, we could treat positively the plural evaluations of some logic function in parallel instead of testing the function for finding out its attribute. In fact, these evaluations of the function are naturally included and evaluated, in parallel, in normal quantum computing discussing a function in a Boolean algebra stemmed from atoms in it. As is naturally understandable with mathematics, quantum computing with qubit systems naturally is included and exemplified by a Boolean algebra, which treats only both 0 and 1. Namely, the theory in this paper is quite natural in logical sense even though physics domain. Therefore, quantum computing has an ability to solve some mathematical problems described in a Boolean algebra. The reason why we positively introduce a Boolean algebra here is because we have multiple evaluations of a function in quantum computing general.