Analysis of circuit imperfections in bosonsampling

Quantum Information and Computation

Volumn 15, Issue 5-6, 2015, Pages 489-512

  Leverrier, Anthony ^a   Garcia Patron, Raul ^b,c  

^a INRIA ROCQUENCOURT   (France)

^b libre de Bruxelles   (Belgium)

^c MAX PLANCK INSTITUT FÜR QUANTENOPTIK   (Germany)

Author keywords

The contents of the

Indexed keywords

FAULT TOLERANCE; LIGHT; TIMING CIRCUITS;

'CURRENT; FAULT TOLERANCE MECHANISMS; LINEAR OPTICS; QUANTA COMPUTERS; SINGLE PHOTONS; STATE-OF-THE-ART EQUIPMENTS; THE CONTENT OF THE;

QUANTUM COMPUTERS;

EID: 84920374061     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: 10.26421/qic15.5-6-8     Document Type: Article

References (20)

1. Peter W Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM journal on computing, 26(5):1484-1509, 1997.
2. John A Smolin, Graeme Smith, and Alexander Vargo. Oversimplifying quantum factoring. Nature, 499(7457):163-165, 2013.
3. John Preskill. Quantum computing and the entanglement frontier. arXiv preprint arXiv:1203.5813, 2012.
4. Scott Aaronson and Alex Arkhipov. The computational complexity of linear optics. Theory of Computing, 9(4):143-252, 2013.
5. Matthew A Broome, Alessandro Fedrizzi, Saleh Rahimi-Keshari, Justin Dove, Scott Aaronson, Timothy C Ralph, and Andrew G White. Photonic boson sampling in a tunable circuit. Science, 339(6121):794-798, 2013.
6. Max Tillmann, Borivoje Dakić, René Heilmann, Stefan Nolte, Alexander Szameit, and Philip Walther. Experimental boson sampling. Nature Photonics, 7:540, 2013.
7. Justin B Spring, Benjamin J Metcalf, Peter C Humphreys, W Steven Kolthammer, Xian-Min Jin, Marco Barbieri, Animesh Datta, Nicholas Thomas-Peter, Nathan K Langford, Dmytro Kundys, et al. Boson sampling on a photonic chip. Science, 339(6121):798-801, 2013.
8. Andrea Crespi, Roberto Osellame, Roberta Ramponi, Daniel J Brod, Ernesto F Galvao, Nicolò Spagnolo, Chiara Vitelli, Enrico Maiorino, Paolo Mataloni, and Fabio Sciarrino. Experimental boson sampling in arbitrary integrated photonic circuits. Nature Photonics, 7:545, 2013.
9. CK Hong, ZY Ou, and Leonard Mandel. Measurement of subpicosecond time intervals between two photons by interference. Physical Review Letters, 59(18):2044-2046, 1987.
10. Larry J Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science, 3(1):1-22, 1976.
11. Alex Arkhipov and Greg Kuperberg. The bosonic birthday paradox. arXiv preprint arXiv:1106.0849, 2011.
12. Michael Reck, Anton Zeilinger, Herbert J Bernstein, and Philip Bertani. Experimental realization of any discrete unitary operator. Physical Review Letters, 73(1):58, 1994.
13. Stefan Scheel. Permanents in linear optical networks. arXiv preprint quant-ph/0406127, 2004.
14. C. Gogolin, M. Kliesch, L. Aolita, and J. Eisert. Boson-sampling in the light of sample complexity. arXiv preprint arXiv:1306.3995, 2013.
15. Leslie G Valiant. The complexity of computing the permanent. Theoretical computer science, 8(2):189-201, 1979.
16. Peter P Rohde and Timothy C Ralph. Error tolerance of the boson-sampling model for linear optics quantum computing. Physical Review A, 85(2):022332, 2012.
17. Peter P Rohde. Optical quantum computing with photons of arbitrarily low fidelity and purity. Physical Review A, 86(5):052321, 2012.
18. Sanjeev Arora, Arnab Bhattacharyya, Rajsekar Manokaran, and Sushant Sachdeva. Testing permanent oracles-revisited. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pages 362-373. Springer, 2012.
19. Bai-Ni Guo and Feng Qi. Sharp bounds for harmonic numbers. Applied Mathematics and Com- putation, 218(3):991-995, 2011.
20. Joel A Tropp. User-friendly tail bounds for sums of random matrices. Foundations of Computational Mathematics, 12(4):389-434, 2012.