Quantum

Controlled preparation and unconditional transport on a fluctuating quantum graph

Read full article at source ↗

Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 13/11/2026, 07:43:24 UTC.

Briefings

A new quantum graph model demonstrates unconditional transport of a signal with a minimum arrival probability of 5/8 (0.625) across a finite open square. The study constructs a wave packet on a prescribed lattice using adiabatic preparation and spectral reduction, proving that local joint-state and Hamiltonian errors do not degrade the signal below 9/16 (0.5625). This work establishes a benchmark for quantum networks by linking propagation mechanisms to observable lower bounds, distinguishing signal delivery from unwanted influence.

Key points

• A one-probe model on a prescribed square candidate lattice achieves an unconditional arrival probability of at least 5/8 (0.625) for a signal on a finite open square.
• The construction relies on a generalized Rokhsar-Kivelson parent Hamiltonian, spectral reduction, and adiabatic preparation to populate an isolated branch with strictly positive group velocity.

Context

This research addresses the challenge of preparing and transmitting quantum information on fluctuating quantum graphs, specifically by establishing unconditional readout capabilities. It provides a model-specific benchmark for transport and readout in fluctuating quantum networks, linking a propagation mechanism to an observable lower bound.

Limitations

The result applies to a one-probe model on a prescribed square candidate lattice with a supplied coherent graph ground state. It does not establish background-free geometry or gravitational dynamics, and the resource estimates are conservative regarding graph-state supply.

Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 13/11/2026, 07:45:45 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.

View archived briefing on IPFS
bafybeia4wgdicc25hk4jidxkzmkzn33zaiezgkrhngbpuyvmtqi47q4l4q