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

Computational complexity in quantum computing

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

Published Jul 1, 2022• 1 citation
Publisher

Abstract

Our aim is of studying the efficiency of two typical arithmetic calculations {[T. Nakamura and K. Nagata, Int. J. Theor. Phys. {\bf 60}, 70 (2021)]} using the principle of quantum mechanics. We demonstrate some evaluations of three two-variable functions which are elements of a boolean algebra composed of the four-atom set utilizing the Bernstein--Vazirani algorithm. This is faster than a classical apparatus, which would require $2^{12}=4096$ evaluations. Finally, using the three two-variable functions evaluated here, we demonstrate two typical arithmetic calculations in the binary system. Hence, our calculations are faster than a classical apparatus, which would require $2^{12}=4096$ evaluations.

DOI
10.1088/978-0-7503-4700-6ch19

Related papers

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 Advantage with Deutsch-Jozsa, Bernstein-Vazirani, and Simon’s Algorithms

Vladimir Silva

In this chapter, we study three algorithms of little practical use but important because they were the first to show that quantum computers can solve problems significantly faster than classical ones. Consider the time complexities O(n) for the algorithms: classical vs. quantum in Table 9-1 (where n is the size of the input).

Apress eBooks•Dec 18, 2023•0 citations

Quantum oracles and the optical Bernstein-Vazirani algorithm

Ian A. Walmsley, Pablo Londero, Christophe Dorrer +3 more

We implement the Bernstein-Vazirani algorithm on a 15-bit register encoding 215-1 elements using optics. The apparatus is efficient in that the physical size of the apparatus scales linearly with the size (i.e. number of digits) of the register. We demonstrate also that the algorithm may be performed not only without entanglement, as Meyer has indicated, but also with a computational basis that does not consist of orthogonal states, and that this coding is the source of the efficiency of the algorithm. This raises several questions: is this the only algorithm that makes use of these simplifying features, or do all quantum Oracles in fact require exponential resources for their construction?

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Nov 18, 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

A Method of Computing Many Functions Simultaneously by Using Many Parallel Quantum Systems

Koji Nagata, Germano Resconi, Tadao Nakamura +4 more

We suggest a method of computing many functions in the same time by using many parallel quantum systems. We use the Bernstein-Vazirani algorithm. Given the set of real values $\{a_1,a_2,a_3,\ldots,a_N\}$, and the function $g:{\bf R}\rightarrow \{0,1\}$, we shall determine the following values $\{g(a_1),g(a_2),g(a_3),\ldots, g(a_N)\}$ simultaneously. By using $M$ parallel quantum systems, we can compute $M$ functions $g^1,g^2,...,g^M$ simultaneously. The speed of determining the $N\times M$ values will be shown to outperform the classical case by a factor of $N$.

•Apr 1, 2017•1 citation

Quantum algorithms for testing Boolean functions

Dominik Floess, Erika Andersson, Mark S. Hillery

We discuss quantum algorithms, based on the Bernstein-Vazirani algorithm, for finding which variables a Boolean function depends on. There are 2^n possible linear Boolean functions of n variables; given a linear Boolean function, the Bernstein-Vazirani quantum algorithm can deterministically identify which one of these Boolean functions we are given using just one single function query. The same quantum algorithm can also be used to learn which input variables other types of Boolean functions depend on, with a success probability that depends on the form of the Boolean function that is tested, but does not depend on the total number of input variables. We also outline a procedure to futher amplify the success probability, based on another quantum algorithm, the Grover search.

arXiv:1006.1423•Electronic Proceedings in Theoretical Computer Science•Jun 9, 2010•16 citations
Our aim is of studying the efficiency of two typical arithmetic calculations {[T. Nakamura and K. Nagata, Int. J. Theor. Phys. {\bf 60}, 70 (2021)]} using the principle of quantum mechanics. We demonstrate some evaluations of three two-variable functions which are elements of a boolean algebra composed of the four-atom set utilizing the Bernstein--Vazirani algorithm. This is faster than a classical apparatus, which would require 212=40962^{12}=4096212=4096 evaluations. Finally, using the three two-variable functions evaluated here, we demonstrate two typical arithmetic calculations in the binary system. Hence, our calculations are faster than a classical apparatus, which would require 212=40962^{12}=4096212=4096 evaluations.
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.
We implement the Bernstein-Vazirani algorithm on a 15-bit register encoding 215-1 elements using optics. The apparatus is efficient in that the physical size of the apparatus scales linearly with the size (i.e. number of digits) of the register. We demonstrate also that the algorithm may be performed not only without entanglement, as Meyer has indicated, but also with a computational basis that does not consist of orthogonal states, and that this coding is the source of the efficiency of the algorithm. This raises several questions: is this the only algorithm that makes use of these simplifying features, or do all quantum Oracles in fact require exponential resources for their construction?
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.
We suggest a method of computing many functions in the same time by using many parallel quantum systems. We use the Bernstein-Vazirani algorithm. Given the set of real values {a1,a2,a3,…,aN}\{a_1,a_2,a_3,\ldots,a_N\}{a1​,a2​,a3​,…,aN​}, and the function g:R→{0,1}g:{\bf R}\rightarrow \{0,1\}g:R→{0,1}, we shall determine the following values {g(a1),g(a2),g(a3),…,g(aN)}\{g(a_1),g(a_2),g(a_3),\ldots, g(a_N)\}{g(a1​),g(a2​),g(a3​),…,g(aN​)} simultaneously. By using MMM parallel quantum systems, we can compute MMM functions g1,g2,...,gMg^1,g^2,...,g^Mg1,g2,...,gM simultaneously. The speed of determining the N×MN\times MN×M values will be shown to outperform the classical case by a factor of NNN.
We discuss quantum algorithms, based on the Bernstein-Vazirani algorithm, for finding which variables a Boolean function depends on. There are 2^n possible linear Boolean functions of n variables; given a linear Boolean function, the Bernstein-Vazirani quantum algorithm can deterministically identify which one of these Boolean functions we are given using just one single function query. The same quantum algorithm can also be used to learn which input variables other types of Boolean functions depend on, with a success probability that depends on the form of the Boolean function that is tested, but does not depend on the total number of input variables. We also outline a procedure to futher amplify the success probability, based on another quantum algorithm, the Grover search.