Quantum

Quantum simulation of real-time bosonic dynamics with binary and unary position encodings on superconducting and trapped-ion processors

Read full article at source ↗

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

Briefings

A 2026 study compares binary and unary qubit encodings for simulating bosonic dynamics on superconducting and trapped-ion processors. Unary encoding achieves exact nearest-neighbor circuit compression for single degrees of freedom, resolving tunneling in double wells with only ~200 gates, whereas binary encoding requires thousands of gates and fails to reproduce the transfer. Noiseless emulation confirms the contrast stems from compilation and encoding differences, with measured population reversal bounds coherence between energy eigenstates. Coupled-oscillator benchmarks indicate the preferred encoding depends on grid size and evolution time.

Key points

• Unary encoding compresses a single bosonic degree of freedom into a nearest-neighbor circuit of fixed size, requiring approximately 200 two-qubit gates to resolve tunneling in a symmetric double well.
• Binary encoding fails to reproduce the quantum transfer between wells due to excessive gate count, while noiseless emulation confirms the encoding difference stems from compilation rather than the encoding itself.

Context

This research compares binary and unary qubit encodings for simulating bosonic dynamics on superconducting and trapped-ion processors, revealing that unary encoding achieves exact nearest-neighbor circuit compression for single degrees of freedom, whereas binary encoding fails to reproduce the transfer due to excessive gate count.

Limitations

Evidence is limited to single-degree-of-freedom benchmarks on symmetric double wells; noiseless emulation bounds coherence between energy eigenstates from below; coupled-oscillator benchmarks show encoding preference depends on grid size and evolution time.

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

View archived briefing on IPFS
bafybeibjbvj7aqv7zqe36xkjp2i723bd5cuxhi4up3dbt7wrp27hpbacjy