{"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/expanding-hardware-efficiently-manipulable","title":"Expanding Hardware-Efficiently Manipulable Hilbert Space via Hamiltonian Embedding","arxiv_id":"2401.08550","date":"2024-01-16","proceeding":null,"authors":["Jiaqi Leng","Joseph Li","Yuxiang Peng","Xiaodi Wu"],"abstract":"Many promising quantum applications depend on the efficient quantum simulation of an exponentially large sparse Hamiltonian, a task known as sparse Hamiltonian simulation, which is fundamentally important in quantum computation. Although several theoretically appealing quantum algorithms have been proposed for this task, they typically require a black-box query model of the sparse Hamiltonian, rendering them impractical for near-term implementation on quantum devices. In this paper, we propose a technique named Hamiltonian embedding. This technique simulates a desired sparse Hamiltonian by embedding it into the evolution of a larger and more structured quantum system, allowing for more efficient simulation through hardware-efficient operations. We conduct a systematic study of this new technique and demonstrate significant savings in computational resources for implementing prominent quantum applications. As a result, we can now experimentally realize quantum walks on complicated graphs (e.g., binary trees, glued-tree graphs), quantum spatial search, and the simulation of real-space Schr\\\"odinger equations on current trapped-ion and neutral-atom platforms. Given the fundamental role of Hamiltonian evolution in the design of quantum algorithms, our technique markedly expands the horizon of implementable quantum advantages in the NISQ era.","url_abs":"https://arxiv.org/abs/2401.08550v1","url_pdf":"https://arxiv.org/pdf/2401.08550v1.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":"expanding-hardware-efficiently-manipulable","repo_url":"https://github.com/jiaqileng/hamiltonian-embedding","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2401.08550","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.08550"}},"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/jiaqileng/hamiltonian-embedding","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":3,"unverified":3},"by_repo_kind":{"official":{"samples":6,"ran":3,"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":"7b5acd08f0a5aed3","entry":"sum_x","repo":"jiaqileng/hamiltonian-embedding","repo_kind":"official","path":"src/utils.py","file_url":"https://github.com/jiaqileng/hamiltonian-embedding/blob/HEAD/src/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"7b5acd08f0a5aed3"}},{"code_sha256_prefix":"15a909ca2a88d57f","entry":"tensor","repo":"jiaqileng/hamiltonian-embedding","repo_kind":"official","path":"src/utils.py","file_url":"https://github.com/jiaqileng/hamiltonian-embedding/blob/HEAD/src/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"15a909ca2a88d57f"}},{"code_sha256_prefix":"ca22688e97f0ffee","entry":"uniform_superposition","repo":"jiaqileng/hamiltonian-embedding","repo_kind":"official","path":"src/utils.py","file_url":"https://github.com/jiaqileng/hamiltonian-embedding/blob/HEAD/src/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ca22688e97f0ffee"}},{"code_sha256_prefix":"a1981ec4923f65c5","entry":"get_ionq_single_job_result","repo":"jiaqileng/hamiltonian-embedding","repo_kind":"official","path":"src/experiments/ionq_circuit_utils.py","file_url":"https://github.com/jiaqileng/hamiltonian-embedding/blob/HEAD/src/experiments/ionq_circuit_utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"a1981ec4923f65c5"}},{"code_sha256_prefix":"840218e9d4dcf4ac","entry":"get_results","repo":"jiaqileng/hamiltonian-embedding","repo_kind":"official","path":"src/experiments/ionq_circuit_utils.py","file_url":"https://github.com/jiaqileng/hamiltonian-embedding/blob/HEAD/src/experiments/ionq_circuit_utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"840218e9d4dcf4ac"}},{"code_sha256_prefix":"e823889c0ce35ad0","entry":"send_job","repo":"jiaqileng/hamiltonian-embedding","repo_kind":"official","path":"src/experiments/ionq_circuit_utils.py","file_url":"https://github.com/jiaqileng/hamiltonian-embedding/blob/HEAD/src/experiments/ionq_circuit_utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"e823889c0ce35ad0"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}