Tootfinder

Quantum computing stocks jumped after JPMorgan announced a $10B strategic tech investment; Arqit, D-Wave, Rigetti, and IonQ each rose about 20% (Jaures Yip/CNBC)
https://www.cnbc.com/2025/10/13/quantum-stocks-jpmorgan-investing-push.html

Quantum stocks surge after JPMorgan investing push into strategic tech
JPMorgan announced it would invest $10 billion in 27 specific industries, including quantum computing.

Quantum Computing Technology Roadmaps and Capability Assessment for Scientific Computing -- An analysis of use cases from the NERSC workload
Daan Camps, Ermal Rrapaj, Katherine Klymko, Hyeongjin Kim, Kevin Gott, Siva Darbha, Jan Balewski, Brian Austin, Nicholas J. Wright
https://arxiv.org/abs/2509.09882

Quantum Computing Technology Roadmaps and Capability Assessment for Scientific Computing -- An analysis of use cases from the NERSC workload
The National Energy Research Scientific Computing Center (NERSC), as the high-performance computing (HPC) facility for the Department of Energy's Office of Science, recognizes the essential role of quantum computing in its future mission. In this report, we analyze the NERSC workload and identify materials science, quantum chemistry, and high-energy physics as the science domains and application areas that stand to benefit most from quantum computers. These domains jointly make up over 50% of t…

HUGR: A Quantum-Classical Intermediate Representation
Mark Koch, Agust\'in Borgna, Seyon Sivarajah, Alan Lawrence, Alec Edgington, Douglas Wilson, Craig Roy, Luca Mondada, Lukas Heidemann, Ross Duncan
https://arxiv.org/abs/2510.11420

HUGR: A Quantum-Classical Intermediate Representation
We introduce the Hierarchical Unified Graph Representation (HUGR): a novel graph based intermediate representation for mixed quantum-classical programs. HUGR's design features high expressivity and extensibility to capture the capabilities of near-term and forthcoming quantum computing devices, as well as new and evolving abstractions from novel quantum programming paradigms. The graph based structure is machine-friendly and supports powerful pattern matching based compilation techniques. Inspi…

Amplified Directional Photoluminescence from CIS Quantum Dots and hBN Quantum Emitters using Tunable BIC Metasurfaces
Omar A. M. Abdelraouf
https://arxiv.org/abs/2510.10470 http…

Amplified Directional Photoluminescence from CIS Quantum Dots and hBN Quantum Emitters using Tunable BIC Metasurfaces
Integrated and tunable light sources are critical for advancing quantum nanophotonic chips in quantum computing, communications, and sensing. However, efficient and tunable emission amplification post-fabrication poses major challenges. Hybrid metasurfaces combining niobium pentoxide (Nb2O5), copper indium sulfide (CIS) quantum dots or hexagonal boron nitride (hBN), and antimony trisulfide (Sb2S3) as a low-loss phase-change material offer a compelling solution for dynamic control and amplificat…

Quantum algorithms based on quantum trajectories
Evan Borras, Milad Marvian
https://arxiv.org/abs/2509.10425 https://arxiv.org/pdf/2509.10425

Quantum algorithms based on quantum trajectories
Quantum simulation has emerged as a key application of quantum computing, with significant progress made in algorithms for simulating both closed and open quantum systems. The simulation of open quantum systems, particularly those governed by the Lindblad master equation, has received attention recently with the current state-of-the-art algorithms having an input model query complexity of $O(T \mathrm{polylog}(T/ε))$, where $T$ and $ε$ are the requested time and precision of the simulation re…

Quantum Alternating Direction Method of Multipliers for Semidefinite Programming
Hantao Nie, Dong An, Zaiwen Wen
https://arxiv.org/abs/2510.10056 https://a…

Quantum Alternating Direction Method of Multipliers for Semidefinite Programming
Semidefinite programming (SDP) is a fundamental convex optimization problem with wide-ranging applications. However, solving large-scale instances remains computationally challenging due to the high cost of solving linear systems and performing eigenvalue decompositions. In this paper, we present a quantum alternating direction method of multipliers (QADMM) for SDPs, building on recent advances in quantum computing. An inexact ADMM framework is developed, which tolerates errors in the iterates …

Thermoelectric effect at the quantum Hall-superconductor interface
Jordan T. McCourt, John Chiles, Chun-Chia Chen, Kenji Watanabe, Takashi Tanaguchi, Francois Amet, Gleb Finkelstein
https://arxiv.org/abs/2510.09798

Thermoelectric effect at the quantum Hall-superconductor interface
The interfaces of quantum Hall insulators with superconductors have emerged as a promising platform to realise interesting physics that may be relevant for topologically protected quantum computing. However, these interfaces can host other effects which obscure the detection of the desired excitations. Here we present measurements of the thermoelectric effect at the quantum Hall-superconductor interface. We explain the heat transport by considering the formation of a hotspot at the interface, w…

A Symmetry-Integrated Approach to Surface Code Decoding
Hoshitaro Ohnishi, Hideo Mukai
https://arxiv.org/abs/2509.10164 https://arxiv.org/pdf/2509.10164

A Symmetry-Integrated Approach to Surface Code Decoding
Quantum error correction, which utilizes logical qubits that are encoded as redundant multiple physical qubits to find and correct errors in physical qubits, is indispensable for practical quantum computing. Surface code is considered to be a promising encoding method with a high error threshold that is defined by stabilizer generators. However, previous methods have suffered from the problem that the decoder acquires solely the error probability distribution because of the non-uniqueness of co…

Assessing the Impact of Post-Quantum Digital Signature Algorithms on Blockchains
Alison Gon\c{c}alves Schemitt (PUCRS), Henrique Fan da Silva (UNIPAMPA), Roben Castagna Lunardi (PUCRS, IFRS), Diego Kreutz (UNIPAMPA), Rodrigo Brand\~ao Mansilha (UNIPAMPA), Avelino Francisco Zorzo (PUCRS)
https://arxiv.org/abs/2510.09271

Assessing the Impact of Post-Quantum Digital Signature Algorithms on Blockchains
The advent of quantum computing threatens the security of traditional encryption algorithms, motivating the development of post-quantum cryptography (PQC). In 2024, the National Institute of Standards and Technology (NIST) standardized several PQC algorithms, marking an important milestone in the transition toward quantum-resistant security. Blockchain systems fundamentally rely on cryptographic primitives to guarantee data integrity and transaction authenticity. However, widely used algorithms…

Trajectory-Protected Quantum Computing
Barbara \v{S}oda, Pierre-Antoine Graham, T. Rick Perche, Gurpahul Singh
https://arxiv.org/abs/2510.12771 https://arx…

Trajectory-Protected Quantum Computing
We introduce a novel method that simultaneously isolates a quantum computer from decoherence and enables the controlled implementation of computational gates. We demonstrate a quantum computing model that utilizes a qubit's motion to protect it from decoherence. We model a qubit interacting with a quantum field via the standard light-matter interaction model: an Unruh-DeWitt detector, i.e., the qubit, follows a prescribed classical trajectory while interacting with a scalar quantum field. We sw…

JPMorgan Chase launches a decade-long plan to invest $10B in industries critical for national security, including "frontier" tech like AI and quantum computing (Hugh Son/CNBC)
https://www.cnbc.com/2025/10/13/jpmorgan-chase-to-invest-10-…

JPMorgan Chase says it will invest $10 billion into industries critical for national security
The move helps JPMorgan Chase organize its activities around national interests at a time of heightened tensions between the U.S. and China.

Quantum-enhanced Computer Vision: Going Beyond Classical Algorithms
Natacha Kuete Meli, Shuteng Wang, Marcel Seelbach Benkner, Michele Sasdelli, Tat-Jun Chin, Tolga Birdal, Michael Moeller, Vladislav Golyanik
https://arxiv.org/abs/2510.07317

Quantum-enhanced Computer Vision: Going Beyond Classical Algorithms
Quantum-enhanced Computer Vision (QeCV) is a new research field at the intersection of computer vision, optimisation theory, machine learning and quantum computing. It has high potential to transform how visual signals are processed and interpreted with the help of quantum computing that leverages quantum-mechanical effects in computations inaccessible to classical (i.e. non-quantum) computers. In scenarios where existing non-quantum methods cannot find a solution in a reasonable time or comput…

Quasiparticle pairing encoding of atomic nuclei for quantum annealing
Emanuele Costa, Axel P\'erez-Obiol, Javier Men\'endez, Arnau Rios, Artur Garc\'ia-S\'aez, Bruno Juli\'a-D\'iaz
https://arxiv.org/abs/2510.10118

Quasiparticle pairing encoding of atomic nuclei for quantum annealing
Quantum computing is emerging as a promising tool in nuclear physics. However, the cost of encoding fermionic operators hampers the application of algorithms in current noisy quantum devices. In this work, we analyze an encoding scheme based on pairing nucleon modes. This approach significantly reduces the complexity of the encoding, while maintaining a high accuracy for the ground states of semimagic nuclei across the $sd$ and $pf$ shells and for tin isotopes. In addition, we also explore the …

Optimizing Inter-chip Coupler Link Placement for Modular and Chiplet Quantum Systems
Zefan Du, Pedro Chumpitaz Flores, Wenqi Wei, Juntao Chen, Kaixun Hua, Ying Mao
https://arxiv.org/abs/2509.10409

Optimizing Inter-chip Coupler Link Placement for Modular and Chiplet Quantum Systems
Quantum computing offers unparalleled computational capabilities but faces significant challenges, including limited qubit counts, diverse hardware topologies, and dynamic noise and error rates, which hinder scalability and reliability. Distributed quantum computing, particularly chip-to-chip connections, has emerged as a solution by interconnecting multiple processors to collaboratively execute large circuits. While hardware advancements, such as IBM's Quantum Flamingo, focus on improving inte…

Quantum Computing as a Service - a Software Engineering Perspective
Aakash Ahmad, Muhammad Waseem, Bakheet Aljedaani, Mahdi Fahmideh, Peng Liang, Feras Awaysheh
https://arxiv.org/abs/2510.04982

Quantum Computing as a Service - a Software Engineering Perspective
Quantum systems have started to emerge as a disruptive technology and enabling platforms - exploiting the principles of quantum mechanics via programmable quantum bits (QuBits) - to achieve quantum supremacy in computing. Academic research, industrial projects (e.g., Amazon Braket, IBM Qiskit), and consortiums like 'Quantum Flagship' are striving to develop practically capable and commercially viable quantum computing (QC) systems and technologies. Quantum Computing as a Service (QCaaS) is view…

Astigmatism-free 3D Optical Tweezer Control for Rapid Atom Rearrangement
Yue-Hui Lu, Nathan Song, Tai Xiang, Jacquelyn Ho, Tsai-Chen Lee, Zhenjie Yan, Dan M. Stamper-Kurn
https://arxiv.org/abs/2510.11451

Astigmatism-free 3D Optical Tweezer Control for Rapid Atom Rearrangement
Reconfigurable arrays of neutral atoms are a leading platform for quantum computing, quantum simulation, and quantum metrology. The most common method for atom reconfiguration using optical tweezers relies on frequency chirping of acousto-optic deflectors (AODs). However, chirp-induced acoustic lensing limits the speed of atom transport by deformation of the tweezer profile and warping of the tweezer trajectory. We use a three-dimensional acousto-optic deflector lens (3D-AODL) to mitigate both …

Probabilistic Links Between Quantum Classification of Patterns of Boolean Functions and Hamming Distance
Theodore Andronikos, Constantinos Bitsakos, Konstantinos Nikas, Georgios I. Goumas, Nectarios Koziris
https://arxiv.org/abs/2510.12736

Probabilistic Links Between Quantum Classification of Patterns of Boolean Functions and Hamming Distance
This article investigates the probabilistic relationship between quantum classification of Boolean functions and their Hamming distance. By integrating concepts from quantum computing, information theory, and combinatorics, we explore how Hamming distance serves as a metric for analyzing deviations in function classification. Our extensive experimental results confirm that the Hamming distance is a pivotal metric for validating nearest neighbors in the process of classifying random functions. O…

Signal Protocol and Post-Quantum Ratchets
[…] The @… Protocol is a set of cryptographic specifications that provides end-to-end encryption for private communications exchanged daily by billions of people around the world. […]
🗨️ ht…

Signal Protocol and Post-Quantum Ratchets
We are excited to announce a significant advancement in the security of the Signal Protocol: the introduction of the Sparse Post Quantum Ratchet (SPQR). This new ratchet enhances the Signal Protocol’s resilience against future quantum computing threats while maintaining our existing security guar...

QUASAR: Quantum Assembly Code Generation Using Tool-Augmented LLMs via Agentic RL
Cong Yu, Valter Uotila, Shilong Deng, Qingyuan Wu, Tuo Shi, Songlin Jiang, Lei You, Bo Zhao
https://arxiv.org/abs/2510.00967

QUASAR: Quantum Assembly Code Generation Using Tool-Augmented LLMs via Agentic RL
Designing and optimizing task-specific quantum circuits are crucial to leverage the advantage of quantum computing. Recent large language model (LLM)-based quantum circuit generation has emerged as a promising automatic solution. However, the fundamental challenges remain unaddressed: (i) parameterized quantum gates require precise numerical values for optimal performance, which also depend on multiple aspects, including the number of quantum gates, their parameters, and the layout/depth of the…

A look at Rigetti Computing and D-Wave Quantum, whose shares have surged over 1,900% in the past year as the potential of quantum computing captivates investors (Felice Maranz/Bloomberg)
https://www.bloomberg.com/news/articles/20

Seventeen years after the Large Hadron Collider switched on,
particle physicists are realizing that they can use the collider to explore how information flows through quantum systems
— a question at the foundations of quantum computing.
The two possible spins of the quarks correspond to the 0 and 1 states of a qubit,
a unit of quantum information.
“It is treating the process of colliding things together and forming new particles as a quantum processor,”
s…

Particle Physicists Detect ‘Magic’ at the Large Hadron Collider | Quanta Magazine
The supercollider is now being used to explore quantum phenomena, including a “magic” form of quantum entanglement.

Quantum Network-Based Prediction of Cancer Driver Genes
Patricia Marques, Andreas Wichert, Duarte Magano, Bruno Coutinho
https://arxiv.org/abs/2510.12628 https://

Quantum Network-Based Prediction of Cancer Driver Genes
Identification of cancer driver genes is fundamental for the development of targeted therapeutic interventions. The integration of mutational profiles with protein-protein interaction (PPI) networks offers a promising avenue for their detection [ 1, 2], but scaling to large network datasets is computationally demanding. Quantum computing offers compact representations and potential complexity reductions. Motivated by the classical method of Gumpinger et al. [3], in this work we introduce a supe…

Computing moment polytopes - with a focus on tensors, entanglement and matrix multiplication
Maxim van den Berg, Matthias Christandl, Vladimir Lysikov, Harold Nieuwboer, Michael Walter, Jeroen Zuiddam
https://arxiv.org/abs/2510.08336

Computing moment polytopes - with a focus on tensors, entanglement and matrix multiplication
Tensors are fundamental in mathematics, computer science, and physics. Their study through algebraic geometry and representation theory has proved very fruitful in the context of algebraic complexity theory and quantum information. In particular, moment polytopes have been understood to play a key role. In quantum information, moment polytopes (also known as entanglement polytopes) provide a framework for the single-particle quantum marginal problem and offer a geometric characterization of ent…

Comparative Studies of Quantum Annealing, Digital Annealing, and Classical Solvers for Reaction Network Pathway Analysis and mRNA Codon Selection
Milind Upadhyay, Mark Nicholas Jones
https://arxiv.org/abs/2509.09862

Comparative Studies of Quantum Annealing, Digital Annealing, and Classical Solvers for Reaction Network Pathway Analysis and mRNA Codon Selection
For various optimization problems, the classical time to solution is super-polynomial and intractable to solve with classical bit-based computing hardware to date. Digital and quantum annealers have the potential to identify near-optimal solutions for such optimization problems using a quadratic unconstrained binary optimization (QUBO) problem formulation. This work benchmarks two use cases to evaluate the utility of QUBO solvers for combinatorial optimization problems, in order to determine if…

Replaced article(s) found for math.OC. https://arxiv.org/list/math.OC/new
[1/1]:
- A robust BFGS algorithm for unconstrained nonlinear optimization problems
Yaguang Yang
https://arxiv.org/abs/1212.5929
- Quantum computing and the stable set problem
Alja\v{z} Krpan, Janez Povh, Dunja Pucher
https://arxiv.org/abs/2405.12845 https://mastoxiv.page/@arXiv_mathOC_bot/112483516437815686
- Mean Field Game with Reflected Jump Diffusion Dynamics: A Linear Programming Approach
Zongxia Liang, Xiang Yu, Keyu Zhang
https://arxiv.org/abs/2508.20388 https://mastoxiv.page/@arXiv_mathOC_bot/115111048711698998
- Differential Dynamic Programming for the Optimal Control Problem with an Ellipsoidal Target Set a...
Sungjun Eom, Gyunghoon Park
https://arxiv.org/abs/2509.07546 https://mastoxiv.page/@arXiv_mathOC_bot/115179281556444440
- On the Moreau envelope properties of weakly convex functions
Marien Renaud, Arthur Leclaire, Nicolas Papadakis
https://arxiv.org/abs/2509.13960 https://mastoxiv.page/@arXiv_mathOC_bot/115224514482363803
- Automated algorithm design via Nevanlinna-Pick interpolation
Ibrahim K. Ozaslan, Tryphon T. Georgiou, Mihailo R. Jovanovic
https://arxiv.org/abs/2509.21416 https://mastoxiv.page/@arXiv_mathOC_bot/115286533597711930
- Optimal Control of a Bioeconomic Crop-Energy System with Energy Reinvestment
Othman Cherkaoui Dekkaki
https://arxiv.org/abs/2510.11381 https://mastoxiv.page/@arXiv_mathOC_bot/115372322896073250
- Point Convergence Analysis of the Accelerated Gradient Method for Multiobjective Optimization: Co...
Yingdong Yin
https://arxiv.org/abs/2510.26382 https://mastoxiv.page/@arXiv_mathOC_bot/115468018035252078
- History-Aware Adaptive High-Order Tensor Regularization
Chang He, Bo Jiang, Yuntian Jiang, Chuwen Zhang, Shuzhong Zhang
https://arxiv.org/abs/2511.05788
- Equivalence of entropy solutions and gradient flows for pressureless 1D Euler systems
Jos\'e Antonio Carrillo, Sondre Tesdal Galtung
https://arxiv.org/abs/2312.04932 https://mastoxiv.page/@arXiv_mathAP_bot/111560077272113052
- Kernel Modelling of Fading Memory Systems
Yongkang Huo, Thomas Chaffey, Rodolphe Sepulchre
https://arxiv.org/abs/2403.11945 https://mastoxiv.page/@arXiv_eessSY_bot/112121123836064435
- The Maximum Theoretical Ground Speed of the Wheeled Vehicle
Altay Zhakatayev, Mukatai Nemerebayev
https://arxiv.org/abs/2502.15341 https://mastoxiv.page/@arXiv_physicsclassph_bot/114057765769441123
- Hessian stability and convergence rates for entropic and Sinkhorn potentials via semiconcavity
Giacomo Greco, Luca Tamanini
https://arxiv.org/abs/2504.11133 https://mastoxiv.page/@arXiv_mathPR_bot/114346453424694503
- Optimizing the ground state energy of the three-dimensional magnetic Dirichlet Laplacian with con...
Matthias Baur
https://arxiv.org/abs/2504.21597 https://mastoxiv.page/@arXiv_mathph_bot/114431404740241516
- A localized consensus-based sampling algorithm
Arne Bouillon, Alexander Bodard, Panagiotis Patrinos, Dirk Nuyens, Giovanni Samaey
https://arxiv.org/abs/2505.24861 https://mastoxiv.page/@arXiv_mathNA_bot/114612580684567066
- A Novel Sliced Fused Gromov-Wasserstein Distance
Moritz Piening, Robert Beinert
https://arxiv.org/abs/2508.02364 https://mastoxiv.page/@arXiv_csLG_bot/114976243138728278
- Minimal Regret Walras Equilibria for Combinatorial Markets via Duality, Integrality, and Sensitiv...
Alo\"is Duguet, Tobias Harks, Martin Schmidt, Julian Schwarz
https://arxiv.org/abs/2511.09021 https://mastoxiv.page/@arXiv_csGT_bot/115541243299714775
toXiv_bot_toot

Non-unitary Time Evolution via the Chebyshev Expansion Method
\'Aron Holl\'o, D\'aniel Varjas, Cosma Fulga, L\'aszl\'o Oroszl\'any, Viktor K\"onye
https://arxiv.org/abs/2510.10643

Non-unitary Time Evolution via the Chebyshev Expansion Method
The Chebyshev expansion method is a well-established technique for computing the time evolution of quantum states, particularly in Hermitian systems with a bounded spectrum. Here, we show that the applicability of the Chebyshev expansion method extends well beyond this constraint: It remains valid across the entire complex plane and is thus suitable for arbitrary non-Hermitian matrices. We identify that numerical rounding errors are the primary source of errors encountered when applying the met…

The director of IBM's Research Lab has some bold takes on the future of computation.
We're on the cusp of two simultaneous technological revolutions - #AI and #quantum - that will fundamentally change how the world uses computers to solve difficult problems.
There have only been two c…

IBM predicts a computation revolution
Quantum and AI are ushering in a whole new range of algorithmic possibilities, says IBM’s research lead.

"Can Academic Libraries Lead the Quantum Revolution?" https://katinamagazine.org/content/article/future-of-work/2025/can-libraries-lead-the-quantum-revolution
– Herjeh, um was sollen wir uns denn noch alles kümmern…

Decoding Multimode Gottesman-Kitaev-Preskill Codes with Noisy Auxiliary States
Marc-Antoine Roy, Thomas Pousset, Baptiste Royer
https://arxiv.org/abs/2510.12677 https://

Decoding Multimode Gottesman-Kitaev-Preskill Codes with Noisy Auxiliary States
In order to achieve fault-tolerant quantum computing, we make use of quantum error correction schemes designed to protect the logical information of the system from decoherence. A promising way to preserve such information is to use the multimode Gottesman-Kitaev-Preskill (GKP) encoding, which encodes logical qubits into several harmonic oscillators. In this work, we focus on decoding the measurements obtained from Steane-type quantum error correction protocols for multimode GKP codes. We propo…

Horizon Quantum, which aims to list on Nasdaq via a SPAC in Q1 2026, claims it is the first private company to deploy a commercial quantum computer in Singapore (Dylan Butts/CNBC)
https://www.cnbc.com/2025/12/04/horizon-qu

Software startup deploys Singapore’s first quantum computer for commercial use
Singapore-based software firm Horizon Quantum Computing has become the first private firm to deploy a quantum computer for commercial use in the city-state.

The foundational value of quantum computing for classical fluids
Sauro Succi, Claudio Sanavio, Peter Love
https://arxiv.org/abs/2510.09178 https://arxiv.or…

The foundational value of quantum computing for classical fluids
Quantum algorithms for classical physics problems expose new patterns of quantum information flow as compared to the many-body Schrödinger equation. As a result, besides their potential practical applications, they also offer a valuable theoretical and computational framework to elucidate the foundations of quantum mechanics, particularly the validity of the many-body Schrödinger equation in the limit of large number of particles, on the order of the Avogadro number. This idea is illustrated …

Trump Administration in Talks to Take Equity Stakes in Quantum-Computing Firms (Amrith Ramkumar/Wall Street Journal)
https://www.wsj.com/business/entrepreneurship/trump-administration-in-talks-to-take-equity-stakes-in-quantum-computing-firms-60ee5143
http://www.memeorandum.com/251022/p172#a251022p172

Light coupling to photonic integrated circuits using optimized lensed fibers
Dengke Chen, Zeying Zhong, Sanli Huang, Jiahao Sun, Sicheng Zeng, Baoqi Shi, Yi-Han Luo, Junqiu Liu
https://arxiv.org/abs/2510.10635

Light coupling to photonic integrated circuits using optimized lensed fibers
Efficient and reliable light coupling between optical fibers and photonic integrated circuits has arguably been the most essential issue in integrated photonics for optical interconnects, nonlinear signal conversion, neuromorphic computing, and quantum information processing. A commonly employed approach is to use inverse tapers interfacing with lensed fibers, particularly for waveguides of relatively low refractive index such as silicon nitride (Si3N4), silicon oxynitride and lithium niobate. …

Gate Teleportation vs Circuit Cutting in Distributed Quantum Computing
Shobhit Gupta, Nikolay Sheshko, Daniel J. Dilley, Alvin Gonzales, Manish K. Singh, Zain H. Saleem
https://arxiv.org/abs/2510.08894

Gate Teleportation vs Circuit Cutting in Distributed Quantum Computing
Distributing circuits across quantum processor modules will enable the execution of circuits larger than the qubit count limitations of monolithic processors. While distributed quantum computation has primarily utilized circuit cutting, it incurs an exponential growth of sub-circuit sampling and classical post-processing overhead with an increasing number of cuts. The entanglement-based gate teleportation approach does not inherently incur exponential sampling overhead, provided that quantum in…

QUASAR: Quantum Assembly Code Generation Using Tool-Augmented LLMs via Agentic RL
Cong Yu, Valter Uotila, Shilong Deng, Qingyuan Wu, Tuo Shi, Songlin Jiang, Lei You, Bo Zhao
https://arxiv.org/abs/2510.00967

QUASAR: Quantum Assembly Code Generation Using Tool-Augmented LLMs via Agentic RL
Designing and optimizing task-specific quantum circuits are crucial to leverage the advantage of quantum computing. Recent large language model (LLM)-based quantum circuit generation has emerged as a promising automatic solution. However, the fundamental challenges remain unaddressed: (i) parameterized quantum gates require precise numerical values for optimal performance, which also depend on multiple aspects, including the number of quantum gates, their parameters, and the layout/depth of the…

Fate of entanglement in open quantum spin liquid: Time evolution of its genuine multipartite negativity upon sudden coupling to a dissipative bosonic environment
Federico Garcia-Gaitan, Branislav K. Nikolic
https://arxiv.org/abs/2510.02256

Fate of entanglement in open quantum spin liquid: Time evolution of its genuine multipartite negativity upon sudden coupling to a dissipative bosonic environment
Topological properties of many-body entanglement in quantum spin liquids (QSLs), persisting at arbitrarily long distances, have been intensely explored over the past two decades, but mostly for QSLs viewed as {\em closed} quantum systems. However, in experiments and potential quantum computing applications, candidate materials for this exotic phase of quantum matter will always interact with a dissipative environment, such as the one generated by bosonic quasiparticles in solids at finite tempe…

Crosslisted article(s) found for cs.DC. https://arxiv.org/list/cs.DC/new
[1/1]:
- Layerwise Federated Learning for Heterogeneous Quantum Clients using Quorus
Jason Han, Nicholas S. DiBrita, Daniel Leeds, Jianqiang Li, Jason Ludmir, Tirthak Patel

Computing Large Deviations of First-Passage-Time Statistics in Open Quantum Systems: Two Methods
Fei Liu, Jiayin Gu
https://arxiv.org/abs/2509.26123 https://

Computing Large Deviations of First-Passage-Time Statistics in Open Quantum Systems: Two Methods
We propose two methods for computing the large deviations of the first-passage-time statistics in general open quantum systems. The first method determines the region of convergence of the joint Laplace transform and the $z$-transform of the first-passage time distribution by solving an equation of poles with respect to the $z$-transform parameter. The scaled cumulant generating function is then obtained as the logarithm of the boundary values within this region. The theoretical basis lies in t…

Quantum Computing Beyond Ground State Electronic Structure: A Review of Progress Toward Quantum Chemistry Out of the Ground State
Alan Bidart, Prateek Vaish, Tilas Kabengele, Yaoqi Pang, Yuan Liu, Brenda M. Rubenstein
https://arxiv.org/abs/2509.19709

Quantum Computing Beyond Ground State Electronic Structure: A Review of Progress Toward Quantum Chemistry Out of the Ground State
Quantum computing offers the promise of revolutionizing quantum chemistry by enabling the solution of chemical problems for substantially less computational cost. While most demonstrations of quantum computation to date have focused on resolving the energies of the electronic ground states of small molecules, the field of quantum chemistry is far broader than ground state chemistry; equally important to practicing chemists are chemical reaction dynamics and reaction mechanism prediction. Here, …

Retro quantum computing

Pair state transfer in tensor product and double cover
Ming Jiang, Xiaogang Liu, Jing Wang
https://arxiv.org/abs/2509.18858 https://arxiv.org/pdf/2509.1885…

High-Fidelity Single-Shot Readout and Selective Nuclear Spin Control for a Spin-1/2 Quantum Register in Diamond
Prithvi Gundlapalli, Philipp J. Vetter, Genko Genov, Michael Olney-Fraser, Peng Wang, Matthias M. M\"uller, Katharina Senkalla, Fedor Jelezko
https://arxiv.org/abs/2510.09164

High-Fidelity Single-Shot Readout and Selective Nuclear Spin Control for a Spin-1/2 Quantum Register in Diamond
Quantum networks offer a way to overcome the size and complexity limitations of single quantum devices by linking multiple nodes into a scalable architecture. Group-IV color centers in diamond, paired with long-lived nuclear spins, have emerged as promising building blocks demonstrating proof-of-concept experiments such as blind quantum computing and quantum-enhanced sensing. However, realizing a large-scale electro-nuclear register remains a major challenge. Here we establish the germanium-vac…

Quantum computing company IonQ raises $2B by selling 21.5M shares and pre-funded warrants to Heights Capital at $93 each, a 20% premium over October 9's close (David Morris/Bloomberg)
https://www.bloomberg.com/news/articles/20

An efficient quantum algorithm for computing $S$-units and its applications
Jean-Francois Biasse, Fang Song
https://arxiv.org/abs/2510.02280 https://arxiv.…

An efficient quantum algorithm for computing $S$-units and its applications
In this paper, we provide details on the proofs of the quantum polynomial time algorithm of Biasse and Song (SODA 16) for computing the $S$-unit group of a number field. This algorithm directly implies polynomial time methods to calculate class groups, S-class groups, relative class group and the unit group, ray class groups, solve the principal ideal problem, solve certain norm equations, and decompose ideal classes in the ideal class group. Additionally, combined with a result of Cramer, Duca…

CircInspect: Integrating Visual Circuit Analysis, Abstraction, and Real-Time Development in Quantum Debugging
Mushahid Khan, Prashant J. Nair, Olivia Di Matteo
https://arxiv.org/abs/2509.25199

CircInspect: Integrating Visual Circuit Analysis, Abstraction, and Real-Time Development in Quantum Debugging
Software bugs typically result from errors in specifications or code translation. While classical software engineering has evolved with various tools and methodologies to tackle such bugs, the emergence of quantum computing presents unique challenges. Quantum software development introduces complexities due to the probabilistic nature of quantum computing, distinct algorithmic primitives, and potential hardware noise. In this paper, we introduce CircInspect, an interactive tool tailored for deb…

Universal syndrome-based recovery for noise-adapted quantum error correction
Debjyoti Biswas, Prabha Mandayam
https://arxiv.org/abs/2510.08719 https://arxi…

Universal syndrome-based recovery for noise-adapted quantum error correction
Quantum error correction (QEC) is an essential tool for quantum computing that enables reliable information processing in the presence of noise. Syndrome measurements play a central role in QEC, making it possible to unambiguously identify the location and type of errors. While syndrome extraction is natural for conventional QEC protocols, where the errors satisfy certain algebraic constraints \emph{perfectly}, this feature is largely missing in the framework of approximate or noise-adapted QEC…

We haven’t mined on the moon yet, but companies are already buying its resources.

Finnish tech firm Bluefors,
a maker of ultracold refrigerator systems critical for quantum computing,
has purchased tens of thousands of liters of Helium-3 from the moon
— spending “above $300 million”
— through a commercial space company called Interlune.
The agreement, which has not been previously reported, marks the largest purchase of a natural resource from space
…

Moon helium deal is biggest purchase of natural resources from space
The feasibility of moon mining is not yet proven, but the future of supercomputing may depend on the ability to extract Helium-3 from the lunar surface.

A Taxonomy of Data Risks in AI and Quantum Computing (QAI) - A Systematic Review
Grace Billiris, Asif Gill, Madhushi Bandara
https://arxiv.org/abs/2509.20418 https://

A Taxonomy of Data Risks in AI and Quantum Computing (QAI) - A Systematic Review
Quantum Artificial Intelligence (QAI), the integration of Artificial Intelligence (AI) and Quantum Computing (QC), promises transformative advances, including AI-enabled quantum cryptography and quantum-resistant encryption protocols. However, QAI inherits data risks from both AI and QC, creating complex privacy and security vulnerabilities that are not systematically studied. These risks affect the trustworthiness and reliability of AI and QAI systems, making their understanding critical. This…

Michel Devoret, a Google Quantum AI chief scientist, John Martinis, who left Google in 2020, and John Clarke win the Nobel in Physics for quantum computing work (Bloomberg)
https://www.bloomberg.com/news/articles/2025-10-…

Spin quantum computing, spin quantum cognition
Betony Adams, Francesco Petruccione
https://arxiv.org/abs/2510.07196 https://arxiv.org/pdf/2510.07196…

Spin quantum computing, spin quantum cognition
Over two decades ago, Bruce Kane proposed that spin-half phosphorus nuclei embedded in a spin-zero silicon substrate could serve as a viable platform for spin-based quantum computing. These nuclear spins exhibit remarkably long coherence times, making them ideal candidates for qubits. Despite this advantage, practical realisation of spin quantum computing remains a challenge. More recently, physicist Matthew Fisher proposed a hypothesis linking nuclear spin dynamics, specifically those of phosp…

Is Measurement Enough? Rethinking Output Validation in Quantum Program Testing
Jiaming Ye, Xiongfei Wu, Shangzhou Xia, Fuyuan Zhang, Jianjun Zhao
https://arxiv.org/abs/2509.16595

Is Measurement Enough? Rethinking Output Validation in Quantum Program Testing
As quantum computing continues to emerge, ensuring the quality of quantum programs has become increasingly critical. Quantum program testing has emerged as a prominent research area within the scope of quantum software engineering. While numerous approaches have been proposed to address quantum program quality assurance, our analysis reveals that most existing methods rely on measurement-based validation in practice. However, due to the inherently probabilistic nature of quantum programs, measu…

An interview with IBM CEO Arvind Krishna on why there's no AI bubble, his view that Watson's healthcare push was "inappropriate", IBM's quantum bet, and more (Nilay Patel/The Verge)
https://www.theverge.com/podcast/829868/ib

Why IBM CEO Arvind Krishna is still hiring humans in the AI era
IBM CEO Arvind Krishna on Watson, the AI bubble, and why he’s hiring college grads.

Quantum gates in coupled quantum dots controlled by coupling modulation
Alejandro D. Bendersky, Sergio S. Gomez, Rodolfo H. Romero
https://arxiv.org/abs/2510.02267 https://

Quantum gates in coupled quantum dots controlled by coupling modulation
We studied the dynamics of a pair of single-electron double quantum dots (DQD) under longitudinal and transverse static magnetic fields and time-dependent harmonic modulation of their interaction couplings. We propose to modulate the tunnel coupling between the QDs to produce one-qubit gates and the exchange coupling between DQDs to generate entangling gates, the set of operations required for quantum computing. We developed analytical approximations to set the conditions to control the qubits …

Caltech says it built the world's largest neutral-atom quantum computer, with 6,100 qubits, 13 second coherence, 10x longer than the past, and 99.98% accuracy (Jason Nelson/Decrypt)
https://decrypt.co/341716/caltech-builds-worlds-largest-neutral-atom…

Caltech Builds World’s Largest Neutral-Atom Quantum Computer
Researchers kept more than 6,000 qubits coherent while operating with 99.98% accuracy. Here's why that matters for quantum computing.

Hybrid Sequential Quantum Computing
Pranav Chandarana, Sebasti\'an V. Romero, Alejandro Gomez Cadavid, Anton Simen, Enrique Solano, Narendra N. Hegade
https://arxiv.org/abs/2510.05851

Hybrid Sequential Quantum Computing
We introduce hybrid sequential quantum computing (HSQC), a paradigm for combinatorial optimization that systematically integrates classical and quantum methods within a structured, stage-wise workflow. HSQC may involve an arbitrary sequence of classical and quantum processes, as long as the global result outperforms the standalone components. Our testbed begins with classical optimizers to explore the solution landscape, followed by quantum optimization to refine candidate solutions, and conclu…

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- Computing $\varphi(N)$ for an RSA module with a single quantum query
Luis V\'ictor Dieulefait, Jorge Urr\'oz

Toronto-based quantum computing company Xanadu says it will go public in the US and Canada via a SPAC, in a deal that values the combined business at ~$3.6B (Josh Scott/BetaKit)
https://betakit.com/xanadu-to-go-public-on-nasdaq-and-tsx-in-3-6-billion-u…

Xanadu to go public on Nasdaq and TSX in $3.6-billion USD SPAC deal
Toronto-based quantum computing firm Xanadu has struck a deal to go public by merging with a SPAC called Crane Harbor Acquisition Corp.

Anchor: Reducing Temporal and Spatial Output Performance Variability on Quantum Computers
Yuqian Huo, Daniel Leeds, Jason Ludmir, Nicholas S. DiBrita, Tirthak Patel
https://arxiv.org/abs/2510.06172

Anchor: Reducing Temporal and Spatial Output Performance Variability on Quantum Computers
Quantum computing, which has the power to accelerate many computing applications, is currently a technology under development. As a result, the existing noisy intermediate-scale quantum (NISQ) computers suffer from different hardware noise effects, which cause errors in the output of quantum programs. These errors cause a high degree of variability in the performance (i.e., output fidelity) of quantum programs, which varies from one computer to another and from one day to another. Consequently,…

From quantum feature maps to quantum reservoir computing: perspectives and applications
Casper Gyurik, Filip Wudarski, Evan Philip, Antonio Sannia, Hossein Sadeghi, Oleksandr Kyriienko, Davide Venturelli, Antonio A. Gentile
https://arxiv.org/abs/2510.01797

From quantum feature maps to quantum reservoir computing: perspectives and applications
We explore the interplay between two emerging paradigms: reservoir computing and quantum computing. We observe how quantum systems featuring beyond-classical correlations and vast computational spaces can serve as non-trivial, experimentally viable reservoirs for typical tasks in machine learning. With a focus on neutral atom quantum processing units, we describe and exemplify a novel quantum reservoir computing (QRC) workflow. We conclude exploratively discussing the main challenges ahead, whi…

Resisting Quantum Key Distribution Attacks Using Quantum Machine Learning
Ali Al-kuwari, Noureldin Mohamed, Saif Al-kuwari, Ahmed Farouk, Bikash K. Behera
https://arxiv.org/abs/2509.14282

Resisting Quantum Key Distribution Attacks Using Quantum Machine Learning
The emergence of quantum computing poses significant risks to the security of modern communication networks as it breaks today's public-key cryptographic algorithms. Quantum Key Distribution (QKD) offers a promising solution by harnessing the principles of quantum mechanics to establish secure keys. However, practical QKD implementations remain vulnerable to hardware imperfections and advanced attacks such as Photon Number Splitting and Trojan-Horse attacks. In this work, we investigate the pot…

Microwave-to-Optical Quantum Transduction of Photons for Quantum Interconnects
Akihiko Sekine, Ryo Murakami, Yoshiyasu Doi
https://arxiv.org/abs/2509.26349 https://

Microwave-to-Optical Quantum Transduction of Photons for Quantum Interconnects
The quantum transduction, or equivalently quantum frequency conversion, is vital for the realization of, e.g., quantum networks, distributed quantum computing, and quantum repeaters. The microwave-to-optical quantum transduction is of particular interest in the field of superconducting quantum computing, since interconnecting dilution refrigerators is considered inevitable for realizing large-scale quantum computers with fault-tolerance. In this review, we overview recent theoretical and experi…

Quantum Reservoir Computing for Credit Card Default Prediction on a Neutral Atom Platform
Giacomo Vitali, Chiara Vercellino, Paolo Viviani, Olivier Terzo, Bartolomeo Montrucchio, Valeria Zaffaroni, Francesca Cibrario, Christian Mattia, Giacomo Ranieri, Alessandro Sabatino, Francesco Bonazzi, Davide Corbelletto
https://arxiv.org/abs/2510.04…

Quantum Reservoir Computing for Credit Card Default Prediction on a Neutral Atom Platform
In this paper, we define and benchmark a hybrid quantum-classical machine learning pipeline by performing a binary classification task applied to a real-world financial use case. Specifically, we implement a Quantum Reservoir Computing (QRC) layer within a classical routine that includes data preprocessing and binary classification. The reservoir layer has been executed on QuEra's Aquila, a 256-qubit neutral atom simulator, using two different types of encoding: position and local detuning. In …

Plugging Leaks in Fault-Tolerant Quantum Computation and Verification
Theodoros Kapourniotis, Dominik Leichtle, Luka Music, Harold Ollivier
https://arxiv.org/abs/2510.03227 http…

Plugging Leaks in Fault-Tolerant Quantum Computation and Verification
With the advent of quantum cloud computing, the security of delegated quantum computation has become of utmost importance. While multiple statistically secure blind verification schemes in the prepare-and-send model have been proposed, none of them achieves full quantum fault-tolerance, a prerequisite for useful verification on scalable quantum computers. In this paper, we present the first fault-tolerant blind verification scheme for universal quantum computations able to handle secret-depende…

Quantum Relative Entropy Decay Composition Yields Shallow, Unstructured k-Designs
Nicholas Laracuente
https://arxiv.org/abs/2510.08537 https://arxiv.org/pd…

Quantum Relative Entropy Decay Composition Yields Shallow, Unstructured k-Designs
A major line of questions in quantum information and computing asks how quickly locally random circuits converge to resemble global randomness. In particular, approximate k-designs are random unitary ensembles that resemble random circuits up to their first k moments. It was recently shown that on n qudits, random circuits with slightly structured architectures converge to k-designs in depth O(log n), even on one-dimensional connectivity. It has however remained open whether the same shallow de…

Platform-Agnostic Modular Architecture for Quantum Benchmarking
Neer Patel, Anish Giri, Hrushikesh Pramod Patil, Noah Siekierski, Avimita Chatterjee, Sonika Johri, Timothy Proctor, Thomas Lubinski, Siyuan Niu
https://arxiv.org/abs/2510.08469

Platform-Agnostic Modular Architecture for Quantum Benchmarking
We present a platform-agnostic modular architecture that addresses the increasingly fragmented landscape of quantum computing benchmarking by decoupling problem generation, circuit execution, and results analysis into independent, interoperable components. Supporting over 20 benchmark variants ranging from simple algorithmic tests like Bernstein-Vazirani to complex Hamiltonian simulation with observable calculations, the system integrates with multiple circuit generation APIs (Qiskit, CUDA-Q, C…

IBM says it was able to run a key quantum computing algorithm in real-time on commonly available field programmable gate array chips made by AMD (Stephen Nellis/Reuters)
https://www.reuters.com/business/ibm-says-key-quantum…

HPQEA: A Scalable and High-Performance Quantum Emulator with High-Bandwidth Memory for Diverse Algorithms Support
Tran Van Duy, Tuan Hai Vu, Vu Trung Duong Le, Hoai Luan Pham, Yasuhiko Nakashima
https://arxiv.org/abs/2510.07110

HPQEA: A Scalable and High-Performance Quantum Emulator with High-Bandwidth Memory for Diverse Algorithms Support
In recent years, there has been a growing interest in the development of quantum emulation. However, existing studies often struggle to achieve broad applicability, high performance, and efficient resource and memory utilization. To address these challenges, we provide HPQEA, a quantum emulator based on the state-vector emulation approach. HPQEA includes three main features: a high-performance computing core, an optimized controlled-NOT gate computation strategy, and effective utilization of hi…

MAQCY: Modular Atom-Array Quantum Computing with Space-Time Hybrid Multiplexing
Andrew Byun, Chanseul Lee, Eunsik Yoon, Minhyuk KimMinhyuk Kim, Tai Hyun Yoon
https://arxiv.org/abs/2510.02940

MAQCY: Modular Atom-Array Quantum Computing with Space-Time Hybrid Multiplexing
We present a modular atom-array quantum computing architecture with space-time hybrid multiplexing (MAQCY), a dynamic optical tweezer-based protocol for fully connected and scalable universal quantum computation. By extending the concept of globally controlled static dual-species Rydberg atom wires [1], we develop an entirely new approach using Q-Pairs, which consist of globally controlled and temporally multiplexed dual-species Rydberg blockaded atom and superatom pairs. Space-time hybrid mult…

Sources: quantum computing companies including IonQ, Rigetti, and D-Wave are in talks to give the US Commerce Dept. equity in exchange for $10M each in funding (Amrith Ramkumar/Wall Street Journal)
https://www.wsj.com/business/entrepren…

Photonic Hybrid Quantum Computing
Jaehak Lee, Srikrishna Omkar, Yong Siah Teo, Seok-Hyung Lee, Hyukjoon Kwon, M. S. Kim, Hyunseok Jeong
https://arxiv.org/abs/2510.00534 https://…

Photonic Hybrid Quantum Computing
Photons are a ubiquitous carrier of quantum information: they are fast, suffer minimal decoherence, and do not require huge cryogenic facilities. Nevertheless, their intrinsically weak photon-photon interactions remain a key obstacle to scalable quantum computing. This review surveys hybrid photonic quantum computing, which exploits multiple photonic degrees of freedom to combine the complementary strengths of discrete and bosonic encodings, thereby significantly mitigating the challenge of wea…

Reproducible Builds for Quantum Computing
Iy\'an M\'endez Veiga, Esther H\"anggi
https://arxiv.org/abs/2510.02251 https://arxiv.org/pdf/2510.0…

Reproducible Builds for Quantum Computing
Reproducible builds are a set of software development practices that establish an independently verifiable path from source code to binary artifacts, helping to detect and mitigate certain classes of supply chain attacks. Although quantum computing is a rapidly evolving field of research, it can already benefit from adopting reproducible builds. This paper aims to bridge the gap between the quantum computing and reproducible builds communities. We propose a generalization of the definition of r…

Magic and communication complexity
Uma Girish, Alex May, Natalie Parham, Henry Yuen
https://arxiv.org/abs/2510.07246 https://arxiv.org/pdf/2510.07246

Magic and communication complexity
We establish novel connections between magic in quantum circuits and communication complexity. In particular, we show that functions computable with low magic have low communication cost. Our first result shows that the $\mathsf{D}\|$ (deterministic simultaneous message passing) cost of a Boolean function $f$ is at most the number of single-qubit magic gates in a quantum circuit computing $f$ with any quantum advice state. If we allow mid-circuit measurements and adaptive circuits, we ob…

Anticoherent $k$-planes and coding techniques for a 3-qubit scheme of universal quantum computing
L. Arag\'on-Mu\~noz, C. Chryssomalakos, A. G. Flores-Delgado, V. Rasc\'on-Barajas, I. V\'azquez Mota
https://arxiv.org/abs/2509.23464

Anticoherent $k$-planes and coding techniques for a 3-qubit scheme of universal quantum computing
Toponomic quantum computing (TQC) employs rotation sequences of anticoherent $k$-planes to construct noise-tolerant quantum gates. In this work, we demonstrate the implementation of generalized Toffoli gates, using $k$-planes of spin systems with $s \geq k + 1$, and of the Hadamard gate for a 3-qubit system, using a spin $s \!= \! 15$ 8-plane. We propose a universal quantum computing scheme for 3-qubit systems (via Hadamard + Toffoli gates) based on coding techniques. A key advantage of this co…

Do Qubit States have to be non-degenerate two-level systems?
Zhuoran Bao, Daniel F. V. James
https://arxiv.org/abs/2510.04880 https://arxiv.org/pdf/2510.04…

Do Qubit States have to be non-degenerate two-level systems?
A qubit, or quantum bit, is conventionally defined as "a physical system for storing information that is capable of existing in either of two quantum states or in a superposition of both". In this paper, we examine the simple question of whether two distinct levels, each consisting of multiply degenerate sub-states, could serve as a practical quantum bit. We explore this idea using a well-characterized atomic system of the kind employed in several quantum computing implementations. We approxima…

Self-concordant Schr\"odinger operators: spectral gaps and optimization without condition numbers
Sander Gribling, Simon Apers, Harold Nieuwboer, Michael Walter
https://arxiv.org/abs/2510.06115

Self-concordant Schrödinger operators: spectral gaps and optimization without condition numbers
Spectral gaps play a fundamental role in many areas of mathematics, computer science, and physics. In quantum mechanics, the spectral gap of Schrödinger operators has a long history of study due to its physical relevance, while in quantum computing spectral gaps are an important proxy for efficiency, such as in the quantum adiabatic algorithm. Motivated by convex optimization, we study Schrödinger operators associated with self-concordant barriers over convex domains and prove non-asymptotic …

Quantum reservoir computing using Jaynes-Cummings model
Sreetama Das, Gian Luca Giorgi, Roberta Zambrini
https://arxiv.org/abs/2510.00171 https://arxiv.org…

Quantum reservoir computing using Jaynes-Cummings model
We investigate quantum reservoir computing (QRC) using a hybrid qubit-boson system described by the Jaynes-Cummings (JC) Hamiltonian and its dispersive limit (DJC). These models provide high-dimensional Hilbert spaces and intrinsic nonlinear dynamics, making them powerful substrates for temporal information processing. We systematically benchmark both reservoirs through linear and nonlinear memory tasks, demonstrating that they exhibit an unusual superior nonlinear over linear memory capacity. …

Unsupervised Detection of Topological Phase Transitions with a Quantum Reservoir
Li Xin, Da Zhang, Zhang-Qi Yin
https://arxiv.org/abs/2509.25825 https://ar…

Unsupervised Detection of Topological Phase Transitions with a Quantum Reservoir
In quantum many-body systems, characterizing topological phase transitions typically requires complex many-body topological invariants, which are costly to compute and measure. Inspired by quantum reservoir computing, we propose an unsupervised quantum phase detection method based on a many-body localized evolution, enabling efficient identification of phase transitions in the extended SSH model. The evolved quantum states produce feature distributions under local measurements, which, after sim…

Mathematical and numerical analysis of quantum signal processing
Lin Lin
https://arxiv.org/abs/2510.00443 https://arxiv.org/pdf/2510.00443

Mathematical and numerical analysis of quantum signal processing
Quantum signal processing (QSP) provides a representation of scalar polynomials of degree $d$ as products of matrices in $\mathrm{SU}(2)$, parameterized by $(d+1)$ real numbers known as phase factors. QSP is the mathematical foundation of quantum singular value transformation (QSVT), which is often regarded as one of the most important quantum algorithms of the past decade, with a wide range of applications in scientific computing, from Hamiltonian simulation to solving linear systems of equati…

Towards a Global Scale Quantum Information Network: A Study Applied to Satellite-Enabled Distributed Quantum Computing
Laurent de Forges de Parny, Luca Paccard, Mathieu Bertrand, Luca Lazzarini, Valentin Leloup, Raphael Aymeric, Agathe Blaise, St\'ephanie Molin, Pierre Besancenot, Cyrille Laborde, Mathias van den Bossche
https://arxiv.…

Towards a Global Scale Quantum Information Network: A Study Applied to Satellite-Enabled Distributed Quantum Computing
Recent developments have reported on the feasibility of interconnecting small quantum registers in a quantum information network of a few meter-scale for distributed quantum computing purposes. This multiple small-scale quantum processors communicating and cooperating to execute computational tasks is considered as a promising solution to the scalability problem of reaching more than thousands of noise-free qubits. Here, we propose and assess a satellite-enabled distributed quantum computing sy…

A quantum analogue of convex optimization
Eunou Lee
https://arxiv.org/abs/2510.02151 https://arxiv.org/pdf/2510.02151…

A quantum analogue of convex optimization
Convex optimization is the powerhouse behind the theory and practice of optimization. We introduce a quantum analogue of unconstrained convex optimization: computing the minimum eigenvalue of a Schrödinger operator $h = -Δ+ V $ with convex potential $V:\mathbb R^n \rightarrow \mathbb R_{\ge 0}$ such that $V(x)\rightarrow\infty $ as $\|x\|\rightarrow\infty$. For this problem, we present an efficient quantum algorithm, called the Fundamental Gap Algorithm (FGA), that computes the mini…

Robust NbN on Si-SiGe hybrid superconducting-semiconducting microwave quantum circuit
Paniz Foshat, Samane Kalhor, Shima Poorgholam-khanjari, Douglas Paul, Martin Weides, Kaveh Delfanazari
https://arxiv.org/abs/2509.26363

Robust NbN on Si-SiGe hybrid superconducting-semiconducting microwave quantum circuit
Advancing large-scale quantum computing requires superconducting circuits that combine long coherence times with compatibility with semiconductor technology. We investigate niobium nitride (NbN) coplanar waveguide resonators integrated with Si/SiGe quantum wells, creating a hybrid platform designed for CMOS-compatible quantum hardware. Using temperature-dependent microwave spectroscopy in the single-photon regime, we examine resonance frequency and quality factor variations to probe the underly…

A Review on Quantum Circuit Optimization using ZX-Calculus
Tobias Fischbach, Pierre Talbot, Pascal Bourvry
https://arxiv.org/abs/2509.20663 https://arxiv.o…

A Review on Quantum Circuit Optimization using ZX-Calculus
Quantum computing promises significant speed-ups for certain algorithms but the practical use of current noisy intermediate-scale quantum (NISQ) era computers remains limited by resources constraints (e.g., noise, qubits, gates, and circuit depth). Quantum circuit optimization is a key mitigation strategy. In this context, ZX-calculus has emerged as an alternative framework that allows for semantics-preserving quantum circuit optimization. We review ZX-based optimization of quantum circuits, …

Evaluating Variational Quantum Circuit Architectures for Distributed Quantum Computing
Leo S\"unkel, Jonas Stein, Jonas N\"u{\ss}lein, Tobias Rohe, Claudia Linnhoff-Popien
https://arxiv.org/abs/2509.12005

Evaluating Variational Quantum Circuit Architectures for Distributed Quantum Computing
Scaling quantum computers, i.e., quantum processing units (QPUs) to enable the execution of large quantum circuits is a major challenge, especially for applications that should provide a quantum advantage over classical algorithms. One approach to scale QPUs is to connect multiple machines through quantum and classical channels to form clusters or even quantum networks. Using this paradigm, several smaller QPUs can collectively execute circuits that each would not be able on its own. However, c…

SQuaD: Smart Quantum Detection for Photon Recognition and Dark Count Elimination
Karl C. Linne (Kai Li), Sho Uemura, Yue Ji, Andrew Karmen, Allen Zang, Alex Kolar, Martin Di Federico, Orlando Quaranta, Gustavo Cancelo, Tian Zhong
https://arxiv.org/abs/2509.24383

SQuaD: Smart Quantum Detection for Photon Recognition and Dark Count Elimination
Quantum detectors of single photons are an essential component for quantum information processing across computing, communication and networking. Today's quantum detection system, which consists of single photon detectors, timing electronics, control and data processing software, is primarily used for counting the number of single photon detection events. However, it is largely incapable of extracting other rich physical characteristics of the detected photons, such as their wavelengths, polari…

Exploiting Translational Symmetry for Quantum Computing with Squeezed Cat Qubits
Tomohiro Shitara, Gabriel Mintzer, Yuuki Tokunaga, Suguru Endo
https://arxiv.org/abs/2510.00497 …

Exploiting Translational Symmetry for Quantum Computing with Squeezed Cat Qubits
Squeezed cat quantum error correction (QEC) codes have garnered attention because of their robustness against photon-loss and excitation errors while maintaining the biased-noise property of cat codes. In this work, we reveal the utility of the unexplored translational symmetry of the squeezed cat codes, with applications to autonomous QEC, reliable logical operations, and readout in a non-orthogonal basis. Using the basis under subsystem decomposition spanned by squeezed displaced Fock states,…

Transversal STAR architecture for megaquop-scale quantum simulation with neutral atoms
Refaat Ismail, I-Chi Chen, Chen Zhao, Ronen Weiss, Fangli Liu, Hengyun Zhou, Sheng-Tao Wang, Andrew Sornborger, Milan Kornja\v{c}a
https://arxiv.org/abs/2509.18294

Quenching, Fast and Slow: Breaking Kibble-Zurek Universal Scaling by Jumping along Geodesics
Thi Ha Kyaw, Guillermo Romero, Gaurav Saxena
https://arxiv.org/abs/2510.08528 https:…

Quenching, Fast and Slow: Breaking Kibble-Zurek Universal Scaling by Jumping along Geodesics
A major drawback of adiabatic quantum computing (AQC) is fulfilling the energy gap constraint, which requires the total evolution time to scale inversely with the square of the minimum energy gap. Failure to satisfy this condition violates the adiabatic approximation, potentially undermining computational accuracy. Recently, several approaches have been proposed to circumvent this constraint. One promising approach is to use the family of adiabatic shortcut procedures to fast-forward AQC. One c…

Quantum Architecture Search for Solving Quantum Machine Learning Tasks
Michael K\"olle, Simon Salfer, Tobias Rohe, Philipp Altmann, Claudia Linnhoff-Popien
https://arxiv.org/abs/2509.11198

Quantum Architecture Search for Solving Quantum Machine Learning Tasks
Quantum computing leverages quantum mechanics to address computational problems in ways that differ fundamentally from classical approaches. While current quantum hardware remains error-prone and limited in scale, Variational Quantum Circuits offer a noise-resilient framework suitable for today's devices. The performance of these circuits strongly depends on the underlying architecture of their parameterized quantum components. Identifying efficient, hardware-compatible quantum circuit architec…

InterQnet: A Heterogeneous Full-Stack Approach to Co-designing Scalable Quantum Networks
Joaquin Chung, Daniel Dilley, Ely Eastman, Alvin Gonzales, Kara Hokenstad, Md Shariful Islam, Varun Jorapur, Joseph Petrullo, Andy C. Y. Li, Bikun Li, Vasileios Niaouris, Anirudh Ramesh, Ansh Singal, Caitao Zhan, Michael Bishof, Eric Chitambar, Jacob P. Covey, Alan Dibos, Xu Han, Liang Jiang, Prem Kumar, Jeffrey Larson, Zain H. Saleem, Rajkumar Kettimuthu

InterQnet: A Heterogeneous Full-Stack Approach to Co-designing Scalable Quantum Networks
Quantum communications have progressed significantly, moving from a theoretical concept to small-scale experiments to recent metropolitan-scale demonstrations. As the technology matures, it is expected to revolutionize quantum computing in much the same way that classical networks revolutionized classical computing. Quantum communications will also enable breakthroughs in quantum sensing, metrology, and other areas. However, scalability has emerged as a major challenge, particularly in terms of…

Connecting Quantum Computing with Classical Stochastic Simulation
Jose Blanchet, Mark S. Squillante, Mario Szegedy, Guanyang Wang
https://arxiv.org/abs/2509.18614 https://

Visualizing Quantum Circuits: State Vector Difference Highlighting and the Half-Matrix
Michael J. McGuffin, Jean-Marc Robert
https://arxiv.org/abs/2510.00895 https://

Visualizing Quantum Circuits: State Vector Difference Highlighting and the Half-Matrix
Existing graphical user interfaces for circuit simulators often show small visual summaries of the reduced state of each qubit, showing the probability, phase, purity, and/or Bloch sphere coordinates associated with each qubit. These necessarily provide an incomplete picture of the quantum state of the qubits, and can sometimes be confusing for students or newcomers to quantum computing. We contribute two novel visual approaches to provide more complete information about small circuits. First, …

Distributed Quantum Error Correction with Permutation-Invariant Approximate Codes
Connor Clayton, Bruno Avritzer
https://arxiv.org/abs/2509.25093 https://a…

Distributed Quantum Error Correction with Permutation-Invariant Approximate Codes
Modular quantum computing architectures require error correction schemes that remain effective in the presense of noisy inter-processor operations. We introduce a distributed quantum error correction framework based on approximate codes to address this challenge. Our approach enables concatenation of distinct local codes across modules while allowing logical operations composed primarily of processor-local gates. We derive a lower bound and present corresponding simulations which indicate that …

A Quantum Computer Based on Donor-Cluster Arrays in Silicon
Shihang Zhang, Chunhui Zhang, Guanyong Wang, Tao Xin, Guangchong Hu, Yu He, Peihao Huang
https://arxiv.org/abs/2509.24749

A Quantum Computer Based on Donor-Cluster Arrays in Silicon
Significant advances in silicon spin qubits highlight the potential of silicon quantum dots for scalable quantum computing, given their compatibility with industrial fabrication and long coherence times. In particular, phosphorus (P)-doped spin qubits possess excellent coherence and have demonstrated high-fidelity two-qubit gates exceeding 99.9%. However, scaling P-donor systems is challenging due to crosstalk caused by the uniformity of individual P donors and the low tolerance for imprecise a…

Towards a user-centric HPC-QC environment
Aleksander Wennersteen, Matthieu Moreau, Aurelien Nober, Mourad Beji
https://arxiv.org/abs/2509.20525 https://arx…

Towards a user-centric HPC-QC environment
Robust execution environments are important for addressing key challenges in quantum computing, such as application development, portability, and reproducibility, and help unlock the development of modular quantum programs, driving forward hybrid quantum workflows. In this work, we show progress towards a basic, but portable, runtime environment for developing and executing hybrid quantum-classical programs running in High Performance Computing (HPC) environments enhanced with Quantum Processin…

Quantum Enhanced Anomaly Detection for ADS-B Data using Hybrid Deep Learning
Rani Naaman, Felipe Gohring de Magalhaes, Jean-Yves Ouattara, Gabriela Nicolescu
https://arxiv.org/abs/2509.15991

Quantum Enhanced Anomaly Detection for ADS-B Data using Hybrid Deep Learning
The emerging field of Quantum Machine Learning (QML) has shown promising advantages in accelerating processing speed and effectively handling the high dimensionality associated with complex datasets. Quantum Computing (QC) enables more efficient data manipulation through the quantum properties of superposition and entanglement. In this paper, we present a novel approach combining quantum and classical machine learning techniques to explore the impact of quantum properties for anomaly detection …

MUSS-TI: Multi-level Shuttle Scheduling for Large-Scale Entanglement Module Linked Trapped-Ion
Xian Wu, Chenghong Zhu, Jingbo Wang, Xin Wang
https://arxiv.org/abs/2509.25988 htt…

MUSS-TI: Multi-level Shuttle Scheduling for Large-Scale Entanglement Module Linked Trapped-Ion
Trapped-ion computing is a leading architecture in the pursuit of scalable and high fidelity quantum systems. Modular quantum architectures based on photonic interconnects offer a promising path for scaling trapped ion devices. In this design, multiple Quantum Charge Coupled Device (QCCD) units are interconnected through entanglement module. Each unit features a multi-zone layout that separates functionalities into distinct areas, enabling more efficient and flexible quantum operations. However…

A Quantum Algorithm For Computing Contextuality Bounds
Colm Kelleher, Fr\'ed\'eric Holweck
https://arxiv.org/abs/2509.20250 https://arxiv.org/pdf/2…

A Quantum Algorithm For Computing Contextuality Bounds
Quantum contextuality is a limitation on deterministic hidden variable models, testable in measurement scenarios where outcomes differ under quantum or classical descriptions due to a common set of constraints. When considering measurements of $N$-qubit spin operators, constraints arise from commutation relations and classical bounds are determined by the $\textit{degree}$ of contextuality, an NP-hard quantity to compute in general, related to the larger class of optimisation problems known as …

Fault-tolerant quantum computing with a high-rate symplectic double code
Naoyuki Kanomata, Hayato Goto
https://arxiv.org/abs/2509.15457 https://arxiv.org/p…

Fault-tolerant quantum computing with a high-rate symplectic double code
High-rate and large-distance quantum codes are expected to make fault-tolerant quantum computing more efficient, but most of them lack efficient fault-tolerant encoded-state preparation methods. We propose such a fault-tolerant encoder for a [[30, 6, 5]] symplectic double code. The advantage of this code is its compactness, in addition to its high encoding rate, allowing for early experimental realization. Detecting crucial errors during encoding with as few auxiliary qubits as possible, our en…

Scaling Hybrid Quantum-HPC Applications with the Quantum Framework
Srikar Chundury, Amir Shehata, Seongmin Kim, Muralikrishnan Gopalakrishnan Meena, Chao Lu, Kalyana Gottiparthi, Eduardo Antonio Coello Perez, Frank Mueller, In-Saeng Suh
https://arxiv.org/abs/2509.14470

Scaling Hybrid Quantum-HPC Applications with the Quantum Framework
Hybrid quantum-high performance computing (Q-HPC) workflows are emerging as a key strategy for running quantum applications at scale in current noisy intermediate-scale quantum (NISQ) devices. These workflows must operate seamlessly across diverse simulators and hardware backends since no single simulator offers the best performance for every circuit type. Simulation efficiency depends strongly on circuit structure, entanglement, and depth, making a flexible and backend-agnostic execution model…

QSearchNet: A Quantum Walk Search Framework for Link Prediction
Priyank Dubey
https://arxiv.org/abs/2510.00325 https://arxiv.org/pdf/2510.00325

QSearchNet: A Quantum Walk Search Framework for Link Prediction
Link prediction is one of the fundamental problems in graph theory, critical for understanding and forecasting the evolution of complex systems like social and biological networks. While classical heuristics capture certain aspects of graph topology, they often struggle to optimally integrate local and global structural information or adapt to complex dependencies. Quantum computing offers a powerful alternative by leveraging superposition for simultaneous multi-path exploration and interferenc…