npj Quantum Information最新文献

A 2-Gbps low-SWaP quantum random number generator with photonic integrated circuits for satellite applications. 2 gbps低swap量子随机数发生器，带光子集成电路，用于卫星应用。

IF 7.6 1区物理与天体物理

npj Quantum Information Pub Date : 2025-09-26 DOI: 10.1038/s41534-025-01100-2

Oliver M Crampton,Toby J Dowling,Thomas Roger,Peter R Smith,James F Dynes,Matthew S Winnel,Davide G Marangon,Mirko Sanzaro,Ravinder Singh,Chithrabhanu Perumangatt,Joseph A Dolphin,Taofiq K Paraiso,Andrew J Shields

{"title":"A 2-Gbps low-SWaP quantum random number generator with photonic integrated circuits for satellite applications.","authors":"Oliver M Crampton,Toby J Dowling,Thomas Roger,Peter R Smith,James F Dynes,Matthew S Winnel,Davide G Marangon,Mirko Sanzaro,Ravinder Singh,Chithrabhanu Perumangatt,Joseph A Dolphin,Taofiq K Paraiso,Andrew J Shields","doi":"10.1038/s41534-025-01100-2","DOIUrl":"https://doi.org/10.1038/s41534-025-01100-2","url":null,"abstract":"We introduce a low size, weight and power quantum random number generator (QRNG) utilizing compact integrated photonic asymmetric Mach-Zehnder interferometers (AMZIs). Our QRNG is based on phase-diffusion in two gain-switched lasers interfered within two separate chip-AMZIs. By substituting the high-bit analog-to-digital converters, typically employed to digitize the random intensity signal from each laser, with clocked comparators we significantly reduce both the complexity and power consumption of the device. Furthermore, by performing the exclusive OR (XOR) operation on the output random bits of each channel we are able to reduce the processing requirements. The QRNG architecture can be integrated with an overhead power consumption of just 7.93 W, accounting for the opto-electronics and FPGA implementation, providing fast random number generation at up to 2 Gbps. We demonstrate the real-time seeding of a free-space decoy-state quantum key distribution system using our QRNG. Our design and implementation provides a practical solution for QRNGs requiring low-power and high bit rates. This advancement is important for practical QRNGs and particularly for application in resource-constrained environments such as space-based quantum key distribution.","PeriodicalId":19212,"journal":{"name":"npj Quantum Information","volume":"78 1","pages":"153"},"PeriodicalIF":7.6,"publicationDate":"2025-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145182640","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Enhancing quantum state reconstruction with structured classical shadows 利用结构经典阴影增强量子态重构

IF 7.6 1区物理与天体物理

npj Quantum Information Pub Date : 2025-09-02 DOI: 10.1038/s41534-025-01101-1

Zhen Qin, Joseph M. Lukens, Brian T. Kirby, Zhihui Zhu

{"title":"Enhancing quantum state reconstruction with structured classical shadows","authors":"Zhen Qin, Joseph M. Lukens, Brian T. Kirby, Zhihui Zhu","doi":"10.1038/s41534-025-01101-1","DOIUrl":"https://doi.org/10.1038/s41534-025-01101-1","url":null,"abstract":"While classical shadows can efficiently predict key quantum state properties, their suitability for certified quantum state tomography remains uncertain. In this paper, we address this challenge by introducing a projected classical shadow (PCS) that extends the standard classical shadow by incorporating a projection step onto the target subspace. For a general quantum state consisting of n qubits, our method requires a minimum of O(4n) total state copies to achieve a bounded recovery error in the Frobenius norm between the reconstructed and true density matrices, reducing to O(2nr) for states of rank r < 2n—meeting information-theoretic optimal bounds in both cases. For matrix product operator states, we demonstrate that the PCS can recover the ground-truth state with O(n2) total state copies, improving upon the previously established Haar-random bound of O(n3). Numerical simulations validate our scaling results and demonstrate the practical accuracy of the proposed PCS method.","PeriodicalId":19212,"journal":{"name":"npj Quantum Information","volume":"11 1","pages":""},"PeriodicalIF":7.6,"publicationDate":"2025-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144928296","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Single shot latched readout of a quantum dot qubit using barrier gate pulsing 使用势垒门脉冲的量子点量子比特的单次锁存读出

IF 7.6 1区物理与天体物理

npj Quantum Information Pub Date : 2025-09-02 DOI: 10.1038/s41534-025-01094-x

Sanghyeok Park, Jared Benson, J. Corrigan, J. P. Dodson, S. N. Coppersmith, Mark Friesen, M. A. Eriksson

引用次数: 0

A quantum algorithm for solving 0-1 Knapsack problems 求解0-1背包问题的量子算法

IF 7.6 1区物理与天体物理

npj Quantum Information Pub Date : 2025-08-26 DOI: 10.1038/s41534-025-01097-8

Sören Wilkening, Andreea-Iulia Lefterovici, Lennart Binkowski, Michael Perk, Sándor P. Fekete, Tobias J. Osborne

引用次数: 0

Scalable noisy quantum circuits for biased-noise qubits 偏置噪声量子比特的可扩展噪声量子电路

IF 7.6 1区物理与天体物理

npj Quantum Information Pub Date : 2025-08-26 DOI: 10.1038/s41534-025-01054-5

Marco Fellous-Asiani, Moein Naseri, Chandan Datta, Alexander Streltsov, Michał Oszmaniec

{"title":"Scalable noisy quantum circuits for biased-noise qubits","authors":"Marco Fellous-Asiani, Moein Naseri, Chandan Datta, Alexander Streltsov, Michał Oszmaniec","doi":"10.1038/s41534-025-01054-5","DOIUrl":"https://doi.org/10.1038/s41534-025-01054-5","url":null,"abstract":"In this work, we consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. This property allows us to design a class of noisy Hadamard tests involving entangling and certain non-Clifford gates, which can be conducted reliably with only a polynomial overhead in algorithm repetitions. On the flip side, we also found classical algorithms able to efficiently simulate both the noisy and noiseless versions of our specific variants of the Hadamard test. We propose to use these algorithms as a benchmark of the biasness of the noise at the scale of large circuits. The bias being checked on a full computational task makes our benchmark sensitive to crosstalk or time-correlated errors, which are usually invisible from individual gate tomography. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to 106 gates, several orders of magnitude larger than circuits not exploiting a noise-bias. Our benchmark is applicable for an arbitrary noise-bias, beyond Pauli models.","PeriodicalId":19212,"journal":{"name":"npj Quantum Information","volume":"48 1","pages":""},"PeriodicalIF":7.6,"publicationDate":"2025-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144899678","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

All genuinely entangled stabilizer subspaces are multipartite fully nonlocal 所有真正纠缠稳定子空间都是多部完全非局部的

IF 7.6 1区物理与天体物理

npj Quantum Information Pub Date : 2025-08-23 DOI: 10.1038/s41534-025-01080-3

Owidiusz Makuta, Remigiusz Augusiak

引用次数: 0

Efficient sparse state preparation via quantum walks 基于量子行走的高效稀疏态制备

IF 7.6 1区物理与天体物理

npj Quantum Information Pub Date : 2025-08-21 DOI: 10.1038/s41534-025-01093-y

Alvin Gonzales, Rebekah Herrman, Colin Campbell, Igor Gaidai, Ji Liu, Teague Tomesh, Zain H. Saleem

引用次数: 0

Universal logical quantum photonic neural network processor via cavity-assisted interactions 通用逻辑量子光子神经网络处理器，通过腔辅助相互作用

IF 7.6 1区物理与天体物理

npj Quantum Information Pub Date : 2025-08-20 DOI: 10.1038/s41534-025-01096-9

Jasvith Raj Basani, Murphy Yuezhen Niu, Edo Waks

{"title":"Universal logical quantum photonic neural network processor via cavity-assisted interactions","authors":"Jasvith Raj Basani, Murphy Yuezhen Niu, Edo Waks","doi":"10.1038/s41534-025-01096-9","DOIUrl":"https://doi.org/10.1038/s41534-025-01096-9","url":null,"abstract":"Encoding quantum information within bosonic modes offers a promising direction for hardware-efficient and fault-tolerant quantum information processing. However, achieving high-fidelity universal control over bosonic encodings using native photonic hardware remains a significant challenge. We establish a quantum control framework to prepare and perform universal logical operations on arbitrary multimode multi-photon states using a quantum photonic neural network. Central to our approach is the optical nonlinearity, which is realized through strong light-matter interaction with a three-level Λ atomic system. The dynamics of this passive interaction are asymptotically confined to the single-mode subspace, enabling the construction of deterministic entangling gates and overcoming limitations faced by many nonlinear optical mechanisms. Using this nonlinearity as the element-wise activation function, we show that the proposed architecture is able to deterministically prepare a wide array of multimode multi-photon states, including essential resource states. We demonstrate universal code-agnostic control of bosonic encodings by preparing and performing logical operations on symmetry-protected error-correcting codes. Our architecture is not constrained by symmetries imposed by evolution under a system Hamiltonian such as purely χ(2) and χ(3) processes, and is naturally suited to implement non-transversal gates on photonic logical qubits. Additionally, we propose an error-correction scheme based on non-demolition measurements that is facilitated by the optical nonlinearity as a building block. Our results pave the way for near-term quantum photonic processors that enable error-corrected quantum computation, and can be achieved using present-day integrated photonic hardware.","PeriodicalId":19212,"journal":{"name":"npj Quantum Information","volume":"31 1","pages":""},"PeriodicalIF":7.6,"publicationDate":"2025-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144899795","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Further improving quantum algorithms for nonlinear differential equations via higher-order methods and rescaling 通过高阶方法和重标度进一步改进非线性微分方程的量子算法

IF 7.6 1区物理与天体物理

npj Quantum Information Pub Date : 2025-08-18 DOI: 10.1038/s41534-025-01084-z

Pedro C. S. Costa, Philipp Schleich, Mauro E. S. Morales, Dominic W. Berry

{"title":"Further improving quantum algorithms for nonlinear differential equations via higher-order methods and rescaling","authors":"Pedro C. S. Costa, Philipp Schleich, Mauro E. S. Morales, Dominic W. Berry","doi":"10.1038/s41534-025-01084-z","DOIUrl":"https://doi.org/10.1038/s41534-025-01084-z","url":null,"abstract":"The solution of large systems of nonlinear differential equations is essential for many applications in science and engineering. We present three improvements to existing quantum algorithms based on the Carleman linearisation technique. First, we use a high-precision method for solving the linearised system that yields logarithmic dependence on the error and near-linear dependence on time. Second, we introduce a rescaling strategy that significantly reduces the cost, which would otherwise scale exponentially with the Carleman order, thus limiting quantum speedups for PDEs. Third, we derive tighter error bounds for Carleman linearisation. We apply our results to a class of discretised reaction-diffusion equations using higher-order finite differences for spatial resolution. We also show that enforcing a stability criterion independent of the discretisation can conflict with rescaling due to the mismatch between the max-norm and the 2-norm. Nonetheless, efficient quantum solutions remain possible when the number of discretisation points is constrained, as enabled by higher-order schemes.","PeriodicalId":19212,"journal":{"name":"npj Quantum Information","volume":"95 1","pages":""},"PeriodicalIF":7.6,"publicationDate":"2025-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144898148","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Quantum key distribution as a quantum machine learning task 量子密钥分发作为量子机器学习任务

IF 7.6 1区物理与天体物理

npj Quantum Information Pub Date : 2025-08-12 DOI: 10.1038/s41534-025-01088-9

Thomas Decker, Marcelin Gallezot, Sven Florian Kerstan, Alessio Paesano, Anke Ginter, Wadim Wormsbecher

引用次数: 0