SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2401.08550 · 2024

Expanding Hardware-Efficiently Manipulable Hilbert Space via Hamiltonian Embedding

arXiv · PDF · Open in the Atlas

Code that ran

3 of 6 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 1 violated it and 0 have no contract verdict; 2 failures of our instrument; 3 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2401.08550.json · badge: /api/ran/2401.08550.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
jiaqileng/hamiltonian-embedding canonical (classifier label)
classifier basis: census
3 ran · 3 no recorded run
FunctionStatusWhere it lives
sum_x Ran
ran; our contract draft was wrong, not the code
jiaqileng/hamiltonian-embedding/src/utils.py
code served (permissive licence) · get_code("7b5acd08f0a5aed3")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned csc_matrix. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import numpy as np
from scipy.sparse import csc_matrix, kron, identity
from functools import reduce

PAULI_X = csc_matrix(np.array([[0, 1], [1, 0]]))

def tensor(op_list: list):
    return reduce(kron, op_list, 1).tocsc()

def sum_x(n: int):
    """
    Returns `\\sum_i \\sigma_x^{(i)}` where `\\sigma_x^{(i)}` 
    is the Pauli-x operator on the ith qubit.
    """
    assert n > 0
    dims = [2 ** i for i in range(n)]
    res = csc_matrix((2 ** n, 2 ** n))
    for i in range(n):
        res += tensor([identity(dims[n - i - 1], format='csr'), PAULI_X, identity(dims[i], format='csr')])
    return res

ARGS = {
    "n": 3
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
numpy, scipy — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type csc_matrix — a csc_matrix output has no array shape of its own; none is stated — the instrument coerces any output to an array; for a csc_matrix output the recorded ndim 0 and dtype family float describe that coercion, not the output, and are not stated
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
tensor Ran
ran; our contract draft was wrong, not the code
jiaqileng/hamiltonian-embedding/src/utils.py
code served (permissive licence) · get_code("15a909ca2a88d57f")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned csc_matrix. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

from scipy.sparse import csc_matrix, identity
import numpy as np

# Create small sparse matrices to use as operators
# These will be used in the tensor product (Kronecker product)
op1 = csc_matrix(np.array([[1, 0], [0, -1]]))  # Pauli Z-like operator
op2 = csc_matrix(np.array([[0, 1], [1, 0]]))   # Pauli X-like operator
op3 = identity(2, format='csc')                # Identity operator

# Create op_list with a few operators
op_list = [op1, op2, op3]

ARGS = {
    'op_list': op_list
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
numpy, scipy — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type csc_matrix — a csc_matrix output has no array shape of its own; none is stated — the instrument coerces any output to an array; for a csc_matrix output the recorded ndim 0 and dtype family float describe that coercion, not the output, and are not stated
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
uniform_superposition Ran
ran, violated the contract we drafted
jiaqileng/hamiltonian-embedding/src/utils.py
code served (permissive licence) · get_code("ca22688e97f0ffee")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned ndarray, ndim 1, dtype family float, shape (8,) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import numpy as np

def uniform_superposition(n: int):
    return np.ones(2 ** n, dtype=np.complex64) / np.sqrt(2 ** n)

# Small positive integer for n
n = 3

ARGS = {
    "n": n
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
numpy — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type ndarray, ndim 1, dtype family float, shape (8,) — shape (8,) as a later run recorded it
dtype family
int means an integer dtype; float means any other dtype the instrument saw, bool and complex included (fixture_check.py records only these two families)
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
get_ionq_single_job_result Not yet run
unverified (harvested, no recorded run)
jiaqileng/hamiltonian-embedding/src/experiments/ionq_circuit_utils.py
code served (permissive licence) · get_code("a1981ec4923f65c5")
How it ran

no invocation recorded.

get_results Not yet run
unverified (harvested, no recorded run)
jiaqileng/hamiltonian-embedding/src/experiments/ionq_circuit_utils.py
code served (permissive licence) · get_code("840218e9d4dcf4ac")
How it ran

no invocation recorded.

send_job Not yet run
unverified (harvested, no recorded run)
jiaqileng/hamiltonian-embedding/src/experiments/ionq_circuit_utils.py
code served (permissive licence) · get_code("e823889c0ce35ad0")
How it ran

no invocation recorded.

Also present in other papers' code

Of 6 samples lifted from this paper's linked repositories, 6 carry a function identity and 0 do not. Of the 6 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 6 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

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ödinger 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.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2401.08550")
get_code_for_paper("2401.08550")
have("2401.08550")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2401.08550.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2401.08550.svg)](https://syntology.ai/paper/2401.08550)

Connect an agent — have() is free.