Abstract
Linear equations play an important role in nearly all fields of research in science and engineering. Recent studies have shown that quantum algorithms for solving linear systems of algebraic equations provide exponential speedups over their classical counterparts. Here, we present a simplified experimental scheme for implementing the quantum algorithm for solving linear equations with multiple degrees of freedom (DoF) of single photon. Compared with the previous studies, our scheme not only presents excellent efficiency, it requires fewer photons to solve the same problem. Our work highlights the potential applications of multiple DoFs of single photon in quantum information processes.
© 2019 Optical Society of America under the terms of the OSA Open Access Publishing Agreement
1. Introduction
Many important problems in science and engineering can be reduced to the problem of solving linear equations. Thus, it is very important to develop a fast algorithm for solving them. The best known classical algorithm to solve linear equations on classical computers with N variables requires a time that scales as [1]. Recently, Harrow et al. proposed a quantum algorithm (HHL algorithm) that is able to solve linear equations in time, which is an exponential speedup over the classical algorithm [2]. Such an exponential speedup promises widespread applications in large-scale systems, such as data processing [3], numerical calculation [4], and artificial intelligence [5,6].
The HHL algorithm has been experimentally demonstrated with parametric down-converted photon schemes [7,8], liquid nuclear magnetic resonance [9] and superconducting quantum processor [10]. All of these experimental schemes are based on encoding the qubit with the same degree of freedom (DoF) of multiparticle. For example, using the polarization of photon to encode one qubit has been reported for the multi-photon scheme described in [7]. In such a case, four photons are required to solve a linear equation with two variables, and seven photons are required to solve the linear equation with four variables. As for linear equations withvariables, photons are required. While to this end, the reported largest number of experimentally preparing multipartite entanglement are 14 trapped ions [11], 10 photons [12,13], and 10 superconducting qubits [14]. That is to say, the computation task with larger number of variables is difficult to be experimentally demonstrated in present technology. To overcome this difficulty, one way is to develop technology to prepare larger number of photons, the other is to reduce the number of photons required to solve linear equations.
Recently, some investigations have shown that the introduction of multiple DoFs of photons can increase the number of entangled qubits [15–17], enhance the violation of local realism [18,19], simplify quantum logic gates [20]. Motivated by these studies, in this work we provide an experimental realization of the HHL algorithm with multiple DoFs of photons. The path and polarization DoFs of single photons are used to encode qubit. As an example for solving a linear equations, we describe the detailed experimental process of the HHL algorithm in such a scheme. Compared with the previous studies, our scheme not only presents excellent efficiency, it requires less photons to solve the same problem.
2. Theoretical description of the quantum HHL algorithm
The HHL algorithm aims to solve a system of linear equations to find for a given Hermitian matrix and a N-dimension unit vector , where N represents the number of variables. The process involves three subsystems as shown in Fig. 1: a single ancilla qubit initialized in , a register of n qubits of working memory initialized in , and an input state initialized in . The input state can be expanded in the basis of as , where is the eigenstate of , and . That is to say, the initial state of this system is prepared at , the subscript a, r and b represents the ancilla, register and input qubit, respectively. The algorithm can be decomposed into the following three subroutines as shown in Fig. 1: (1) phase estimation [21,22], (2) controlled rotation, and (3) inverse phase estimation.
In the step (1), the phase estimation operation is applied to the input state, using the working memory as control, to transfer the state into where represents the binary representation of the eigenvalue of . In the step (2), an appropriate controlled rotation operation is used to extract the eigenvalues of . The control and controlled qubits are the register and the ancilla, respectively. After this step, the state of the system is , whereis an appropriate constant. In the final step of the inverse phase estimation, the register qubit is transformed back to . Then we obtain the state . So, making a projection measurement to obtain at the ancilla and register qubits, we can get the state , which corresponds to the expected results of the linear equations .
3. Experimental realization of the HHL algorithm for a linear equations with multiple DoFs of single photons
To illustrate the above algorithm, we consider an concrete example with a matrix , three input states , and . Following the quantum multiphoton realization of this algorithm in [7], the optimized quantum circuit for solving the linear equation is shown in Fig. 2(a), which corresponds to the process shown in Fig. 1. The compiled circuit realization of the phase estimation step consists of two C-Not gate between input and register qubits, two Hadamard gate on input qubit, a swap gate between the two register qubits and a X gate on register gate. The control rotation step is realized by two gate between the register and aniclla qubits, where . The final step is realized by two Hadamard gates and post-selection measurement on two register qubits, which is a semiclassical version that employs single-qubit rotation conditioned on measurement outcomes [23].
In our experimental scheme, the ancilla, register1 and input qubits are encoded by multipath of single photon. And register2 qubit is encoded by the polarization of the same photon. The whole experimental realization of this optimized quantum circuit is shown in Fig. 2(b). It contains three parts, the initial state preparation part to prepare the initial state, the algorithm evolution part including three subroutines to execute the phase estimation, control rotation and inverse phase estimation operation, and the measurement part to make post-selection measurement to obtain the expected state .
In the part of initial state preparation, we use ultraviolet laser pulses with a central wavelength of 390nm passing through a β-barium borate (BBO) crystal to produce two photon pairs. Before the photons are collected by single mode fibers, they are filtered by narrow bandwidth filters (780 nm, nm), which is not shown in Fig. 2(b). The total coincident counts are about 15000 per second. The collection time is 30 seconds for each measurement. One photon of the photon pairs is used as signal photon, and the other is used as idler photon. The signal photon passes through a HWP (half wave plate) with its optical axis oriented at , a PBS (polarizing beam splitter) and a HWP with its axis oriented at on the vertical output path of the PBS to prepare the input state . We can obtain the required input state , and with the ancilla and register qubit on , when the angle is taken as , and , respectively.
In the Algorithm Evolution part, the whole process corresponds to the quantum circuit shown in Fig. 2(a). The phase estimation subroutine in Fig. 2(a) is executed using the optical devices in the gray dotted box at the top left corner in Fig. 2(b). We find that the required quantum gates are the Hadamard gate with the single qubit path, the polarization X gate and two qubits C-NOT gate based on polarization and path. The detailed demonstrations of them are shown in Fig. 4(a) , Fig. 4(c) and Fig. 5(a) in Appendices A and B. In the following, we give the concrete implementation in Fig. 2(b). The Hadamard gate A on the input qubit shown in Fig. 2(a) is realized by a BS A. The first C-Not gate B between input and register2 qubits is realized by putting one HWP B on one of the paths when the other path keeps unchanged. The second C-Not gate C between the register2 and register1 qubits is realized with two PBSs and . So, we can obtain four paths encoded with , , and , respectively. To implement the Hadamard gate D on the input qubit, we need to induce the two paths with the same states on ancilla and register1 qubits and the different states on input qubit into the BS and . And the X-gate E on the polarization qubit register2 is realized by four HWPs , , and with their optical axis oriented at . The two sequential swap gates between the register1 and register2 qubits are omitted.
The controlled rotation subroutine is realized by the devices labeled with F and G, which is in the middle region of Fig. 2(b). The gate F is realized by the BS, and , putting on the path with the state on the register1 qubit and keeping the path with the state on the register1 qubit unchanged. The gate G is realized with four blue blocks ,,and . The detailed demonstration of these two control gates is shown in Appendix B.
In the subroutine of inverse phase estimation, the required two Hadamard gates are demonstrated in Figs. 4(a) and 4(b) in Appendix A. The concrete implementation of this subroutine is shown in the gray dotted box at the bottom of right corner in Fig. 2(b). The last two Hadamard gates on register1 and register2 are realized by the BS on the path qubit and the HWP with the optical axis oriented at on the polarization qubit.
After all these operations, we can obtain eight outputs which are encoded by the paths as , , , , , , and . According to the circuit shown in Fig. 2(a), the Ancilla and Register1 qubit on the path DoF, and , can be firstly post-selected. The post-selected paths are marked as Out1 and Out2 in Fig. 2(b). Then we induce these two paths into the PBS to accomplish the final post-selection on the polarization qubit register2. To characterize the expected state, we make measurement with Pauli observables , and by using a Mach-Zehnder interferometer with a piezoelectric transducer to modify the relative phase between the two arms in the green box. The detailed description of the measurement on the DoF of path is given in Appendix C.
The experimental results are shown in Fig. 3. The blue and orange bars are experimental results and theoretical expectation values, respectively. To quantify the performance of our scheme, we calculate the fidelities between the theoretical and experimental results. According to [24], the fidelity between two pure states is defined as: , where and are the theoretically and experimentally obtained state . They are about 0.991(4), 0.987(5) and 0.975(10) for , and respectively. These high fidelities indicate the good agreement between experimental results and theoretical predictions. The experimental error comes from the instability of the interferometer. The main challenge lies in keeping all the path lengths the same, which is maintained by tuning the length of the arms of the interferometer with a piezoelectric transducer installed on one Mirror of the MZ interferometer. And this structure is similar to the structure shown in Appendix C. Another effect that may lead to the experimental error is that a single gate is comprised of multiple optical elements, e.g. there are 4 separate objects performing the operation E or G on different paths. In other words, the unequal performance of the same optical elements may affect the experiment results. In fact, the mainly used optical elements are PBS and HWP. The performances of different PBSs on the polarized light are almost the same under current technical conditions. While the performances of HWPs is a little unequal. But this can be eliminated by choosing HWPs with similar performances in practical experiments.
The above experiment shows an example to solve linear equations with two variables. If such a method is generalized to the case to solve the linear equations with variables, we can use the path DoF of photons to encode the input qubit, the polarization and path DoF of the same photons to encode the register and ancilla qubits. In such a case, the number of photons required to obtain the expected results is , which is less than . So, our scheme of encoding qubit with multiple DoF of single photon can be used to simplify the realization of the HHL algorithm. Maybe, the integrated photonic chip would be a better choice for multiple path systems. In [25–27], it has shown that the wave plate operations for polarization in integrated chip can be realized. This means that our method can be performed on integrated photonic chip.
4. Conclusion and discussion
In summary, we have experimentally demonstrated an example of the HHL algorithm for solving a linear equations with the path and polarization DoFs of photons. The high fidelities have been obtained, which indicate the good performance efficiency of our scheme. In fact, the present method can be extended to solve any general linear equations, because the corresponding quantum circuit can be implemented using the quantum gates shown in Appendices A and B. Compared with the previous experimental implementations, our scheme requires less photons to solve the same problem because multiple DoFs of single photons have been used. Although the path and polarization DoFs of photons have only been used, such an idea is applicable to the general situation. For example, if the DoF of high-dimension orbital angular momentum is introduced to encode the qubits, a more optimized scheme may be obtained. It is expected that more complex quantum information processes can be solved using such an idea.
Appendix A single qubit quantum gate based on path and polarization DoFs
There are three types of single qubit quantum gate required in Fig. 2(a): single qubit Hadamard gate based on the path (Fig. 4(a)), single qubit Hadamard gate based on the polarization (Fig. 4(b)), single qubit X gate based on the polarization (Fig. 4(c)). Here we describe the concrete implementation process for these gates [28].
The single qubit Hadamard gate based on the path is realized by a 50/50 beam splitter with phase shifters at the input and output ports shown in Fig. 4(a). The phase shifter is realized by the microscope slide with adjustable effective thickness. The performance between the input path and output path is expressed as . In the experiment, we use beam splitter to represent this Hadamard gate to simplify the expression. Figures 4(b) and 4(c) show the single qubit Hadamard gate and X-gate based on the polarization, which is realized by the HWP with the optical axis oriented at and respectively. The function of the HWP with the optical axis oriented at on the polarization is .
Appendix B two qubit quantum gates based on the path and polarization DoFs
There are also three types of two qubit quantum gates required in Fig. 2(a): two qubit C-Not gate based on the polarization and path (Fig.5(a)), two qubit gate based on the path and path (Fig.5(b)), and two qubit gate based on the polarization and path (Fig.5(c)), where . The C-Not gate based on path and polarization is realized with a sensing beam splitter for polarization, which is shown in Fig. 5(a). It can be seen that if the input state is horizontally polarized, the state with the path qubit remains. If the input state is vertically polarized, the state with the path qubit will transform from and . The gate based on the path and path is shown in Fig. 5(b). The function of the gate is equivalent to the Hadamard gate, which has been demonstrated above. So we keep the path unchanged when the state of the control bit is , which is realized with two mirrors (or even do nothing in the practical experiment). While the state of the control bit is , we use a beam splitter to perform the transformation of on the controlled bit. As for the gate based on the polarization and path, it is shown in Fig. 5(c). The function of the blue box corresponds to the gate. When the input state is horizontally polarized, it will firstly appear at the upper arm. Then the output state on the path DoF remains the same to the input state. When the input state is vertically polarized, it will firstly appear at the lower arm. And the output state undergoes a operation, which is realized by the green HWP with the optical axis oriented at and a PBS. The angle of the blue HWPs are setting as .
Appendix C measurement method for the path DoF
In the following, the details of the measurement process shown in Fig. 2(b) is clarified. The measurement of the path DoF on basis is directly obtained because the post selected outputs at Out1 and Out2 are already on the eigenstates and . Thus, the measurement of Pauli observable can be realized. The measurements of the path DoF on other Pauli observable and are realized with the module shown in Fig. 6. It is a MZ interferometer with a piezoelectric transducer on one arm to modify the relative phase between the two arms. The function of the piezoelectric transducer on one arm is . The function of the beam splitter on the path DoF is . The whole function of the measurement part on the output state is . So the states at the two output ports of this module are and . By setting , the outputs are , which are the eigenstates of Pauli observable X. Similarly, by setting , the outputs are , which are the eigenstates of Pauli observable .
Funding
Ministry of Science and Technology of the People’s Republic of China Key Technologies R&D Program (2017YFA0303800); National Natural Science Foundation of China (11574031 and 61421001).
References
1. G. H. Golub and C. F. van Loan, “Matrix Computation,” John Hopkins University Press, Baltimore, MD, 1996.
2. A. W. Harrow, A. Hassidim, and S. Lloyd, “Quantum algorithm for linear systems of equations,” Phys. Rev. Lett. 103(15), 150502 (2009). [CrossRef] [PubMed]
3. N. Wiebe, D. Braun, and S. Lloyd, “Quantum algorithm for data fitting,” Phys. Rev. Lett. 109(5), 050505 (2012). [CrossRef] [PubMed]
4. A. Montanaro and S. Pallister, “Quantum algorithms and the finite element method,” Phys. Rev. A (Coll. Park) 93(3), 032324 (2016). [CrossRef]
5. S. Lloyd, M. Mohseni, and P. Rebentrost, “Quantum algorithms for supervised and unsupervised machine learning,” arXiv:1307.0411 (2013).
6. P. Rebentrost, M. Mohseni, and S. Lloyd, “Quantum support vector machine for big data classification,” Phys. Rev. Lett. 113(13), 130503 (2014). [CrossRef] [PubMed]
7. X. D. Cai, C. Weedbrook, Z. E. Su, M. C. Chen, M. Gu, M. J. Zhu, L. Li, N. L. Liu, C. Y. Lu, and J. W. Pan, “Experimental quantum computing to solve systems of linear equations,” Phys. Rev. Lett. 110(23), 230501 (2013). [CrossRef] [PubMed]
8. S. Barz, I. Kassal, M. Ringbauer, Y. O. Lipp, B. Dakić, A. Aspuru-Guzik, and P. Walther, “A two-qubit photonic quantum processor and its application to solving systems of linear equations,” Sci. Rep. 4(1), 6115 (2014). [CrossRef] [PubMed]
9. J. Pan, Y. D. Cao, X. W. Yao, Z. K. Li, C. Y. Ju, H. W. Chen, X. H. Peng, S. Kais, and J. F. Du, “Experimental realization of quantum algorithm for solving linear systems of equations,” Phys. Rev. A 89(2), 022313 (2014). [CrossRef]
10. Y. Zheng, C. Song, M. C. Chen, B. Xia, W. Liu, Q. Guo, L. Zhang, D. Xu, H. Deng, K. Huang, Y. Wu, Z. Yan, D. Zheng, L. Lu, J. W. Pan, H. Wang, C. Y. Lu, and X. Zhu, “Solving systems of linear equations with a superconducting quantum processor,” Phys. Rev. Lett. 118(21), 210504 (2017). [CrossRef] [PubMed]
11. T. Monz, P. Schindler, J. T. Barreiro, M. Chwalla, D. Nigg, W. A. Coish, M. Harlander, W. Hänsel, M. Hennrich, and R. Blatt, “14-Qubit entanglement: creation and coherence,” Phys. Rev. Lett. 106(13), 130506 (2011). [CrossRef] [PubMed]
12. X. L. Wang, L. K. Chen, W. Li, H. L. Huang, C. Liu, C. Chen, Y. H. Luo, Z. E. Su, D. Wu, Z. D. Li, H. Lu, Y. Hu, X. Jiang, C. Z. Peng, L. Li, N. L. Liu, Y. A. Chen, C. Y. Lu, and J. W. Pan, “Experimental ten-photon entanglement,” Phys. Rev. Lett. 117(21), 210502 (2016). [CrossRef] [PubMed]
13. L. Chen, Z. Li, X. Yao, M. Huang, W. Li, H. Lu, X. Yuan, Y. Zhang, X. Jiang, C. Peng, L. Li, N.-L. Liu, X. Ma, C.-Y. Lu, Y.-A. Chen, and J.-W. Pan, “Observation of ten-photon entanglement using thin BiB3O6 crystals,” Optica 4(1), 77 (2017). [CrossRef]
14. C. Song, K. Xu, W. Liu, C. P. Yang, S. B. Zheng, H. Deng, Q. Xie, K. Huang, Q. Guo, L. Zhang, P. Zhang, D. Xu, D. Zheng, X. Zhu, H. Wang, Y. A. Chen, C. Y. Lu, S. Han, and J. W. Pan, “10-qubit entanglement and parallel logic operations with a superconducting circuit,” Phys. Rev. Lett. 119(18), 180511 (2017). [CrossRef] [PubMed]
15. J. T. Barreiro, N. K. Langford, N. A. Peters, and P. G. Kwiat, “Generation of hyperentangled photon pairs,” Phys. Rev. Lett. 95(26), 260501 (2005). [CrossRef] [PubMed]
16. W. B. Gao, C. Y. Lu, X. C. Yao, P. Xu, O. Gühne, A. Goebel, Y. A. Chen, C. Z. Peng, Z. B. Chen, and J. W. Pan, “Experimental demonstration of a hyper-entangled ten-qubit Schrödinger cat state,” Nat. Phys. 6(5), 331–335 (2010). [CrossRef]
17. X. L. Wang, Y. H. Luo, H. L. Huang, M. C. Chen, Z. E. Su, C. Liu, C. Chen, W. Li, Y. Q. Fang, X. Jiang, J. Zhang, L. Li, N. L. Liu, C. Y. Lu, and J. W. Pan, “18-Qubit Entanglement with Six Photons’ Three Degrees of Freedom,” Phys. Rev. Lett. 120(26), 260502 (2018). [CrossRef] [PubMed]
18. C. Cinelli, M. Barbieri, R. Perris, P. Mataloni, and F. De Martini, “All-versus-nothing nonlocality test of quantum mechanics by two-photon hyperentanglement,” Phys. Rev. Lett. 95(24), 240405 (2005). [CrossRef] [PubMed]
19. T. Yang, Q. Zhang, J. Zhang, J. Yin, Z. Zhao, M. Żukowski, Z. B. Chen, and J. W. Pan, “All-versus-nothing violation of local realism by two-photon, four-dimensional entanglement,” Phys. Rev. Lett. 95(24), 240406 (2005). [CrossRef] [PubMed]
20. B. P. Lanyon, M. Barbieri, M. P. Almeida, T. Jennewein, T. C. Ralph, K. J. Resch, G. J. Pryde, J. L. O’Brien, A. Gilchrist, and A. G. White, “Simplifying quantum logic using higher-dimensional Hilbert spaces,” Nat. Phys. 5(2), 134–140 (2009). [CrossRef]
21. R. Cleve, A. Ekert, C. Macchiavello, and M. Mosca, “Quantum algorithms revisited,” In Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences1998 Jan 8 (Vol. 454, No. 1969, pp. 339–354).
22. A. Luis and J. Peřina, “Optimum phase-shift estimation and the quantum description of the phase difference,” Phys. Rev. A 54(5), 4564–4570 (1996). [CrossRef] [PubMed]
23. R. B. Griffiths and C.-S. Niu, “Semiclassical Fourier transform for quantum computation,” Phys. Rev. Lett. 76(17), 3228–3231 (1996). [CrossRef] [PubMed]
24. R. Jozsa, “Fidelity for mixed quantum states,” J. Mod. Opt. 41(12), 2315–2323 (1994). [CrossRef]
25. A. Crespi, R. Ramponi, R. Osellame, L. Sansoni, I. Bongioanni, F. Sciarrino, G. Vallone, and P. Mataloni, “Integrated photonic quantum gates for polarization qubits,” Nat. Commun. 2(1), 566 (2011). [CrossRef] [PubMed]
26. R. Heilmann, M. Gräfe, S. Nolte, and A. Szameit, “Arbitrary photonic wave plate operations on chip: realizing Hadamard, Pauli-X, and rotation gates for polarisation qubits,” Sci. Rep. 4(1), 4118 (2014). [CrossRef] [PubMed]
27. M. A. Ciampini, A. Orieux, S. Paesani, F. Sciarrino, G. Corrielli, A. Crespi, R. Ramponi, R. Osellame, and P. Mataloni, “Path-polarization hyperentangled and cluster states of photons on a chip,” Light Sci. Appl. 5(4), e16064 (2016). [CrossRef] [PubMed]
28. N. J. Cerf, C. Adami, and P. G. Kwiat, “Optical simulation of quantum logic,” Phys. Rev. A 57(3), R1477–R1480 (1998). [CrossRef]