{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/boundaries-for-quantum-advantage-with-single","title":"Boundaries for quantum advantage with single photons and loop-based time-bin interferometers","arxiv_id":"2411.16873","date":"2024-11-25","proceeding":null,"authors":["Samo Novák","David D. Roberts","Alexander Makarovskiy","Raúl García-Patrón","William R. Clements"],"abstract":"Loop-based boson samplers interfere photons in the time degree of freedom using a sequence of delay lines. Since they require few hardware components while also allowing for long-range entanglement, they are strong candidates for demonstrating quantum advantage beyond the reach of classical emulation. We propose a method to exploit this loop-based structure to more efficiently classically sample from such systems. Our algorithm exploits a causal-cone argument to decompose the circuit into smaller effective components that can each be simulated sequentially by calling a state vector simulator as a subroutine. To quantify the complexity of our approach, we develop a new lattice path formalism that allows us to efficiently characterize the state space that must be tracked during the simulation. In addition, we develop a heuristic method that allows us to predict the expected average and worst-case memory requirements of running these simulations. We use these methods to compare the simulation complexity of different families of loop-based interferometers, allowing us to quantify the potential for quantum advantage of single-photon Boson Sampling in loop-based architectures.","url_abs":"https://arxiv.org/abs/2411.16873v2","url_pdf":"https://arxiv.org/pdf/2411.16873v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"boundaries-for-quantum-advantage-with-single","repo_url":"https://github.com/orcacomputing/loop-progressive-simulator","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2411.16873","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.16873"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/orcacomputing/loop-progressive-simulator","reach":null}],"summary":{"ran_honours":2,"ran_violates":1,"ran_fixture":2,"unverified":1},"by_repo_kind":{"official":{"samples":6,"ran":5,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"c5148c34aab732e8","entry":"arg_int_or_var","repo":"orcacomputing/loop-progressive-simulator","repo_kind":"official","path":"shell_utilities/run_experiment_families.py","file_url":"https://github.com/orcacomputing/loop-progressive-simulator/blob/HEAD/shell_utilities/run_experiment_families.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"c5148c34aab732e8"}},{"code_sha256_prefix":"5cb09c220028d4f6","entry":"arg_sym_tuple_range_or_ellipsis","repo":"orcacomputing/loop-progressive-simulator","repo_kind":"official","path":"shell_utilities/run_experiment_families.py","file_url":"https://github.com/orcacomputing/loop-progressive-simulator/blob/HEAD/shell_utilities/run_experiment_families.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"5cb09c220028d4f6"}},{"code_sha256_prefix":"d5f600fcd8a8eb34","entry":"check_commute","repo":"orcacomputing/loop-progressive-simulator","repo_kind":"official","path":"loop_progressive_simulator/bscircuits.py","file_url":"https://github.com/orcacomputing/loop-progressive-simulator/blob/HEAD/loop_progressive_simulator/bscircuits.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"d5f600fcd8a8eb34"}},{"code_sha256_prefix":"ee4c0661b33b2808","entry":"commute_multiple_forward","repo":"orcacomputing/loop-progressive-simulator","repo_kind":"official","path":"loop_progressive_simulator/bscircuits.py","file_url":"https://github.com/orcacomputing/loop-progressive-simulator/blob/HEAD/loop_progressive_simulator/bscircuits.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"ee4c0661b33b2808"}},{"code_sha256_prefix":"9c89caee45939fa9","entry":"commute_pos_forward","repo":"orcacomputing/loop-progressive-simulator","repo_kind":"official","path":"loop_progressive_simulator/bscircuits.py","file_url":"https://github.com/orcacomputing/loop-progressive-simulator/blob/HEAD/loop_progressive_simulator/bscircuits.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"9c89caee45939fa9"}},{"code_sha256_prefix":"c5f60ba0c7513642","entry":"arg_range","repo":"orcacomputing/loop-progressive-simulator","repo_kind":"official","path":"shell_utilities/run_experiment_families.py","file_url":"https://github.com/orcacomputing/loop-progressive-simulator/blob/HEAD/shell_utilities/run_experiment_families.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"c5f60ba0c7513642"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}