Pith. sign in

REVIEW 2 cited by

Perfect Transfer of Arbitrary States in Quantum Spin Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/0411020 v2 pith:GZIN5PPP submitted 2004-11-02 quant-ph

classification quant-ph
keywords networksperfectqubitcouplingsquantumstatestatestransfer
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We propose a class of qubit networks that admit perfect state transfer of any two-dimensional quantum state in a fixed period of time. We further show that such networks can distribute arbitrary entangled states between two distant parties, and can, by using such systems in parallel, transmit the higher dimensional systems states across the network. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to $N$-qubit spin networks of identical qubit couplings, we show that $2\log_3 N$ is the maximal perfect communication distance for hypercube geometries. Moreover, if one allows fixed but different couplings between the qubits then perfect state transfer can be achieved over arbitrarily long distances in a linear chain. This paper expands and extends the work done in PRL 92, 187902.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Spectral surgery and high-fidelity quantum state transfer in $XX$ chains

    quant-ph 2024-12 conditional novelty 6.0 of 10

    Spectral surgery on a uniform XX chain yields analytic spin chains that interpolate between uniform and Krawtchouk chains and achieve good-fidelity state transfer with bounded couplings.

  2. Emergence of Krylov complexity through quantum walks: An exploration of the quantum origins of complexity

    hep-th 2026-02 conditional novelty 5.0 of 10

    Reducing a graph walk to distance-layers reproduces Krylov/spread complexity, yielding analytic finite-q SYK Lanczos coefficients and hypercube complexity D sin²(t/D), with faster saturation than classical-walk circuits.

Pith tools