Decomposition of Unitary Matrices for Finding Quantum Circuits

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.1063/1.3575402

Constructing appropriate unitary matrix operators for new quantum algorithms and finding the minimum cost gate sequences for the implementation of these unitary operators is of fundamental importance in the field of quantum information and quantum computation. Evolution of quantum circuits faces two major challenges: complex and huge search space and the high costs of simulating quantum circuits on classical computers. Here, we use the group leaders optimization algorithm to decompose a given unitary matrix into a proper-minimum cost quantum gate sequence. Using this procedure, we present the circuit designs for the simulation of the Toffoli gate, the amplifica- tion step of the Grover search algorithm, the quantum Fourier transform, the sender part of the quantum teleportation and the unitary propagator of the Hamiltonian for the hydrogen molecule. The approach is general and can be applied to generate the sequence of quantum gates for larger molecular systems.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Decomposition of Unitary Matrices for Finding Quantum Circuits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Decomposition of Unitary Matrices for Finding Quantum Circuits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decomposition of Unitary Matrices for Finding Quantum Circuits will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-694719

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.