The quantum-classical hybrid algorithm is a promising with respect to demonstrating the quantum advantage in noisy-intermediate-scale (NISQ) devices. When running such algorithms, effects due noise are inevitable. In our work, we consider well-known algorithm, approximate optimization (QAOA). We study on QAOA from typical channels, and produce several numerical results. Our research indicates t...

We show that Grover’s algorithm defines a geodesic in quantum Hilbert space with the Fubini-Study metric. From statistical point of view Grover’s algorithm is determined by a condition of minima for Fisher’s information function. 1.Recently a lot of attention has been paid to the problem of defining quantum algorithms [1] [2] [3]. Generically a quantum algorithm defines a discrete path in a qua...

This paper gives a glimpse of basic quantum computing concepts, which is an active area of research in today's world. The discussion starts with difference between a quantum computer and a classical one at the bit level, register level, logic gates level and at circuit level. Then, some of the important quantum phenomena such as quantum entanglement and quantum interference are discussed. After...

Quantum Factoring and Search Algorithms Quantum Information Seminar Friday, Sep. 17, 1999 Ashok Muthukrishnan Rochester Center for Quantum Information (RCQI) ___________________________________________________________ § 1. Quantum Algorithm for Factorisation (1994) A. Factorising and cryptography p. 2 B. Relation of factorisation to period-finding p. 5 C. Quantum algorithm for period-finding p....

sive speedups in computing by exploiting quantum-mechanical effects such as superposition (quantum parallelism) and entanglement.1 A quantum algorithm typically consists of applying quantum gates to quantum states, but because the input to the algorithm might be normal classical bits (or nonquantum), it only affects the selection of quantum gates. After all the gates are applied, quantum measur...

In this paper, we use the methods found in [21] to create a continuous variable analogue of Shor’s quantum factoring algorithm. By this we mean a quantum hidden subgroup algorithm that finds the period P of a function Φ : R −→ R from the reals R to the reals R, where Φ belongs to a very general class of functions, called the class of admissible functions. One objective in creating this continuo...

The characterization of quantum dynamics is a fundamental and central task in quantum mechanics. This task is typically addressed by quantum process tomography (QPT). Here we present an alternative "direct characterization of quantum dynamics" (DCQD) algorithm. In contrast to all known QPT methods, this algorithm relies on error-detection techniques and does not require any quantum state tomogr...