Compare Papers

Paper 1

Nonlinear photonic architecture for fault-tolerant quantum computing

Maike Ostmann, Joshua Nunn, Alex E. Jones

Year

2025

Journal

arXiv preprint

DOI

arXiv:2510.06890

arXiv

2510.06890

We propose a novel architecture for fault-tolerant quantum computing that incorporates strong single-photon nonlinearities into a photonic GHZ-measurement-based architecture. The nonlinearities substantially reduce resource overheads compared to conventional linear-optics-based architectures, which require significant redundancy to accommodate probabilistic photon generation and probabilistic entangling operations. By removing linear-optical failure modes, our nonlinear architecture can also tolerate much higher optical losses than linear approaches, with a baseline loss tolerance of $\sim$12\% using a 32-photon resource state and a foliated surface code. Our results show how introducing a nonlinear primitive enables dramatic improvements in practical implementations of fault-tolerant quantum computing.

Open paper

Paper 2

Proofs of quantum memory

Minki Hhan, Tomoyuki Morimae, Yasuaki Okinaka, Takashi Yamakawa

Year

2025

Journal

arXiv preprint

DOI

arXiv:2510.04159

arXiv

2510.04159

With the rapid advances in quantum computer architectures and the emerging prospect of large-scale quantum memory, it is becoming essential to classically verify that remote devices genuinely allocate the promised quantum memory with specified number of qubits and coherence time. In this paper, we introduce a new concept, proofs of quantum memory (PoQM). A PoQM is an interactive protocol between a classical probabilistic polynomial-time (PPT) verifier and a quantum polynomial-time (QPT) prover over a classical channel where the verifier can verify that the prover has possessed a quantum memory with a certain number of qubits during a specified period of time. PoQM generalize the notion of proofs of quantumness (PoQ) [Brakerski, Christiano, Mahadev, Vazirani, and Vidick, JACM 2021]. Our main contributions are a formal definition of PoQM and its constructions based on hardness of LWE. Specifically, we give two constructions of PoQM. The first is of a four-round and has negligible soundness error under subexponential-hardness of LWE. The second is of a polynomial-round and has inverse-polynomial soundness error under polynomial-hardness of LWE. As a lowerbound of PoQM, we also show that PoQM imply one-way puzzles. Moreover, a certain restricted version of PoQM implies quantum computation classical communication (QCCC) key exchange.

Open paper