18
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Boson Sampling with 20 Input Photons and a 60-Mode Interferometer in a \(1{0}^{14}\) -Dimensional Hilbert Space

      Read this article at

      ScienceOpenPublisherPubMed
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Quantum computing experiments are moving into a new realm of increasing size and complexity, with the short-term goal of demonstrating an advantage over classical computers. Boson sampling is a promising platform for such a goal; however, the number of detected single photons is up to five so far, limiting these small-scale implementations to a proof-of-principle stage. Here, we develop solid-state sources of highly efficient, pure, and indistinguishable single photons and 3D integration of ultralow-loss optical circuits. We perform experiments with 20 pure single photons fed into a 60-mode interferometer. In the output, we detect up to 14 photons and sample over Hilbert spaces with a size up to 3.7×10^{14}, over 10 orders of magnitude larger than all previous experiments, which for the first time enters into a genuine sampling regime where it becomes impossible to exhaust all possible output combinations. The results are validated against distinguishable samplers and uniform samplers with a confidence level of 99.9%.

          Related collections

          Most cited references37

          • Record: found
          • Abstract: not found
          • Article: not found

          Quantum dynamics of single trapped ions

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Linear optical quantum computing with photonic qubits

              Bookmark
              • Record: found
              • Abstract: found
              • Article: not found

              Quantum Algorithm for Linear Systems of Equations

              Solving linear systems of equations is a common problem that arises both on its own and as a subroutine in more complex problems: given a matrix A and a vector b(-->), find a vector x(-->) such that Ax(-->) = b(-->). We consider the case where one does not need to know the solution x(-->) itself, but rather an approximation of the expectation value of some operator associated with x(-->), e.g., x(-->)(dagger) Mx(-->) for some matrix M. In this case, when A is sparse, N x N and has condition number kappa, the fastest known classical algorithms can find x(-->) and estimate x(-->)(dagger) Mx(-->) in time scaling roughly as N square root(kappa). Here, we exhibit a quantum algorithm for estimating x(-->)(dagger) Mx(-->) whose runtime is a polynomial of log(N) and kappa. Indeed, for small values of kappa [i.e., poly log(N)], we prove (using some common complexity-theoretic assumptions) that any classical algorithm for this problem generically requires exponentially more time than our quantum algorithm.
                Bookmark

                Author and article information

                Journal
                PRLTAO
                Physical Review Letters
                Phys. Rev. Lett.
                American Physical Society (APS)
                0031-9007
                1079-7114
                December 2019
                December 18 2019
                : 123
                : 25
                Article
                10.1103/PhysRevLett.123.250503
                31922765
                8b812ff1-da14-46dc-8e12-3f3727e7d01f
                © 2019

                https://link.aps.org/licenses/aps-default-license

                History

                Comments

                Comment on this article