Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Quantum computing applications of genetic programming
Advances in genetic programming
Quantum computation and quantum information
Quantum computation and quantum information
A new algorithm for producing quantum circuits using KAK decompositions
Quantum Information & Computation
Quantum Information Processing
Efficient Universal Quantum Circuits
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Efficient universal quantum circuits
Quantum Information & Computation
A 802.11 MAC Protocol Adaptation for Quantum Communications
DS-RT '12 Proceedings of the 2012 IEEE/ACM 16th International Symposium on Distributed Simulation and Real Time Applications
| Hi-index | 0.00 |
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.