recursive quantum algorithms for integrated opticstgnm/notes/qip2016poster.pdfΒ Β· recursive quantum...
TRANSCRIPT
Recursive quantum algorithms for integrated optics
Gelo Noel M. Tabia
Institute of Computer Science, University of Tartu, Estonia
MotivationIt is known that any π-dimensional unitary can be achievedby a linear optical network with π modes and π(π2) gates.
However, for specific unitary families, we do not know whatthe optimal network is.
Quantum Fourier transformsThis is a discrete Fourier transform on quantum states usedin algorithms such as phase estimation.
Groverβs algorithmThis is a quantum search on an unstructured database, which achieves a quadratic speedup over the classical case.
Performance under realistic errorsThe fidelity histograms for 3-qubit QFT (left) and 8-item Grover search (right) with 107 trials is given below.
Main contributionWe provide matrix decompositions for quantum Fouriertransforms and Grover inversion that operate on 2π modesusing two copies of the same operation on π modes.
PreliminariesThe elementary gates are phase shifters and beam splitters.For a phase shifter with phase parameter π,
For a beam splitter with reflectivity π,
Let ππ π be a phase shift π on mode π. Let π΅π(π, π) denote a beam splitter with reflectivity π on modes π and π. Note thatπ΅0 is equivalent to a swap operation.
π΅π =π 1 β π
1 β π β π
ππ =1 00 πππ
π
π
Reck triangular array of beam splitters for π = 4.
πΉ4 =1
4
1 11 π
1 1β1 βπ
1 β11 βπ
1 β1β1 π
Here we describe a recursive circuit for W. To start, considerthe unitary π4 below and how it is used to construct π8. Therecipe for π2π given ππ is described in Box 2.
Below is the circuit for πΉ8 built using two copies of πΉ4. Itexhibits a pattern for the general case described in Box 1.
1) Apply ππ on modes 1 to π and ππ on modes π + 1 to 2π.2) Apply the circuit for Ξ£2d.3) Use the following beam splitters: π΅ 1 2
1,2 , π΅ 1 2(3,4),β¦, π΅ 1 2
(2π β 1,2π)
4) Apply the circuit for Ξ£2πβ1.
π» = HadamardπΊ = Grover iterateπ = oracle queryπ = Grover inversion
πΊ = ππ
The following shows how π8 is built using two copies of thecircuit for π4 and π4. The procedure for π2π using ππ and ππ is described in Box 3.
Let Ξ£2d denote the permutation 1,2, β¦ , 2π β¦ 1, π + 1,2, π + 2,β¦ . , π, 2π . Ituses π(π β 1)/2 swap operations. Let Ξ£2π
β1 denote its inverse.
1) Apply the circuit for Ξ£2πβ1.
2) Apply πΉπ on modes 1 to π and πΉπ on modes π + 1 to 2π.3) Use the following phase shifters: ππ
π(π + 2),β¦, πππ
π
(π + π + 1),β¦, π(πβ1)π
π
(2π)
4) Apply the circuit for Ξ£2d.5) Use the following beam splitters: π΅ 1 2
1,2 , π΅ 1 2(3,4),β¦, π΅ 1 2
(2π β 1,2π)
6) Apply the circuit for Ξ£2πβ1.
1) Apply ππ on modes 1 to π and ππ on modes π + 1 to 2π.2) Apply ππ on modes 1 to π and ππ on modes π + 1 to 2π.3) Let Ξ¦2d denotee the permutation that exchanges mode 1 and mode π + 1. It
uses π(π2/4) swap operations. Apply the circuit for Ξ¦2d.4) Apply ππ on modes 1 to π and ππ on modes π + 1 to 2π.
Error model: 4% on beam splitter reflectivities and 5% absorption loss in phase shifters
Contact information: Gelo Noel Macuja Tabia ([email protected])Institute of Computer Science, University of Tartu, J.Liivi 2, 50409, Tartu, Estonia
Acknowledgement: This work is funded by institutional research grant IUT2-1 from the Estonian Research Council and by the European Union through the European Regional Development Fund.
1
2
3