A time-bin multiplexing protocol generates parallel multipartite entanglement among N quantum nodes using a photon whose time-bin dimension stays independent of N.
arXiv:2212.12372 (2022)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Presents a concrete quantum oracle for bilinear Diophantine equations enabling factoring of n-bit biprimes with 2n-5 qubits or fewer and near-100% simulated success for numbers up to 35 bits.
citing papers explorer
-
Resource-efficient parallel entanglement generation for multinode quantum networks via time-bin multiplexing
A time-bin multiplexing protocol generates parallel multipartite entanglement among N quantum nodes using a photon whose time-bin dimension stays independent of N.
-
Efficient Quantum Oracle for Solving Bilinear Diophantine Equations on Digital Quantum Computers
Presents a concrete quantum oracle for bilinear Diophantine equations enabling factoring of n-bit biprimes with 2n-5 qubits or fewer and near-100% simulated success for numbers up to 35 bits.