Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1307.3197

Heterogeneous teleportation with laser and quantum light sources

R. M. Stevenson·J. Nilsson·A. J. Bennett·J. Skiba-Szymanska·I. Farrer·D. A. Ritchie·A. J. Shields
View original source ↗Read source document ↗Export metadata ↓

Abstract

Quantum information technology is set to transform critical network security using quantum cryptography, and complex scientific and engineering simulations with quantum computing. Quantum computer nodes may be based on a variety of systems, such as linear optics, ions, or solid state architectures such as NV-centers in diamond, semiconductor quantum dots or spins in silicon. Interfacing any of these platforms with photonic qubits in secure quantum networks will require quantum teleportation protocols to transfer the information, and matter-light teleportation has for some of these systems been demonstrated. However, although it is conceivable that the input photon originates from a dissimilar source to that supplying the entangled resources, every demonstration so far of teleportation using linear optics use the same or identical sources for the input and entangled photons, often accompanied by a fourth heralding photon. Here we show that photons from fundamentally different sources can be used in the optical quantum teleportation protocol. Input photons are generated by a laser, and teleported using polarisation-entangled photon pairs electrically generated by an entangled-light-emitting diode (ELED). The sources have bandwidth differing by a factor 1000, different photon statistics and need not be precisely degenerate- but we still observe a teleportation fidelity of 0.77, beating the quantum limit by 10 standard deviations. This is a significant leap towards practical applications, such as extending the range of existing QKD systems using quantum relays and repeaters, which usually use weak coherent laser pulses for quantum information transport. The use of an ELED offers practical advantages of electrical control, and as we show erases the multi-photon character of the laser input field, thus eliminating errors if used in a quantum optics circuit.

Explore related subjects

quant-ph

Keep this discovery

BibTeXRIS

R. M. Stevenson, J. Nilsson, A. J. Bennett, J. Skiba-Szymanska, I. Farrer, D. A. Ritchie, A. J. Shields. 2013-07-11. Heterogeneous teleportation with laser and quantum light sources. https://arxiv.org/abs/1307.3197

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph↗
arXiv2026

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph↗
arXiv2026

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph↗