The DOI matches its Crossref record; 117 of the 118 references it cites were found in a registry or an index, and 1 are not checked yet.
Applications of near-term photonic quantum computers: software and algorithms
Open accessAbstract
Gaussian boson sampling (GBS) is a near-term platform for photonic quantum computing. Recent efforts have led to the discovery of GBS algorithms with applications to graph-based problems, point processes, and molecular vibronic spectra in chemistry. The development of dedicated quantum software is a key enabler in permitting users to program devices and implement algorithms. In this work, we introduce a new applications layer for the Strawberry Fields photonic quantum computing library. The applications layer provides users with the necessary tools to design and implement algorithms using GBS with only a few lines of code. This paper serves a dual role as an introduction to the software, supported with example code, and also a review of the current state of the art in GBS algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“For a pure Gaussian state, it can be shown that the A matrix is symmetric (Bromley et al. , 2020).”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Bromley et al., 2020
The cited source says what the claim attributes to it.
In the citing paper
“CO applications of photonic QC include dense subgraph identification, Max-Clique, and graph similarity [24].”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [24]
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“Within the gate-model domain, a further distinction can be made between VQAs, Grover-based approaches [52, 118], and other gate-based approaches that have been mentioned above, e.g., References [15, 16, 24, 94].”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [24]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
node2vec: Scalable Feature Learning for Networks
Grover, A., & Leskovec, J. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939754 · Cited by 10,926
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552
Weedbrook, C., Pirandola, S., García−Patrón, R., Cerf, N. J., Ralph, T. C., Shapiro, J. H., & Lloyd, S. (2012) · Reviews of Modern Physics · doi:10.1103/revmodphys.84.621 · Cited by 3,843
Ladd, T. D., Jelezko, F., Laflamme, R., Nakamura, Y., Monroe, C., & O’Brien, J. L. (2010) · Nature · doi:10.1038/nature08812 · Cited by 3,592
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
Georgescu, I. M., Ashhab, S., & Nori, F. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.153 · Cited by 2,932
Probing many-body dynamics on a 51-atom quantum simulator
Bernien, H., Schwartz, S., Keesling, A., Levine, H., Omran, A., Pichler, H., Choi, S., Zibrov, A. S., Endres, M., Greiner, M., et al. (2017) · Nature · doi:10.1038/nature24622 · Cited by 2,460
O'Brien, J. L., Furusawa, A., & Vučković, J. (2009) · Nature Photonics · doi:10.1038/nphoton.2009.229 · Cited by 2,388
Quantum annealing in the transverse Ising model
Kadowaki, T., & Nishimori, H. (1998) · Physical Review E · doi:10.1103/physreve.58.5355 · Cited by 2,339
The theory of variational hybrid quantum-classical algorithms
McClean, J. R., Romero, J., Babbush, R., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/2/023023 · Cited by 2,227
Superconducting Circuits for Quantum Information: An Outlook
Devoret, M., & Schoelkopf, R. J. (2013) · Science · doi:10.1126/science.1231930 · Cited by 2,197
Experimental realization of any discrete unitary operator
Reck, M., Zeilinger, A., Bernstein, H. J., & Bertani, P. (1994) · Physical Review Letters · doi:10.1103/physrevlett.73.58 · Cited by 2,155
Quantum annealing with manufactured spins
Johnson, M. W., Amin, M. H. S., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A. J., Johansson, J., Bunyk, P., et al. (2011) · Nature · doi:10.1038/nature10012 · Cited by 1,891
Graph embedding techniques, applications, and performance: A survey
Goyal, P., & Ferrara, E. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.03.022 · Cited by 1,801
Single-photon detectors for optical quantum information applications
Hadfield, R. H. (2009) · Nature Photonics · doi:10.1038/nphoton.2009.230 · Cited by 1,763
Qiskit: An Open-source Framework for Quantum Computing
Aleksandrowicz, G., Alexander, T., Barkoutsos, P. K., Bello, L., Ben-Haim, Y., Bucher, D., Cabrera-Hernández, F. J., Carballo-Franquis, J., Chen, A., Chen, C.-F., et al. (2019) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.2562110 · Cited by 1,454
Qiskit: An Open-source Framework for Quantum Computing
Aleksandrowicz, G., Alexander, T., Barkoutsos, P. K., et al. (2019) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.2562111 · Cited by 1,314
Optimal design for universal multiport interferometers
Clements, W. R., Humphreys, P. C., Metcalf, B. J., Kolthammer, W. S., & Walsmley, I. A. (2016) · Optica · doi:10.1364/optica.3.001460 · Cited by 1,216
Quantum computing with trapped ions
HAFFNER, H., ROOS, C., & BLATT, R. (2008) · Physics Reports · doi:10.1016/j.physrep.2008.09.003 · Cited by 1,154
Determinantal Point Processes for Machine Learning
Kulesza, A., & Taskar, B. (2012) · now publishers, Inc. eBooks · doi:10.1561/2200000044 · Cited by 1,077
Trawling the Web for emerging cyber-communities
Kumar, R., Raghavan, P., Rajagopalan, S., & Tomkins, A. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00040-7 · Cited by 999
On Graph Kernels: Hardness Results and Efficient Alternatives
Gärtner, T., Flach, P. A., & Wrobel, S. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45167-9_11 · Cited by 874
Debnath, A. K., Lopez de Compadre, R. L., Debnath, G., Shusterman, A. J., & Hansch, C. (1991) · Journal of Medicinal Chemistry · doi:10.1021/jm00106a046 · Cited by 868
Counting near-infrared single-photons with 95% efficiency
Lita, A. E., Miller, A. J., & Nam, S. W. (2008) · Optics Express · doi:10.1364/oe.16.003032 · Cited by 734
Network Representation Learning: A Survey
Zhang, D., Yin, J., Zhu, X., & Zhang, C. (2020) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2018.2850013 · Cited by 714
Colloquium : Quantum annealing and analog quantum computation
Das, A., & Chakrabarti, B. K. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1061 · Cited by 700
Hachmann, J., Olivares‐Amaya, R., Atahan-Evrenk, Ş., Amador‐Bedolla, C., Sánchez‐Carrera, R. S., Gold‐Parker, A., Vogt-Maranto, L., Brockway, A. M., & Aspuru‐Guzik, A. (2011) · The Journal of Physical Chemistry Letters · doi:10.1021/jz200866s · Cited by 668
The quantum technologies roadmap: a European community view
Acín, A., Bloch, I., Buhrman, H., Calarco, T., Eichler, C., Eisert, J., Esteve, D., Gisin, N., Glaser, S. J., Jelezko, F., et al. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aad1ea · Cited by 648
Serafini, A. (2017) · CRC Press eBooks · doi:10.1201/9781315118727 · Cited by 601
Improving the performance of doped π-conjugated polymers for use in organic light-emitting diodes
Gross, M., Müller, D. C., Nothofer, H., Scherf, U., Neher, D., Bräuchle, C., & Meerholz, K. (2000) · Nature · doi:10.1038/35015037 · Cited by 571
Franck—Condon Factors for Polyatomic Molecules
Sharp, T. E., & Rosenstock, H. M. (1964) · The Journal of Chemical Physics · doi:10.1063/1.1725748 · Cited by 567
Santoro, F., Improta, R., Lami, A., Bloino, J., & Barone, V. (2007) · The Journal of Chemical Physics · doi:10.1063/1.2437197 · Cited by 536
Hamilton, C. S., Kruse, R., Sansoni, L., Barkhofen, S., Silberhorn, C., & Jex, I. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.170501 · Cited by 503
Greedy Approximation Algorithms for Finding Dense Components in a Graph
Charikar, M. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44436-x_10 · Cited by 493
Cliques, Coloring, and Satisfiability
Johnson, D. S., & Trick, M. A. (1996) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/026 · Cited by 477
Read, R. C., & Corneil, D. G. (1977) · Journal of Graph Theory · doi:10.1002/jgt.3190010410 · Cited by 461
Rydberg atom quantum technologies
Adams, C. S., Pritchard, J. D., & Shaffer, J. P. (2019) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/1361-6455/ab52ef · Cited by 445
High-efficiency multiphoton boson sampling
Wang, H., He, Y., Li, Y.-H., Su, Z.-E., Li, B., Huang, H.-L., Ding, X., Chen, M.-C., Liu, C., Qin, J., et al. (2017) · Nature Photonics · doi:10.1038/nphoton.2017.63 · Cited by 430
Prospects for Spin-Based Quantum Computing in Quantum Dots
Kloeffel, C., & Loss, D. (2013) · Annual Review of Condensed Matter Physics · doi:10.1146/annurev-conmatphys-030212-184248 · Cited by 421
Impact of Interference on Multi-Hop Wireless Network Performance
Jain, K. K., Padhye, J. D., Padmanabhan, V. N., & Qiu, L. (2005) · Wireless Networks · doi:10.1007/s11276-005-1769-9 · Cited by 405
Bond Market Structure in the Presence of Marked Point Processes
Björk, T., Kabanov, Y., & Runggaldier, W. J. (1997) · Mathematical Finance · doi:10.1111/1467-9965.00031 · Cited by 398
Strawberry Fields: A Software Platform for Photonic Quantum Computing
Killoran, N., Izaac, J., Quesada, N., Bergholm, V., Amy, M., & Weedbrook, C. (2019) · Quantum · doi:10.22331/q-2019-03-11-129 · Cited by 395
Self-citationPardalos, P. M., & Xue, J. (1994) · Journal of Global Optimization · doi:10.1007/bf01098364 · Cited by 384
Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters
Berry, D. W., Childs, A. M., & Kothari, R. (2015) · 2015 IEEE 56th Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2015.54 · Cited by 372
Dynamical symmetry of vibronic transitions in polyatomic molecules and the Franck-Condon principle
Doktorov, E. V., Malkin, I. A., & Man'ko, V. I. (1977) · Journal of Molecular Spectroscopy · doi:10.1016/0022-2852(77)90269-7 · Cited by 359
Second-order complex random vectors and normal distributions
Picinbono, B. (1996) · IEEE Transactions on Signal Processing · doi:10.1109/78.539051 · Cited by 351
Multivariate Hawkes processes: an application to financial data
Paul Embrechts, A., Liniger, T., & Lin, L. (2011) · Journal of Applied Probability · doi:10.1017/s0021900200099344 · Cited by 342
Boson sampling for molecular vibronic spectra
Huh, J., Guerreschi, G. G., Peropadre, B., McClean, J. R., & Aspuru-Guzik, A. (2015) · Nature Photonics · doi:10.1038/nphoton.2015.153 · Cited by 341
A review on algorithms for maximum clique problems
Wu, Q., & Hao, J. (2014) · European Journal of Operational Research · doi:10.1016/j.ejor.2014.09.064 · Cited by 323
Clique Relaxations in Social Network Analysis: The Maximum k -Plex Problem
Balasundaram, B., Butenko, S. I., & Hicks, I. V. (2011) · Operations Research · doi:10.1287/opre.1100.0851 · Cited by 308
Topological Analysis of Linear Polymer Melts: A Statistical Approach
Tzoumanekas, C., & Theodorou, D. N. (2006) · Macromolecules · doi:10.1021/ma0607057 · Cited by 305
Mining market data: A network approach
Boginski, V. L., Butenko, S. I., & Pardalos, P. M. (2005) · Computers & Operations Research · doi:10.1016/j.cor.2005.01.027 · Cited by 283
Commercialize quantum technologies in five years
Mohseni, M., Read, P., Neven, H., Boixo, S., Denchev, V., Babbush, R., Fowler, A., Smelyanskiy, V., & Martinis, J. (2017) · Nature · doi:10.1038/543171a · Cited by 268
On the Partition Function p ( n )
Rademacher, H. (1938) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s2-43.4.241 · Cited by 239
Simulating the vibrational quantum dynamics of molecules using photonics
Sparrow, C., Martín-López, E., Maraviglia, N., Neville, A., Harrold, C., Carolan, J., Joglekar, Y. N., Hashimoto, T., Matsuda, N., O’Brien, J. L., et al. (2018) · Nature · doi:10.1038/s41586-018-0152-9 · Cited by 230
Open source software in quantum computing
Fingerhuth, M., Babej, T., & Wittek, P. (2018) · PLoS ONE · doi:10.1371/journal.pone.0208561 · Cited by 188
Modelling Financial High Frequency Data Using Point Processes
Bauwens, L., & Hautsch, N. (2009) · Springer eBooks · doi:10.1007/978-3-540-71297-8_41 · Cited by 183
Combinatorics and Complexity of Partition Functions
Barvinok, A. I. (2016) · Algorithms and combinatorics · doi:10.1007/978-3-319-51829-9 · Cited by 182
Detailed study of Gaussian boson sampling
Kruse, R., Hamilton, C. S., Sansoni, L., Barkhofen, S., Silberhorn, C., & Jex, I. (2019) · Physical Review A · doi:10.1103/physreva.100.032326 · Cited by 180
Harder, G., Bartley, T. J., Lita, A. E., Nam, S. W., Gerrits, T., & Silberhorn, C. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.143601 · Cited by 179
Jankowiak, H.-C., Stuber, J. L., & Berger, R. (2007) · The Journal of Chemical Physics · doi:10.1063/1.2805398 · Cited by 175
Dense subgraph maintenance under streaming edge weight updates for real-time story identification
Angel, A., Sarkas, N., Koudas, N., & Srivastava, D. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2168651.2168658 · Cited by 166
MotifCut: regulatory motifs finding with maximum density subgraphs
Fratkin, E., Naughton, B., Brutlag, D. L., & Batzoglou, S. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl243 · Cited by 165
An optimized photon pair source for quantum circuits
Harder, G., Ansari, V., Brecht, B., Dirmeier, T., Marquardt, C., & Silberhorn, C. (2013) · Optics Express · doi:10.1364/oe.21.013975 · Cited by 164
Dynamic Local Search for the Maximum Clique Problem
Pullan, W., & Hoos, H. H. (2006) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1815 · Cited by 160
Using Gaussian Boson Sampling to Find Dense Subgraphs
Arrazola, J. M., & Bromley, T. R. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.030503 · Cited by 143
Self-citationCaianiello, E. R. (1953) · Il Nuovo Cimento · doi:10.1007/bf02781659 · Cited by 133
Toward Scalable Boson Sampling with Photon Loss
Wang, H., Li, W., Jiang, X. Q., He, Y., Li, Y.-H., Ding, X., Chen, M., Qin, J., Peng, C.-Z., Schneider, C., et al. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.230502 · Cited by 130
A combinatorial algorithm for calculating ligand binding
Kuhl, F., Crippen, G. M., & Friesen, D. K. (1984) · Journal of Computational Chemistry · doi:10.1002/jcc.540050105 · Cited by 126
Computational complexity and information asymmetry in financial products
Arora, S., Barak, B., Brunnermeier, M. K., & Ge, R. (2011) · Communications of the ACM · doi:10.1145/1941487.1941511 · Cited by 121
Solving the maximum clique problem using a tabu search approach
Gendreau, M., Soriano, P., & Salvail, L. (1993) · Annals of Operations Research · doi:10.1007/bf02023002 · Cited by 120
Identification of a 5-Protein Biomarker Molecular Signature for Predicting Alzheimer's Disease
Ravetti, M. G., & Moscato, P. (2008) · PLoS ONE · doi:10.1371/journal.pone.0003111 · Cited by 120
Gaussian boson sampling using threshold detectors
Quesada, N., Arrazola, J. M., & Killoran, N. (2018) · Physical Review A · doi:10.1103/physreva.98.062322 · Cited by 120
Self-citationDense Subgraphs with Restrictions and Applications to Gene Annotation Graphs
Saha, B., Hoch, A., Khuller, S., Raschid, L., & Zhang, X. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12683-3_30 · Cited by 116
Measuring the similarity of graphs with a Gaussian boson sampler
Schuld, M., Brádler, K., Israel, R., Su, D., & Gupt, B. (2020) · Physical Review A · doi:10.1103/physreva.101.032314 · Cited by 109
Self-citationModelling Robust Flight-Gate Scheduling as a Clique Partitioning Problem
Dorndorf, U., Jaehn, F., & Pesch, E. (2008) · Transportation Science · doi:10.1287/trsc.1070.0211 · Cited by 107
The journey of graph kernels through two decades
Ghosh, S., Das, N., Gonçalves, T., Quaresma, P., & Kundu, M. (2017) · Computer Science Review · doi:10.1016/j.cosrev.2017.11.002 · Cited by 103
Gaussian boson sampling for perfect matchings of arbitrary graphs
Brádler, K., Dallaire-Demers, P.-L., Rebentrost, P., Su, D., & Weedbrook, C. (2018) · Physical Review A · doi:10.1103/physreva.98.032310 · Cited by 102
Graph Domination, Coloring and Cliques in Telecommunications
Balasundaram, B., & Butenko, S. I. (2008) · Springer eBooks · doi:10.1007/978-0-387-30165-5_30 · Cited by 95
Gupt, B., Izaac, J., & Quesada, N. (2019) · The Journal of Open Source Software · doi:10.21105/joss.01705 · Cited by 82
Self-citationA Faster Hafnian Formula for Complex Matrices and Its Benchmarking on a Supercomputer
Björklund, A., Gupt, B., & Quesada, N. (2019) · ACM Journal of Experimental Algorithmics · doi:10.1145/3325111 · Cited by 74
Self-citationPhased local search for the maximum clique problem
Pullan, W. (2006) · Journal of Combinatorial Optimization · doi:10.1007/s10878-006-9635-y · Cited by 73
Experimental Gaussian Boson sampling
Zhong, H.-S., Peng, L.-C., Li, Y., Hu, Y., Li, W., Qin, J., Wu, D., Zhang, W., Li, H., Zhang, L., et al. (2019) · Science Bulletin · doi:10.1016/j.scib.2019.04.007 · Cited by 73
Simulating realistic non-Gaussian state preparation
Quesada, N., Helt, L. G., Izaac, J., Arrazola, J. M., Shahrokhshahi, R., Myers, C. R., & Sabapathy, K. K. (2019) · Physical Review A · doi:10.1103/physreva.100.022341 · Cited by 73
Self-citationSimple factorization of unitary transformations
de Guise, H., Di Matteo, O., & Sánchez-Soto, L. L. (2018) · Physical Review A · doi:10.1103/physreva.97.022328 · Cited by 70
Scalable Squeezed-Light Source for Continuous-Variable Quantum Sampling
Vernon, Z., Quesada, N., Liscidini, M., Morrison, B., Menotti, M., Tan, K., & Sipe, J. E. (2019) · Physical Review Applied · doi:10.1103/physrevapplied.12.064024 · Cited by 70
Self-citationClique Relaxation Models in Social Network Analysis
Pattillo, J., Youssef, N., & Butenko, S. I. (2011) · Springer optimization and its applications · doi:10.1007/978-1-4614-0857-4_5 · Cited by 68
Quantum++: A modern C++ quantum computing library
Gheorghiu, V. (2018) · PLoS ONE · doi:10.1371/journal.pone.0208073 · Cited by 65
Huh, J., & Yung, M.-H. (2017) · Scientific Reports · doi:10.1038/s41598-017-07770-z · Cited by 63
Exact simulation of Gaussian boson sampling in polynomial space and exponential time
Quesada, N., & Arrazola, J. M. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.023005 · Cited by 63
Self-citationQuantum approximate optimization with Gaussian boson sampling
Arrazola, J. M., Bromley, T. R., & Rebentrost, P. (2018) · Physical Review A · doi:10.1103/physreva.98.012322 · Cited by 61
Self-citationTransient Access to the Protein Interior: Simulation versus NMR
Persson, F., & Halle, B. (2013) · Journal of the American Chemical Society · doi:10.1021/ja403405d · Cited by 58
Detection of clustered microcalcifications using spatial point process modeling
Jing, H., Yang, Y., & Nishikawa, R. M. (2010) · Physics in Medicine and Biology · doi:10.1088/0031-9155/56/1/001 · Cited by 56
Franck-Condon factors by counting perfect matchings of graphs with loops
Quesada, N. (2019) · The Journal of Chemical Physics · doi:10.1063/1.5086387 · Cited by 54
Self-citationPoint processes with Gaussian boson sampling
Jahangiri, S., Arrazola, J. M., Quesada, N., & Killoran, N. (2020) · Physical review. E · doi:10.1103/physreve.101.022134 · Cited by 51
Self-citationDodgson, J., Chessel, A., Yamamoto, M. L., Vaggi, F., Cox, S., Rosten, E., Albrecht, D., Geymonat, M., Csikász‐Nagy, A., Sato, M., et al. (2013) · Nature Communications · doi:10.1038/ncomms2813 · Cited by 50
Bloch-Messiah reduction of Gaussian unitaries by Takagi factorization
Cariolaro, G., & Pierobon, G. L. (2016) · Physical Review A · doi:10.1103/physreva.94.062109 · Cited by 50
Reexamination of Bloch-Messiah reduction
Cariolaro, G., & Pierobon, G. L. (2016) · Physical Review A · doi:10.1103/physreva.93.062115 · Cited by 41
Characterization of maximally random jammed sphere packings: Voronoi correlation functions
Klatt, M. A., & Torquato, S. (2014) · Physical Review E · doi:10.1103/physreve.90.052120 · Cited by 39
Approximating vibronic spectroscopy with imperfect quantum optics
Clements, W. R., Renema, J. J., Eckstein, A., Valido, A. A., Lita, A., Gerrits, T., Nam, S. W., Kolthammer, W. S., Huh, J., & Walmsley, I. A. (2018) · Journal of Physics B: Atomic, Molecular and Optical Physics · doi:10.1088/1361-6455/aaf031 · Cited by 39
Maximum Cliques in Protein Structure Comparison
Malod‐Dognin, N., Andonov, R., & Yanev, N. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13193-6_10 · Cited by 31
First quantum computers need smart software
Zeng, W., Johnson, B., Smith, R., Rubin, N., Reagor, M., Ryan, C. A., & Rigetti, C. T. (2017) · Nature · doi:10.1038/549149a · Cited by 24
Stochastic Gene Expression in Cells: A Point Process Approach
Fromion, V., Leoncini, E., & Robert, P. H. (2013) · SIAM Journal on Applied Mathematics · doi:10.1137/120879592 · Cited by 22
Pulse Packet Stochastic Model for Gastric Emptying in the Fasted State: A Physiological Approach
Talattof, A., & Amidon, G. L. (2018) · Molecular Pharmaceutics · doi:10.1021/acs.molpharmaceut.7b01077 · Cited by 16
Analysis of Protein Dynamics Simulations by a Stochastic Point Process Approach
Halle, B., & Persson, F. (2013) · Journal of Chemical Theory and Computation · doi:10.1021/ct400161u · Cited by 13
Point process models for localization and interdependence of punctate cellular structures
Li, Y., Majarian, T. D., Naik, A. W., Johnson, G. R., & Murphy, R. F. (2016) · Cytometry Part A · doi:10.1002/cyto.a.22873 · Cited by 13
Schmidt, L., Fouxon, I., & Holzner, M. (2017) · Physical Review Fluids · doi:10.1103/physrevfluids.2.074302 · Cited by 12
Quantitative Framework for Stochastic Nanopore Sensors Using Multiple Channels
Lazenby, R. A., Macazo, F. C., Wormsbecher, R. F., & White, R. J. (2017) · Analytical Chemistry · doi:10.1021/acs.analchem.7b03845 · Cited by 12
Heuristics for Maximum Clique and Independent Set
Pelillo, M. (2008) · Encyclopedia of Optimization · doi:10.1007/978-0-387-74759-0_264 · Cited by 11
Aaghabali, M., Akbari, S., Friedland, S., Markström, K., & Tajfirouz, Z. (2014) · European Journal of Combinatorics · doi:10.1016/j.ejc.2014.11.001 · Cited by 9
A functional marked point process model for lupus data
Fok, C. C. T., Ramsay, J. O., Abrahamowicz, M., & Fortin, P. R. (2012) · Canadian Journal of Statistics · doi:10.1002/cjs.11136 · Cited by 8
Grell, K., Diggle, P. J., Frederiksen, K., Schüz, J., Cardis, E., & Andersen, P. K. (2015) · Statistics in Medicine · doi:10.1002/sim.6538 · Cited by 8
Some properties of point processes in statistical optics
Picinbono, B., & Bendjaballah, C. (2010) · Physical Review A · doi:10.1103/physreva.82.063811 · Cited by 7
Ising distribution as a latent variable model
Wohrer, A. (2019) · Physical review. E · doi:10.1103/physreve.99.042147 · Cited by 3
Research works printed but not linked: 8
- Aaronson, 2013, Theor. Comput., 9, 143, 10.4086/toc.2013.v009a004 · DOI
- Wang, 2019, Nat. Photon., 1
- Kluyver, 2016, El Público, 87
- Johnson, 1993, Discrete Math. Theor. Comput. Sci., 26, 11
- Vishwanathan, 2010, J. Mach. Learn. Res., 11, 1201
- Shervashidze, 2011, J. Mach. Learn. Res., 12, 2539
- Pedregosa, 2011, J. Mach. Learn. Res., 12, 2825
- Ruhoff, 2000, Int. J. Quantum Chem., 77, 383, 10.1002/(sici)1097-461x(2000)77:1<383::aid-qua38>3.0.co;2-0 · DOI
Cited by
Sorted by citations
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
Quantum computational advantage with a programmable photonic processor
Madsen, L. S., Laudenbach, F., Askarani, M. F., Rortais, F., Vincent, T., Bulmer, J. F. F., Miatto, F. M., Neuhaus, L., Helt, L. G., Collins, M. J., et al. (2022) · Nature · doi:10.1038/s41586-022-04725-x · Cited by 1,101
Self-citationQuantum circuits with many photons on a programmable nanophotonic chip
Arrazola, J. M., Bergholm, V., Brádler, K., Bromley, T. R., Collins, M. J., Dhand, I., Fumagalli, A., Gerrits, T., Goussev, A., Helt, L. G., et al. (2021) · Nature · doi:10.1038/s41586-021-03202-1 · Cited by 567
Self-citationQuantum circuits with many photons on a programmable nanophotonic chip
Arrazola, J. M., Bergholm, V., Brádler, K., Bromley, T. R., Collins, M. J., Dhand, I., Fumagalli, A., Gerrits, T., Goussev, A., Helt, L. G., et al. (2021) · RePEc: Research Papers in Economics · Cited by 463
Self-citationNon-Gaussian Quantum States and Where to Find Them
Walschaers, M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030204 · Cited by 352
Metadata
- Authors
- Bromley, T. R., Arrazola, J. M., Jahangiri, S., Izaac, J., Quesada, N., Gran, A. D., Schuld, M., Swinarton, J., Zabaneh, Z., & Killoran, N.
- Affiliations
- Xanadu Quantum Technologies (Canada) (CA)
- Venue
- Quantum Science and Technology
- Publisher
- IOP Publishing
- Published
- 2020-05-12
- Volume
- 5
- Issue
- 3
- Pages
- 034010
- ISSN
- 2058-9565 (ISSN-L)
- OpenAlex
- W2995724754
- Cited by
- 128
- References
- 117
- Citations by year
- 2026: 12 · 2025: 19 · 2024: 20 · 2023: 23 · 2022: 22 · 2021: 23 · 2020: 8
- FWCI
- 7.46
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Quantum Science and Technology (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- PolyPublie (École Polytechnique de Montréal) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- Gaussian boson sampling, photonic quantum computing, strawberry fields, quantum computing software, quantum algorithms, graph problems, point processes, near-term quantum computing
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
