Synthesizing Quantum Circuits for Simple Periodic Functions
arXiv:1305.3642
Abstract
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 simples periodic function of period p, where p is an n-bit number, one needs at most n Toffoli gates.
15 pages
References in corpus (7)
- Quantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity, and Efficient Estimators
- Experimental realisation of Shor's quantum factoring algorithm using qubit recycling
- Realization of the quantum Toffoli gate with trapped ions
- Experimental demonstration of Shor's algorithm with quantum entanglement
- Demonstration of Shor's quantum factoring algorithm using photonic qubits
- Pretending to factor large numbers on a quantum computer
- Synthesis of Reversible Functions Beyond Gate Count and Quantum Cost