scholarly journals Human-Competitive Evolution of Quantum Computing Artefacts by Genetic Programming

2006 ◽  
Vol 14 (1) ◽  
pp. 21-40 ◽  
Author(s):  
Paul Massey ◽  
John A. Clark ◽  
Susan Stepney
Keyword(s):  
Fourier Transform ◽  
Quantum Computing ◽  
Genetic Programming ◽  
Quantum Algorithms ◽  
Quantum Circuits ◽  
Quantum Fourier Transform ◽  
Competitive Evolution ◽  
Specific Quantum

We show how Genetic Programming (GP) can be used to evolve useful quantum computing artefacts of increasing sophistication and usefulness: firstly specific quantum circuits, then quantum programs, and finally system-independent quantum algorithms. We conclude the paper by presenting a human-competitive Quantum Fourier Transform (QFT) algorithm evolved by GP.

scholarly journals Quantum Computing Concepts with Deutsch Jozsa Algorithm

2019 ◽  
Vol 3 (1) ◽  
Author(s):  
Poornima Aradyamath ◽  
Naghabhushana N M ◽  
Rohitha Ujjinimatad
Keyword(s):  
Fourier Transform ◽  
Quantum Computing ◽  
Quantum Computation ◽  
Mathematical Description ◽  
Quantum Computer ◽  
Quantum Algorithms ◽  
Quantum Computers ◽  
Quantum Fourier Transform ◽  
Basic Concepts ◽  
Classical Computer

In this paper, we briefly review the basic concepts of quantum computation,  entanglement,  quantum cryptography and quantum fourier  transform.   Quantum algorithms like Deutsch Jozsa, Shor’s   factorization and Grover’s data search are developed using fourier  transform  and quantum computation concepts to build quantum computers.  Researchers are finding a way to build quantum computer that works more efficiently than classical computer.  Among the  standard well known  algorithms  in the field of quantum computation  and communication we  describe  mathematically Deutsch Jozsa algorithm  in detail for  2  and 3 qubits.  Calculation of balanced and unbalanced states is shown in the mathematical description of the algorithm.

scholarly journals EFFICIENT IMPLEMENTATIONS OF THE QUANTUM FOURIER TRANSFORM: AN EXPERIMENTAL PERSPECTIVE

2005 ◽  
Vol 03 (02) ◽  
pp. 413-424 ◽  
Author(s):  
KAVITA DORAI ◽  
DIETER SUTER
Keyword(s):  
Fourier Transform ◽  
Quantum Computing ◽  
Quantum Information ◽  
Quantum Algorithms ◽  
Point Of View ◽  
Quantum Fourier Transform ◽  
Density Matrices ◽  
Standard Quantum ◽  
Hadamard Transformation ◽  
State Tomography

The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the implementation. We focus here on an interesting decomposition of the QFT as a product of the non-selective Hadamard transformation followed by multiqubit gates corresponding to square- and higher-roots of controlled-NOT gates. This decomposition requires only O(n) operations and is thus linear in the number of qubits n. The schemes were implemented on a two-qubit NMR quantum information processor and the resultant density matrices reconstructed using standard quantum state tomography techniques. Their experimental fidelities have been measured and compared.

scholarly journals Implementation of the quantum Fourier transform on a hybrid qubit–qutrit NMR quantum emulator

2015 ◽  
Vol 13 (07) ◽  
pp. 1550059 ◽  
Author(s):  
Shruti Dogra ◽  
Arvind Dorai ◽  
Kavita Dorai
Keyword(s):  
Fourier Transform ◽  
Quantum Algorithms ◽  
Quantum Computers ◽  
Quantum Fourier Transform ◽  
Specific Implementation ◽  
Circuit Decomposition

The quantum Fourier transform (QFT) is a key ingredient of several quantum algorithms and a qudit-specific implementation of the QFT is hence an important step toward the realization of qudit-based quantum computers. This work develops a circuit decomposition of the QFT for hybrid qudits based on generalized Hadamard and generalized controlled-phase gates, which can be implemented using selective rotations in NMR. We experimentally implement the hybrid qudit QFT on an NMR quantum emulator, which uses four qubits to emulate a single qutrit coupled to two qubits.

scholarly journals Quantum arithmetic operations based on quantum fourier transform on signed integers

2020 ◽  
Vol 18 (06) ◽  
pp. 2050035
Author(s):  
Engin Şahin
Keyword(s):  
Fourier Transform ◽  
Quantum Circuits ◽  
Quantum Computers ◽  
Quantum Fourier Transform ◽  
Arithmetic Operations ◽  
Absolute Value ◽  
Addition And Subtraction ◽  
Quantum Arithmetic

The quantum Fourier transform (QFT) brings efficiency in many respects, especially usage of resource, for most operations on quantum computers. In this study, the existing QFT-based and non-QFT-based quantum arithmetic operations are examined. The capabilities of QFT-based addition and multiplication are improved with some modifications. The proposed operations are compared with the nearest quantum arithmetic operations. Furthermore, novel QFT-based subtraction, division and exponentiation operations are presented. The proposed arithmetic operations can perform nonmodular operations on all signed numbers without any limitation by using less resources. In addition, novel quantum circuits of two’s complement, absolute value and comparison operations are also presented by using the proposed QFT-based addition and subtraction operations.

Machine invention of quantum computing circuits by means of genetic programming

2008 ◽  
Vol 22 (3) ◽  
pp. 275-283 ◽  
Author(s):  
Lee Spector ◽  
Jon Klein
Keyword(s):  
Quantum Computing ◽  
Genetic Programming ◽  
Quantum Computer ◽  
Quantum Circuit ◽  
Quantum Circuits ◽  
Practical Significance ◽  
Programming System ◽  
Computer Simulator ◽  
Classical Quantum ◽  
Better Than

AbstractWe demonstrate the use of genetic programming in the automatic invention of quantum computing circuits that solve problems of potential theoretical and practical significance. We outline a developmental genetic programming scheme for such applications; in this scheme the evolved programs, when executed, build quantum circuits and the resulting quantum circuits are then tested for “fitness” using a quantum computer simulator. Using the PushGP genetic programming system and the QGAME quantum computer simulator we demonstrate the invention of a new, better than classical quantum circuit for the two-oracle AND/OR problem.

scholarly journals QUANTUM PHASE ESTIMATION WITH AN ARBITRARY NUMBER OF QUBITS

2013 ◽  
Vol 11 (01) ◽  
pp. 1350008
Author(s):  
CHEN-FU CHIANG
Keyword(s):  
Fourier Transform ◽  
Quantum Computing ◽  
Diophantine Approximation ◽  
Great Difficulty ◽  
Quantum Computers ◽  
Phase Estimation ◽  
Quantum Fourier Transform ◽  
Factorization Algorithm ◽  
Simultaneous Diophantine Approximation ◽  
Parallel Circuits

Due to the great difficulty in scalability, quantum computers are limited in the number of qubits during the early stages of the quantum computing regime. In addition to the required qubits for storing the corresponding eigenvector, suppose we have additional k qubits available. Given such a constraint k, we propose an approach for the phase estimation for an eigenphase of exactly n-bit precision. This approach adopts the standard recursive circuit for quantum Fourier transform (QFT) in [R. Cleve and J. Watrous, Fast parallel circuits for quantum fourier transform, Proc. 41st Annual Symp. on Foundations of Computer Science (2000), pp. 526–536.] and adopts classical bits to implement such a task. Our algorithm has the complexity of O(n log k), instead of O(n2) in the conventional QFT, in terms of the total invocation of rotation gates. We also design a scheme to implement the factorization algorithm by using k available qubits via either the continued fractions approach or the simultaneous Diophantine approximation.

Quantum Computing II

2020 ◽  
pp. 245-262
Author(s):  
M. Suhail Zubairy
Keyword(s):  
Fourier Transform ◽  
Quantum Computing ◽  
Quantum Entanglement ◽  
Arbitrary Number ◽  
Quantum Fourier Transform ◽  
Grover’S Algorithm ◽  
Computing Algorithm ◽  
Shor's Algorithm ◽  
Grover's Algorithm

This chapter deals with some of the most prominent successes of quantum computing. The most well-known quantum computing algorithm, Shor’s algorithm for factoring a number in its prime factors, is discussed in details. The key to Shor’s algorithm is the quantum Fourier transform that is explained with the help of simple examples. The role of quantum entanglement is also discussed. The next important quantum computing algorithm is Grover’s algorithm that helps in searching an item in an unsorted database. This algorithm is motivated by first discussing a quantum shell game in which a pea hidden under one of the four shells is found in one measurement with certainty each time. This amazing result is then generalized to an arbitrary number of objects and Grover’s algorithm.

Synthesis of quantum circuits for $d$-level systems by using cosine-sine

2009 ◽  
Vol 9 (5&6) ◽  
pp. 423-443
Author(s):  
Y. Nakajima ◽  
Y. Kawano ◽  
H. Sekigawa ◽  
M. Nakanishi ◽  
S. Yamashita ◽  
...  
Keyword(s):  
Fourier Transform ◽  
Quantum Circuit ◽  
Previous Method ◽  
Quantum Circuits ◽  
Divide And Conquer ◽  
Synthesis Methods ◽  
Quantum Fourier Transform ◽  
Asymptotically Optimal ◽  
Polynomial Size

We study the problem of designing minimal quantum circuits for any operations on $n$ qudits by means of the cosine-sine decomposition. Our method is based on a divide-and-conquer strategy. In that strategy, the size of the produced quantum circuit depends on whether the partitioning is balanced. We provide a new cosine-sine decomposition based on a balanced partitioning for $d$-level systems. The produced circuit is not asymptotically optimal except when $d$ is a power of two, but, when the number of qudits $n$ is small, our method can produce the smallest quantum circuit compared to the circuits produced by other synthesis methods. For example, when $d=3$ (three-level systems) and $n=2$ (two qudits), then the number of two-qudit operations called CINC, which is a generalized versions of CNOT, is 36 whereas the previous method needs 156 CINC gates. Moreover, we show that our method is useful for designing a polynomial-size quantum circuit for the radix-$d$ quantum Fourier transform.

Estimation of the heating rate of ions due to laser fluctuations when implementing quantum algorithms

2007 ◽  
Vol 7 (7) ◽  
pp. 573-583
Author(s):  
S. Fujiwara ◽  
S. Hasegawa
Keyword(s):  
Fourier Transform ◽  
White Noise ◽  
Heating Rate ◽  
Laser Intensity ◽  
Quantum Algorithms ◽  
Trapped Ions ◽  
Quantum Fourier Transform ◽  
Phase Fluctuations ◽  
Order Of Magnitude ◽  
Magnitude Difference

We analyze numerically the heating of trapped ions due to laser intensity and phase fluctuations when implementing Grover's algorithm and the Quantum Fourier Transform. For a simpler analysis we assume that the stochastic processes are white noise processes and average over each noise as in [Phys. Rev. A. \textbf{57}, 3748, (1998)]. We investigate the fidelity and the heating rate for these algorithms using parameters estimated from experiments, and we can see the order of magnitude difference in the heating rate depending on the quantum algorithms.

Sign in / Sign up

Export Citation Format

Share Document