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 Cryptography Based on an Algorithm for Determining a Function Using Qudit Systems

Koji Nagata, Do Ngoc Diep, Tadao Nakamura

Published Jul 17, 2020• 2 citations
Publisher
DOI
10.1007/s10773-020-04547-5

Related papers

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 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

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

Computational speed-up with a single qudit

Z. Gedik, I. A. Silva, Barış Çakmak +5 more

Quantum algorithms are known for providing more efficient solutions to certain computational tasks than any corresponding classical algorithm. Here we show that a single qudit is sufficient to implement an oracle based quantum algorithm, which can solve a black-box problem faster than any classical algorithm. For 2d permutation functions defined on a set of d elements, deciding whether a given permutation is even or odd, requires evaluation of the function for at least two elements. We demonstrate that a quantum circuit with a single qudit can determine the parity of the permutation with only one evaluation of the function. Our algorithm provides an example for quantum computation without entanglement since it makes use of the pure state of a qudit. We also present an experimental realization of the proposed quantum algorithm with a quadrupolar nuclear magnetic resonance using a single four-level quantum system, i.e., a ququart.

arXiv:1403.5861•Scientific Reports•Oct 8, 2015•124 citations

Quantum Algorithm Determining a Homogeneous Linear Function

Koji Nagata, Tadao Nakamura, Han J.F. Geurdes +4 more

We present a method of fast determining a homogeneous linear function $f(x):= s.x=s_1x_1+ s_2x_2+\dots+s_Nx_N$ from $\{0,1,\dots,d-1\}^N$ with coefficients $s=(s_1,\dots,s_N)$. Here $x=(x_1,\dots,x_N)$ and $x_j\in{\bf R}$. Given the interpolation values $(f(1), f(2),...,f(N))=\vec{y}$, we shall determine the unknown coefficients $s = (s_1(\vec{y}),\dots, s_N(\vec{y}))$ of the linear function, simultaneously. The speed of determining the values is shown to outperform the classical case by a factor of $N$. Our method is based on the generalized Bernstein-Vazirani algorithm \cite{BVG} to qudit systems \cite{BVD}.

•Sep 1, 2017•0 citations

Quantum Algorithms in Cryptography

WORLD SCIENTIFIC eBooks•Mar 10, 2026•0 citations
Quantum algorithms are known for providing more efficient solutions to certain computational tasks than any corresponding classical algorithm. Here we show that a single qudit is sufficient to implement an oracle based quantum algorithm, which can solve a black-box problem faster than any classical algorithm. For 2d permutation functions defined on a set of d elements, deciding whether a given permutation is even or odd, requires evaluation of the function for at least two elements. We demonstrate that a quantum circuit with a single qudit can determine the parity of the permutation with only one evaluation of the function. Our algorithm provides an example for quantum computation without entanglement since it makes use of the pure state of a qudit. We also present an experimental realization of the proposed quantum algorithm with a quadrupolar nuclear magnetic resonance using a single four-level quantum system, i.e., a ququart.
We present a method of fast determining a homogeneous linear function f(x):=s.x=s1x1+s2x2+⋯+sNxNf(x):= s.x=s_1x_1+ s_2x_2+\dots+s_Nx_Nf(x):=s.x=s1​x1​+s2​x2​+⋯+sN​xN​ from {0,1,…,d−1}N\{0,1,\dots,d-1\}^N{0,1,…,d−1}N with coefficients s=(s1,…,sN)s=(s_1,\dots,s_N)s=(s1​,…,sN​). Here x=(x1,…,xN)x=(x_1,\dots,x_N)x=(x1​,…,xN​) and xj∈Rx_j\in{\bf R}xj​∈R. Given the interpolation values (f(1),f(2),...,f(N))=y⃗(f(1), f(2),...,f(N))=\vec{y}(f(1),f(2),...,f(N))=y​, we shall determine the unknown coefficients s=(s1(y⃗),…,sN(y⃗))s = (s_1(\vec{y}),\dots, s_N(\vec{y}))s=(s1​(y​),…,sN​(y​)) of the linear function, simultaneously. The speed of determining the values is shown to outperform the classical case by a factor of NNN. Our method is based on the generalized Bernstein-Vazirani algorithm \cite{BVG} to qudit systems \cite{BVD}.