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

Institute of Physics eBooks

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

Koji Nagata, Do Ngoc Diep, Ahmed Farouk, Tadao Nakamura

Published Jul 1, 2022• 1 citation
Publisher
DOI
10.1088/978-0-7503-4700-6ch9

Related papers

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

Koji Nagata, Renata Wong, Do Ngoc Diep +1 more

Quantum Studies Mathematics and Foundations•Feb 10, 2023•2 citations

Quantum cryptography based on an algorithm for determining a function using qudit systems

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

Institute of Physics eBooks•Jul 1, 2022•0 citations

Quantum Cryptography Based on an Algorithm for Determining a Function Using Qudit Systems

Koji Nagata, Do Ngoc Diep, Tadao Nakamura

International Journal of Theoretical Physics•Jul 17, 2020•2 citations

Quantum Cryptography Through Some Algorithm for Quantum Computers

Koji Nagata, Do Ngoc Diep, Tadao Nakamura

We propose quantum cryptography based on an algorithm of determining a function. The security of our cryptography is based on the Ekert 1991 protocol, that is, we use an entangled state. Eve must destroy the entangled state. Consider a function. Alice knows all the mappings concerning the function. Bob knows none of them. His aim is of obtaining all of them without Eve's attack. In classical case, Bob needs some queries. In quantum case, Bob needs just a query. By measuring the single entangled state, which is sent by Alice, Bob can obtain all the mappings concerning the function, simultaneously. This is faster than classical cryptography.

•Jan 1, 2020•0 citations

Representation theorem for obsevables on a quantum logic

Andrei Yu. Khrennikov, Oľga Nánásiová

We study a conditional state on a quantum logic using Renyi's approach (or Bayesian principle). This approach helps us to define independence of events and differently from the situation in the classical theory of probability, if an event $a$ is independent of an event $b$, then the event $b$ can be dependent on the event $a$. We will show that we can define a $s$-map (function for simultaneous measurements on a quantum logic). It can be shown that if we have the conditional state we can define the $s$-map and conversely. By using the $s$-map we can introduce joint distribution also for noncompatible observables on a quantum logic.

arXiv:quant-ph/0302053•Feb 7, 2003•0 citations

Mathematical digital quantum computation by means of much more logical skills

Koji Nagata, Tadao Nakamura

Abstract We expand Deutsch’s algorithm for determining the mappings of a logical function using four orthogonal states. Using this, we propose a parallel computation for all of the combinations of values in variables of a logical function using sixteen orthogonal states. As an application of our algorithm, we demonstrate two typical arithmetic calculations in the binary system. We study an efficiency for operating a full adder/half adder by quantum-gated computing. The two typical arithmetic calculations are $$(1+1)$$ ( 1 + 1 ) and $$(2+3)$$ ( 2 + 3 ) . The typical arithmetic calculation $$(2+3)$$ ( 2 + 3 ) is faster than that of its classical apparatus which would require $$4^3=64$$ 4 3 = 64 steps when we introduce the full adder operation. Another typical arithmetic calculation $$(1+1)$$ ( 1 + 1 ) is faster than that of its classical apparatus which would require $$4^2=16$$ 4 2 = 16 steps when we introduce only the half adder operation.

Quantum Studies Mathematics and Foundations•Mar 11, 2024•3 citations
We propose quantum cryptography based on an algorithm of determining a function. The security of our cryptography is based on the Ekert 1991 protocol, that is, we use an entangled state. Eve must destroy the entangled state. Consider a function. Alice knows all the mappings concerning the function. Bob knows none of them. His aim is of obtaining all of them without Eve's attack. In classical case, Bob needs some queries. In quantum case, Bob needs just a query. By measuring the single entangled state, which is sent by Alice, Bob can obtain all the mappings concerning the function, simultaneously. This is faster than classical cryptography.
We study a conditional state on a quantum logic using Renyi's approach (or Bayesian principle). This approach helps us to define independence of events and differently from the situation in the classical theory of probability, if an event aaa is independent of an event bbb, then the event bbb can be dependent on the event aaa. We will show that we can define a sss-map (function for simultaneous measurements on a quantum logic). It can be shown that if we have the conditional state we can define the sss-map and conversely. By using the sss-map we can introduce joint distribution also for noncompatible observables on a quantum logic.
Abstract We expand Deutsch’s algorithm for determining the mappings of a logical function using four orthogonal states. Using this, we propose a parallel computation for all of the combinations of values in variables of a logical function using sixteen orthogonal states. As an application of our algorithm, we demonstrate two typical arithmetic calculations in the binary system. We study an efficiency for operating a full adder/half adder by quantum-gated computing. The two typical arithmetic calculations are (1+1)(1+1)(1+1) ( 1 + 1 ) and (2+3)(2+3)(2+3) ( 2 + 3 ) . The typical arithmetic calculation (2+3)(2+3)(2+3) ( 2 + 3 ) is faster than that of its classical apparatus which would require 43=644^3=6443=64 4 3 = 64 steps when we introduce the full adder operation. Another typical arithmetic calculation (1+1)(1+1)(1+1) ( 1 + 1 ) is faster than that of its classical apparatus which would require 42=164^2=1642=16 4 2 = 16 steps when we introduce only the half adder operation.