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

Constructing Quantum Circuits for Simple Periodic Functions

Omar Gamel, Daniel F. V. James

Published May 15, 2013• 0 citations
OpenAlex

Related papers

Periodic functions and quantum computing

Karl E. Friedl

•Jan 1, 2003•0 citations

Quantum circuits for simple periodic functions

Omar Gamel, Daniel F. V. James

Periodic functions are of special importance in quantum computing, particularly in applications of Shor's algorithm. We explore methods of creating circuits for periodic functions to better understand their properties. We introduce a method for constructing the circuit for a simple monoperiodic function, that is one-to-one within a single period, of a given period $p$. We conjecture that to create a simple periodic function of period $p$, where $p$ is an $n$-bit number, one needs at most $n$ Toffoli gates.

arXiv:1305.3642•Quantum Information and Computation•Jul 1, 2014•3 citations

A universal quantum circuit design for periodical functions

Junxu Li, Sabre Kais

We propose a universal quantum circuit design that can estimate any arbitrary one-dimensional periodic functions based on the corresponding Fourier expansion. The quantum circuit contains N -qubits to store the information on the different N -Fourier components and M + 2 auxiliary qubits with M = ⌈log 2 N ⌉ for control operations. The desired output will be measured in the last qubit q N with a time complexity of the computation of , which leads to polynomial speedup under certain circumstances. We illustrate the approach by constructing the quantum circuit for the square wave function with accurate results obtained by direct simulations using the IBM-QASM simulator. The approach is general and can be applied to any arbitrary periodic function.

arXiv:2106.02678•New Journal of Physics•Oct 1, 2021•9 citations

Basic circuits for quantum computation

Gunajit Kalita

Advances in computers•Aug 5, 2025•0 citations

Constructing Quantum Circuits for Unitary Operations

Joanna Wiśniewska

•Jan 1, 2011•0 citations

A Key Component of the Shor's Algorithm and Its Possible Quantum Implementations

Jiří Tomčala

A fundamental problem in factorization by Shor's algorithm [1] is the implementation of the modular exponentiation function. The period of this function is important for determining the individual factors, so its accurate implementation is for successful factorization critical.The imprecision of current quantum computers requires that any quantum circuits should be as simple as possible. Both in terms of the number of qubits used, the number of quantum gates and the depth of the quantum circuit. Therefore, it is necessary to search for an optimal variant for the implementation of the above-mentioned modular exponentiation function.The standard method is to implement individual arithmetic functions [2] which can be combined to achieve the desired modular exponentiation function. This process, however, creates a very complex quantum circuit, so that its measured result (probability distribution) will be so skewed that it will not be possible to reliably obtain the period of sought.Another way is to create a special quantum circuit for one particular modular exponentiation function [3]. Such a circuit is of course simpler than the circuit created by the above universal implementation, but in practice it only makes sense for testing the functionality of the surrounding quantum circuit for period detection.A very interesting possibility for the implementation of arithmetic functions is to use the direct and inverse quantum Fourier transform [4]. For a quantum computer, these transformations are very easy operations, and this interesting feature can then be used to advantage in these various implementations.This contribution will explore these possible approaches and show their advantages and disadvantages through concrete examples.

•Dec 17, 2025•0 citations
Periodic functions are of special importance in quantum computing, particularly in applications of Shor's algorithm. We explore methods of creating circuits for periodic functions to better understand their properties. We introduce a method for constructing the circuit for a simple monoperiodic function, that is one-to-one within a single period, of a given period ppp. We conjecture that to create a simple periodic function of period ppp, where ppp is an nnn-bit number, one needs at most nnn Toffoli gates.
We propose a universal quantum circuit design that can estimate any arbitrary one-dimensional periodic functions based on the corresponding Fourier expansion. The quantum circuit contains N -qubits to store the information on the different N -Fourier components and M + 2 auxiliary qubits with M = ⌈log 2 N ⌉ for control operations. The desired output will be measured in the last qubit q N with a time complexity of the computation of , which leads to polynomial speedup under certain circumstances. We illustrate the approach by constructing the quantum circuit for the square wave function with accurate results obtained by direct simulations using the IBM-QASM simulator. The approach is general and can be applied to any arbitrary periodic function.
A fundamental problem in factorization by Shor's algorithm [1] is the implementation of the modular exponentiation function. The period of this function is important for determining the individual factors, so its accurate implementation is for successful factorization critical.The imprecision of current quantum computers requires that any quantum circuits should be as simple as possible. Both in terms of the number of qubits used, the number of quantum gates and the depth of the quantum circuit. Therefore, it is necessary to search for an optimal variant for the implementation of the above-mentioned modular exponentiation function.The standard method is to implement individual arithmetic functions [2] which can be combined to achieve the desired modular exponentiation function. This process, however, creates a very complex quantum circuit, so that its measured result (probability distribution) will be so skewed that it will not be possible to reliably obtain the period of sought.Another way is to create a special quantum circuit for one particular modular exponentiation function [3]. Such a circuit is of course simpler than the circuit created by the above universal implementation, but in practice it only makes sense for testing the functionality of the surrounding quantum circuit for period detection.A very interesting possibility for the implementation of arithmetic functions is to use the direct and inverse quantum Fourier transform [4]. For a quantum computer, these transformations are very easy operations, and this interesting feature can then be used to advantage in these various implementations.This contribution will explore these possible approaches and show their advantages and disadvantages through concrete examples.