Universal quantum circuit for n-qubit quantum gate: a programmable quantum gate

2007 ◽  
Vol 7 (3) ◽  
pp. 228-242
Author(s):  
P.B.M. Sousa ◽  
R.V. Ramos
Keyword(s):  
Quantum Computer ◽  
Quantum Circuit ◽  
Quantum Gate ◽  
Quantum Circuits ◽  
Unitary Matrices ◽  
Quantum Operations ◽  
Universal Quantum ◽  
Np Problems ◽  
Universal Quantum Circuit ◽  
Specific Quantum

Quantum computation has attracted much attention, among other things, due to its potentialities to solve classical NP problems in polynomial time. For this reason, there has been a growing interest to build a quantum computer. One of the basic steps is to implement the quantum circuit able to realize a given unitary operation. This task has been solved using decomposition of unitary matrices in simpler ones till reach quantum circuits having only single-qubits and CNOTs gates. Usually the goal is to find the minimal quantum circuit able to solve a given problem. In this paper we go in a different direction. We propose a general quantum circuit able to implement any specific quantum circuit by just setting correctly the parameters. In other words, we propose a programmable quantum circuit. This opens the possibility to construct a real quantum computer where several different quantum operations can be realized in the same hardware. The configuration is proposed and its optical implementation is discussed.

scholarly journals Training of quantum circuits on a hybrid quantum computer

2019 ◽  
Vol 5 (10) ◽  
pp. eaaw9918 ◽  
Author(s):  
D. Zhu ◽  
N. M. Linke ◽  
M. Benedetti ◽  
K. A. Landsman ◽  
N. H. Nguyen ◽  
...  
Keyword(s):  
Quantum Computer ◽  
Quantum Circuit ◽  
Quantum Circuits ◽  
Bayesian Optimization ◽  
Optimization Strategy ◽  
Generative Modeling ◽  
Universal Quantum ◽  
Near Term ◽  
Universal Quantum Circuit ◽  
Learning Schemes

Generative modeling is a flavor of machine learning with applications ranging from computer vision to chemical design. It is expected to be one of the techniques most suited to take advantage of the additional resources provided by near-term quantum computers. Here, we implement a data-driven quantum circuit training algorithm on the canonical Bars-and-Stripes dataset using a quantum-classical hybrid machine. The training proceeds by running parameterized circuits on a trapped ion quantum computer and feeding the results to a classical optimizer. We apply two separate strategies, Particle Swarm and Bayesian optimization to this task. We show that the convergence of the quantum circuit to the target distribution depends critically on both the quantum hardware and classical optimization strategy. Our study represents the first successful training of a high-dimensional universal quantum circuit and highlights the promise and challenges associated with hybrid learning schemes.

scholarly journals Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization

2021 ◽  
Vol 20 (7) ◽  
Author(s):  
Ismail Ghodsollahee ◽  
Zohreh Davarzani ◽  
Mariam Zomorodi ◽  
Paweł Pławiak ◽  
Monireh Houshmand ◽  
...  
Keyword(s):  
Quantum Computation ◽  
Quantum Computer ◽  
Quantum Circuit ◽  
Quantum Circuits ◽  
Connectivity Matrix ◽  
Circuit Optimization ◽  
Novel Approach ◽  
The Matrix ◽  
Minimum Number ◽  
Two Phases

AbstractAs quantum computation grows, the number of qubits involved in a given quantum computer increases. But due to the physical limitations in the number of qubits of a single quantum device, the computation should be performed in a distributed system. In this paper, a new model of quantum computation based on the matrix representation of quantum circuits is proposed. Then, using this model, we propose a novel approach for reducing the number of teleportations in a distributed quantum circuit. The proposed method consists of two phases: the pre-processing phase and the optimization phase. In the pre-processing phase, it considers the bi-partitioning of quantum circuits by Non-Dominated Sorting Genetic Algorithm (NSGA-III) to minimize the number of global gates and to distribute the quantum circuit into two balanced parts with equal number of qubits and minimum number of global gates. In the optimization phase, two heuristics named Heuristic I and Heuristic II are proposed to optimize the number of teleportations according to the partitioning obtained from the pre-processing phase. Finally, the proposed approach is evaluated on many benchmark quantum circuits. The results of these evaluations show an average of 22.16% improvement in the teleportation cost of the proposed approach compared to the existing works in the literature.

scholarly journals Error mitigation with Clifford quantum-circuit data

Quantum ◽  
2021 ◽  
Vol 5 ◽  
pp. 592
Author(s):  
Piotr Czarnik ◽  
Andrew Arrasmith ◽  
Patrick J. Coles ◽  
Lukasz Cincio
Keyword(s):  
State Energy ◽  
Quantum Computer ◽  
Quantum Circuit ◽  
Training Data ◽  
Quantum Circuits ◽  
Accurate Estimation ◽  
Error Mitigation ◽  
Order Of Magnitude ◽  
Quantum Observables ◽  
Near Term

Achieving near-term quantum advantage will require accurate estimation of quantum observables despite significant hardware noise. For this purpose, we propose a novel, scalable error-mitigation method that applies to gate-based quantum computers. The method generates training data {Xinoisy,Xiexact} via quantum circuits composed largely of Clifford gates, which can be efficiently simulated classically, where Xinoisy and Xiexact are noisy and noiseless observables respectively. Fitting a linear ansatz to this data then allows for the prediction of noise-free observables for arbitrary circuits. We analyze the performance of our method versus the number of qubits, circuit depth, and number of non-Clifford gates. We obtain an order-of-magnitude error reduction for a ground-state energy problem on 16 qubits in an IBMQ quantum computer and on a 64-qubit noisy simulator.

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 Towards optimization of quantum circuits

Open Physics ◽  
2008 ◽  
Vol 6 (1) ◽  
Author(s):  
Michal Sedlák ◽  
Martin Plesch
Keyword(s):  
Quantum Information ◽  
Quantum Information Processing ◽  
Quantum Circuit ◽  
Quantum Gate ◽  
Quantum Circuits ◽  
Quantum Gates ◽  
Unitary Operation ◽  
Short Sequence ◽  
Toffoli Gates ◽  
Universal Procedure

AbstractAny unitary operation in quantum information processing can be implemented via a sequence of simpler steps — quantum gates. However, actual implementation of a quantum gate is always imperfect and takes a finite time. Therefore, searching for a short sequence of gates — efficient quantum circuit for a given operation, is an important task. We contribute to this issue by proposing optimization of the well-known universal procedure proposed by Barenco et al. [Phys. Rev. A 52, 3457 (1995)]. We also created a computer program which realizes both Barenco’s decomposition and the proposed optimization. Furthermore, our optimization can be applied to any quantum circuit containing generalized Toffoli gates, including basic quantum gate circuits.

ON THE QUANTUM KOLMOGOROV COMPLEXITY OF CLASSICAL STRINGS

2009 ◽  
Vol 07 (04) ◽  
pp. 701-711 ◽  
Author(s):  
MARKUS MÜLLER
Keyword(s):  
Kolmogorov Complexity ◽  
Quantum Computer ◽  
Mathematical Proof ◽  
Minimal Length ◽  
Additive Constant ◽  
Quantum Operations ◽  
Universal Quantum ◽  
Probabilistic Error ◽  
Quantum Complexity ◽  
Binary Strings

We show that classical and quantum Kolmogorov complexity of binary strings agree up to an additive constant. Both complexities are defined as the minimal length of any (classical resp. quantum) computer program that outputs the corresponding string. It follows that quantum complexity is an extension of classical complexity to the domain of quantum states. This is true even if we allow a small probabilistic error in the quantum computer's output. We outline a mathematical proof of this statement, based on an inequality for outputs of quantum operations and a classical program for the simulation of a universal quantum computer.

Sign in / Sign up

Export Citation Format

Share Document