A reconfigurable silicon photonics chip for the generation of frequency bin entangled qudits

Massimo Borghi; Noemi Tagliavacche; Federico Andrea Sabattoli; Houssein El Dirani; Laurene Youssef; Camille Petit-Etienne; Erwine Pargon; J. E. Sipe; Marco Liscidini; Corrado Sciancalepore; Matteo Galli; Daniele Bajoni

arXiv · 2301.08475

A reconfigurable silicon photonics chip for the generation of frequency bin entangled qudits

Massimo Borghi·Noemi Tagliavacche·Federico Andrea Sabattoli·Houssein El Dirani·Laurene Youssef·Camille Petit-Etienne·Erwine Pargon·J. E. Sipe·Marco Liscidini·Corrado Sciancalepore·Matteo Galli·Daniele Bajoni

View original source ↗Read source document ↗Export metadata ↓

Abstract

Quantum optical microcombs in integrated ring resonators generate entangled photon pairs over many spectral modes, and allow the preparation of high dimensional qudit states. Ideally, those sources should be programmable and have a high generation rate, with comb lines tightly spaced for the implementation of efficient qudit gates based on electro-optic frequency mixing. While these requirements cannot all be satisfied by a single resonator device, for which there is a trade-off between high generation rate and tight bin spacing, a promising strategy is the use of multiple resonators, each generating photon pairs in specific frequency bins via spontaneous four-wave mixing. Based on this approach we present a programmable silicon photonics device for the generation of frequency bin entangled qudits, in which bin spacing, qudit dimension, and bipartite quantum state can be reconfigured on-chip. Using resonators with a radius of 22 microns, we achieve a high brightness (MHz/(mW)^2) per comb line with a bin spacing of 15 GHz, and fidelities above 85% with maximally entangled Bell states up to a Hilbert space dimension of sixteen. By individually addressing each spectral mode, we realize states that can not be generated on-chip using a single resonator. We measure the correlation matrices of maximally entangled two-qubit and two-qutrit states on a set of mutually unbiased bases, finding fidelities exceeding 98%, and indicating that the source can find application in high-dimensional secure communication protocols.

Explore related subjects

quant-ph

Keep this discovery

BibTeX RIS

Massimo Borghi, Noemi Tagliavacche, Federico Andrea Sabattoli, Houssein El Dirani, Laurene Youssef, Camille Petit-Etienne, Erwine Pargon, J. E. Sipe, Marco Liscidini, Corrado Sciancalepore, Matteo Galli, Daniele Bajoni. 2023-01-20. A reconfigurable silicon photonics chip for the generation of frequency bin entangled qudits. https://arxiv.org/abs/2301.08475

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↗