The Quantum Insider·2026-10-24·Yuval Boger
No generated summary available for this entry.
overview
Original abstract
Yuval Boger interviews Mehmet Sanliol, managing director at Evercore covering quantum technologies and semiconductors. They discuss how investors value public quantum companies, when private companies should consider IPOs or SPACs, and why consolidation may shape the next phase of the industry. Mehmet also shares his perspective on technical and market signals that could affect valuations, the outlook for quantum software, and the recent developments in quantum that caught his attention most. Transcript Yuval: Hello, Mehmet, and thank you for joining me today. Mehmet: How are you, Yuval? My pleasure. Yuval: So, who are you and what do you do? Mehmet: So, my name is Mehmet Sanliol. I am the managing director at an investment bank called Evercore, and I focus on quantum technologies and semiconductors. Yuval: So, why don’t I start from the end? So if you’re speaking with the CEO of a private quantum computer company, one that has delivered the product, has investors, has some good technical progress, what would you advise them to do about the public markets? Mehmet: So the way that, look, you’ve seen a number of companies, I think we’re now up to kind of seven and having entered the public markets. Thankfully, all seem to be trading well enough so far. And the older companies are kind of well in excess of the $10 stock price and the few others that have joined are hovering around that level. I really think about it as a de-risking strategy because access in the public markets does provide you with the ability to tap liquidity in a manner that’s not necessarily always going to be available on the private side. You do open yourself up to public scrutiny and at some point you see some of the companies that had been traded for a few years now from kind of ’21 onwards go through some tough times and you really need to kind of weigh those two things against each other. To my mind if you are already full
npj Quantum Information
·2026-10-24
·Y. Matsumoto et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract Fast electrical spin rotations in quantum dots require strong spin-charge hybridization, but the same hybridization can increase sensitivity to detuning noise. In a double-quantum-dot (DQD) flopping-mode qubit, the sweet-spot width and the Rabi enhancement are both tied to the same orbital splitting, limiting post-fabrication optimization of the speed-coherence trade-off. Here, we demonstrate a GaAs triple-quantum-dot (TQD) flopping-mode qubit in which the detuning of the third dot, ϵ 34 , provides an additional electrical tuning parameter for orbital-band flattening. Tuning ϵ 34 flattens the qubit-frequency dependence on the detuning of the target DQD while maintaining strong spin-charge hybridization, enabling electrically driven Rabi frequencies above 100 MHz. We then use feedforward-neural-network (FNN) feedback to track slow qubit-frequency drift and connect this engineered operating point to high-fidelity gates. This feedback suppresses slow qubit-frequency fluctuations, reducing their standard deviation to 388 kHz, and yields a π /2 gate fidelity of 99.56% with a 4.05 ns gate time. These results identify TQD orbital-band engineering as an electrical route for tuning the speed-coherence trade-off, complementary to material-intrinsic spin-orbit coupling and fixed micromagnet geometry.
Quantum Computing Report·2026-10-23·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Inteli, a Brazilian higher education institute, has become an accredited ICT and partnered with IBM Quantum. This collaboration grants Inteli researchers cloud access to IBM Quantum systems to explore quantum algorithms for decision-making under uncertainty, with a focus on practical industrial applications in Latin America. The partnership aims to advance quantum computing capabilities and workforce development in the region. The post Brazil’s Inteli Becomes Accredited ICT and Partners with IBM Quantum to Research Decision-Making Under Uncertainty appeared first on Quantum Computing Report .
Phys.org Quantum Physics·2026-10-23
No generated summary available for this entry.
overview
Original abstract
What would it take to watch an electron move through a material? Researchers would need to see individual atoms and capture an electron's motion at incredibly short timescales. A Technion-led team has brought those two capabilities together in a scanning tunneling microscope, using carefully shaped laser pulses to control the direction of electron flow while preserving nanoscale spatial resolution.
Quantum Computing Report·2026-10-23·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Iceberg Quantum's Pinnacle 1.2 architecture, featuring the Crevasse QLDPC decoder, significantly reduces the resources needed to factor RSA-2048. They achieved logical error rates below 10^-12 per logical qubit-cycle, a critical threshold for this task, through direct circuit-level simulations. This breakthrough could factor RSA-2048 in as little as 0.98 days with 48,000 physical qubits. The post Iceberg Quantum Validates Pinnacle 1.2 Architecture with Crevasse QLDPC Decoder to Reduce RSA-2048 Factoring Resources appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-23·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Quanova has selected Quandela ’s MosaiQ photonic system for a program at Quang Trung University that the partners say will deploy Vietnam’s first quantum computer. Supported by Nam A Bank, the initiative includes faculty training, dedicated curricula, software access, a Quantum Experience Center and technology events. The partnership will establish a Quantum Innovator Residency Program to develop local expertise and support quantum education, research and entrepreneurship. PRESS RELEASE — Quandela , a European leader in photonic quantum computing, announces a major milestone in its expansion in Southeast Asia. Quanova, a Vietnamese quantum company, has selected Quandela ’s MosaiQ solution as the foundation of a new quantum research, innovation, service and entrepreneurship (quantum-RISE) program at Quang Trung University (QTU) in Quy Nhơn, Gia Lai. The project marks the first France–Vietnam collaboration in quantum computing and will lead to the deployment of Vietnam’s first quantum computer, with the support of Nam A Bank. Vietnam’s first quantum computer at the heart of a strategic education and research program This long-term partnership, developed with Quanova, Quandela ’s strategic local partner in Vietnam, will provide Quang Trung University with a comprehensive platform for education, research and innovation. Nam A Bank is supporting the initiative as part of its commitment to advanced technologies. As Võ Hoàng Hải, Deputy CEO of Nam A Bank, explained: “Nam A Bank invests in core technologies, including quantum technology, to help build high-tech capabilities in Vietnam through strong and effective cooperation with French organizations.” The program includes: Deployment of the MosaiQ photonic quantum computer; Faculty training and development of dedicated curricula; Provision of the software suite and support for the creation of a Quantum Experience Center and launch of the Quantum Innovator Residency Program; Organization of technology ev
Quantum Computing Report·2026-10-23·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Quantinuum and Oracle have launched the OCI Quantum AI Compute Beta Program, offering early cloud-based access to Quantinuum's Helios quantum processor for hybrid quantum-AI workflows. This program integrates Helios within Oracle Cloud Infrastructure (OCI) AI data centers, providing a browser-based Python development environment for various applications. The initiative will be further detailed at Oracle AI World 2026. The post Quantinuum and Oracle Launch OCI Quantum AI Compute Beta Program for Early Access to Helios appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-23·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Telefónica and IQM Quantum Computers plan to install the first quantum computer in Spain’s Community of Madrid at the Technical University of Madrid (UPM) before the end of 2026. The IQM Spark system is designed for research, education and early-stage development, giving universities, hospitals, research centers and start-ups access to quantum hardware. The project aims to build regional expertise, support the development of industry use cases and expand Madrid’s role in Europe’s quantum technology ecosystem. PRESS RELEASE — Telefónica and IQM Quantum Computers, a global leader in superconducting quantum computing, have joined forces to deploy the first quantum computer in the Community of Madrid. The initiative will strengthen the region’s scientific and technological capabilities, while driving the development of real-world cases for companies across the Community of Madrid. The IQM Spark quantum computer, an all-in-one solution specifically designed for research, education and early-stage development, will be installed at the Technical University of Madrid (UPM) before the end of 2026. It will enable universities, hospitals, research centers and start-ups, direct access to real quantum hardware to develop and test quantum algorithms and build the expertise needed to explore future use cases. This will be the first quantum computer of its kind in the Community of Madrid, significantly increasing the region’s capacity to develop quantum capabilities locally and through hands-on experience. The computer will join the other two quantum computers provided by Telefónica and IQM to CESGA (Galician Supercomputing Centre). Once the new quantum computer is operational, the Community of Madrid will have greater capabilities to foster the creation of its own quantum ecosystem, bringing together all stakeholders involved in developing real-world use cases that deliver direct benefits to local industry. This ecosystem will help attract talent and strengthen
Phys.org Quantum Physics·2026-10-23
No generated summary available for this entry.
overview
Original abstract
Researchers at AIST have directly observed magnetic flux quanta generated in a superconductor by photon absorption and demonstrated a new principle of photon detection that identifies the number of photons based on the number of these flux quanta.
Nature: Quantum Information·2026-10-23
No generated summary available for this entry.
overview
Quantum Computing Report·2026-10-23·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Chalmers University of Technology has developed TRIO pulses, a new quantum control framework for superconducting processors. These pulses enable single-qubit gates to maintain high fidelity even with significant control-amplitude miscalibrations and frequency detuning errors. This breakthrough offers a way to reduce recalibration overheads in large-scale quantum processors and has been demonstrated with an X-gate achieving 99.90% fidelity. The post Chalmers University Demonstrates TRIO Pulses for Control-Error-Robust Single-Qubit Gates in Superconducting Processors appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-23·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
IQM Quantum Computers and NVIDIA have successfully automated the calibration of a 20-qubit quantum processor using NVIDIA Ising Vision-Language Models (VLMs). This agentic AI system analyzes experimental data, autonomously adjusts parameters, and generates diagnostic logs for human review. They also released QCalEval, an open benchmark for AI-driven quantum processor bring-up, where NVIDIA Ising Calibration models outperformed general-purpose VLMs. The post IQM and NVIDIA Automate 20-Qubit Chip Calibration via NVIDIA Ising Vision-Language Models and QCalEval Benchmark appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-23·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Google Quantum AI launched a $150,000 Kaggle competition to develop smaller, more efficient quantum circuits for calculations related to fusion energy, optimization and chemistry. Participants will reduce qubit and gate counts while meeting accuracy requirements, potentially lowering the hardware demands of useful quantum algorithms. The competition uses Google ’s open-source kickmix software to efficiently test circuit designs on conventional computers, providing confidence in approximate correctness without proving exact equivalence. Google Quantum AI is launching a competition to use artificial intelligence to shrink the circuits needed for useful quantum computing. The competition offers a total prize pool of $150,000, organizers said. The competition, hosted on Kaggle , challenges participants to reduce the number of computing steps and quantum bits required for tasks related to fusion energy, mathematical optimization and chemistry. Google is providing starting circuits and software to check whether proposed improvements produce sufficiently accurate results. The effort targets a central obstacle to practical quantum computing. Even as researchers build more capable processors, many potentially useful calculations remain too demanding for available hardware. Reducing the work required by an algorithm could lower the hardware requirements for running it. According to Google’s announcement , the competition draws on a method that allows conventional computers to efficiently test a particular class of quantum circuits. That creates a way for AI systems to repeatedly propose changes, check their accuracy and search for further savings. Reducing the Cost of a Calculation A quantum circuit is a sequence of operations used to carry out a calculation. Those operations, called gates, act on qubits, the basic units of quantum information. Current processors have limited numbers of qubits, and their gates can introduce errors. Quantum error correction is de
The Quantum Insider·2026-10-23·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Guest Post by Liam Wang COO, Logical Qubit Technology. The World Economic Forum’s Quantum Economy Day 2026 was held in Geneva, Switzerland, on October 13–14. Logical Qubit Technology attended as the only quantum computing company representing China. The company’s Chief Operating Officer, Liam Wang, joined business executives, researchers, and representatives of international organizations from around the world to discuss the global development of quantum computing. This June, I took part in a World Economic Forum discussion on global quantum science and technology development at the Summer Davos meeting in Dalian. Representing the company again at Quantum Economy Day 2026 in Geneva gave me a close-up view of how quantum computing is developing in other countries and regions. What Is Everyone Talking About? My first and most immediate impression: China and other countries share many of the same concerns about this industry — how to persuade policymakers, capital, and industry to commit more resources to quantum computing; which application scenarios will see the first breakthroughs; how geopolitics continues to shape the global industry (supply chain security, the setting of global quantum standards, and so on); how to broaden quantum computing’s social reach, steadily moving beyond academia into industry and the wider public; and how the convergence of quantum computing and AI will unfold, and what major opportunities that super-cycle will create. Although the industry is still at an early stage, the overall mood among participants was optimistic . AI was the most common point of comparison: since ChatGPT launched in November 2022, the pace of progress in large AI models has exceeded almost everyone’s expectations. Quantum computing is likely to follow a similar logic. Of course, at this stage, quantum computing still has to be viewed pragmatically. Two terms came up most frequently in the discussions: “use case” and “geopol
Quantum Computing Report·2026-10-23·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Florida Atlantic University received a nearly $400,000 NSF grant to advance post-quantum cryptographic protocols. Led by Dr. Edoardo Persichetti and Dr. Veronika Kuchta, the project will develop advanced functionalities beyond basic primitives to secure decentralized systems against future quantum attacks. The initiative also supports student mentoring and cybersecurity outreach, building on FAU's leadership in quantum-safe security. The post Florida Atlantic University Awarded $400,000 NSF Grant to Expand Post-Quantum Cryptographic Protocols appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-23·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Leiden University and Riverlane research uncovered a flaw in correlated decoding, causing a loss of effective code distance and higher logical failure rates in quantum error correction. They introduced a new regularization parameter to fix this, restoring nominal distance scaling and improving accuracy without adding computational overhead. This discovery offers a crucial design principle for future quantum decoding architectures. The post Leiden University and Riverlane Research Reveals Distance-Losing Flaw in Correlated Decoding Below Threshold appeared first on Quantum Computing Report .
Nature: Quantum Information·2026-10-23
No generated summary available for this entry.
overview
Quantum Computing Report·2026-10-23·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
IBM Quantum has released Qiskit SDK v2.6, significantly enhancing its C API layer with a new pass-manager framework and native QPY serialization. This update allows for custom compiler passes and hardware-native quantum operations in C, C++, and Julia without a Python runtime, moving towards Python-optional execution in high-performance computing. The release also updates the Qiskit GitHub Roadmap, outlining future versions that will focus on C ABI/API stability, fault-tolerant compilation, and a Rust-native execution interface. The post IBM Releases Qiskit SDK v2.6 with C API Pass-Manager Framework, Native QPY Serialization, and Custom Operations appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-23·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
NVIDIA has invested in Riverlane to advance real-time quantum error correction (QEC) and GPU decoder calibration. This collaboration utilizes NVIDIA H100 GPUs to accelerate Riverlane's Local Clustering Decoder (LCD), significantly reducing the time for surface code training cycles and enabling dynamic recalibration of QEC decoders. This advancement helps mitigate qubit drift and hardware defects, paving the way for more stable and reliable fault-tolerant quantum computing systems. The post NVIDIA Takes Strategic Stake in Riverlane to Accelerate Real-Time Quantum Error Correction and GPU Decoder Calibration appeared first on Quantum Computing Report .
Nature: Quantum Information·2026-10-23
No generated summary available for this entry.
overview
The Quantum Insider·2026-10-23·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief A state-commissioned study ranks New York second nationally in quantum-related businesses, research groups and patents, identifying greater coordination as an opportunity to accelerate commercialization. New York has committed $360 million to quantum development, including $300 million for a Stony Brook research hub and $60 million for up to four regional commercialization hubs. The study estimates these investments could support $2.3 billion to $5 billion in economic activity and 7,200 to 10,100 job-years through 2036. PRESS RELEASE — Governor Kathy Hochul today announced the release of a comprehensive study of New York State’s quantum technology landscape, finding that the Empire State ranks second nationally in quantum-related businesses, research groups and patents. Commissioned by Empire State Development’s Division of Science, Technology and Innovation (NYSTAR), the study highlights New York’s position as a national leader in the emerging industry and identifies opportunities to strengthen collaboration, accelerate commercialization and support future economic growth. “New York is building the foundation for the next generation of technological breakthroughs, and quantum technology represents an enormous opportunity for our economy,” Governor Hochul said. “With world-class research institutions, advanced manufacturing capabilities and a growing network of innovative businesses, we have the tools to lead this emerging industry. Our $360 million investment will help turn that potential into progress, bringing new technologies to market, attracting private investment and creating good-paying jobs across New York State.” Empire State Development President, CEO and Commissioner Hope Knight said, “Under Governor Hochul’s leadership, New York is making strategic investments to lead the next generation of technological innovation. This study confirms that our state has the research institutions, manufacturing capabilities and industry expertise nee
Quantum Computing Report·2026-10-23·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Google Quantum AI has launched a $150,000 Kaggle competition running from October 22, 2026, to January 20, 2027. The competition challenges participants to use AI agents to compress fault-tolerant quantum circuits, focusing on "kickmix" circuits which are verifiable by classical computers. This initiative aims to optimize quantum algorithms for applications in fusion energy, optimization, and quantum chemistry. The post Google Quantum AI Launches $150K Kaggle Competition to Compress Fault-Tolerant Quantum Circuits Using AI Agents appeared first on Quantum Computing Report .
Phys.org Quantum Physics·2026-10-23
No generated summary available for this entry.
overview
Original abstract
Quantum systems can occupy superpositions, quantum states that combine different possibilities. For instance, a microwave field can be prepared in a superposition of an empty state and a state that contains microwave light.
Quantum
·2026-10-23
·Abhishek Kumar et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Periodically driven quantum systems exhibit many fascinating phenomena absent in equilibrium systems, but their simulation is more challenging than that of static systems. Consequently, quantum simulation of these systems offers greater opportunity for achieving quantum advantage. To build the foundation for simulating time-periodic Hamiltonians, we utilize the Floquet-Hilbert space formalism to transform the Hamiltonian into a time-independent form and provide its Pauli decomposition. Within this formalism, we develop a hybrid quantum-classical algorithm, Floquet-ADAPT-VQE, that produces three key quantities that govern periodically driven quantum dynamics: the quasienergy, the associated Floquet eigenstates, and expectation values of observables with respect to these eigenstates. The latter is achieved by applying a fixed-depth quantum circuit to an initial Floquet eigenstate—an efficient construction made possible by the Floquet-Hilbert space formalism. We also identify a suitable auxiliary initial state whose squared Floquet energy is independent of the number of auxiliary qubits as well as the driving frequency, which leads to better convergence with fewer ADAPT iterations. We demonstrate our algorithm by performing numerical simulations on a periodically driven XYZ model with a magnetic field. We also explore potential applications of our algorithm for studying various non-equilibrium phenomena in periodically driven systems.
Quantum Science and Technology
·2026-10-23
·Xin Wang, Yabo Wang, Re-Bing Wu
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract We propose a Trace-distance binary Tree AdaBoost (TTA) multi-class quantum classifier, a practical pipeline for quantum multi-class classification that combines quantum-aware reductions with ensemble learning to improve trainability and resource efficiency. TTA builds a hierarchical binary tree by choosing, at each internal node, the bipartition that {heuristically} maximizes the trace distance between average quantum states; each node trains a binary AdaBoost ensemble of shallow variational quantum base learners. By confining intrinsically hard, small trace distance distinctions to small node-specific datasets and combining weak shallow learners via AdaBoost, TTA distributes capacity across many small submodels rather than one deep circuit, mitigating barren-plateau and optimization failures without sacrificing generalization. Empirically TTA achieves top test accuracy ($\approx $100\%) among quantum and classical baselines, is robust to common quantum errors, and realizes aggregate systems with almost 10,000 cumulative layers and 0.2M parameters, implemented as many shallow circuits. Our results are empirical and implementable on near-term platforms, providing a resource-efficient route to scalable multi-class quantum machine learning.
Quantum Science and Technology
·2026-10-23
·Piero Luchi, Francesco Pederiva
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract We present a framework combining Lie group theory and feed-forward neural networks to efficiently generate quantum optimal control pulses for arbitrary unitary operations in superconducting qubit systems, bypassing the need for explicit optimization at inference time. The exponential scaling of the Hilbert space dimension with qubit number makes standard optimization approaches computationally prohibitive when large ensembles of distinct propagators must be processed, a bottleneck that is particularly acute in Trotterized quantum simulation. Our method addresses this limitation by pre-computing a representative set of control pulses via Lie group theory and training neural networks to map target propagators to their corresponding pulses. We demonstrate the approach on superconducting qubit systems of 2, 3, and 4 qubits, finding high reconstruction fidelity for specific combinations of Lie algebra parameters. As a physically motivated benchmark, we apply the methodology to reconstruct control pulses for the Trotter propagators of a neutrino system undergoing collective flavor oscillations. The successful generalization across system types demonstrates that a single model -trained once on hardware-specific random propagators -can serve as a universal control-pulse generator for any target quantum system of compatible Hilbert space dimension, offering a promising route toward scalable quantum simulation.
Quantum Science and Technology
·2026-10-23
·Hassan Ugail, Newton Howard
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract Equivariant quantum neural networks are designed to preserve symmetries in quantum machine-learning data, but this property is usually verified only before hardware compilation. We show that a transpiler can preserve the expected unitary symmetry relation while compiling symmetry-related inputs into circuits with different two-qubit gate counts and physical-qubit layouts, so ideal-circuit equivariance does not guarantee symmetry at the level of compiled circuit structure. We formalise this gap with a three-level compliance hierarchy and a taxonomy separating topology-input ansätze, where the symmetry changes the gate topology the compiler sees, from parameter-input ansätze, where it changes only numerical gate parameters and provably leaves controlled-Z counts unchanged under topology-based transpilation. Auditing four published ansatz families, we observe the effect only in the topology-input case. For the Skolik permutation-equivariant weighted-graph ansatz compiled to the IBM Heron Fez simulator target at twelve qubits, sparse graph inputs produce a mean relative controlled-Z asymmetry of 7.3\% across fifty random vertex permutations, with a worst case of 22.5\%. The effect persists across all four Qiskit optimisation levels and is not removed by matched-layout compilation, implicating routing-stage sensitivity to the ordered sparse-edge gate sequence. A density sweep shows that the asymmetry is comparable across intermediate graph densities and vanishes for complete graphs, where the ansatz degenerates into the parameter-input class, and stochastic baselines attribute the realised differences to heuristic routing sensitivity rather than to differing optimal compiled costs. Finally, we propose compile-once-and-relabel, a deployment pattern that removes controlled-Z count asymmetry by construction and reduces compilation cost for orbit-based workflows.
Quantum Science and Technology
·2026-10-23
·Jigyen Bhavsar, Rajni Bala, Siddhartha Santra
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract Entanglement distillation is a fundamental operation in quantum information processing used to obtain higher-fidelity entangled pairs from a supply of less entangled quantum states using local operations aided by classical communication (LOCC). In a physically relevant setting, where states with an initial fidelity of f 0 , probabilistically generated over multiple, m, memory pairs distributed between two parties, Alice and Bob, are pairwise distilled, the optimal policy identifies the system configuration dependent sequence of entanglement generation and distillation operations that need to be performed in order to minimize the expected time to reach some target fidelity f T > f 0 . Here, we formulate and systematically analyze this task as a Markov decision process and using a value iteration algorithm, obtain optimal deterministic policies that minimize the expected waiting time required to achieve a target fidelity. Our results show that the expected waiting time under the optimal policy decreases with increasing generation probability p and number of quantum memories m -as expected. In contrast, it exhibits non-monotonic behavior with respect to f 0 for a fixed fidelity gap, (∆f = f T - f 0 ). While the optimal policy consistently outperforms baseline policies such as the greedy, nested and entanglement pumping policies, its relative advantage is regime-dependent, being determined by the system parameters (p, f 0 , f T , m), and exhibits a nontrivial dependence on the fidelity gap ∆f . Our results highlight the value of formulating entanglement distillation as a Markov decision problem, enabling the systematic design of policies that achieve target fidelity thresholds for quantum information tasks in realistic resource-constrained settings.
Quantum Science and Technology
·2026-10-23
·Piotr Mironowicz et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract Machine learning (ML) and quantum machine learning (QML) have gained significant importance, as they offer powerful tools for tackling complex computational problems across various domains. An overview of QML's uses in quantitative finance is presented here. The connection between quantum computing and machine learning in financial applications, spanning a range of use cases including portfolio optimization, market prediction and trading, pricing and risk management is examined. The different applications from the literature review are categorized based on specific use cases, ML approaches, optimization methods, and the types of quantum hardware utilized. To facilitate this examination, we employ a morphological box, which allows us to analyze different combinations of these elements across financial use cases.
Quantum Science and Technology
·2026-10-23
·Davide Poderini et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract We study a family of sparse positive maps on qutrits for which positivity, decomposability, and PPT entanglement can all be analysed explicitly. The block structure of the associated Choi matrices reduces positivity to a Hermitian biquadratic form and leads to exact positivity boundaries for three representative parametric families. For the same families we determine the exact transition between decomposable and non-decomposable maps and construct associated PPT states of two classes. The first consists of witness-adapted deformations naturally tied to the non-decomposability analysis. The second consists of analytically tractable families whose full PPT-entangled branch is detected by fixed positive maps, yielding exact thresholds between separability and bound entanglement. For the trace-preserving subclass, we further compare positivity with a recent eigenvalue bound for 2-positive maps, thereby making the gap between positivity and higher-order positivity fully explicit within this family.
Quantum Science and Technology
·2026-10-23
·Aishwarya Vishwakarma
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract Calibration summaries are used both to select physical qubits and to parameterize noisy emulators, creating a risk that agreement within a calibration-derived model is mistaken for validation on hardware. We test whether calibration-aware compiler rankings transfer to hardware using weighted-MaxCut instances implemented with the quantum approximate optimization algorithm (QAOA). The evidence comprises four stages: 3,240 historical calibration-derived simulations; a complete 54-pair hardware grid on three IBM Heron r2 processors; exact-circuit repeats 9.3–12.1 days later; and a contemporaneous five-arm refresh experiment. Full-calibration selection improves the median hardware approximation ratio by 0.74 percentage points (pp), with 29 resolved gains and 11 resolved losses. This is a mean-objective effect: its translation to exact-solution probability is instance- and size-dependent, and we do not extrapolate it beyond the tested n ≤ 10 regime. A Qiskit Aer model constructed from the calibration state available before execution reproduced the direction of the measured full-calibration-versus-topology advantage in 35/54 comparisons, but systematically overestimated its size: the simulated advantage exceeded the subsequently measured hardware advantage by a median 1.35 pp. Regressing the measured hardware advantage on the simulated advantage gave a slope of 0.28 (workload-depth case-cluster 95% interval 0.06–0.52), rather than the unit slope of a calibrated predictor. The emulator identified the exact best of six backend-compiler configurations in only 5/18 cases (95% Wilson interval [0.125, 0.509]). By contrast, identical circuits preserved the compiler-effect sign in 16/18 later repeats (r = 0.92). Refreshing the full-calibration mapping yielded a median +0.72 pp gain, whereas the calibration-score difference agreed in sign with the measured refresh benefit in only 9/18 cases. Calibration data are therefore useful for candidate discovery and timely refresh, but their scalar scores are not calibrated predictors of hardware performance or configuration ranking.
npj Quantum Information
·2026-10-23
·Jingyi Fan, Shengshi Pang
·doi
No generated summary available for this entry.
overview
The Quantum Insider·2026-10-22·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief A new study analyzes an unpublished Schrödinger manuscript that challenged claims that hidden information could not explain apparently random quantum outcomes. Schrödinger’s model reproduced the expected results of polarization measurements, serving as a mathematical counterexample rather than a complete theory of quantum physics. The manuscript illustrates the complexity of Schrödinger’s views, showing that he could construct a deterministic model while favoring fundamental randomness in nature. Image: Photo by Robert Stump on Unsplash PRESS RELEASE — An unpublished manuscript by Erwin Schrödinger shows how apparently random quantum results could follow definite rules, challenging an argument that such explanations were impossible. The handwritten draft , analyzed in a new historical study posted on arXiv , adds a missing contribution to a wartime dispute over whether quantum mechanics had ended the scientific case for a predictable universe. It also complicates a familiar picture of Schrödinger as a defender of determinism, the idea that events are fixed by preceding conditions. According to physicist Flavio Del Santo, Schrödinger constructed his model to expose a weakness in an argument, rather than to establish how nature actually works. His draft combined a mathematical counterexample with a defense of the possibility that randomness is fundamental. The study presents what Del Santo describes as the first transcription and analysis of the manuscript with a central finding concerning the limits of scientific claims. Schrödinger showed that ruling out one proposed explanation does not necessarily rule out every explanation of the same kind. A Missing Contribution The document survives in the Erwin Schrödinger Archive at the University of Vienna ’s Austrian Central Library for Physics. Titled “Collapse of Determinism,” it consists of three handwritten pages and is undated. Del Santo, affiliated with the University of Geneva and Constructor Univ
The Quantum Insider·2026-10-22·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Qblox has integrated NVIDIA DGX Spark with its quantum system controller using NVIDIA NVQLink, reporting round-trip latency below 4.0 microseconds on NVIDIA RTX PRO 6000 Blackwell and below 7.2 microseconds on DGX Spark. The integration connects GPU computing with quantum control to support real-time hybrid quantum-classical workloads, including GPU-accelerated calibration and quantum error correction. The system uses NVIDIA CUDA-Q to support development on desktop hardware, with the same code designed to transfer to GPU servers as quantum systems scale. PRESS RELEASE — Qblox , a leader in scalable quantum control architecture, today announced the integration of NVIDIA DGX Spark with a quantum system controller using NVIDIA NVQLink , achieving measured roundtrip latency below 4.0 µs on NVIDIA RTX PRO 6000 Blackwell and below 7.2 µs on NVIDIA DGX Spark. This enables Qblox to support real-time hybrid quantum-classical applications, with a single desktop system that can host quantum, AI, and simulation workloads via NVIDIA CUDA-Q . The same code then carries over to data center graphics processing unit (GPU) servers as systems scale. The integration brings GPU acceleration into the real-time control loop, a key building block for scaling quantum systems to support logical qubits. Qblox ‘s Q1 sequence processors and LINQ deliver the low latency and high throughput the Qblox Cluster needs to work hand in hand with the GPU. GPU-accelerated calibration routines update qubit parameters while experiments run, instead of between them. For quantum error correction, syndrome data reaches GPU-based decoders with low latency, helping identify and correct errors in real time. The milestone builds on the previous work from Qblox with NVIDIA NVQLink announced in October 2025 and on Qblox’s support for the NVIDIA CUDA-Q realtime API in March 2026. It moves the integration from architecture to measured hardware performance, demonstrating Qblox’s a
The Quantum Insider·2026-10-22·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief QCentroid has announced QCentroid Missions, a new QuantumOps capability that helps enterprise teams evaluate computational approaches against business objectives and defined validation criteria. The system uses agents to test classical, quantum-inspired, GPU-simulated and quantum processing unit (QPU) approaches, with recommendations based on benchmarking evidence and the option to retain an existing classical solution. QCentroid Missions uses NVIDIA CUDA-Q for accelerated circuit simulation and is being demonstrated at NVIDIA GTC Berlin from 20–22 October 2026, with rollout to QCentroid Platform customers planned from Q4 2026. PRESS RELEASE — QCentroid today announced QCentroid Missions , a new goal-driven capability in its QuantumOps platform designed to take enterprise teams from a measurable business objective to validated evidence for deciding whether, and how, to evolve an existing computational solution. QCentroid Missions is being demonstrated this week at NVIDIA GTC Berlin. Rather than starting with a quantum algorithm or a predefined technology, a Mission starts with an outcome such as reducing execution time, improving solution quality or reaching a target business metric. Teams define the objective, the computational and operational limits, and the validation gates that must be cleared. Expert agents in QuantumOps then run the experimentation cycle, evaluating potential evolutions of the current solver across classical, quantum-inspired, GPU-simulated and QPU-ready approaches. The resulting recommendation may be classical, hybrid or quantum, including a recommendation to retain the current classical solution when the evidence supports it. “Quantum teams are small, while the number of questions coming from the business continues to grow,” said Carlos Kuchkovsky, CEO and co-founder of QCentroid . “With Missions, teams no longer have to manually drive every stage of an experiment. They define what they want to improve, how far the system
The Quantum Insider·2026-10-22·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Black Kite has introduced Quantum Readiness controls within its Cyber Rating platform to assess observable signs of post-quantum cryptography readiness across an organization’s third-party vendors. The new controls examine indicators such as hybrid post-quantum key exchange, certificate signature readiness and assets without an identified migration path, integrating the results into the platform’s SSL/TLS Strength category. The feature is designed to help organizations track vendor readiness, identify potential gaps in supply-chain cryptographic security and prepare for post-quantum migration requirements. PRESS RELEASE — Black Kite , the leader in third-party cyber risk management, today announced the release of Quantum Readiness, a new set of controls within the SSL/TLS Strength category of the Black Kite Cyber Rating that evaluates quantum agility across an organization’s third-party vendor ecosystem. Quantum Readiness surfaces which vendors are quantum-ready or adopting quantum-safe encryption methods, providing an early indication of security maturity and preparedness for the post-quantum era. Quantum computers capable of breaking today’s encryption do not exist yet, but experts predict “Q-Day” could arrive as early as 2028. The risk is also retroactive: in “harvest now, decrypt later” attacks, bad actors are already collecting encrypted data to decrypt once quantum computers are powerful enough. Organizations need to prepare now – for many, the shift to quantum-safe encryption is underway, making quantum agility a key indicator of vendor security maturity and readiness. “Third-party cyber risk management needs to account for where risk is going, not only where it exists today,” said Ferhat Dikbiyik, Chief Research & Intelligence Officer (CRIO), Black Kite. “We built Quantum Readiness to give customers early visibility into quantum agility across their supply chains and help them understand
The Quantum Insider·2026-10-22·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Florida’s first statewide quantum-safe network segment is operational, connecting Palm Beach State College and Florida Atlantic University in Boca Raton using IonQ quantum key distribution technology. Supported by a $1 million FloridaCommerce grant, the connection went live Oct. 15 over Palm Beach County’s dark fiber infrastructure to strengthen data security between the institutions. Connections to Miami Dade College and FAU’s Jupiter campus are planned within three months, with further statewide expansion dependent on funding. PRESS RELEASE — Palm Beach State College (PBSC) President Ava L. Parker , JD announced Wednesday night that the first segment of Florida’s statewide quantum-safe network is operational. The system links PBSC to Florida Atlantic University in Boca Raton over Palm Beach County’s dark fiber infrastructure. Supported by a $1 million defense infrastructure grant from FloridaCommerce, Palm Beach State College is leading the development of the network’s first segment in partnership with Florida LambdaRail, Florida Atlantic University, Palm Beach County and IonQ. The segment uses IonQ quantum key distribution technology to strengthen the security of data transmitted between the participating institutions and establishes a foundation for expanding quantum-secure communication across Florida. Parker made the announcement at the college’s Historic Building in West Palm Beach, the future home of PBSC’s Quantum Innovation Center, the evening before Quantum Beach 2026 . The link went live Oct. 15, 2026. “”This partnership is a model for how higher education, industry and government can work together to build the infrastructure and talent that will drive Florida’s future,” said Parker. “By connecting students to leading-edge technologies while strengthening secure communications across our region and state, we are creating opportunities that extend far beyond our campuses. At the same time, we are pre
Nature: Quantum Information·2026-10-22
No generated summary available for this entry.
overview
Phys.org Quantum Physics·2026-10-22
No generated summary available for this entry.
overview
Original abstract
Researchers at Fraunhofer IAF have developed a laser-enhanced quantum sensor that combines high magnetic-field sensitivity with a large dynamic range. Using laser threshold magnetometry, they improved the ratio of sensitivity and dynamic range by a factor of up to 590 compared with state-of-the-art approaches. The breakthrough is enabled by the first demonstration of 100% optical contrast, combined with strong laser readout signals. The results, published in Nature Communications, open up new prospects for medical diagnostics, navigation, and resource exploration.
The Quantum Insider·2026-10-22·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief ZuriQ and Rhonexum have signed a multi-year commercial agreement under which Rhonexum will supply cryogenic integrated-circuit technologies and customization services for ZuriQ ‘s trapped-ion quantum computing roadmap. The agreement includes an initial product delivery scheduled for the end of 2026, future product orders and deployments, and technical cooperation that gives ZuriQ access to selected Rhonexum technologies and product developments. The companies aim to address quantum processor scaling challenges, including control-signal overhead per qubit, by combining ZuriQ ‘s trapped-ion architecture with Rhonexum ‘s cryogenic electronics expertise. PRESS RELEASE — ZuriQ and Rhonexum have announced a multi-year commercial framework agreement. Under the agreement, Rhonexum will supply cryogenic integrated-circuit technologies and customisation services to ZuriQ, which will evaluate the potential of each of these solutions to advance its trapped-ion quantum computing roadmap. This partnership brings together ZuriQ ’s trapped-ion quantum computing expertise and Rhonexum ’s cryogenic electronics technologies to address future scaling and performance requirements. It establishes a framework for future orders, product deployments, and technical collaboration. Quantum computing is rapidly accelerating toward industrial deployment and scalable commercial systems. As quantum processors scale, demand is growing for specialised hardware and electronics that improve performance, reduce complexity, and enable more compact system architectures. A longstanding challenge in scaling trapped-ion quantum computing is to reduce the overhead in control signals per qubit that travel from room-temperature sources into a cryogenic environment. ZuriQ ’s architectural advances, together with Rhonexum ’s cryogenic electronics expertise, provide a unique approach that can enable denser qubit arrays while retaining flexible reconfiguration capabilities. Th
Nature: Quantum Information·2026-10-22
No generated summary available for this entry.
overview
The Quantum Insider·2026-10-22·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief The UK and Singapore held their 11th Financial Dialogue in Singapore, discussing cooperation in digital finance, AI, quantum technologies, capital markets and sustainable finance. On quantum technologies, both countries reviewed quantum security approaches, guidance for financial institutions transitioning to post-quantum cryptography, and lessons from Singapore’s Quantum Key Distribution sandbox with industry partners. The two countries also discussed financial market innovation and regulatory cooperation ahead of the UK’s G20 Presidency and Singapore’s ASEAN Chairmanship in 2027. PRESS RELEASE — The United Kingdom (UK) and Singapore held the 11th UK-Singapore Financial Dialogue in Singapore today. Reaffirming their strong and longstanding partnership, the discussions focused on advancing cooperation in digital finance and innovation, capital markets, sustainable finance, and regional and multilateral initiatives. Digital Finance and Innovation The UK and Singapore exchanged views on digital finance and innovation, including taking stock of and advancing their cooperation in digital assets, artificial intelligence (AI), and quantum technologies. Discussions on digital assets and financial market infrastructure covered initiatives from both jurisdictions aimed at supporting cross-border use cases for tokenisation and wholesale digital markets. These included the Monetary Authority of Singapore (MAS)’s Project Guardian [footnote 1] and BLOOM, [footnote 2] Global Layer One (GL1), [footnote 3] alongside the UK’s Wholesale Financial Markets Digital Strategy, [footnote 4] the work of the UK Wholesale Digital Markets Champion, [footnote 5] the Digital Securities Sandbox, [footnote 6] and ongoing work of the Bank of England (BoE) and the Financial Conduct Authority (FCA) on tokenisation and wholesale digital markets. Developments in crypto-assets and stablecoins and the implications of digital money for wholesale markets and inst
Phys.org Quantum Physics·2026-10-22
No generated summary available for this entry.
overview
Original abstract
Ever since quantum mechanics first described particles, like electrons, as rippling waves, researchers have wondered if those waves could be trapped in place. Writing today in Science a century later, a team of Columbia University researchers reports waves of electrons becoming trapped for the first time in a metal called Pd₅AlI₂.
The Quantum Insider·2026-10-22·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Sparrow Quantum has appointed founder Peter Lodahl as CEO, succeeding Kurt Stokbro, who will remain involved as an executive advisor and board member. The company plans to focus on integrating, controlling and connecting its photonic quantum chip technology into larger computing systems designed for fault-tolerant quantum computing. Sparrow has strengthened its leadership team with new commercial and financial appointments and established a Scientific Advisory Board to guide its technical roadmap. PRESS RELEASE — Sparrow Quantum today announced that its founder and former Chief Quantum Officer, Professor Peter Lodahl, has been appointed Chief Executive Officer as part of a planned leadership transition. He succeeds Kurt Stokbro, an early investor who led the company’s development into a growing commercial quantum technology scale-up. Kurt will remain closely involved as Executive Advisor and member of the board. The appointment completes a strengthening of Sparrow Quantum ’s leadership team that began in May, when former Danish Tech Ambassador Anne-Marie Engtoft Meldgaard joined as Chief Commercial Officer. The company has also established a new Scientific Advisory Board to provide external guidance on its technical roadmap. Having developed and delivered its quantum photonic chip technology, Sparrow Quantum will now focus on the integration, control, and connection of reliable quantum light within larger computing systems. Peter Lodahl is uniquely positioned to lead that work. As a world-leading expert in photonic quantum technology, his research has been instrumental in establishing Sparrow’s position in photonic quantum hardware. Since the company spun out of the Niels Bohr Institute at the University of Copenhagen, it has built world-leading capabilities, an ambitious team, and growing engagement from customers and partners. “Kurt has been instrumental in turning Sparrow ’s scientific foundations into a growing technology company. He he
The Quantum Insider·2026-10-22·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief SEEQC reported simulation results showing that combining its chip-based pre-decoder with NVIDIA Ising reduced quantum error-correction decoding time and logical error rates by approximately 50% compared with using Ising alone. The architecture places specialized processing closer to the quantum processor to reduce data transfers and support faster communication with GPU-based computing systems. SEEQC plans to integrate the demonstrated components into a quantum processor connected to high-performance computing infrastructure and evaluate further improvements in error correction and scalability. PRESS RELEASE — – SEEQC , Inc. (“SEEQC” or the “Company”),a chip-based quantum computing company, today announced results demonstrating significant performance improvements in quantum error correction decoding through a digital interface optimized multi-stage decoding architecture combining SEEQC’s chip-based pre-decoder technology with the NVIDIA Ising open family of AI models . SEEQC’s chip-based pre-decoder was integrated in a simulated quantum processor and architecture stack incorporating realistic decoder latency at scale, as a backend to NVIDIA Ising Decoding with SEEQC Digital Link and NVIDIA NVQLink providing the framework for low-latency communication between quantum and GPU-accelerated compute environments. Compared with operating NVIDIA Ising as a standalone pre-decoder, the combined multi-stage pre-decoder architecture demonstrated an approximately 50% reduction in decoding latency and logical error rate performance, the two key metrics that dictate the scalability of a fault tolerant quantum system. The overheads associated with error correction are enormous and can increase exponentially as systems scale towards useful computation. Therefore, a 50% improvement in these key scaling bottleneck metrics have a significant impact on the overall scalability and efficiency of a quantum processor. The results demonstrate how specialized proce
The Quantum Insider·2026-10-22·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Ericsson Canada and École de technologie supérieure (ÉTS) have launched a Mitacs-supported research project to develop quantum computing methods for improving telecom network operations. The research team will investigate variational quantum algorithms, focusing on error mitigation and optimization through experiments using quantum hardware and simulations. The project is the second Mitacs-funded academic collaboration under Ericsson Canada’s Montreal Quantum Research Hub, which supports quantum research and talent development in Quebec. PRESS RELEASE — Ericsson Canada and École de technologie supérieure (ÉTS) have teamed up to further quantum computing research in Quebec, one of the country’s primary quantum computing centres. With support from the Mitacs Accelerate program, the project aims to develop better quantum computing methods that will help run and manage telecom networks more efficiently, while also training students and researchers in cutting-edge quantum technology that supports Canada’s leadership in this field. “Quantum computing will unlock new ways to make telecommunications networks more efficient, and Canada is well positioned to lead that work,” says Nishant Grover, President, Ericsson Canada. “Through our Montreal Quantum Research Hub and our partnership with ÉTS, supported by Mitacs Accelerate, we’re bringing together world-class research and industry expertise to advance practical quantum methods for telecom network operations.” The Honourable Mélanie Joly, Minister of Industry and Minister responsible for Canada Economic Development for Quebec Regions, says: “Quantum technologies will shape the course of our future and Canada is a world leader in this emerging technology space. As a long-trusted partner in Canada’s technology ecosystem for more than 70 years, we were encouraged by the establishment of Ericsson Canada’s Quantum hub in Montreal, and we welcome this new partnership which will further strengthen Canada’s
The Quantum Insider·2026-10-22·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Symmatrics has appointed Andrew Hallman, a former senior CIA and ODNI official who now works at Leidos, to its Strategic Advisory Board. Hallman brings more than 30 years of intelligence and security experience, including serving as Deputy Director of the CIA for Digital Innovation and performing the duties of Principal Deputy Director of National Intelligence. Symmatrics is developing cybersecurity products based on One-Time Pad Symmetric Key (OTPSK) encryption, which the company says are designed to protect data and communications against AI-driven and quantum-related threats. PRESS RELEASE — Symmatrics , the cybersecurity company pioneering one-time pad encryption at internet scale and building the new trust layer for the AI and post-quantum era, today announced the appointment of Andrew Hallman to its Strategic Advisory Board. Hallman joins the company as organizations across government, defense, and critical infrastructure sectors face escalating cybersecurity risks driven by artificial intelligence and the emergence of quantum computing. A respected national security leader, Hallman brings more than three decades of intelligence and security experience, including senior leadership roles at both the Central Intelligence Agency (CIA) and the Office of the Director of National Intelligence (ODNI). He is currently Vice President and Strategic Account Executive for the Intelligence Community at Leidos, Inc. “Andrew’s experience leading the nation’s most critical intelligence and security initiatives makes him a valuable addition to our advisory board,” said Walter Raquet, Chairman and CEO of Symmatrics . “As AI accelerates cyber threats and quantum computing challenges traditional encryption, Andrew’s perspective will help guide our efforts to develop technologies protecting governments, enterprises, and critical infrastructure from the next generation of cyber risks.” From 2019-2020, Hallman
The Quantum Insider·2026-10-22·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Join us online on October 22 as Quantum Beach 2026 brings researchers, entrepreneurs, investors and industry leaders to the Palm Beach County Convention Center in West Palm Beach, Florida. Explore the ideas, investments and partnerships shaping the quantum economy, from advances in quantum computing to the practical work of building businesses, preparing a skilled workforce and developing the infrastructure needed to support growth. With a focus on Florida and connections across the wider quantum community, Quantum Beach examines what it takes to move quantum technology from research toward commercial use. Watch the livestream below to follow the conversation and hear perspectives on the opportunities and challenges ahead.
The Quantum Insider·2026-10-22·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief RhymeQ raised $2.2 million in pre-seed funding to develop software designed to let Python developers program quantum computers. Its Rhyme compiler translates conventional code for multiple quantum processors and NVIDIA CUDA-Q, supporting both quantum simulators and hardware. The funding will support engineering hires, enterprise platform development, hardware partnerships and expansion of its developer community. RhymeQ, a startup making quantum computers accessible to software developers across the world, has raised a $2.2 million pre-seed round led by Ground State Ventures , with participation from Vanagon Ventures, Plug and Play , and Freiraum Ventures. Quantum computers promise to solve significant problems and expand the reach of supercomputing and AI, for instance in chemicals, pharmaceuticals, finance, or manufacturing. However, coding for a quantum computer currently requires a PhD in quantum physics. Relatively few people globally are currently capable of that. RhymeQ has developed Rhyme, a new abstraction layer that allows every developer with basic Python skills to code for quantum. The actual coding is familiar and conventional, while the company’s compilers handle the translation for quantum computers. What’s more, it’s compatible across multiple quantum processors, with no hardware lock-in. “We are on a mission to make quantum computers programmable by every developer on the planet,” says RhymeQ founder and CEO Daniel Volz. “While vibe coding is taking over the classical programming world, the situation is not so simple in the quantum world. Quantum circuits can only be debugged by PhD-level physicists. With Rhyme, any programmer can both develop and debug production-ready code to run on quantum computers at enterprise level.” Volz previously led quantum computing initiatives for McKinsey and BASF and co-founded quantum startup Kipu Quantum. He co-founded RhymeQ in 2026 with CTO Tamás Varga and COO Christina Wu. Varga, the inventor
Phys.org Quantum Physics·2026-10-22
No generated summary available for this entry.
overview
Original abstract
Unlike classical physics, quantum mechanics generally cannot tell us exactly what will happen in an individual event. Instead, it predicts the probabilities of different outcomes. As one of the theory's early pioneers, Erwin Schrödinger played a key role in debates about what this randomness really means. However, part of his contribution has stayed hidden for more than 80 years.
Quantum
·2026-10-22
·André Melo, Gaspard Beugnot, Fabrizio Minganti
·doi
No generated summary available for this entry.
overview
Original abstract
Determining the steady state of an open quantum system is crucial for characterizing quantum devices and studying various physical phenomena. Often, computing a single steady state is insufficient, and it is necessary to explore its dependence on multiple external parameters. In such cases, calculating the steady state independently for each combination of parameters quickly becomes intractable. Perturbation theory (PT) can mitigate this challenge by expanding steady states around reference parameters, minimizing redundant computations across neighboring parameter values. However, PT has two significant limitations: it relies on the pseudo-inverse – a numerically costly operation – and has a limited radius of convergence. In this work, we remove both of these roadblocks. First, we introduce a variational perturbation theory (VPT) and its multipoint generalization that significantly extends the radius of convergence even in the presence of non-analytic effects such as dissipative phase transitions. Then, we develop two numerical strategies that eliminate the need to compute pseudo-inverses. The first relies on a single LU decomposition to efficiently construct the steady state within the convergence region, while the second reformulates VPT as a Krylov space recycling problem and uses preconditioned iterative methods. We benchmark these approaches across various models, demonstrating their broad applicability and significant improvements over standard PT.
Quantum
·2026-10-22
·Changhao Yi, Cunlu Zhou
·doi
No generated summary available for this entry.
overview
Original abstract
We present a symmetry-enabled direct quantum protocol for computing many-body Green's functions, a central tool for studying strongly correlated quantum systems. Our protocol relies only on native time evolution and straightforward measurements available on current hardware platforms. By exploiting parity symmetry—satisfied by a broad class of Hamiltonians in condensed matter physics and quantum chemistry, including the Fermi–Hubbard and Heisenberg models—we introduce a tailored quench spectroscopy scheme that recovers both the real and imaginary parts of two-point time correlators, from which Green's functions can be reconstructed via efficient classical signal processing. We further develop a tailored symmetric quantum Gibbs sampler that prepares parity-resolved (symmetric and antisymmetric) thermal states, enabling finite-temperature extensions within the same framework. Finally, we show that the same symmetry-based measurement primitive extends naturally to out-of-time-ordered correlators (OTOCs). Our results provide a practical route to estimating symmetry-resolved dynamical correlators on near-term and early fault-tolerant quantum hardware.
Quantum
·2026-10-22
·Matias Ginzburg, Simone Rademacher, Giacomo De Palma
·doi
No generated summary available for this entry.
overview
Original abstract
Mean-field Hartree theory is a central tool for reducing many-body dynamics to an effective one-particle evolution. This approximation has been employed when the Hamiltonian governing the many-body dynamics is not Hermitian. Indeed, non-Hermitian Hamiltonians model particle gain/loss or the evolution of open quantum systems between consecutive quantum jumps. Furthermore, the validity of the Hartree approximation for generic non-Hermitian Hamiltonians lies at the basis of a quantum algorithm for nonlinear differential equations. In this work, we show that this approximation can fail.First, we consider the most general bosonic mean-field Hamiltonian with two-body interactions and we prove that, for non-Hermitian Hamiltonian, the Hartree equation does not capture the correct second time derivative of the one-particle marginal state at t = 0 in the thermodynamic limit. Then, we analytically solve a model of N bosonic qubits with a purely anti-Hermitian Hamiltonian, compute the limit for N → ∞ of the one-particle marginal state and show that it does not agree with the solution of the non-Hermitian Hartree equation. We further show that there exists an initial condition such that the exact one-particle marginal state undergoes a finite-time transition to a mixed state, a phenomenon that is completely absent in the case of Hermitian Hamiltonians. Finally, we simulate a non-Hermitian Hamiltonian with real spectrum and show that, also in this case, there are initial conditions for which the Hartree equation does not reproduce the correct one-particle marginal state in the limit N → ∞ .Our findings challenge the validity of the mean-field Hartree approximation for non-Hermitian Hamiltonians, and call for additional conditions for the validity of the mean-field regime to model the dynamics of particle gain and loss and the open-system dynamics in bosonic many-body systems.
Quantum
·2026-10-22
·Adrián Franco-Rubio, Arkadiusz Bochniak, J. Ignacio Cirac
·doi
No generated summary available for this entry.
overview
Original abstract
In this work, we examine the consequences of the existence of a finite group of matrix product unitary (MPU) symmetries for matrix product states (MPS). We generalize the well-understood picture of onsite unitary symmetries, which give rise to virtual symmetry defects given by insertions of operators in the bonds of the MPS. In the MPU case, we can define analogous defect tensors, this time sitting on lattice sites, that can be created, moved, and fused by local unitary operators. We leverage this formalism to study the gauging of MPU symmetries. We introduce a condition, block independence, under which we can gauge the symmetries by promoting the symmetry defects to gauge degrees of freedom, yielding an MPS of the same bond dimension that supports a local version of the symmetry given by commuting gauge constraints. Whenever block independence does not hold (which happens, in particular, whenever the symmetry representation is anomalous), a modification of our method which we call state-level gauging still gives rise to a locally symmetric MPS by promotion of the symmetry defects, at the expense of producing gauge constraints that do not commute on different sites.
Quantum
·2026-10-22
·Szilárd Szalay
·doi
No generated summary available for this entry.
overview
Original abstract
We construct an important missing piece in the entanglement theory of pure three-qubit states, which is a polynomial measure of W-entanglement. This works in parallel to the three-tangle, which is a polynomial measure of GHZ-entanglement, and to the bipartite concurrence, which is a polynomial measure of bipartite entanglement. We also show that these entanglement measures are ordered, the bipartite measure is larger than the W measure, which is larger than the GHZ measure. It is meaningful then to consider these three types of three-qubit entanglement, which are also ordered, bipartite is weaker than W, which is weaker than GHZ, in parallel to the order of the three kinds of equivalence classes of entangled three-qubit states.
Quantum
·2026-10-22
·Miguel Tierz
·doi
No generated summary available for this entry.
overview
Original abstract
We show that, for sudden quenches, the work distribution reduces to the statistics of the traces of powers of Haar unitaries, which are random unitary matrices drawn uniformly from the unitary group. For translation-invariant quadratic fermionic chains with interactions extending to m neighbors and periodic boundary conditions, the Loschmidt amplitude admits a unitary matrix model / Toeplitz representation, which yields a work variable of the form W = ∑ r ≤ m a r ℜ Tr ⁡ U r (and in models with pairing terms -superconducting pairing- additional b r ℑ Tr ⁡ U r terms appear). By invoking multivariate central limit theorems for vectors of traces of unitaries, we obtain a Gaussian distribution for P ( W ) with variance V a r ( W ) = 1 2 ∑ r r ( a r 2 + b r 2 ) and asymptotic independence across different powers. We also characterise the conditions under which non-Gaussian tails arise, for example from many interaction terms or their slow decay, as well as the appearance of Fisher-Hartwig singularities. We illustrate these mechanisms in the XY chain. Various numerical diagnostics support the analytical results.
PRX Quantum
·2026-10-22
·H. D. Pinckney et al.
·doi
No generated summary available for this entry.
overview
Quantum Science and Technology
·2026-10-22
·Matthieu Sarkis et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract Quantum batteries are quantum systems that store energy and deliver it on demand, and their practical value hinges on how fast they can be charged. While collective charging protocols and global control are known to enhance charging power, it remains unclear how the battery’s internal interaction architecture itself constrains performance. Here we study interacting fermionic batteries whose internal couplings are encoded by a graph adjacency matrix and which are charged through a uniform interaction with an external fermionic device. We prove that the star topology uniquely maximizes the initial slope of the charging power at zero local field. At finite field, we derive an exact spectral criterion for outperforming the star and construct a star-like family that satisfies it. Based on numerically established correlation, we expect these findings to extend to the maximal average charging power as well. To confirm the dominance of the star architecture, we complement the analysis by an exhaustive sweep over all connected graphs with N ≤ 7 vertices, and by larger
random-graph benchmarks.
arXiv·2026-10-22·Jacques L. Pienaar, Eran Tal, Asya Ciftci
No generated summary available for this entry.
overview
Original abstract
We examine the conditions under which quantum parameter estimation is compatible with the concept of a ``true'' quantity value: a unique value of the estimated quantity that exists prior to and independently of measurement. While quantum parameter estimation typically assumes that the quantity to be estimated is a parameter, we argue that this assumption can be lifted, opening the way to a more general formulation of estimation that may apply even in situations where the quantity to be estimated is no longer a parameter, but instead a quantum variable susceptible to quantum fluctuations. We identify three assumptions that characterize the way estimation is often presented in the quantum metrology literature, namely, as a procedure for inferring an unknown ``true value", which is assumed to be unique and to exist prior to and independently of measurement. Using our more general framework, we prove a no-go theorem showing that the preceding assumptions are jointly incompatible with two further assumptions: the completeness of the quantum state (no `hidden variables'), and the presence of entanglement between the probe systems and the system under measurement. We note that the presence of such entanglement is a generic prediction of standard quantum theory. Consequently, if one is not willing to accept hidden variables, nor willing to modify standard quantum theory by introducing a new physical mechanism that destroys entanglement at some scale or regime, then a realist account of estimation is ultimately impossible.
arXiv·2026-10-22·Ouns El Harzli et al.
No generated summary available for this entry.
overview
Original abstract
We develop an end-to-end framework for assessing a quantum-computing application in industrial materials science: the screening of strongly correlated oxygen-electrode materials for SOFCs and SOECs. We formulate the materials problem in terms of interface observables including oxygen-vacancy formation energies, vacancy migration barriers, and electronic conductivity. We describe how these observables can be obtained using a diagrammatic GW-based embedding, either GW+DMFT or self-energy embedding theory (SEET), applied to a DFT-screened shortlist. The atomistic electrode/electrolyte interface defines the electronic structure problem from which the correlated impurity models are constructed. Quantum impurity solvers would provide the finite-temperature impurity Green's functions required by the embedding. The computational challenges that classical solvers may encounter as the interacting active space grows, together with the polynomial scaling of quantum Hamiltonian simulation for efficiently represented discretized models, open an opportunity for quantum advantage. We identify the benchmarks needed to assess this opportunity through convergence of vacancy and migration energetics and comparison with the best applicable classical solvers. We provide illustrative logical qubit counts and identify the thermal state preparation, simulation, measurement, and repeated-solve costs needed for a complete resource assessment. We connect microscopic observables to macroscopic engineering metrics using a continuum model for mixed ionic--electronic conducting oxygen electrodes that couples oxygen surface exchange, solid-state oxygen transport, electrode microstructure, and finite electrode thickness. Finally, we estimate the potential worldwide business value of improved electrode materials under SOFC and SOEC deployment scenarios informed by public technical targets and electrolyser deployment data.
arXiv·2026-10-22·Xie-Hang Yu, Pavel Kos
No generated summary available for this entry.
overview
Original abstract
Pure-state deep thermalization predicts that, after sufficient scrambling, projected ensembles approach universal distributions that contain information beyond the reduced density matrix. In realistic quantum systems, however, noise is unavoidable and the projected states are generally mixed. Whether mixed-state deep thermalization admits an analogous universal limiting distribution has remained unclear. Here we answer this question for quantum dynamics containing local quantum channels, i.e., errors. We show that the late-time mixed-state projected ensemble is completely determined by the normalized Choi state of the error channel and is universal, independent of the microscopic details of the underlying unitary dynamics. We establish this result analytically for dual-unitary circuits, global Haar-random dynamics, and local Haar-random circuits at large local dimension, and verify it numerically in qubit circuits and kicked Ising dynamics. In a solvable setting, we further find exponentially fast convergence to the limiting ensemble. Our results extend deep thermalization to noisy quantum dynamics and establish a direct correspondence between quantum errors and universal random mixed-state ensembles.
arXiv·2026-10-22·Hongrui Chen, Zhiyan Ding, Jianfeng Lu
No generated summary available for this entry.
overview
Original abstract
We propose a new method for proving $L^2$ and modified logarithmic Sobolev inequalities with constants independent of system size for quantum Gibbs samplers whose Lindblad generators satisfy Kubo-Martin-Schwinger (KMS) detailed balance. We first establish the $L^2$ logarithmic Sobolev inequality by transporting it along a temperature-dependent path from the infinite-temperature product state to the target Gibbs state while maintaining a size-independent decay rate for the sandwiched Rényi-2 divergence. A tensor-power argument, combined with the quantum asymptotic equipartition property, then transfers this decay bound to relative entropy, yielding the modified logarithmic Sobolev inequality. This approach provides a general framework for proving size-independent logarithmic Sobolev inequalities for quantum Gibbs samplers. We apply it to two regimes: one-dimensional quantum spin chains at every finite temperature, and finite-range quantum spin systems at sufficiently high temperature in any fixed dimension.
arXiv·2026-10-22·Zhengyi Liu et al.
No generated summary available for this entry.
overview
Original abstract
Tensor-network simulation of quantum circuits depends on contraction orders with low computational cost and small intermediate tensors, found without excessive planning time. We present ArcTN, a contraction-order optimization framework with two search presets. Light keeps planning overhead low, and Heavy spends more effort on refinement. Both combine randomized-greedy construction, subtree reconfiguration, and parallel tempering with stage-specific stopping rules. ArcTN also provides Fixed and Dynamic slicing to meet tensor-size limits and executes the returned orders. On the 30 QC32 quantum-circuit networks completed by all eight compared configurations, Light reduces FLOPs by 61.32% and plans 1.62$\times$ faster than Cotengra Auto/CMA-ES, and Heavy reduces FLOPs by 43.83% and plans 7.21$\times$ faster than Cotengra AutoHQ/Optuna. Heavy also needs 11.85% fewer FLOPs than OMECO TreeSA-8 and plans 1.33$\times$ faster. Dynamic slicing meets the size limits in all 90 runs on 18 scalar-output networks and reduces total sliced FLOPs by 31.99% relative to Fixed slicing, at the cost of longer planning. With a common NumPy executor, Heavy has the lowest combined planning and execution time among five configurations on the runs that all of them completed. On 672 networks built from 320 MQT Bench circuits, Heavy obtains the lowest geometric-mean FLOPs on the 142 large networks while planning 3.1$\times$ and 31$\times$ faster than Cotengra AutoHQ and Hyper128.
arXiv·2026-10-22·Brian Coyle et al.
No generated summary available for this entry.
overview
Original abstract
Randomised quantum simulation algorithms such as qDRIFT reduce circuit depth by replacing deterministic product formulas with stochastic compilations, but achieving high accuracy can require many steps. In vanilla qDRIFT, Hamiltonian terms are sampled with probabilities proportional to their coefficient magnitudes. We propose StateDRIFT, a variant of qDRIFT which optimises its sampling distribution to estimate time-evolved quantities using knowledge of the initial state and target observable, with a provable truncation bound that keeps qDRIFT's guarantees. The distribution at each depth is chosen by solving an optimisation problem targeting bias and/or variance. StateDRIFT can significantly reduce the bias and variance of estimators, and hence circuit depth, which we test on short-time dynamics of lattice models and molecules under Jordan-Wigner up to 18 qubits. For example, with BeH2 StateDRIFT can reduce the number of two-qubit gates required to achieve a given accuracy from 11,201 to 983. StateDRIFT involves measuring observables and commutators on the initial state, so we propose two practical ways to estimate these: classical surrogates such as tensor networks, and classical shadows, which recover most or all of the saving from exact oracles in the systems tested.
arXiv·2026-10-22·Arpan De et al.
No generated summary available for this entry.
overview
Original abstract
Metallo-DNA nanowires serve as a versatile, programmable scaffold for molecular-scale electronics. In this work, we demonstrate that periodic heavy-metal coordination fundamentally reshapes the electronic landscape of DNA, generating dispersive, metal-centered conduction bands rather than isolated localized states. Driven by enhanced inter-layer coupling, where second nearest-neighbor hopping plays a crucial role: the conduction bandwidth can approach 1 eV, more than double that of canonical DNA. These broad bands suggest enhanced robustness of transport against structural fluctuations. As a result of relativistic effects, in these quasi-one-dimensional materials, spin-orbit (SO) coupling enhances band dispersion and governs spin-dependent transport. We predict that although ligand hybridization reduces atomic SO splitting, the effective SO splitting in these nanowires is comparable to the next-nearest-neighbor hopping strength, which results in considerable spin mixing. We find that Hg2+-coordinated nanowire exhibit pronounced spin-flip conductance comparable to spin-conserving conductance across the LUMO manifold. This efficient spin conversion remains robust over extended molecular lengths and is accompanied by a set of highly delocalized unoccupied states with oscillating nodal structures, readily accessible under low-bias transport measurements. In contrast, the Ag+-coordinated nanowires exhibit weak spin-flip scattering that is more than an order of magnitude smaller than spin-preserving transport. This duality establishes the choice of coordination metal as a decisive parameter to govern metal-metal interaction, electron delocalization, and spin-dependent transport. Overall, our findings demonstrate how relativistic effects and quantum confinement intersect in these bio-templated, quasi-one-dimensional molecular conductors.
arXiv·2026-10-22·Matthew Can, Mark M. Wilde
No generated summary available for this entry.
overview
Original abstract
How much entanglement can two distant laboratories share when their connection is noisy? We relate this question to deciding which of two quantum hypotheses is present. Our one-shot bounds apply to entanglement generation over a quantum channel and to one-way entanglement distillation from a shared state. We use Cheng's trace inequality to bound the infidelity of a Petz decoder in terms of a binary hypothesis testing cost. Applying the inequality before averaging over codes reduces the error analysis to computing a second moment of random subspaces. The proof covers every integer target dimension and treats rank-deficient states explicitly. A corollary expresses the achievable entanglement through hypothesis-testing coherent information, with a single logarithmic error slack and exact integer rounding. We also prove an error-preserving conversion from entanglement generation codes to entanglement transmission codes: the target dimension decreases by only a constant factor at fixed error, and the decoder is the original decoder followed by local processing. Consequently, for both entanglement generation and entanglement transmission, arbitrary pure reference-input states yield the same coherent-information rate, second-order Gaussian correction at the original error tolerance, and explicit achievable logarithmic remainder. For commuting testing hypotheses, the logarithmic remainder improves to a constant. These results give a direct route from binary distinguishability to explicit recovery guarantees and finite-resource quantum communication rates.
arXiv·2026-10-22·Anthony M. Polloreno, Timothy Proctor, Robin Blume-Kohout
No generated summary available for this entry.
overview
Original abstract
Randomized benchmarking (RB) returns a single decay parameter or gate error rate, but when the noise is gate-dependent that parameter is notoriously difficult to interpret. We study RB and related random-circuit benchmarks under small gate-local Markovian noise by factorizing each noisy gate into its ideal action followed by the exponential of a small error generator and then perturbing the RB $\mathscr{L}$ matrix, which models the RB decay. For any low-error gate set that satisfies the requirements of RB (it is a sequence-asymptotic unitary 2-design), we show that Pauli-stochastic error rates contribute linearly to the RB decay parameter, while Hamiltonian error rates contribute through a gauge-invariant quadratic form. Pauli-correlation and active generators are absent from the linear term and enter only at higher order. For the single-qubit native gate set $\{X_{π/2},Y_{π/2}\}$ we derive this quadratic form explicitly in terms of three first-order gauge-invariant (FOGI) coordinates: the two intrinsic over-rotations and one relational axis-tilt error. The resulting formula explains the dependence of DRB on the sampling distribution and the compilation dependence of CRB. These results turn RB decay rates into interpretable functions of experimentally meaningful elementary error rates.
arXiv·2026-10-22·Alexander Jung et al.
No generated summary available for this entry.
overview
Original abstract
Mechanically compliant mirrors are key components in cavity optomechanics. However, the requirements to achieve the best optical and mechanical performance are usually in direct competition. A high reflectivity for tightly focused beams entails thick reflectors, whereas ultracoherent flexural nanomechanics necessitates thin membranes. We eliminate this trade-off by introducing high-refractive-index nanopillar metasurfaces on top of a thin membrane. We pattern a 50 micrometer-diameter array of nanopillars to form a photonic crystal. The flat band behavior of guided resonances in the photonic crystal enables a reflectivity of 99.82(1)% for a tightly focused beam of 7 micrometer waist. The combination of two guided resonances creates a 100 nanometer-wide high-reflectivity band around 1550 nanometer. Simultaneously, the nanopillar patterning realizes a density-modulated phononic crystal that isolates an ultracoherent localized mechanical mode with a $Q\cdot f$-product of $2\cdot 10^{14}$Hz. The demonstrated nanopillar metasurfaces enable lightweight mirrors for room-temperature quantum optomechanics and for use as levitated mirrors or lightsails.
arXiv·2026-10-22·Zihao Li, Ji Guan, Mingsheng Ying
No generated summary available for this entry.
overview
Original abstract
Quantum error-correcting code (QECC) implementations are hybrid software-control systems: measured syndromes drive decoder dispatch, recovery actions, and logical checks. Existing QECC verification techniques can prove formal obligations, and general quantum testing can expose final failures, but developers still lack a scalable testing workflow that generates concrete faults and explains where a QECC repair path first diverges. This paper presents ConQEC, to our knowledge the first concolic testing framework for QECC implementations. By combining concrete (Pauli) fault replay with symbolic repair-path constraints, ConQEC generates tests that expose not only final logical failures but also fault--syndrome--decoder--recovery (FSDR) diagnostics: the injected fault, observed syndrome, decoder decision, recovery action, oracle result, and earliest divergent stage. Its symbolic encoding of Pauli faults, syndrome predicates, decoder and recovery relations, and oracle checks enables this diagnostic workflow to scale beyond exponentially increasing amplitude-level quantum-state reasoning. We implemented ConQEC and evaluated it on generated source-level QECC families and public QECC artifacts with up to thousands of qubits. ConQEC detects the seeded bug in every experimental case and reports a replay-valid, fault-localizing FSDR witness for each.
arXiv·2026-10-22·Arman Kashef, Stefan Scheel, Marco Ornigotti
No generated summary available for this entry.
overview
Original abstract
We construct a quantum theory of light in nonlinearly responding materials with dispersion and absorption and, in particular, show the emergence of non-Gaussian noise associated with nonlinear absorption processes. Our theory is based on a path-integral formulation of the microscopic Huttner-Barnett model including cubic matter self-interaction required for $χ^{(2)}$ nonlinear processes. We show that the noise polarization emerges naturally from a decoupling of the stochastic weights of the bath response which, in case of cubic self-interactions, leads to a decoupling via Airy functions. As the theory is, by construction, consistent with the nonlinear fluctuation-dissipation theorem, it constitutes a viable quantum theory of light in nonlinear media.
arXiv·2026-10-22·Jiatian Liu et al.
No generated summary available for this entry.
overview
Original abstract
Narrow-linewidth lasers are essential for various key atom-laser interaction processes and optical setups in quantum coherent control, quantum precision measurement, and quantum information science. The Pound-Drever-Hall (PDH) technique is the standard method for the frequency-stabilization of narrow-linewidth lasers, but the inherent time delay in its feedback loop inevitably induces excessive phase noise, commonly known as servo bumps. Previous solutions primarily rely on additional optical components outside the electronic feedback control loop. Here, we propose and implement a generic method based on the Smith predictor to address the time-delay issue entirely within the electronic part of the PDH feedback control loop. We systematically demonstrate its capability to suppress phase noise and reduce servo bumps by adding only a single Field-Programmable Gate Array (FPGA) controller to the loop. This class of methods is demonstrated to be conceptually concise with minimal hardware overhead, effective in practice, and holds potential for a wide variety of future applications.
arXiv·2026-10-22·Jeff Murugan, Victor Van Aswegen, Hendrik J R Van Zyl
No generated summary available for this entry.
overview
Original abstract
We investigate the behaviour of Krylov complexity as the number of degrees of freedom of a quantum system increases. Specifically, we show that for tensor products of commuting subsystems, the leading excess complexity is controlled by a weighted variance of the subsystem Lanczos coefficients. This provides a quantitative measure of dynamical heterogeneity and a precise characterization of synchronous evolution. We also show that Krylov entropy is able to disambiguate the information associated with subsystems composition from that generated by dynamical mismatch, and that the same Lanczos variance controls the leading mismatch contribution to both complexity and the entropy. Our results establish excess complexity and Krylov entropy as complementary probes of the emergence of collective dynamics in large quantum systems.
arXiv·2026-10-22·Bikalpa Gautam, Akil Raj Subedi
No generated summary available for this entry.
overview
Original abstract
Amplitude encoding stores an N-degree-of-freedom structural mode using ceiling(log2 N) qubits. This article develops an evaluation framework for variational quantum eigensolvers in finite-element structural dynamics. A Cholesky transformation maps the generalized eigenproblem to a symmetric mass-orthonormal Hamiltonian, ensuring Euclidean quantum-state orthogonality equals structural mass orthogonality. For higher modes, the deflation penalty condition is sharpened to a necessary-and-sufficient threshold, with a Davis-Kahan bound quantifying effects of approximate projectors. Numerical studies separate mapping correctness, ansatz expressibility, preprocessing, Pauli growth, finite-shot uncertainty, and damage localization. For 128-DOF chains, consistent-mass whitening increases transformed-operator density from 0.023 to 0.308 and Pauli terms from 576 to 2950. Exact state-vector experiments show qubit count and circuit expressibility are distinct. At 10^5 shots per Pauli term, first-mode frequency RMS error is 2.45%. In an oracle-state study, 10% stiffness loss is localized in 84.5% of trials. Results sharpen the deflation condition, quantify resource bottlenecks, and claim no speedup.
arXiv·2026-10-22·Pengfei Zhu
No generated summary available for this entry.
overview
Original abstract
An internal electronic coherence changes electrical transport only when it feeds back on the physical current. We develop a reduced description of this feedback and distinguish its exact consequences from the assumptions required for a microscopic realization. An opposite-parity two-orbital Hamiltonian identifies a current-coupled orbital force. Under an explicitly stated moment closure and collision ansatz, it yields a passive three-state response with an exponentially damped oscillatory memory. The resulting conductivity redistributes a fixed optical weight and predicts a nonmonotonic dependence of dc conduction on coherence damping at fixed remaining parameters. The orbital reduction constrains the coupling and internal frequency through a shared bare splitting, providing a test beyond unconstrained spectral fitting. A charge-conserving spatial extension couples to Maxwell equations through a positive energy balance and separates the constitutive response from longitudinal collective and transverse electromagnetic modes. We formulate complex-conductivity and transmission tests, including the limits of parameter identification over a finite bandwidth. The model supplies a conditional connection between orbital dynamics, transport memory, and electromagnetic observables; conductivity alone does not establish a uniquely quantum mechanism, and a material-specific collision calculation and closure-error assessment remain necessary.
arXiv·2026-10-22·Miguel Flores R., Carlos A. Muñoz
No generated summary available for this entry.
overview
Original abstract
We investigate the dynamics of two-level systems using the quasidistribution $Q$ function projected onto the space of collective measurements. Particular attention is given to evolution under Hamiltonians that are invariant under particle permutations, for pure states that are either invariant or noninvariant under such permutations. This requires constructing an approximate analog of the star product between quasidistribution functions: the projected $Q$ function of a product of two operators is expressed approximately in terms of the individual operators' $Q$ and $P$ functions. We rewrite the Liouville equation to determine approximate state dynamics and compare the result with exact evolution using the Hellinger distance. Overall, the method performs well for permutation-invariant pure states and Hamiltonians, whereas deviations arise for arbitrary pure states and noninvariant Hamiltonians.
arXiv·2026-10-22·Marcos Crichigno, Steve Flammia
No generated summary available for this entry.
overview
Original abstract
Compiling quantum algorithms for real devices involves hard optimization problems that can decide whether an algorithm runs at scale. We present a general method for solving such problems with AI agents, with every result certified. It builds on autoresearch loops, in which agents iteratively improve programs against a fixed evaluator and which have recently improved quantum cryptanalysis circuits, and adds two elements: a frozen, exact verifier certifies every result, and this verifier, together with the challenge around it, is built by an agent that formulates the problem with a researcher and validates the verifier against a solved case, deliberately broken solutions and published results before any solution exists. The method applies to any optimization problem whose solutions can be verified exactly and efficiently. We apply it to three compilation problems in quantum simulation, namely fermion-to-qubit encoding, Hamiltonian layout and unitary synthesis. In each, the agents improved substantially on published or standard constructions, reducing the cost being optimized by up to 73% at the largest sizes tested and outperforming a state-of-the-art optimizer for fermion-to-qubit encodings. Every submission is a program accompanied by its agent's notes, so the ideas behind each improvement are recorded in human-readable form; later agents built on them, and we describe them here. These results open the way to automated, certified discovery across quantum circuit design and beyond.
arXiv·2026-10-22·Tariq Mahassen, Marcin Jastrzebski, Oleksandr Kyriienko
No generated summary available for this entry.
overview
Original abstract
We develop and analyze generative models based on quantum solvers of stochastic differential equations. Unlike the common approach based on layered variational quantum circuits with parameterized rotations, we parameterize the potential of a Langevin process. The associated Fokker-Planck (FP) equations are Hermitianized and solved using a linear combination of cosine operators implemented through quantum singular value transformation. By encoding the square root of the stationary density, the model enables sampling through computational-basis measurements and is efficiently controlled by coefficients of the block-encoded diagonal potential. We train the proposed model to match empirical distributions within the family described by FP equations, demonstrating parameter recovery for multivariate probability distributions. Crucially, the model remains trainable at scale. Sample-efficient and convex optimization for in-distribution targets arises from a physics-informed inductive bias and holds regardless of the dimensionality of the problem. We provide circuit constructions and efficient block encodings of the main components of the algorithm and analyze resource requirements. Our approach frames quantum generative learning as quantum model discovery and provides a foundation for extending this framework to high-dimensional, strongly correlated scientific data.
arXiv·2026-10-22·Daniel R. E. Hodgson, Pieter Kok
No generated summary available for this entry.
overview
Original abstract
Solid state quantum emitters with electronic spin properties can be entangled using optical interferometric which-path erasure techniques that rely on identical frequencies and linewidths of the emitters. This promises a powerful, fast and scalable platform for quantum technologies. Using current protocols, a pair of emitters embedded in a waveguide interferometer can be deterministically prepared in a maximally entangled state. However, the amount of entanglement diminishes rapidly with increasing separation of the emission lines and variations in the linewidths of the emitters. Solid state emitters such as quantum dots are subject to intrinsic variations in the fabrication process. Therefore, manufacturing the required number of identical emitters on a chip is not scalable. In this Letter, we present a method that uses readily available pairs of entangled photons to entangle solid state emitters with large transition frequency separations and linewidth variations, circumventing the need to fabricate optically identical emitters. We demonstrate a concurrence of C = 0.95 for typical quantum dots using narrowband photon inputs.
arXiv·2026-10-22·Jan Wiersig
No generated summary available for this entry.
overview
Original abstract
We consider finite-dimensional non-Hermitian systems in which all modes coalesce at a single exceptional point. For a rank-one anti-Hermitian contribution, the spectral response strength is computed exactly. For passive systems, we then derive a sharp upper bound at fixed exceptional-point decay rate and show that it is reached only when the decay operator has rank one, corresponding to a single independent dissipative direction. This establishes rank-one loss as the optimal configuration for enhancing the response of a full-order exceptional point. The bound holds for arbitrary order and improves on earlier passive estimates beyond second order. Two third-order trimers illustrate the result: a rank-one-loss system saturates the bound, whereas a passive rank-two-loss realization remains below it. The result turns dissipation into a design resource: concentrating the loss into a single effective dissipative direction maximizes the highest-order spectral response of a passive full-order exceptional-point device.
arXiv·2026-10-22·Ravi Kumar Jha, Hsuan-Yin Lin, Eirik Rosnes
No generated summary available for this entry.
overview
Original abstract
Projected quantum kernels (PQKs) have emerged as a notable approach to circumvent the hardness of machine learning tasks arising from the exponential dimensionality of the quantum Hilbert space. However, recent PQK studies often rely heavily on extensive classical hyperparameter tuning of the radial basis function (RBF) kernel parameter and the support vector machine regularization parameter. The extensive tuning can mask the true representational power of the underlying PQKs induced by quantum feature maps, which has not been explored in detail. Thus, this work aims to expose the structural capabilities of PQKs by isolating and evaluating their native inductive bias through comparisons between untuned and tuned PQKs against the RBF baseline. Furthermore, we propose novel quantum feature maps that leverage two-qubit entanglement to capture multivariate correlations in IoT data. The results show that extensive tuning can lead to competitive performance architectures, while our proposed entanglement topologies exhibit a significantly stronger native inductive bias. This reveals that superior quantum architectural design can yield structurally better PQKs with improvements arising from quantum-mechanical properties rather than from classical hyperparameter tuning.
arXiv·2026-10-22·Silan Li, Qingjun Tong, Ruicheng Bao
No generated summary available for this entry.
overview
Original abstract
Quantum metrology is ultimately shaped not only by measurements, but also by the dissipative dynamics that prepare and maintain the probe. Nevertheless, a general mechanism for enhancing both steady-state and transient precision in open quantum systems has been lacking. Here we show that adding a simple reset channel provides such a mechanism: reset acts as a minimal dissipative control that can enhance metrological precision without modifying the intrinsic Hamiltonian or applying continuous coherent driving. We derive a unified quantum-Fisher-information (QFI) reset-rate response identity, showing how reset enhances steady-state and transient estimation while revealing a sharp transient distinction. For static-parameter estimation in diagonal dynamics, reset leaves the leading short-time QFI unchanged; for the separate task of elapsed-time estimation, it generates an immediate drift contribution that can scale quadratically with the reset rate in the short-time limit. For frequency estimation, the enhancement is instead dominated by a genuinely quantum eigenvector contribution. These results establish reset as a simple dissipative resource for open-system quantum metrology.
arXiv·2026-10-22·Longyan Gong, Jing Zhang, Yongtao Li
No generated summary available for this entry.
overview
Original abstract
The implication of entanglement in quantum battery charging remains poorly understood. In addition, intrinsic quantum randomness poses a fundamental challenge to charging uniformity across distinct trials. To address these issues, we study a three-qubit system within a cascaded collision frame, with two qubits acting as the charger and the third serving as the battery. After each collision, an adaptive measurement is performed on the charger, yielding four conditional post-measurement battery states with identical expected stored energy. For arbitrary fixed charger states, we derive analytical expressions for the recurrence relation of stored energy. We find that stored-energy fluctuations depend on whether the dynamics relies on the battery phase \(γ_n\). For two Bell-like families of entangled states, together with their computational basis states termed Bell-like separable states, the dynamics is \(γ_n\)-independent and fluctuations vanish, whereas for other entangled and separable states, fluctuations emerge. These insights establish a paradigm for engineering charger states to design uniform-charging quantum-battery architectures despite inherent quantum randomness.
arXiv·2026-10-22·Zhen-huan Yang, Dan-Bo Zhang
No generated summary available for this entry.
overview
Original abstract
Local pure dephasing suppresses single-spin coherence, yet we show that it sustains continuous time-crystalline order in a fully connected ferromagnetic spin-$1/2$ ensemble with local decay. An exact operator identity reveals the mechanism: dephasing raises the interaction energy, while energy relaxation on a finite timescale converts this charging into delayed feedback. Within homogeneous mean-field theory, we prove that dephasing is necessary for periodic motion in this model and that feedback exactly balances transverse damping over each cycle. Beyond mean field, the identity fixes the relative amplitude and phase of energy and longitudinal magnetization in oscillatory Liouvillian modes. Liouvillian spectra and stationary two-time correlations characterize temporal order through decay rates that decrease algebraically with system size, frequencies approaching nonzero mean-field values, and comparable per-spin oscillatory weights. Semiclassical trajectories further reveal recurrent switching between a limit-cycle region and two symmetry-related stationary regions: fluctuations interrupt and reactivate collective oscillations, and oscillatory episodes provide an intermediate channel between stationary regions. These results establish local dephasing as a resource for autonomous collective motion and show how the resulting temporal order can participate in metastable dynamics.
arXiv·2026-10-22·Philipp Stammer
No generated summary available for this entry.
overview
Original abstract
The emergence of entangled quantum optical states in high-harmonic generation raises a fundamental problem about its characterization, namely, \textit{how can entanglement of extreme-ultraviolet radiation be certified for attosecond light fields?} Here, we provide experimentally accessible separability tests, particularly showing that attosecond photoelectron interferometry provides a direct solution to this problem. This is achieved by a quantum optical treatment of mapping photoelectron interferometry to the measurement of optical correlation functions. This yields a negative-partial-transpose witness for infrared-XUV entanglement and a sufficient witness of genuine multipartite entanglement without auxiliary optical measurements. We evaluate both witnesses on explicit optical states and identify how the protocol can be extended to XUV-XUV entanglement certification. Hence, we establish attosecond photoelectron interferometry as a general framework for entanglement certification across a wide range of optical frequencies.
arXiv·2026-10-22·Wan-Ling Yang et al.
No generated summary available for this entry.
overview
Original abstract
Ultracold quantum gases offer a controllable and microscopically accessible platform for understanding and engineering superfluidity. Yet, realizing a superleak that selectively transports the superfluid while suppressing normal flow has remained elusive. Here, we harness an optical superlattice to realize such a superleak through dynamical selectivity. The superfluid undergoes coherent Josephson transport, whereas the normal component exhibits slow, thermodynamically limited response, resulting in a flow-rate contrast of 500(49). Exploiting this contrast, we demonstrate repeated filtering of the normal component and dynamical purification of the superfluid, while sustaining coherent driven oscillations for up to 100 cycles. Our results establish a controllable atomic superleak and open possibilities for manipulating transport and thermodynamics in quantum fluids.
arXiv·2026-10-22·Yoshihiko Abe, Ryo Nagai
No generated summary available for this entry.
overview
Original abstract
We propose Quantum Constrained Hamiltonian Descent (QCHD), a continuous-time quantum framework for optimization under smooth equality constraints. The unconstrained counterpart, Quantum Hamiltonian Descent (QHD), minimizes a cost function by simulating the Schrödinger dynamics of a particle in the potential given by the cost function. Applying Dirac's formalism to the classical dynamics with constraints, we construct an intrinsic quantum Hamiltonian with a Laplace--Beltrami operator on the constraint manifold in a kinetic term. Its evolution preserves the constraints exactly without penalty terms and is expected to solve quantum-dynamically the constrained optimization problem. We analyze its relation to Quantum Hamiltonian Descent supplemented by a strong penalty term. For a squared-distance penalty, the effective tangential dynamics acquires an extrinsic-curvature potential and, in nontrivial normal-rotation sectors, a coupling to the normal-bundle connection. These embedding-dependent terms remain in the strong-penalty limit, generally yielding quantum dynamics different from QCHD. Numerical comparisons for circular, elliptical, and two simultaneous constraints show faster optimization and improved concentration near global minima for the initial states and finite penalty strengths considered.
arXiv·2026-10-22·Kamran Behnia
No generated summary available for this entry.
overview
Original abstract
Formulated a hundred years ago, the Bridgman formula for thermal conductivity of liquids postulates a proportionality between sound velocity and thermal conductivity. This designates phonons as heat carriers in a liquid. Its empirical success has been under-appreciated and its conceptual implications overlooked. It is not mentioned in well-known condensed-matter textbook. Here, we review its origin, its links to hydrodynamic Euler equations and to the fundamental paradox surrounding the parabolic heat equation and its fate across the quantum-classical crossover.
arXiv·2026-10-22·Llorenç Balada Gaggioli, Jakub Mareček
No generated summary available for this entry.
overview
Original abstract
Magic-state factories are a major cost of fault-tolerant quantum computing, yet how few noisy inputs they need is known only for restricted protocols. We show that, for tolerating input faults, any stabilizer protocol, however adaptive, postselected or multistage, is no better than a projection onto one stabilizer code, and that for rational targets a fault pattern is harmful exactly when its complement is. Searches over all codes show that quadratic distillation of one T state needs exactly nine inputs and that the eight-input CCZ factory is optimal. At order $d$, one T state needs $n\geq2d$.
arXiv·2026-10-22·Carlos A. Piñeiro Moreno, Pascal Krause, Annika Bande
No generated summary available for this entry.
overview
Original abstract
With the target of efficiently solving the quantum-mechanical Schrödinger equation on future quantum computers, first- and second-order product formulas for the time-evolution operator are proposed, designed to exploit hierarchies in the operator norms of the individual Hamiltonian components. Inspired by the THRIFT product formula, these decomposition schemes achieve a suppression of the leading error term by a factor of alpha<1 with respect to the standard Lie--Trotter--Suzuki splitting of the same order, where alpha quantifies the norm ratio between the dominant and subdominant parts of the Hamiltonian. Unlike THRIFT, the proposed formulas retain the general product-formula structure, making them applicable to Hamiltonians whose terms act on an arbitrary number of qubits. The advantages of this approach are demonstrated through numerical experiments on engineered two-dimensional spin-1/2 XY model systems and isolated molecules within the double-factorization framework.
arXiv·2026-10-22·Haiting Zhang et al.
No generated summary available for this entry.
overview
Original abstract
Scale-free localization is a distinctive phenomenon in non-Hermitian systems, where specific eigenstates, known as scale-free localized states (LSs), possess localization lengths that scale linearly with the system size. Here, we show that a single non-Hermitian defect in one-dimensional quantum walks (QWs) induces scale-free localization. Driven by non-Hermiticity, the QW system undergoes a pseudo-Hermitian (PH) phase transition and the PH symmetry breaking is accompanied by the emergence of scale-free localization. As non-Hermiticity is further increased, the system undergoes a second phase transition, marked by the emergence of two pairs of bound states. Crucially, we identify the critical points of both transitions using localization properties. Furthermore, we extend our investigation to two-dimensional QWs, where a single non-Hermitian defect also induces scale-free localization, thereby demonstrating the universality of this phenomenon. Our work provides a valuable perspective for further exploring defect physics and a type of novel LS in non-Hermitian quantum systems.
arXiv·2026-10-22·Long Huang
No generated summary available for this entry.
overview
Original abstract
We present an organizing framework for concatenated quantum error correction based on the observation that the syndrome projection of a stabilizer code reshapes the noise channel in a code-determined manner. For any stabilizer code, one level of QEC maps the physical noise to a block-diagonal logical channel whose diagonal Pauli weights are fixed by the code geometry. Coherences between different syndrome classes vanish, and no physical Pauli twirl is required to reach this block-diagonal form. Concatenation can then be viewed as the iteration of the same redistribution step: the dominant logical error after one level selects the code used at the next. We instantiate the framework with the two smallest stabilizer codes, the bit-flip and phase-flip codes, and apply it to amplitude damping. The redistribution rules give the concatenation protocol $C_2(\hatσ_y) C_1(\hatσ_x)$, whose ideal-recovery fidelity scales as $f_l=1-\mathcal O(γ^2)$. Solving the crossover condition $F_l>F_{l-1}$ in the ideal-gate limit yields a critical damping parameter $γ_c\approx0.30$; in terms of the initial channel fidelity, $f=1-1.72755γ^2$. Under the same ideal-recovery assumption, we compare the overall gate accuracy rate with that of the five-qubit code. The scope of the framework, in particular for coherent and correlated noise, is stated explicitly.
arXiv·2026-10-22·Guy Hetzroni, Yakir Aharonov
No generated summary available for this entry.
overview
Original abstract
This oral history interview provides Yakir Aharonov's personal and conceptual recollections from the 1950s to the 2000s, focusing on his academic trajectory, some of his major contributions to quantum foundations, and his perspective on the development of the field. The interview traces Aharonov's academic career through the Technion, University of Bristol, Brandeis University, Yeshiva University, University of South Carolina, Tel Aviv University, George Mason University, and Chapman University. The interview also traces the development of Aharonov's work and collaborations on the EPR paradox, time-energy uncertainty relations, quantum measurement theory, quantum frames of reference, the two-state vector formalism, weak values, protective measurements, and several other contributions. It includes recollections of meetings and discussions with David Bohm, Niels Bohr, John Clauser, Paul Dirac, Rudolf Peierls, Aage Petersen, and Abner Shimony. Also mentioned: David Albert, Jeeva Anandan, Peter Bergmann, Gideon Carmi, Avshalom Elitzur, Dave Finkelstein, Vladimir Fock, Itzhak Kalugai, Ed Lerner, Joel Lebowitz, Stanley Mandelstam, Yuval Ne'eman, Sandu Popescu, Maurice Pryce, Daniel Rohrlich, Nathan Rosen, Joseph Safko, Paul Singer, Daniele Struppa, Leonard Susskind, Lev Vaidman, Chien-Shiung Wu.
arXiv·2026-10-22·Paweł Mrowiński et al.
No generated summary available for this entry.
overview
Original abstract
We demonstrate a monolithic telecom C-band single-photon platform based on low-density InAs/InP quantum dots grown on an InGaAsP/InP distributed Bragg reflector, with simulated upward light-extraction efficiency exceeding 10% within the 40 nm spectral band. Enhanced light extraction is crucial for wide-field photoluminescence imaging, enabling approximately 3 nm statistical centroid-localization precision of QD emitters due to improved signal-to-noise ratio. The identified charged exciton emitting at 1549.5 nm exhibits single-photon emission purity up to 94.7%, validated by a raw peak-area integration under pulsed quasi-resonant excitation. Under these conditions, photons emitted sequentially from the unprocessed planar structure reveal a raw two-photon interference visibility of 51% of the photon wave packet within the 2 ns time window and 41% over a 4 ns integration window, all without Purcell enhancement typical for cavity-embedded emitters. Combining broadband extraction, high photon coherence, and emitter preselection on a native III-V wafer, this architecture paves the way for marker-based deterministic fabrication of high-quality monolithic nanophotonic devices.
arXiv·2026-10-22·Thiago Carvalho Corso, Louis Garrigue
No generated summary available for this entry.
overview
Original abstract
We first prove a sharp Lieb-Thirring inequality with semi-classical constant and gradient correction in one dimension. In the periodic setting, the corresponding inequality also includes a parity dependent shell-correction term, which appears to be new. Moreover, we also characterize the optimizers of these inequalities. In particular, the optimizing density profiles form a two-dimensional manifold, which we call here the Poincaré density manifold. We then apply these results to study the Thomas--Fermi--von Weizsäcker (TFW) approximation of the kinetic energy in Density Functional Theory. More precisely, we first obtain an explicit and non-asymptotic bound on the global and local error made by the TFW approximation. These bounds are controlled by the distance of the normalized density profile from the Poincaré density manifold times the number of particles. In particular, these bounds show that the TFW approximation is exact on the Poincaré manifold. We then show that, in the periodic setting, the distance between the Kohn-Sham potential and the inverse TFW potential in the natural dual Sobolev space can also be controlled by explicit density dependent constants times the distance to the Poincaré manifold. As a corollary, we prove that for a fixed density profile, the Kohn-Sham potential converges towards the inverse Thomas--Fermi potential in the high-density limit $N \rightarrow \infty$ with asymptotic rate of order $N^{-2}$. This rate is shown to be optimal.
arXiv·2026-10-22·Jiawen Liu et al.
No generated summary available for this entry.
overview
Original abstract
Millimeter-wave and terahertz technologies offer new opportunities for high-capacity communications, sensing, and quantum systems, but electronic signal chains above 100 GHz are limited by weak sources, noisy receivers, and lossy interconnects. Photonic approaches mitigate these constraints by enabling chip-scale high-frequency components, yet existing implementations generally retain lossy off-chip electrical or free-space links, hindering dense and compact integration for cryogenic or space-constrained settings. Here, we show a monolithic lithium tantalate photonic chip, termed a signal core, which generates, modulates, routes, and detects continuous-wave signals at discrete frequencies between 100 GHz and 2.5 THz. The architecture integrates high-frequency functional modules on chip and uses exclusively fiber-based optical interfaces. Bidirectional coherent electro-optic conversion enables signal generation, detection, and nanosecond-scale amplitude and phase modulation, while micro-coplanar striplines interconnect the modules into an end-to-end signal chain on a single chip. Our modules achieve single-photon electro-optic coupling rates of g_0/2π=10 kHz and peak drive-power-normalized photon-flux conversion efficiencies of 1.0%/mW for generation and 0.5%/mW for detection. It also operates at 4 K in a dilution refrigerator through the same fiber-only optical links. Together, these capabilities establish an all-photonic platform for millimeter-wave-to-terahertz systems and offer a broadly applicable architecture for applications constrained by electrical-interconnect loss, heat load, and footprint.
arXiv·2026-10-22·Jaakko Luomala et al.
No generated summary available for this entry.
overview
Original abstract
The rate operator quantum jumps (ROQJ) is a general method to unravel a master equation describing the dynamics of an open quantum system into stochastic pure state trajectories. By post-selecting on no jumps occurring, one obtains a trajectory generated by a non-Hermitian Hamiltonian. The ROQJ allows for versatile modification of this non-Hermitian evolution, with each non-Hermitian Hamiltonian corresponding to a different continuous measurement scheme. We apply the ROQJ to modify the non-Hermitian dynamics of the open three-particle Bose-Hubbard dimer model under environmental non-local dephasing to construct a $PT$-symmetric non-Hermitian Hamiltonians with a general two parameter $PT$-symmetric imaginary diagonal part, which generalizes the well-known gain-loss Bose-Hubbard dimer. We characterize the symmetry structure of the spectrum for different on-site interaction strengths. For vanishing on-site interaction, we find the unbroken $PT$-symmetry region enclosed by order two exceptional lines of different character and four order four exceptional points, two of which are not found in the usual gain-loss Bose-Hubbard dimer. Additionally, we find regions with degenerate imaginary parts of the eigenvalues, also not found in the gain-loss Bose-Hubbard dimer. In this parameter space, we use time-dependent rate operator transformations to investigate state transfer under slowly varying parameter loops. Loops encircling an order four exceptional point exhibit chiral state transfer. Because the loops cross exceptional lines, the final states are superpositions of eigenstates. Chiral state transfer is also found with non-zero homogeneous on-site interaction when the loop crosses over broken $PT$-symmetry regions of different character. Using inhomogeneous on-site interactions, we find direction dependent state transfer between eigenstates without crossing or encircling exceptional points.
arXiv·2026-10-22·Anurag Anshu, Quynh T. Nguyen
No generated summary available for this entry.
overview
Original abstract
Port-based teleportation (PBT) is a variant of quantum teleportation that does not require corrections on the teleported state: starting with $N$ shared EPR states, Alice can teleport a qudit to Bob by performing a measurement on her system and informing Bob which of his $N$ `ports' to retrieve the state, up to infidelity decaying with $N$. Existing quantum circuits of PBT rely on representation theory tools and the mixed Schur transform. In this note, we report an elementary efficient circuit for PBT, which has depth $\operatorname{polylog}(N,d)$. As a corollary, this gives a simple proof that all $n$-qubit unitaries can be parallelized to $\operatorname{poly}(n)$ depth, recovering a recent result due to Nehoran--Slote--Yuen and OpenAI.
arXiv·2026-10-22·Hanyu Wang et al.
No generated summary available for this entry.
overview
Original abstract
Lattice-surgery compilation places logical qubits on a grid of surface-code tiles and routes their interactions. Sparse static layouts limit routing contention but reserve space that often remains idle. Reducing this reservation requires balancing area savings against additional gate serialization and qubit movement. In this paper, we present a co-designed dynamic architecture and compiler that allocates routing space according to circuit demand. The architecture preserves a fixed virtual qubit floorplan while allowing its physical spacing to change between execution stages. The compiler coordinates placement, scheduling, and routing to implement lattice surgeries using fewer physical qubits. Across our application benchmarks, our method reduces space-time volume by 55.6% in geometric mean and compiles 75.5 times faster than the evaluated DasCot configuration. A circuit-synthesis case study shows how our compiler exposes optimization tradeoffs.
arXiv·2026-10-22·Zhenyu Xiao, Minxuan Wang, Shinsei Ryu
No generated summary available for this entry.
overview
Original abstract
The elementary charged excitations of fractional quantum Hall states are anyons. Without continuous translation symmetry, they acquire a dispersion and richer dynamics. We study the Laughlin quasihole at filling $1/3$ in a periodically modulated magnetic field, a common model of fractional Chern insulators in two-dimensional materials. From the microscopic wave functions, we derive the commutator of its guiding-center coordinates, set by a many-body Berry curvature that governs its wave packets. A modulation with two flux quanta per unit cell splits the quasihole band into bands with Chern numbers $6$ and $-3$; such opposite signs are generic as long as a weak modulation opens a gap between the anyon bands. In the $C=-3$ band, the quasihole drifts against $\mathbf{E}\times\mathbf{B}$, although the magnetic field has the same sign everywhere. Perturbation theory in the modulation explains these results, and large-scale Monte Carlo calculations confirm them. Anyon bands thus acquire their own topology, which controls anyon motion and may shape the phases of itinerant anyons.
arXiv·2026-10-22·Aditya Kumar, Sayan Choudhury
No generated summary available for this entry.
overview
Original abstract
We investigate quantum-enhanced time-reversal-based metrology using the central spin model, in which a single ancilla spin of magnitude $S_{\rm cen}$ mediates interactions between $N$ bath spins through a star-graph topology. We demonstrate that the SATIN (Signal Amplification Through Time-reversal Interaction) echo protocol can be implemented in this setup to achieve a Fisher information of $N^2/e$ with the collective $\langle J_y\rangle$ readout, corresponding to a $4.34\,\mathrm{dB}$ offset from the Heisenberg limit. Furthermore, we establish that this platform provides a pathway to perform the butterfly echo protocol by conjugating each evolution step with a random collective bath rotation, thereby achieving axis-agnostic Heisenberg-scaled sensing. Crucially, with a small $N-$independent number of random steps, the butterfly echo reaches a Fisher information of $N^2/4$ ($6\,\mathrm{dB}$ below the Heisenberg limit) for any unknown encoding axis, with the plateau gain tracking the Haar limit. Finally, we demonstrate that the central-spin magnitude $S_{\rm cen}$ provides a powerful knob to reduce the optimal protocol timescale without altering the metrological ceiling or the circuit depth required to reach isotropy. The proposed scheme is relevant to cavity QED and NMR quantum processors, where the central spin architecture arises naturally.
arXiv·2026-10-22·Chia-Hsien Huang, Hsi-Sheng Goan
No generated summary available for this entry.
overview
Original abstract
In the companion paper (Part I), we developed an optimal-control framework to suppress intrinsic and decoherence-induced errors in controlled-Z (CZ) gates between directly coupled, frequency-tunable transmons. Here, we extend this framework to incorporate uncertainties in coupling strength, anharmonicities, and zero-flux qubit frequencies, enabling the design of high-fidelity gates robust against noise and parameter uncertainties. We classify these uncertainties by whether they perturb the off-diagonal coupling strengths or the diagonal detunings of the Hamiltonian, and we identify distinct suppression mechanisms for each class. Coupling errors are mitigated through dynamical decoupling induced by strong detuning modulation. For a 30-ns gate, this strategy reduces the coupling error to $6.21\times10^{-7}$ and tolerates coupling-strength uncertainties up to $2π\times4$ MHz while keeping total gate infidelity below $10^{-3}$. Detuning errors are minimized near a symmetric-detuning operating point that balances the two dominant leakage-mediated interactions. A 24-ns gate operated near this point tolerates individual uncertainties of up to $2π\times5$ MHz in each relevant diagonal parameter under the same infidelity threshold. We further optimize gate performance under realistic conditions where intrinsic errors, decoherence, and parameter uncertainties coexist across six representative stages of progressively improving hardware performance. The resulting stage-specific controls achieve lower infidelity and greater robustness. Together with the companion study (Part I), this framework offers a practical approach to balance speed, fidelity, and robustness while reducing the need for exhaustive characterization and frequent recalibration in large-scale superconducting quantum processors.
arXiv·2026-10-22·Ruixuan Deng et al.
No generated summary available for this entry.
overview
Original abstract
Quantum key distribution (QKD), whose security is derived from quantum mechanics rather than computational assumptions, is moving into standardization and commercial deployment. Yet its security guarantees rest on technically delicate proofs checked by hand. Formal verification closes this gap, establishing a two-factor assurance: unconditional security from physical principles, and machine-checked proofs against reasoning errors. We present FVQKD, a Rocq library for machine-checking QKD security proofs. Its first result is a complete, end-to-end machine-checked proof of composable, finite-key security for BB84. The mechanization reconstructs the complete proof infrastructure from first principles, including the smooth entropy framework, the entropic uncertainty relation, and the Quantum Leftover Hash Lemma. It uncovers necessary side conditions that the published argument leaves unstated, one of which reveals a missing proof branch, and it grounds the information-theoretic bound in a formal semantics of protocol execution, which the pen-and-paper analysis lacks. The proof is entirely admit-free, relying only on the Rocq kernel and standard foundational axioms. To our knowledge, this is the first end-to-end formal verification of a QKD security proof. Built on MathComp, MathComp-Analysis, and CoqQ, the development provides quantum-information infrastructure designed for reuse across broader QKD variants and quantum cryptography applications.
arXiv·2026-10-22·Hao-Fan Wang, Lin Chen
No generated summary available for this entry.
overview
Original abstract
Set coherence and set imaginarity are two important quantum resources defined by sets of states. We investigate tuples of qubit states under vanishing higher-order Bargmann invariants and show that their set coherence and set imaginarity are each related to whether they contain a pair of orthogonal states. Specifically, when the relevant higher-order Bargmann invariants vanish, the tuple contains a pair of orthogonal states if and only if removing some state makes the remaining tuple incoherent. Moreover, when maximally mixed states are excluded, the same vanishing conditions imply that the tuple is imaginarity-free if and only if it contains a pair of orthogonal states. As a consequence, under these conditions, a tuple of single-qubit states has imaginarity precisely when every tuple obtained by deleting one of its states is coherent.
arXiv·2026-10-22·Jia Gu, Guofeng Zhang, Ian R. Petersen
No generated summary available for this entry.
overview
Original abstract
The purpose of this paper is to conduct a comprehensive structural analysis of quantum finite-level systems in the Heisenberg picture, where the evolution of system observables is modeled by bilinear quantum stochastic differential equations (QSDEs). Firstly, real coordinate transformations that preserve commutation and anticommutation relations are characterized, and relative admissibility between different orthonormal Hermitian bases is formulated. Secondly, strongly aligned subspaces are introduced, based on which decoherence-free subsystems (DFSs) are constructed in general orthonormal Hermitian basis as well as the generalized Gell-Mann basis. Thirdly, conditions for the existence of quantum nondemolition (QND) variables are given in terms of both linear systems theory and spectral separation by output-signal observables. Finally, a sufficient condition for quantum back-action-evading (BAE) measurements is established. A four-qubit nearest-neighbor Heisenberg chain with collective dephasing illustrates these structural properties of quantum finite-level systems.
arXiv·2026-10-22·Tetsu Kinase, Ippei Nakamura, Atsushi Noguchi
No generated summary available for this entry.
overview
Original abstract
Excess micromotion induced by stray DC electric fields limits the control fidelity of trapped-ion experiments. Various techniques have been developed to detect and compensate ion displacements from the RF null by monitoring modulated fluorescence, ion positions, or micromotion sidebands. Although these approaches are effective, they do not probe the displacement through a ground-state-cooled motional mode and therefore offer limited compatibility with quantum-enhanced sensing protocols. Here, we demonstrate a micromotion compensation method based on the driven coherent amplitude of a ground-state-cooled motional mode. In this approach, the ion displacement is converted into a coherent motional excitation by an auxiliary RF drive and detected through the qubit. We determine the optimal compensation field with a $1σ$ statistical uncertainty of 8 mV/m. The method is naturally compatible with quantum-enhanced sensing protocols employing nonclassical motional states, including Fock, squeezed, and Schrödinger-cat states, providing a pathway toward quantum-enhanced micromotion compensation.
arXiv·2026-10-22·Chihiro Matsui
No generated summary available for this entry.
overview
Original abstract
We investigate a hierarchy of invariant Hilbert-space structures connecting Hilbert-space fragmentation, partial solvability, and quantum many-body scars. For spin chains with fragmented spin-$1/2$ subspaces and their local deformations, we show, using the spin-$1$ $XXC$ chain as a representative example, how successive local deformations reduce extensive irreducible-string fragmentation through an implicitly embedded spin-$1/2$ invariant space and ultimately to a single scar tower, connecting the $XXC$, perturbed $XXC$, and spin-$1$ $XY$ scar models. Through the intermediate embedded space, local dynamics couples states from distinct frozen irreducible-string sectors and selects a new decomposition into representations, from which smaller invariant spaces can be retained. We also establish a rigidity constraint on isolating nonsymmetric towers and a constructive correspondence that transfers a reduction between locally realizable representations of the embedded dynamics. The latter demonstrates that the reduction hierarchy can be transferred through a unitary transformation within the embedded subspace, yielding an exact scar tower built on a Néel reference state without requiring unitary equivalence of the full Hamiltonians.
arXiv·2026-10-22·Katsuhiko Higuchi, Masahiko Higuchi
No generated summary available for this entry.
overview
Original abstract
We present the conditions for satisfying the cluster property in the superconducting state. Using these conditions, we show that the cluster property employed when deriving the order parameter of the superconducting state (OPSS) holds true, and that the OPSS is given by ${}_S\langle Ψ| \hatψ(x)\hatψ(x') | Ψ\rangle_S$, where $|Ψ\rangle_S$ is the superconducting state, and where $\hatψ(x)$ is the field operator of superconducting electrons. This provides a resolution to the long-standing concern raised by Leggett et al.\ regarding particle-number fluctuation in the superconducting state. In addition, by considering the entanglement between two particles composed of the maximum geminal of the BCS ground state [J.\ Phys. Commun. 5, 095003 (2021)], it is confirmed that the larger the deviation from the conditions for satisfying the cluster property becomes, the greater the magnitude of the entanglement becomes. This shows not only the effectiveness of the conditions for satisfying the cluster property but also the justification of the OPSS that has been commonly used.
arXiv·2026-10-22·Shujie Cheng et al.
No generated summary available for this entry.
overview
Original abstract
Quasiperiodic systems combine sharply different spectral and localisation regimes with a dense hierarchy of dynamical time scales. We show that a finite-rate quantum Otto cycle can use this structure as a thermodynamic probe, revealing which parts of the spectrum become dynamically accessible and thermodynamically relevant during a driven transformation. For a generalised Aubry-André-Harper chain, the resulting response is not determined by the static quasiperiodic regime alone: extended, near-critical, and crossing protocols do not exhibit universal ordering of work fluctuations. Instead, the statistics reflect transition pathways that are simultaneously dynamically coupled, thermally occupied, and energetically significant. The same spectral accessibility separates thermodynamic recovery from microscopic adiabatic recovery. Positive mean work can reappear while the population transfer dynamics remain strongly nonadiabatic because finite-rate population transfer is redistributed toward energetically less costly channels rather than suppressed. The full work distribution reveals a further separation, with a finite rate window in which positive-work cycles form a majority although the mean work remains negative. This behaviour persists in finite-size analysis. A thermally weighted spectral susceptibility connects these effects to a distributed hierarchy of dynamically active spectral regions rather than to a single minimum-gap bottleneck. Finite thermal contacts preserve this picture while introducing a second time scale and intercycle memory. Quantum Otto cycles can therefore provide a fluctuation-resolved thermodynamic probe of quasiperiodic spectral accessibility, complementary to direct spectroscopic and eigenstate-resolved diagnostics.
The Quantum Insider·2026-10-21·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Plurilock shareholders will vote Nov. 18 on a proposed acquisition by Quantum eMotion that would combine quantum-based security technologies with Plurilock’s cybersecurity operations and customer network. Shareholders would receive C$0.084 in cash and 0.0763 Quantum eMotion shares for each Plurilock share, implying an offer value of C$0.28 per share. Plurilock’s board recommends approval, with completion expected in late November subject to shareholder, court and other required approvals. Plurilock Security shareholders will vote Nov. 18 on a proposed acquisition by Quantum eMotion , a deal intended to pair quantum-based security technology with an established cybersecurity business and its customer network. Plurilock said in a news release that it has filed and mailed documents explaining the transaction ahead of a special shareholder meeting in Vancouver. The companies expect to complete the acquisition in late November if shareholders, the court and other authorities approve it. The announcement marks another step toward completing the proposed purchase, rather than a completed acquisition. Under the agreement, Quantum eMotion would acquire all outstanding Plurilock common shares. Shareholders would receive C$0.084 in cash and 0.0763 of a Quantum eMotion share for each Plurilock share they own. For example, an investor holding 1,000 Plurilock shares would be entitled to C$84 in cash and 76.3 Quantum eMotion shares before any provisions governing fractional shares. The companies put the implied value of the offer at C$0.28 per Plurilock share. Because the payment includes stock, its value will depend partly on Quantum eMotion ’s share price. The agreement specifies how many Quantum eMotion shares investors would receive, rather than guaranteeing a fixed cash value for that portion. A Route to Customers The business rationale centers on bringing Quantum eMotion ’s technology to more customers through Plurilock’s existing sales and service operations,
The Quantum Insider·2026-10-21·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Toshiba launched its Quantum-Safe Networking Platform to help organizations protect critical data connections and expand coverage across existing network infrastructure. The platform combines post-quantum cryptography, quantum key distribution and quantum random number generation with centralized network control and key management. Toshiba says optical switching, integrated transceivers and shared-fiber capabilities reduce equipment requirements and deployment costs, with a single hub able to serve hundreds of remote sites. PRESS RELEASE — Toshiba Corporation today announced the launch of its Quantum-Safe Networking (QSN) Platform, marking a major step towards delivering true scalability, flexibility and greater efficiency in the deployment of quantum-safe networks. The Toshiba QSN Platform brings together interoperable equipment and deployment capabilities within a unified architecture. It is designed to help network operators, data center service providers, enterprises and public-sector organizations protect their most critical data paths first and expand as their security, operational and commercial requirements evolve. Importantly, those organizations do not need to rebuild their networks to get started. The platform integrates with existing network infrastructures and can support deployments from a single dedicated connection to large metro, hub-and-spoke, ring, mesh and long-distance networks. By simplifying the deployment of quantum-safe networks and improving the economics of expanding across multiple sites, the platform helps turn the quantum-safe transition into a strategic advantage. Organizations can strengthen network resilience while scaling protection in line with their needs. Service providers can also begin to offer differentiated quantum-safe services to create new revenue opportunities. The quantum-safe transition is under way The prospect that sufficiently powerful quantum computers could render many of today’s encryptio
The Quantum Insider·2026-10-21·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Researchers from Rutgers , IBM and collaborating institutions demonstrated real-time quantum feedback on up to 100 qubits, using repeated measurements and resets to control chaotic behavior. The experiment used a 156-qubit IBM Heron processor to perform nearly 5,000 two-qubit operations and nearly 5,000 measurements and resets while the system continued running. The researchers observed a sharp transition from chaos to control when resets outpaced scrambling, confirming theoretical predictions and demonstrating a capability needed for future fault-tolerant quantum computers. PRESS RELEASE — Researchers from Rutgers , IBM and collaborating institutions have shown that a quantum computer can check what is happening inside it and respond while it is running, repeatedly resetting parts of the system to bring chaotic behavior under control. The advance is a critical step toward building larger, more reliable quantum computers. Today’s quantum computers operate according to the unusual rules governing atoms and other extremely small particles. They could one day solve problems beyond the reach of conventional computers — designing better batteries and cleaner industrial catalysts, simulating molecules and materials too complex for today’s computers, and running certain artificial intelligence programs. In a study published in Nature Physics , researchers from Rutgers , International Business Machines Corp., and collaborating institutions showed that a quantum computer can repeatedly check and reset parts of itself while running. The experiment is among the largest demonstrations to date of real-time quantum feedback control, a capability considered essential for future quantum computers that will be fault tolerant. Scaling quantum computers will require them to identify and correct errors while they are working, a capability known as error correction, which will allow for the construction of a fault-tolerant quantum computer. A fault-toleran
Phys.org Quantum Physics·2026-10-21
No generated summary available for this entry.
overview
Original abstract
For the first time, Northwestern University physicists have coaxed a single positron—the antimatter counterpart of an electron—into an exquisitely controlled quantum state.
Phys.org Quantum Physics·2026-10-21
No generated summary available for this entry.
overview
Original abstract
Scientists from the Quantum Technologies Group at the Institute of Physics Zagreb, in collaboration with a colleague from the Physics Department at the Faculty of Science (PMF), have experimentally demonstrated for the first time the existence of discrete one-dimensional (1D) solitons in an optically induced photonic lattice in warm rubidium vapor.
Phys.org Quantum Physics·2026-10-21
No generated summary available for this entry.
overview
Original abstract
Quantum networks, systems that connect devices and allow them to exchange information encoded in the quantum states of particles, could enable more secure communications. To build these networks, physicists need to devise strategies that allow distant particles to share quantum states, preserving them long enough to perform calculations or enable communication between devices.
The Quantum Insider·2026-10-21·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Vulcan Elements is partnering with the North Carolina Collaboratory and UNC-Chapel Hill to develop higher-performance rare earth magnets for defense and commercial applications. Supported by a $600,000 research award, the team will use quantum-mechanical simulations to predict how atomic-level changes affect magnetic properties. Vulcan’s factory under construction in Benson, North Carolina, is planned to produce 10,000 metric tons of magnets annually and create 1,000 manufacturing jobs. Vulcan Elements, an American rare earth magnet manufacturer, today announced a partnership with the North Carolina Collaboratory to advance the development of high-performance rare earth magnets for critical defense and commercial technology applications. The collaboration brings together Vulcan Elements and leading scientific expertise at the University of North Carolina at Chapel Hill (UNC-Chapel Hill), where research led by chemistry professor Yosuke Kanai, PhD, will develop a novel analytic capability using quantum-mechanical simulations to predict with significant accuracy how changes at the atomic level affect magnetic properties, ultimately setting a new standard for Vulcan’s magnetic performance. The partnership represents a convergence of two research fields that are foundational to national security and the future economy: rare earth magnets and quantum mechanics. The research will pair Kanai’s more than 25 years of experience in computational materials research with Vulcan Elements’ expertise in manufacturing rare earth magnets. The Collaboratory is supporting the partnership through a $600,000 research award, helping support the application of UNC-Chapel Hill’s scientific expertise to advance rare earth magnet innovation. Established by the North Carolina General Assembly in 2016, the Collaboratory works with academic experts across the state to transform research into practical applications for the benefit of North Carolina. Si
The Quantum Insider·2026-10-21·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief The National Physical Laboratory (NPL) has secured Government Office for Technology Transfer (GOTT) funding to advance trapped-ion quantum computing technology , with a focus on manufacturing scalability. The project will develop a batch packaging process for ion-trap devices to address production yield and manufacturing bottlenecks that limit large-scale production. The work aims to support reliable manufacturing of ion traps for networked quantum computing architectures, building on NPL technology already used at NPL, the University of Oxford and the National Quantum Computing Centre. PRESS RELEASE — The National Physical Laboratory (NPL) has secured funding through the Government Office for Technology Transfer (GOTT) to accelerate the development of next-generation trapped-ion quantum computing technologies, helping address one of the sector’s most significant barriers to commercial adoption: scalability. Quantum computing has the potential to transform industries by solving complex problems that are beyond the reach of today’s most powerful classical computers. Rather than relying on conventional binary transistors, quantum computers use quantum bits, or qubits, which exploit the principles of quantum mechanics to perform calculations at unprecedented speeds. Trapped-ion systems have emerged as a leading platform, among competing quantum computing technologies being developed worldwide, due to their exceptional fidelity, stability and scalability. NPL plays an important role this field, having developed a microfabricated, chip-scale ion microtrap capable of confining and manipulating arrays of ions. The technology provides a highly scalable architecture that is ideally suited for quantum computing and quantum networking applications. NPL’s ion microtrap devices are already supporting cutting-edge research activities at both NPL and the University of Oxford. Building on this success, a previous GOTT Knowledge Asset Gran
The Quantum Insider·2026-10-21·Resonance
No generated summary available for this entry.
overview
Original abstract
How hybrid infrastructure is making quantum commercially actionable today – and why the organizations building that infrastructure now will be the ones ready when the hardware arrives. Insider Brief Quantum readiness is an infrastructure problem as much as a hardware one: organizations are in a “prepare for quantum” era, and integrating isolated quantum processors with enterprise IT through secure, low-latency interconnection is the step most organizations are overlooking. Paris-based Qubit Pharmaceuticals shows this approach in practice. Its four-layer ATLAS platform combines polarizable molecular dynamics, a synthetic quantum chemistry data engine built with Sorbonne University, the FeNNix-Bio1 foundation model, and the Hyperion-1 emulator, which simulates up to 40 qubits on classical hardware. Quantum advantage has not yet been demonstrated in drug discovery, but the milestones that matter now (algorithm validation, workflow integration and ecosystem maturity) don’t require fault-tolerant hardware. Organizations that delay preparation risk falling further behind as a result. The Era Between Eras The prevailing assumption about quantum computing is that fault-tolerant hardware will arrive at some point, organizations will integrate it when it does, and until then there is nothing practical to do. That framing is both inaccurate and increasingly costly to believe. We are not in a “wait for quantum” era. We are in a “prepare for quantum” era, and preparation is an active, infrastructure-intensive undertaking. Organizations that treat it as passive will find themselves starting from scratch when quantum utility arrives. Those who build now will be able to absorb it. The distinction matters most in the life sciences, where the cost of falling behind can be measured in years of delayed discovery for diseases that are not adequately served by today’s therapeutics. This is not a problem exclusive to drug discovery; it also
AWS Quantum Computing·2026-10-21·Benchen Huang
No generated summary available for this entry.
overview
Original abstract
Quantum computers today are fragile: they lose their quantum state to noise and decoherence faster than a useful algorithm completes. Quantum error correction (QEC) makes longer computations possible by encoding each logical qubit across many physical qubits, so that errors can be detected and removed without disturbing the encoded information. In practice, QEC runs as a repeating cycle (see Fig. 1): in each round, the hardware measures a set of parity checks, called stabilizers, whose outcomes (the syndrome) reveal where errors have occurred without collapsing the logical state. A classical decoder then reads the syndrome, infers the most likely errors, and either records a correction to apply later or triggers a physical recovery. Figure 1 – The quantum error correction cycle. On the quantum hardware, (1) a logical qubit is stored across many physical qubits, and (2) each round of stabilizer (parity-check) measurements produces a syndrome. The syndrome passes to classical processing, where (3) a decoder infers the likely error and (4) issues a recovery command that is fed back to the hardware. The cycle repeats every round. The challenge is latency [1] (see our earlier post, A framework for quantum-classical integration decisions ). On today’s superconducting hardware, for instance, one round takes on the order of one microsecond. If the decoder cannot keep up with that rate, a processing backlog builds and stalls the computation. Popular decoders such as minimum-weight perfect matching (MWPM) [2], which infers the most likely errors by pairing up syndrome signals in a graph, grow more expensive as the quantum error-correcting code size gets larger. A pre-decoder eases this bottleneck with a fast first pass that clears the easy, high-confidence errors, leaving the full decoder a much smaller problem. This is where AI-based pre-decoders [3,4] come in, such as NVIDIA Ising Decoding . In this post we show how we trained NVIDIA Ising Decoding on AWS, how a range of ac
PRX Quantum
·2026-10-21
·Federico Belliardo et al.
·doi
No generated summary available for this entry.
overview
Quantum Science and Technology
·2026-10-21
·Marek Sokol et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract Claims of quantum advantage in machine learning often rest on classical comparators that lack the same features, on simulation alone, and on unreported hardware cost. QBioBench is a benchmark of quantum machine learning on peripheral biosignals that holds quantum and classical models to the same features and reports calibration and hardware cost. It comprises three clinical tasks, 12-lead ECG diagnosis (PTB-XL), single-lead apnea detection (Apnea-ECG), and wearable stress detection (WESAD), each reduced to six to eight shared dimensions. A factorial grid of projected and fidelity quantum kernels and variational classifiers is screened in noisy simulation, and the promoted configurations are evaluated in an exploratory study on an IBM Nighthawk r2 processor on the full test pools of 510 apnea minutes and 512 PTB-XL records. Every prediction is recovered from the device records, intervals resample recordings or patients, and classical baselines are trained on the same units and tested on the same executed inputs. No quantum model reaches its matched support vector machine in ROC-AUC on either primary task, and none is separably better in balanced accuracy. The angle-encoded fidelity and projected kernels reach ROC-AUC 0.697 and 0.693 on apnea, paired differences of $-0.127$ and $-0.119$ to the support vector machine, and both are classical by construction, since the entangling layer of the encoding cancels from the fidelity kernel and leaves closed-form local expectations in the projected kernel. A variational classifier comes closest, reaching 0.797 on apnea (difference $-0.012$, 95\% interval $[-0.052, +0.027]$), and falls to chance without its two-qubit gates. Test sets of the size that circuit budgets favour are unreliable, as random 80-minute subsets of the apnea pool give the fidelity kernel a central 95\% range of ROC-AUC from 0.589 to 0.797. Readout mitigation changed ROC-AUC by at most 0.015.
Quantum Science and Technology
·2026-10-21
·Weihua Xie, Vadim Oganesyan, Michael Kolodrubetz
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract Non-Hermitian quantum dynamics lie in an intermediate regime between unitary Hamiltonian dynamics and trace-preserving non-unitary open quantum system dynamics. Given differences in the noise tolerance of unitary and non-unitary dynamics, it is interesting to consider implementing non-Hermitian dynamics on a noisy quantum computer. In this paper, we do so for a non-Hermitian Ising Floquet model whose many-body dynamics gives rise to persistent temporal oscillations, a form of time crystallinity. In the simplest two qubit case that we consider, there is an infinitely longlived periodic steady state at certain fine-tuned points. Using a generalized Floquet analysis, we show that infinitely long-lived oscillations are generically lost for arbitrarily weak values of common types of noise and compute the corresponding damping rate; this result is confirmed numerically using IBM's Qiskit platform. We further show that the complex gaps responsible for oscillation damping are opened generically at first order in perturbation theory for any convex combination of depolarization, relaxation, and dephasing, establishing that no engineered mixture of these noise channels can stabilize the time-crystalline phase. Experiments on a real device (ibmq-lima) are consistent with rapid oscillation damping, though a significant mismatch between the manufacturer noise model and observed device behavior complicates quantitative comparison, illustrating the importance of rigorous analytical noise analysis.
npj Quantum Information
·2026-10-21
·Shota Yokoyama et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract Tracking the dynamics of a quantum system is conventionally achieved by monitoring the system continuously in time and filtering the information contained in measurement records via the causal quantum trajectory approach. However, in practical scenarios, there is often loss of information to the environment, leading to filtered states that are impure because of decoherence. If real-time tracking is not required, the lost information can be maximally extracted via acausal quantum state smoothing , which has been theoretically proven to better restore the system’s coherence (purity) than causal filtering. Interestingly, quantum state smoothing requires assumptions about how any lost quantum information (unobserved by the experimenter) was turned into classical information by the environment. In this work, we experimentally demonstrate smoothing scenarios, using an optical parametric oscillator and introducing ‘observed’ and ‘unobserved’ channels by splitting the output beam into two independent homodyne detectors. We achieve improvement in state purification of 10.3% ± 1.6%, squeezing restoration of 7.6% ± 2.6%, and show that smoothed states are better estimates of hidden true states than those from conventional filtering. The estimation techniques used in this paper are promising for many applications in quantum information that incorporate post-processing.
arXiv·2026-10-21·Edilberto O. Silva
No generated summary available for this entry.
overview
Original abstract
We study a finite-width two-dimensional quantum ring with a quadratic $d$-wave altermagnetic term, Tan--Inkson confinement, a perpendicular magnetic field, and independently tunable Aharonov--Bohm (AB) flux. The altermagnetic interaction mixes $m$ and $m\pm2$ angular channels while preserving their parity. Circular symmetry renders the crystal orientation spectrally irrelevant and makes the two spin blocks exactly isospectral. The resulting same-parity anticrossings are resolved at low filling, and multichannel mixing is found near the Fermi level of highly occupied rings. Independent converged calculations for $N_e=1400$ and $1800$ establish the reconstructed Fermi edge and magnetic response in a finite field window and the persistent current over a full AB flux period. The analytic conventional reference separates radial-subband depopulation (dHvA-type cycles) from finer finite-ring shell oscillations; we do not assign a global Fourier spectrum to unverified altermagnetic field scans. The few-electron thermal response is obtained from an exact fixed-particle-number canonical partition function, avoiding finite-system errors of a fixed-mean-number approximation. The circular model supports an equilibrium charge current but no persistent spin current.
arXiv·2026-10-21·Guilherme Adamatti Bridi, Franklin de Lima Marquezino, Andris Ambainis
No generated summary available for this entry.
overview
Original abstract
Problem structure is regarded as a key factor influencing the performance of the Quantum Approximate Optimization Algorithm (QAOA), yet it remains an informal notion without a precise mathematical characterization. In this work, we address this issue by identifying a mathematical object that captures problem structure as seen from the perspective of the target state amplitude in single-layer QAOA. Specifically, we show that this structure is encoded in a joint probability distribution induced by the unique coarsest partition of the computational basis, determined by problem cost values and mixer-dependent walk counts. The statistical dependence between these classes provides a means of quantifying the available problem structure and identifying necessary conditions for exponential amplification. To assess the extent to which this structure can translate into algorithmic performance, we establish a mean-max non-separation bound relating the parameter-averaged probability of measuring the target configuration to its variational maximum. For NPO-PB problems with polynomially many distinct mixer eigenvalues, these probabilities exhibit the same scaling up to polynomial factors. This allows us to characterize the exponential scaling of optimal amplitude amplification by analyzing the parameter-averaged probability without explicitly optimizing the variational parameters. We then derive an exact expression for the parameter-averaged probability as a matrix inner product involving two objects that separately encode the joint structural distribution and the mixer dynamics. This representation provides a framework for identifying the structural mechanisms governing the amplification of the target-state probability or its exponential suppression relative to the mixer capacity. We demonstrate these mechanisms through analytically tractable examples involving transverse field and Grover mixers.
arXiv·2026-10-21·Jan Gulla, Johannes Skaar
No generated summary available for this entry.
overview
Original abstract
We review what it means for a relativistic particle to be localized and argue that the most useful approach is through local measurement. This perspective ties localization directly to relativistic causality and measurable outcomes in spacetime. Strict localization in quantum field theory is formalized by states that give the same expectation value as vacuum for all local observables outside some spacetime region. With this formalism, single photons cannot be strictly localized, but coherent states can. The structure and interpretation of local observables and local operator algebras are discussed in connection with the Reeh-Schlieder theorem. Since probabilities of local measurement outcomes cannot vanish in vacuum, particle detection events must be phrased carefully. Key characteristics of strictly localized states are surveyed alongside concrete strategies for constructing them. The relationship between localization, causality, and on-demand sources is analyzed, finding that strictly localized states can represent localized, propagating information in quantum field theory. Explicit examples of localized photonic states are presented with an emphasis on quantum optics, including states that approximate single photons and (entangled) Bell states.
arXiv·2026-10-21·Haowei Shi et al.
No generated summary available for this entry.
overview
Original abstract
We propose distributed dual-comb spectroscopy, a quantum-enhanced sensing architecture that simultaneously exploits spatial- and spectral-domain entanglement to improve the extraction of global spectroscopic information across broadband frequency ranges. Our scheme consists of a network of Mach-Zehnder interferometers interrogating spatially separated samples, each driven by a classical frequency comb at the bright port. A single two-mode squeezed frequency comb is distributed through a passive beam-splitter array into $K$ entangled combs, establishing multipartite correlations across sensors while preserving intrinsic spectral entanglement. The protocol is compatible with both heterodyne detection and division detection, and enables parallel estimation of weighted-average absorption features over multiple frequency components. Compared with spatially separable quantum strategies requiring $K$ independently engineered nonclassical comb sources, our approach achieves enhanced signal-to-noise performance using only a single quantum resource distributed across the network. These results establish a scalable route toward broadband distributed quantum spectroscopy with simultaneous spatial and spectral advantage.
arXiv·2026-10-21·Jishad Kumar, Achilleas Lazarides, Tapio Ala-Nissila
No generated summary available for this entry.
overview
Original abstract
Coherence preservation and environmental renewal offer competing ways of controlling quantum memory and transport. We show that a seemingly natural protocol which exactly replaces the bath occupations while preserving arbitrary system--bath coherences need not correspond to a physical fermionic state. We instead construct a two-reservoir protocol with independent, number-conserving thermal attenuators, for which complete positivity and fermionic admissibility hold by construction. Physical attenuation necessarily modifies bath populations as well as cross correlations; the coherence control is not an independent hard-reset knob. Quadratic dynamics reduces the stroboscopic problem to an exact matrix fixed-point equation without a weak-coupling or Markov approximation. Analytically, coherence retention enhances the leading short-cycle transfer rate, including the complete-erasure limit; no general endpoint-vanishing theorem exists. An exact stationary continuity theorem forces the through-current to vanish whenever either reservoir is left entirely unrefreshed, although no analogous theorem suppresses it at complete erasure. For biased structured reservoirs, exact finite-chain calculations display distinct coherence-, current-, and signed energy-transfer operating points; a resolved high-retention boundary layer exposes strong finite-size sensitivity of the coherence peak. The model provides a microscopic, fermion-admissible benchmark for the interplay of reservoir coherence, particle transport, and energetic exchange.
arXiv·2026-10-21·Ian N. Hammock et al.
No generated summary available for this entry.
overview
Original abstract
Group IV color centers in diamond -- silicon, germanium, tin, and lead-vacancy centers -- are a promising platform for quantum networking. Typical Group-IV creation utilizes ion implantation during diamond growth that leaves the color centers with a broad depth distribution and damage-induced strain inhomogeneity. Deterministic placement and damage reduction in Group IV generation are essential for improving this platform. In this letter, we report on the localization of germanium-vacancy (GeV$^-$) to a $<$ 10 nm layer via the timed injection of GeH$_4$ during microwave plasma chemical vapor deposition. In this layer we have realized 17 ppm of Ge and a strain-free environment for the GeV$^-$. Subsequent electron irradiation and annealing have generated a sheet density of 0.12 GeV$^-$/$μ$m$^2$. The minimal damage from color center generation mitigates spectral inhomogeneity and allows spectral resolution of isotopic clusters, with the best cluster having an inhomogeneous distribution of 2.14 GHz and an average linewidth of $47 \pm 11$ MHz. Our study gives insight into formation dynamics of GeV$^-$ in delta-doped systems and estimates our vacancy to GeV$^-$ yield to be $\geq$ 90%, establishing an athermal nearest-neighbor formation model. We further characterized the spin $T_2^*$ and set a lower bound of 730 ns, limited by a paramagnetic defect.
arXiv·2026-10-21·Ao Chen et al.
No generated summary available for this entry.
overview
Original abstract
The two-dimensional Hubbard model was originally proposed as the minimal model of uniform $d$-wave superconductivity in the cuprate high-temperature superconductors, but recent calculations with relevant parameters in a realistic doping regime have often found other ground states. Further, uncertainty remains over such results due to the intrinsic bias of different computational methods. Here we address this uncertainty through state-of-the-art neural tensor network and neural backflow state simulations, enabled by large-scale GPU computation, that together reach an unprecedented variational accuracy on lattices with up to 1024 sites. At $1/8$ doping in the pure Hubbard model, as well as with next-nearest-neighbor hopping relevant to the hole-doped cuprates, we reveal a near degeneracy among a low-energy uniform $d$-wave state, superconducting stripes, and non-superconducting stripe states on the milli-$t$ energy scale. Our work rebalances the narrative that the Hubbard model supports a single dominant order in relevant parameter regimes towards a picture of extreme competition between stripes and superconductivity.
arXiv·2026-10-21·Filipa C. R. Peres et al.
No generated summary available for this entry.
overview
Original abstract
Pauli-based computation (PBC) is a measurement-based model of quantum computation that samples from output distributions of universal Clifford+$T$ circuits. Here, we provide a normal form (NF) that completely characterizes its adaptive and entanglement structures. These insights unify PBC with one-way quantum computing as dual or `time-reversed' counterparts. We use the NF to advance strategies for distributed computation and investigate magic-state injection rates. We also demonstrate an exponential improvement in the detection of unnecessary magic-state qubits, allowing their efficient removal. Our NF further enables ahead-of-time circuit compilation using PBC, reducing CNOT gate count and quantum memory of random quantum circuits on average by 50% and 40%, respectively, beating other state-of-the-art compilers.
arXiv·2026-10-21·Giacomo Fregona et al.
No generated summary available for this entry.
overview
Original abstract
Belief Propagation combined with Ordered Statistics Decoding (BP OSD) is an open-source decoding tool used widely within the community due to its versatility and ease of application to Quantum Low Density Parity Check (QLDPC) codes. However, the degeneracy of quantum codes has been observed to degrade the performance of BP OSD, particularly leading to error floors for low physical error rates. Here, we investigate the low-weight error configurations responsible for such failures in Bivariate Bicycle codes. We show that, at code capacity, BP OSD fails on errors whose weight is significantly smaller than d/2, arising from global symmetries of the decoding graph that prevent the convergence of parallel BP. Furthermore, our analysis reveals new pitfalls that can arise when analysing the performance of BP OSD in the rare events regime, such as loss of ergodicity in splitting methods and numerical instabilities in the decoder. We show how to mitigate these failure mechanisms by modifying the BP update rules and the decoder implementation, leading to substantial improvement in logical error rate.
arXiv·2026-10-21·Ryan Smith et al.
No generated summary available for this entry.
overview
Original abstract
The promise of efficiently solving classical optimisation problems on quantum computers is tantalizing. As many such problems can be mapped to approximating the ground state of spin-glasses, paradigmatic models for studying many-body localisation, it is natural to ask if some of the intuition coming from quantum statistical mechanics can help guide the construction of novel quantum optimisation algorithms. In this work, we discuss how continuous reverse quantum annealing crossing a many-body localisation transition can be accelerated by considering the density of Landau-Zener crossings as the system is quenched. We provide an interpretation of this behaviour in terms of an effective Fokker-Planck equation for the success probability of the algorithm. This interpretation suggests an improvement in the required annealing time as a function of the system size $N$, which goes from $\mathcal{O}({\rm poly}(N))$ to $\mathcal{O}(1)$ for reference states with non-vanishing energy density. We show that the continuous dynamics can be Trotterised with a number of steps that remains modest as system size increases, making it appealing for near-term devices. For the resulting circuit implementation, we provide a quantitative strategy for determining the parameters of the time-dependent Hamiltonian. We compare the performance of our digitised algorithm, which we call FRIO, against that of the QAOA for finding the ground state of spin-glass problems, in particular the SK model. The numerical results suggest that with suitably selected circuit parameters which can be efficiently found using thermalizing dynamics, FRIO almost always outperforms the conventional QAOA ansatz with pre-optimized angles.
arXiv·2026-10-21·Christos N. Gagatsos
No generated summary available for this entry.
overview
Original abstract
We consider the discrimination of two quantum channels acting on bosonic modes, with a probe state of fixed mean photon number and no ancilla. We prove that pure probes are optimal: for every mixed probe there is a pure probe with exactly the same mean photon number that performs at least as well. The result holds for arbitrary channels and for every figure of merit built from the Chernoff quantities $\Tr[ρ_1^sρ_2^{1-s}]$, including the quantum Chernoff exponent, as well as for the single-shot error probability. The proof relies on a decomposition of any state of mean photon number $\nb$ into pure states of mean photon number exactly $\nb$, which extends a matrix rank-one decomposition of Huang and Zhang to density operators of infinite rank.
arXiv·2026-10-21·Miles D. Gorman
No generated summary available for this entry.
overview
Original abstract
Fault-tolerant syndrome extraction is fundamental to stabilizer-code-based quantum error correction, yet existing general protocols incur substantial costs in either circuit depth or width. In this work, we design ancilla stabilizer states for a general transversal circuit to construct a family of fault-tolerant syndrome-extraction gadgets that interpolate between Shor and Steane syndrome extraction for any stabilizer code. The result is a configurable trade-off between circuit depth and width.
arXiv·2026-10-21·Vivan Bhatt et al.
No generated summary available for this entry.
overview
Original abstract
We study variational preparation of ground states and sector-resolved excited states in the $(1+1)$-dimensional lattice Gross-Neveu model. We construct fixed circuits preserving either total fermion number or every flavor number, and a problem-specific scalable-circuit adaptive variational quantum eigensolver (SC-ADAPT-VQE). Classical circuit benchmarks cover massless and massive systems through 30 qubits, using exact-diagonalization and tensor-network reference results. Imposing flavor-number conservation improves the achieved energies in the completed two-flavor comparisons. Selected massive fixed-ansatz benchmarks with one to four flavors have relative energy errors of approximately $1 \times 10^{-5}$ - $2 \times 10^{-4}$, smaller than the quoted literature errors where available, although discretizations and computational resources differ. The adaptive pool combines translated bulk and boundary-sensitive generators with an interaction-sensitive cross-flavor family. Selected massive SC-ADAPT benchmarks with one to three flavors have relative energy errors below $2.1 \times 10^{-3}$. For one flavor, matrix-product-state evaluations extend the transferred circuits to 60-400 qubits without target-side operator selection or parameter optimization, giving energy deviations of approximately $0.35\%$ - $1.76\%$ from density-matrix renormalization-group reference values at maximum bond dimension 256. At fixed flavor number, range caps, and append count, the adaptive construction has a precompilation local-factor count linear in volume and a volume-independent shared-parameter count; fixed-accuracy performance at arbitrary volumes remains unestablished. Sequential deflation also prepares low-lying states within a fixed flavor-number sector, with projector fidelities providing a basis-independent assessment of degenerate target eigenspaces.
arXiv·2026-10-21·Zuo Wang et al.
No generated summary available for this entry.
overview
Original abstract
Discrete time crystals exhibit robust subharmonic oscillations, spontaneously breaking the discrete time-translation symmetry of a periodic drive. Since their emergence, the question of whether other types of temporal many-body order can exist has attracted considerable attention. Here we identify discrete time liquids -- a new form of spatiotemporal order characterized by short-range temporal coherence as a result of time-solitons. We study a two-dimensional spin system coupled to a finite-temperature cavity, whose fluctuations provide a noisy, approximately periodic drive with only finite temporal coherence. Remarkably, the spins nevertheless form a metastable state with robust period-doubled dynamics over an extended parameter regime. Unlike a time crystal, this state has only finite temporal coherence: individual trajectories stochastically switch between the two symmetry-related temporal configurations of the period-doubled response. We identify these switches as time-solitons: topological defects in temporal order that preserve local period doubling while destroying long-range temporal coherence, thereby producing the time liquid state. We propose a minimal model which reproduces the distribution of temporal correlations of the many-body system, suggesting a general description of the time liquid as a time crystal with a finite density of time-solitons. Because these solitons can occur at arbitrary times, ensemble averaging restores continuous time-translation symmetry, raising the intriguing possibility that discrete time liquids can exist in thermal equilibrium.
arXiv·2026-10-21·Faith Oyedemi, Stefanie Czischek
No generated summary available for this entry.
overview
Original abstract
Numerically simulating quantum many-body systems is one of the central challenges in modern physics, as the exponential growth of the Hilbert space with system size renders large-scale exact solutions intractable. Over the past decade, generative artificial neural networks have emerged as powerful wave function ansätze that have powered advances in finding ground state representations, reconstructing quantum states from data, and modeling dynamics in quantum many-body systems. While recurrent neural networks (RNNs) are computationally efficient, the recurrent nature can limit their capacity to capture long-range correlations. Transformer models with their underlying self-attention mechanism excel at capturing these long-range correlations, but incur increased computational requirements, restricting applications to small physical systems. In this work, we address these limitations by exploring the multi-layer perceptron (MLP) mixer model as a wave function ansatz. By mixing information globally and locally through the system via a computationally lightweight mixing strategy, this architecture promises to combine the ability to capture long-range correlations with low computational costs. We benchmark the model on finding ground state representations of two-dimensional quantum many-body systems in various phases of matter and investigate the behavior of representational accuracy and computational efficiency for different physical system sizes. By comparing its performance to RNNs and transformer models with single-site and patched input definitions, we demonstrate that the MLP mixer architecture performs competitively with state-of-the-art network models. We further show that a hierarchical combination of this model with the transformer model outperforms other state-of-the-art architectures for large-scale quantum systems, opening new avenues for investigating quantum phases of matter.
arXiv·2026-10-21·Andreas Feuerpfeil et al.
No generated summary available for this entry.
overview
Original abstract
Field-theoretic analysis has predicted that the edge of a double quantum spin Hall insulator (DQSHI) can undergo an interaction-driven transition from a phase with fermionic edge modes into one with only bosonic modes. All single-fermion edge excitations are gapped in this bosonic edge phase, but fermion pairs remain gapless, leading to distinct experimental signatures. We numerically simulate the interacting DQSHI edge and verify the existence of the bosonic edge phase. This calculation requires an explicit bulk embedding of the DQSHI edge, due to its mixed anomaly between charge and $S^z$ conservation. We hence employ segment DMRG on an infinite two-dimensional cylinder, where the DQSHI bulk is modeled in terms of two copies of the spin-up lowest Landau level, combined with their time-reversed counterparts. We find that interactions can open a single-fermion gap at the DQSHI edge while fermion pairs remain gapless, matching the predictions for the bosonic edge phase. We find the scaling of the single-fermion gap with interaction strength to be consistent with field-theoretic calculations, and discuss the relevance of the bosonic edge phase to twisted homobilayers of WSe$_2$ and MoTe$_2$. We elaborate on the methodological extension of the segment geometry used here to other topological phases with edge anomalies.
arXiv·2026-10-21·Yunjia Bao et al.
No generated summary available for this entry.
overview
Original abstract
We provide a fully quantum-mechanical description of the continuous measurement of wavelike dark matter. Our focus is cavity haloscopes, although our results inform a broad range of axion searches. We extend the input-output formalism by treating the axion as a quantum field, finding how its quantum state is imprinted onto higher-order moments of observables of the outgoing transmission-line modes. We further develop a novel measurement-record formalism, which computes the joint probability distribution of all measurement outcomes and is well suited to studying the axion in the time domain. With it, we compute the exact axion-induced number distribution for the first time, demonstrating that it is not Poisson. We argue that virialized axion dark matter is expected to be in a Gaussian quantum state, and show that number or quadrature measurements can distinguish this from the predictions of a coherent state or even a Bose-Einstein condensate. Finally, we show that intrinsically quantum effects, such as those from Fock or squeezed axion states, are far too weak to detect.
arXiv·2026-10-21·Lei Zhang et al.
No generated summary available for this entry.
overview
Original abstract
AI agents are increasingly capable of constructing quantum algorithms and proofs, yet machine-checked proofs alone cannot guarantee that the intended problem is solved or that resource claims match the verified computation.Here we introduce Lean-QuantumAlg, a Lean 4 framework for trustworthy AI-assisted development of quantum algorithms.Its Algorithm-Solves-Problem contract binds correctness, success probability, borrowed-state restoration and quantum and classical resource bounds to a single execution, while separating the guarantees that Lean checks from the problem specifications and execution models that humans review. We demonstrate the framework on nine AI-formalized quantum algorithms, from Grover search to quantum attacks on RSA-2048 and P-256, with less than 1% of each algorithm's imported source code requiring statement-level human review once the shared framework has been audited. By integrating reusable mathematical foundations, certified algorithmic primitives and execution-grounded verification, Lean-QuantumAlg provides a basis for AI agents to construct and certify quantum algorithms, opening a path toward scalable AI-driven discovery of quantum algorithms.
arXiv·2026-10-21·Sunjun Hwang et al.
No generated summary available for this entry.
overview
Original abstract
Mechanical vibrations are fundamental to a wide range of physical phenomena and technologies, yet their ability to actively shape free-electron dynamics remains largely unexplored. Here we theoretically show how an optomechanical membrane provides a phonon-assisted optical interface for controlling free-electron recoil and sensing localized forces. Transverse membrane motion scatters cavity light into high-momentum evanescent sidebands that enable phase-matched interaction with electrons traveling in vacuum. Beyond supplying momentum for phase matching, the vibration amplitude controls the electron-light interaction strength and redistributes electron populations among recoil orders. External forces that perturb the vibration are thereby encoded in the electron recoil spectrum. Under the modeled conditions, electron readout of localized stochastic forces can yield a higher signal-to-noise ratio than a Gaussian optical homodyne benchmark at equal detected probe rates. These results provide a theoretical basis for mechanically reconfigurable free-electron optics and mode-selective mechanical sensing.
arXiv·2026-10-21·Matthew Kozma, Stephen Hughes
No generated summary available for this entry.
overview
Original abstract
A two-level emitter chirally coupled to a waveguide imprints a $π$ conditional phase on a two-photon pulse, a key component assumed in quantum photonic neural network architectures, but whether it survives the pure dephasing of a solid-state emitter is unknown, since no two-photon scattering treatment includes it. We derive the dephased two-photon amplitude in closed form and validate it against an independent Fock-state master equation. The conditional phase is pinned at exactly $π$ at every dephasing rate examined: dephasing destroys the amplitude carrying the nonlinear phase rather than rotating it. The one- and two-photon channels are not attenuated equally, so dephasing does not simply scale the node down but reweights it between photon-number sectors---an error no phase setting can train away. The standard factorization of two-photon correlators, exact for arbitrary loss, fails at first order in $γ_φ$, discarding $16$--$81\%$ of pairs over $γ_φ/γ=0.1$--$1$.
arXiv·2026-10-21·Valery, Grishin, Aryeh Lev Zabokritskiy
No generated summary available for this entry.
overview
Original abstract
We prove a conjecture of Yu, Lai, and Oh: their rounded family of strengthened quantum Hamming bounds, which interpolates between Hamming-type bounds and the Singleton bound, holds for arbitrary exact quantum subspaces of dimension $K>1$. The result covers every integer local dimension $p\ge2$, every integer $t\ge1$, both distances $2t+1$ and $2t+2$, and every interpolation parameter $e\in\{0,\ldots,t\}$. Yu, Lai, and Oh proved these bounds for pure codes and for general codes of distance three or four; the case $e=0$ contains the ordinary quantum Hamming bound for general codes, recently proved by Zhang and Chen. More generally, for $p\ge3$, we prove the inequality $Kf(0)\le p^n\mathbb{E}f(X)$, where $X\sim\operatorname{Bin}(n,1-p^{-2})$, for every real polynomial $f$ of degree at most $D$, with $2\le D<d$, that is nonnegative on $\{0,\ldots,n\}$ and positive at zero; here $n$ and $d$ are the code length and distance.
arXiv·2026-10-21·Joseph Sullivan, David Amaro, Michael A. Perlin
No generated summary available for this entry.
overview
Original abstract
We propose a quantum architecture that achieves addressable and parallel universal fault-tolerant logical in high-rate codes. The codes are obtained from the flexible concatenation of small-distance high-rate self-dual CSS codes. Addressable and parallel universal logic on the resulting $K$ logical qubits is injected by fault-tolerantly preparing and then consuming diverse logical $K$-qubit CSS stabilizer states and logical $\lvert H \rangle^{\otimes K}$ global magic states. Flag-at-origin is used to prepare the stabilizer resource states while a concatenated cultivation protocol prepares the global magic states. These resource states are consumed by Steane-QEC or Knill-QEC teleportation gadgets, which simultaneously perform quantum error correction. Any quantum algorithm with $T$-depth $D_T$ can be executed by consuming $12D_T$ or fewer resource states. We benchmark the fault-tolerant preparation of the resource states for several two-level concatenations of the $[[k+4,k,2]]$ H codes and the Hamming $[[15,7,3]]$ code. In particular, we find that the concatenated cultivation offers at least one order of magnitude spacetime reduction compared to cultivation in the surface code.
arXiv·2026-10-21·Vishnulal Cheriyodathillathu et al.
No generated summary available for this entry.
overview
Original abstract
We propose an operational resolution of the FLRW big bang singularity using quantum probes satisfying a curvature coupled Klein-Gordon equation. Applying the Madelung-Bohm decomposition of a Klein-Gordon field on a classical near-singularity FLRW background, we show that the induced conformal geometry renders curvature invariants finite and makes past directed causal geodesics complete. The classical big bang surface is therefore inaccessible to this class of quantum probes in finite effective proper time, while the underlying FLRW spacetime remains singular.
arXiv·2026-10-21·Nicolaus A. Chlanda et al.
No generated summary available for this entry.
overview
Original abstract
We introduce a random sampling method for testing the weak Eigenstate Thermalization Hypothesis (wETH) that is particularly useful for large, sparse Hamiltonians. We test the method on a well-studied Rydberg atom system that exhibits both two- and three-body dipole-dipole interactions. Our results show that our method allows for the study of system sizes significantly beyond the limits of exact diagonalization. We find that the fluctuations in eigenstate expectation values decay as the Hilbert space dimension $D^{-1/2}$, consistent with wETH and in agreement with previous numerical results.
arXiv·2026-10-21·Atharva Naik et al.
No generated summary available for this entry.
overview
Original abstract
A recent work considered the Page curve for entanglement entropy of a freely expanding one-dimensional Fermi gas starting from a finite box (the system) in a zero-temperature initial state that then expands in to a semi-infinite vacuum (the environment). For the case with a single defect at the system-environment junction, it was shown that the Yang-Yang entropy of the system computed from semiclassical hydrodynamics agrees with the microscopically computed entanglement entropy, yielding the Page curve. On the other hand, the environment Yang-Yang entropy showed a monotonic increase. Here, we propose a hydrodynamic description to obtain the eigenvalues of the microscopic correlation matrix for a nonzero temperature freely-expanding Fermi gas. For the system, the phase space density directly gives the correlation matrix eigenvalues and thus, via the Yang-Yang formula, yields the von-Neumann entropy. For the reservoir, a modification of the phase space density is required in the Yang-Yang formula, to incorporate coherences, in order to reproduce accurately the entropy. The hydrodynamic description of correlation matrix eigenvalues also leads to a Levitov-Lesovik type formula for the full-counting-statistics for a finite system in the transient regime. We provide a heuristic derivation of the correlation matrix eigenvalues based on a semiclassical wave-packet picture.
arXiv·2026-10-21·Chia-Hsien Huang, Hsi-Sheng Goan
No generated summary available for this entry.
overview
Original abstract
Fault-tolerant quantum computing requires quantum gates that combine short duration, high fidelity, and robustness to noise. As quantum processors scale, robustness becomes increasingly important because exhaustive characterization and frequent recalibration of individual gates become impractical. We present a comprehensive optimal-control framework for controlled-Z (CZ) gates between directly coupled, frequency-tunable transmons that systematically accounts for intrinsic Hamiltonian errors and realistic decoherence mechanisms, including energy relaxation and dephasing. Using smooth, single-shot flux pulses, we obtain 12-ns CZ gates---close to the theoretical speed limit of 11.6 ns---with intrinsic errors suppressed to the $2\times10^{-5}$ level. We construct dephasing noise models, calibrated against published experimental measurements, that capture fast dephasing from room-temperature control electronics and slow dephasing from $1/f$ flux noise. Using these models, we identify dephasing sweet spots that suppress sensitivity to dephasing noise. We further exploit transmon asymmetry as a design parameter to access distinct noise-resilient operating regimes. These results establish an experimentally applicable framework for balancing gate speed, fidelity, and noise robustness while reducing characterization and recalibration overhead.
arXiv·2026-10-21·Chengu Wang
No generated summary available for this entry.
overview
Original abstract
We prove that the randomized communication complexity of Vector-in-Subspace in $\mathbb R^n$ with error at most $1/3$ is $Θ(\sqrt n)$. Alice holds a unit vector $u$ and Bob holds an $n/2$-dimensional subspace $H$; they must distinguish $u\in H$ from $u\in H^\perp$. An exact one-way quantum protocol uses $O(\log n)$ qubits, making the problem a geometric example of an exponential quantum advantage over interactive classical communication. Our lower bound matches Raz's $O(\sqrt n)$ upper bound, improves the $Ω(n^{1/3})$ lower bound of Klartag and Regev, and removes the total-rank restriction in Grupel's $Ω(\sqrt n)$ result. The proof establishes a Gaussian moment bound over complete rectangle partitions. A complex Gaussian representation yields a vanishing even moment whose cancellation is preserved when averaging over the partition. We control the signed conditional moments around a real center by decomposing conditional Gaussian measures into fixed coordinates and sub-Gaussian components. Combining this estimate with spherical harmonic analysis gives the communication lower bound.
arXiv·2026-10-21·Chon-Fai Kam
No generated summary available for this entry.
overview
Original abstract
Majorana drew a symmetric multiqubit state as points on the Bloch sphere, antipodal to the zeros of its overlap with spin coherent states. Projecting only one qubit of a general state leaves the others in a state that varies with direction. Its entanglement invariants are eigenvalues of a non-Hermitian matrix and form bands over the sphere. Exceptional points appear, without gain or loss, where the entanglement family of the rest changes. Circling one exchanges two bands, so the bands form one Riemann surface. At five qubits it fixes the entanglement class up to finitely many choices.
arXiv·2026-10-21·Christoph I Westbrook
No generated summary available for this entry.
overview
Original abstract
I discuss two important quantum optics experiments which depend on two particle interference. In the years since their first demonstration many interesting and instructive variants have appeared, including the use of atoms instead of photons as the interfering particles. This chapter gives a pedagogical overview of some of these results and argues that the two effects are closely related.
arXiv·2026-10-21·Neereja M. Sundaresan et al.
No generated summary available for this entry.
overview
Original abstract
Modular quantum architecture requires long-distance quantum interconnects to stitch together individual processor modules. Such interconnects, long-distance couplers or L-couplers, must support coherent quantum operation over meter-scale distances and scale to multiple connections between any two modules. Here we demonstrate four L-couplers operating between two 120-qubit IBM Nighthawk R1 superconducting qubit processors. Each L-coupler joins two Nighthawk lattice qubits through two frequency-tunable L-qubits, two RF-SQUID based "i2m" couplers, and 80 cm of superconducting aluminum coax. Each cable installs perpendicular to the processor surface, to enable denser connections, and is joined to the chip by an indium-to-indium room temperature pressure bond made after both modules were mounted. L-coupler modes near 5 GHz, with internal quality factors of 0.86 to 1.09e6, carry relay-based state transfer at a mean network benchmarking fidelity of 99.00%, with a best link of 99.29 +/- 0.07%. We then realize distant CZ gates between lattice qubits in separate modules at a mean fidelity of 94.75%, with a best link of 96.42 +/- 0.28%, and use them to generate entangled states across the two processors, including a demonstration of simultaneous Bell pair generation using two adjacent L-couplers. These four high-fidelity L-couplers establish a practical path to scalable quantum interconnects for modular quantum computing.
arXiv·2026-10-21·A. Tofful et al.
No generated summary available for this entry.
overview
Original abstract
Two single-ion optical clocks, located in the United Kingdom and in Germany, are compared remotely via a 2220\,km long optical fiber link. Both clocks are based on the ${}^2S_{1/2} (F=0)\leftrightarrow {}^2F_{7/2} (F=3)$ electric octupole (E3) transition in $^{171}\text{Yb}^+$. Using more than $10^6$ seconds of measurement data, we determine a fractional frequency difference of $1.0(4.8)\times 10^{-18}$, demonstrating agreement of the independently developed systems. To our knowledge, this constitutes the first international clock comparison reaching a fractional uncertainty below $5\times 10^{-18}$, an important milestone towards an anticipated optical redefinition of the SI second. The measurement uncertainty is dominated by that of the relativistic redshift correction between the two sites, which includes time-varying gravity potential differences. We exploit the large baseline between the two clocks to search for violations of Lorentz invariance. In the absence of statistically significant modulations, we improve constraints on the Robertson-Mansouri-Sexl parameter $α$ by approximately a factor of five in the uncertainty, and provide limits on corresponding parameters within the Standard-Model Extension framework.
arXiv·2026-10-21·Xi He et al.
No generated summary available for this entry.
overview
Original abstract
We establish that transversal diagonal gates on exact qubit codes of distance at least two can be exhaustively classified within a finite search space. Although code-preserving physical gates can have continuous phases, any projective logical action induced by a transversal diagonal gate can always be realized by a physical gate of finite order. Crucially, we prove that this physical order has an upper bound determined solely by the code parameters. This order bound enables the subset-sum-linear-programming (SSLP) framework introduced in arXiv:2504.20847 to exhaustively enumerate all candidate discrete symmetries, after which the Knill-Laflamme equations determine the remaining continuous code parameters. Applying this method to the nontrivial diagonal sector of exact $((6,2,3))$ codes, SSLP yields $66$ candidate symmetry classes, of which exactly $15$ are realizable, supporting full projective diagonal logical cyclic groups of orders $2$, $3$, and $5$. In particular, for order $5$, the code is unique up to local unitaries and qubit permutations, equivalent to the code constructed in arXiv:2504.20847. This code also attains the minimum length $n=6$ among exact $((n, 2, \ge 3))$ codes whose full projective transversal group cannot be conjugated into the projective Clifford group.
arXiv·2026-10-21·Vitor Dallabona, Lucas Friedrich, Jonas Maziero
No generated summary available for this entry.
overview
Original abstract
Variational Quantum Algorithms (VQAs) are promising approaches for solving combinatorial optimization problems on near-term quantum devices. However, the role played by quantum resources such as entanglement and coherence during the optimization process remains poorly understood. In this work, we investigate the evolution of these resources in two VQAs--the Quantum Approximate Optimization Algorithm (QAOA) and the Feedback-based Algorithm for Quantum Optimization (FALQON)--applied to the Minimum Vertex Cover problem. We employ a variational resource-quantification framework based on the Bures metric and Uhlmann's theorem, in which an auxiliary quantum circuit is optimized to identify the closest resource-free states. This approach allows us to quantify Bures entanglement and Bures coherence of the algorithmic states without requiring full quantum state tomography. For the considered problem instance, QAOA exhibits a pronounced accumulation of entanglement in its initial layers, followed by a progressive reduction as the algorithm converges toward the optimal solution. Its coherence likewise decreases overall with increasing circuit depth, although a finite residual value persists due to the degeneracy of the optimal-solution subspace. In contrast, FALQON exhibits a substantially lower entanglement peak, reached at larger circuit depth, followed by a decay as convergence proceeds. Its coherence decreases smoothly and monotonically together with the optimization error. These results reveal distinct quantum-resource trajectories associated with the two optimization strategies and illustrate how entanglement and coherence evolve as variational quantum states approach solutions of a classical combinatorial optimization problem.
arXiv·2026-10-21·Boris Chesca et al.
No generated summary available for this entry.
overview
Original abstract
Impedance matching is a crucial feature of an amplifier used to increase its instantaneous bandwidth and is typically achieved using static LC resonators. Here we show an approach to impedance matching in parametric amplifiers using arrays of unequal Josephson-junction-based elements (rf/dc SQUIDs, SNAILs, etc). The elements act either as small-footprint flux-tunable inductors forming an impedance-matching circuit, or 'active' amplifier elements which result in amplifier gain. We develop an analytical theory describing these systems, predicting a quasi-non-periodic amplifier frequency and gain modulation with applied flux and the broadening of gain bandwidths. We demonstrate this in devices using arrays of flux-focused SNAILs where flux biasing varies across the array. We find instantaneous bandwidths of 200 MHz with $>$17 dB of gain centred at $\sim$5.4 GHz in a device without a static impedance matcher. This broadening of amplifier bandwidth is stable with $>$100 MHz bandwidth at 17 dB gain across $>$1.2 GHz tunable bandwidth. Our analytical model captures flux dependence and qualitatively reproduces gain-bandwidths giving confidence in our understanding of these systems and allowing operational figures of merit to be optimised in future devices.
arXiv·2026-10-21·Latu Kalita et al.
No generated summary available for this entry.
overview
Original abstract
The superconducting diode effect requires the forward and reverse bias currents to differ, a scenario achieved via inversion and time-reversal symmetries broken together. The latter, and the more crucial one, is inevitably achieved by a magnetic field. Here, we show that a spatio-temporally driven chemical potential of the form, $μ_j(t)=μ+V\cos(ωt+\kd j)$, achieves both at once. Applied to a helical Shiba chain, the drive transmutes a traveling Peierls phase via generating an odd-in-momentum term, equivalent to an imaginary next-nearest-neighbour Haldane-like hopping in real space. Remarkably, the protocol is spin-blind, which renders the time-reversal breaking via a synthetic gauge flux rather than an effective Zeeman field. The rectification is odd in the drive wavevector, with exact zeros at $\kd=nπ$ and an analytical optimum at $\kd=2π/3$. It is however, even in the exchange coupling, $J$ and persists even at $J=0$. Furthermore, the rectification scales inversely with the pair-breaking gap, yielding approximately $50\%$ rectification in the topological phase and $10\%$ in the trivial phase. Symmetry breaking is thus drive-controlled, allowing it to be switched on, tuned, and reversed without an external magnetic field.
arXiv·2026-10-21·Alberto Carlini et al.
No generated summary available for this entry.
overview
Original abstract
Teaching quantum mechanics at the secondary school level remains a major educational challenge. Traditional historical approaches often present the theory as a sequence of disconnected phenomena, requiring extensive prior knowledge of classical physics before students can appreciate the conceptual structure of quantum physics. In this work, we present the design, implementation, and evaluation of a curriculum based on the two state (qubit first) approach, in which the fundamental postulates of quantum mechanics are introduced through mathematically accessible two level systems and realized with light polarization. The curriculum integrates theoretical instruction, laboratory activities, a coherent progression grounded in the interactive simulations, and inquiry based learning into a coherent pathway that progresses from quantum states and superposition to entanglement and the experimental violation of Bell's inequalities. A distinctive feature of the project is the experimental realization of the violation of Bell's inequalities obtained in a newly established quantum optics laboratory in an Italian high school, where students performed, for the first time in Italy, an authentic Bell test using polarization-entangled photons. The same educational framework was adopted for in service teacher professional development courses. Learning outcomes were evaluated through mixed methods. Preliminary analysis indicates significant improvements in conceptual understanding, confidence in using mathematical formalism, and appreciation of the relationship between theory, experimentation, and the foundations of quantum mechanics. The proposed curriculum shows that two-state formalism and supported by real laboratory experiences enables secondary-school students to engage more meaningfully with both the conceptual foundations of quantum mechanics and their experimental verification.
arXiv·2026-10-21·E. Okon, D. Sudarsky, M. Wiedemann
No generated summary available for this entry.
overview
Original abstract
In quantum mechanics, conservation laws are usually understood only statistically and only in the context of unitary evolution: during such evolution, if an observable commutes with the Hamiltonian, its expectation value and Born-rule probability distribution remain unchanged. Individual measurement outcomes, however, disrupt even this weak form of statistical conservation. Recently, though, it has been argued that a stronger, non-statistical form of conservation, valid at the level of individual measurement outcomes, can be recovered. The proposal relies on the claim that any superposition of eigenstates of a conserved quantity must ultimately be prepared relative to another physical system, which serves as the relevant reference frame and remains correlated with the system being prepared. On this enlarged description, the change observed in the measured system is claimed to be exactly compensated by an opposite change in the preparer, thereby restoring conservation at the level of individual measurement outcomes. We analyze this proposal and argue that it faces significant conceptual difficulties. We show that the proposed mechanism is not adequately justified and, moreover, does not establish conservation in individual measurement outcomes as claimed.
arXiv·2026-10-21·Alexander D. Popov
No generated summary available for this entry.
overview
Original abstract
We show that the concept of particles and antiparticles is related to the Weyl-Heisenberg group $W\!H_3$. Its generators are the position operators $\hat x^a$, the momentum operators $\hat p_a$, and the central element $Q_{\sf{v}}$, which defines a subgroup U(1)$_{\sf v}$ of $W\!H_3$. We show that the wave functions have a charge relative to the group U(1)$_{\sf{v}}$ equal to either $q_+=1/\hbar$ (particle $ψ_+$) or $q_-=-1/\hbar$ (antiparticle $ψ_-$). We call these eigenvalues of the operator $Q_{\sf{v}}$ quantum charges: $Q_{\sf{v}}ψ_\pm^{}=q_\pm^{}ψ_\pm^{}$. The wave functions $ψ_+$ and $ψ_-$ belong to the Hilbert spaces $\mathcal{H}_+$ and $\mathcal{H}_-$, on which unitarily inequivalent representations $π_\hbar$ and $π_{-\hbar}$ of the Weyl-Heisenberg group $W\!H_3$ are defined. These representations are related to each other by the antilinear charge conjugation operator $\hat C$, which maps $\mathcal{H}_+, q_+$ to $\mathcal{H}_-, q_-$. Charges $q_\pm^{}$ are intrinsic characteristics of the wave functions $ψ_\pm^{}$, similar to spin and electric charge. The wave function possesses one of these charges, $q_+$ or $q_-$, prior to the specification of any equations. We show that negative probabilities/energies and the Klein paradox in Klein-Gordon and Dirac theories are consequences of the violation of U(1)$_{\sf v}$-invariance in these theories. Restoring this invariance separates particle and antiparticles and eliminates all paradoxes at the level of first-quantized relativistic theories.
arXiv·2026-10-21·G. X. A. Petronilo et al.
No generated summary available for this entry.
overview
Original abstract
Predicting molecular electronic structure using Quantum Computing approaches is a challenge in Computational Chemistry. Traditional Variational Quantum Eigensolvers (VQEs) are typically hindered by optimization challenges. The alternative Generative Quantum Eigensolver (GQE) mitigates this by reformulating ground-state search as discrete sequence generation, but its Transformer backbone suffers from quadratic computational complexity, bottlenecking scalability for larger molecules. To address this, we introduce the Mamba Quantum Eigensolver (Mamba-QE), which replaces the Transformer with a Selective State Space Model (SSM) to process operator sequences with linear $\mathcal{O}(L)$ complexity. Additionally, we integrate a distance-conditioned mechanism enabling the direct prediction of complete potential energy surfaces (PES). Evaluated on the $H_2$ molecule, Mamba-QE reproduces Full Configuration Interaction (FCI) reference energies well within chemical accuracy, achieving an energy error below $3\times10^{-6}$ Ha across 16 geometries with zero variational violations. Mamba-QE maintains high expressive power while establishing a robust, scalable foundation for quantum simulations of complex molecular systems.
arXiv·2026-10-21·Maarten Stroeks et al.
No generated summary available for this entry.
overview
Original abstract
We explore the space-time cost of encoding of a bosonic mode into a set of qubits via various encodings, and their resilience to noise. In particular, we compare the performance of the unary Fock state encoding, an unexplored encoding of Fock states into Dicke states (``Dicke'' encoding), and the binary quadrature encoding. We do so by considering a displacement as well as a simulation of a Dicke model, coupling a bosonic mode to a set of atoms represented as qubits. Using classical simulations, we assess the accuracy and optimized space-time costs in terms of number of qubits, circuit depth and CNOT count of a quantum simulation of the time dynamics using these encodings. Although our study is far from comprehensive, we find that the binary quadrature encoding is overall most favorable in terms of being very space-efficient and relatively time-efficient due to the use of the quantum Fourier transform. Our novel Dicke encoding leads to very shallow circuits, but pays in terms of using many more qubits. We probe the use of an H2-2 Quantinuum trapped-ion qubit device (56 qubits) for displacement and Dicke model simulation in the low boson-number regime, where we find that noise leads to visible deviations from ideal circuit dynamics.
arXiv·2026-10-21·John Zaris et al.
No generated summary available for this entry.
overview
Original abstract
Motional modes of trapped-ion crystals in Penning traps can now be cooled to near their ground states via electromagnetically induced transparency (EIT) cooling. Numerical simulations are valuable tools for interpreting EIT cooling results and optimizing experimental protocols, but existing molecular dynamics codes are limited to the simulation of Doppler cooling. In this work, we fill this gap by implementing a semiclassical model of EIT cooling in a novel MD code. By simultaneously evolving the ions' internal quantum states and classical motion, we are able to calculate the instantaneous EIT laser forces acting on the ions. We first validate our code by comparing the single-ion cooling rate to fully quantum simulation results. Next, we analyze cooling of the drumhead modes in planar ion crystals, quantifying the effects of planar ion motion and a finite laser beam width. Finally, we demonstrate efficient EIT cooling of the axial modes in 3D ellipsoidal crystals containing up to 500 ions. Such crystals are a promising platform for future quantum sensing experiments with enhanced sensitivity. We find that the mode spectra of 3D crystals can be engineered to enable sympathetic cooling of the low-frequency $\boldsymbol{E}\times\boldsymbol{B}$ modes. This numerical framework provides a powerful tool for modeling sub-Doppler cooling techniques and for optimizing future quantum sensing and quantum information experiments.
arXiv·2026-10-21·Francesco Buscemi
No generated summary available for this entry.
overview
Original abstract
The same classical f-divergence admits inequivalent extensions to quantum states. The question is whether these extensions can be obtained from a common operational variational principle. Here we generalize Matsumoto's reverse-test optimization by introducing a reference prior state. More explicitly, we minimize the statistical distinguishability between a forward and a reverse prepare-and-measure process, related by retrodiction through the chosen reference and subject to prescribed quantum averages. Distinguishability is quantified by the classical f-divergence between their complete records. For faithful states in finite dimension, we prove that the same spectral implementation attains the minimum simultaneously for every operator-convex f. Varying the reference allows us to interpolate between standard and maximal quantum f-divergences of the prescribed states, passing through the geodesic family. More precisely, a flat reference yields the standard quantum f-divergences, thereby giving the Nussbaum-Szkoła distributions a variational characterization as optimal records. Choosing either prescribed state as reference recovers maximal quantum f-divergences and Matsumoto's reverse tests, while power references realize the geodesic interpolation. In the relative-entropy case, this gives the passage from Umegaki to Belavkin-Staszewski relative entropy by changing the prior for retrodiction.
arXiv·2026-10-21·Benjamin A. Brereton et al.
No generated summary available for this entry.
overview
Original abstract
Combining topological insulators with chiral magnetic multilayers offers the opportunity to greatly enhance the spin-orbit torque (SOT) driven manipulation of hosted spin textures, however this also exposes devices to the often poor temperature stability of the commonly used, Bi$_2$X$_3$-based (X is a chalcogenic element), topological insulator films. In this work we demonstrate through in-situ-annealing and polarised neutron reflectometry that the multilayer at a Bi$_2$Se$_3$ interface remains magnetically robust up to a temperature of 350 $^{\circ}$C: even as the Bi$_2$Se$_3$ epilayer structurally deteriorates. Through x-ray photoemission electron microscopy, an intermediate annealing temperature of $\sim$ 200 $^{\circ}$C was found to improve the domain ordering of the multilayer, allowing for field-induced skyrmion nucleation, all whilst sustaining minimal damage to the topological insulator
arXiv·2026-10-21·Devki Nandan Jha et al.
No generated summary available for this entry.
overview
Original abstract
Quantum computing represents a fundamental shift in computation, promising to solve problems currently intractable for classical computers. However, misconceptions persist; quantum computers are not universally faster, nor do they replace classical systems. Current Noisy Intermediate-Scale Quantum (NISQ) devices face significant challenges, including decoherence, high error rates, and limited scalability. Additionally, leveraging quantum systems requires rethinking traditional computing principles, adopting different programming models, and addressing the complexities of integrating quantum and classical workflows, making their practical use in computer science both demanding and non-trivial. This article provides a system-level perspective on quantum computing for computer scientists, software engineers, and IT professionals, examining its current capabilities, key architectural and software challenges, and potential paths toward quantum advantage in real-world applications within hybrid quantum-classical environments.
arXiv·2026-10-21·Guang-Bao Xu et al.
No generated summary available for this entry.
overview
Original abstract
The local distinguishability of five bipartite and tripartite orthogonal product states (OPSs) has been effectively resolved, while that of five quadripartite OPSs has not yet been effectively addressed. In this paper, we give the local distinguishability of five quadripartite OPSs, where any two of these five states are orthogonal on exactly one subsystem. Based on the vectors of the numbers of pairwise orthogonality relations, we classify different sets of five quadripartite OPSs into nine categories, which correspond to 371 distinct orthogonality graphs. We show that the sets of five quadripartite OPSs corresponding to 355 of the 371 cases can be perfectly distinguished by local operations and classical communication (LOCC), whereas the sets of five quadripartite OPSs for the remaining 16 cases cannot exactly distinguished by LOCC. Our results enrich the theory of nonlocality for sets of OPSs.
arXiv·2026-10-21·V. K. Ivanov, D. A. Glazov, A. V. Volotka
No generated summary available for this entry.
overview
Original abstract
We apply a large Gaussian basis set of size up to $N = 500$ to calculate the all-order Wichmann-Kroll vacuum polarization correction in highly-charged ion. For a hydrogen-like system, this allows us to obtain an accurate correction value with a level of precision comparable to that of traditional methods. We demonstrate that values of effects that can be calculated as the difference between two quantities, such as the nuclear model correction, converge faster than the absolute value of the correction. We discuss the basis extrapolation methods and show their use in estimating the error due to incomplete convergence. Finally, we show an application of the Gaussian basis set to calculation of the vacuum polarization screening correction in lithium-like ions.
arXiv·2026-10-21·Sriganapathy Raghav, Utpal Roy
No generated summary available for this entry.
overview
Original abstract
We propose a quantum-enhanced matter-wave interferometry protocol based on fractional-revival dynamics of a Bose-Einstein condensate in a ring, combined with a controlled interaction quench. Using the Truncated Wigner Approximation, we show that nonlinear evolution to the quarter revival generates modest spin squeezing of $-2.03\pm0.28\;$dB, which subsequently degrades under further nonlinear evolution. In contrast, starting from a non-interacting condensate, a controlled interaction quench applied after the initial quarter-revival beam-splitter operation generates substantially stronger spin squeezing of $-14.57\pm0.27\;$dB. We further show that phase control at $t=3T_r/8$ rotates the squeezed quadrature onto the phase-sensitive direction $\hat{J}_y$, producing a phase-squeezed state at $t=T_r/2$. The subsequent quarter-revival evolution converts this phase-squeezed state into a number-squeezed state, enabling population-difference readout. The resulting sequence provides a route to quantum-enhanced interferometry using the intrinsic fractional-revival dynamics of a ring together with controlled interaction and phase operations.
arXiv·2026-10-21·Prashant Singh et al.
No generated summary available for this entry.
overview
Original abstract
We consider a continuous-time quantum walk stroboscopically subjected to projective measurements on two distinct targets with sampling time period $τ$. We construct a general renewal framework for the first-detection amplitude at each target, from which we obtain the associated splitting probabilities. For Hamiltonians with reflection symmetry, we further show that each dual-target first-detection amplitude can be viewed as an interference effect between a pair of single-target first-detection amplitudes. This formulation yields exact expressions for the splitting probabilities and gives special sampling times at which they undergo pointwise discontinuous jumps due to a form of ergodicity breaking associated with dark states. As an illustrative example, we apply the framework to a one-dimensional tight-binding lattice chain with nearest-neighbor hopping, and study the splitting probabilities as functions of the initial position and sampling time. Below a critical sampling time, $0<τ< τ_c$ where $τ_c = 2 π/ ΔE$ with $ΔE$ being the energy bandwidth, the splitting probabilities for large system sizes become equal to $1/2$, independent of the initial position, as long as this position does not coincide with target sites. Above the critical sampling time, $τ\geq τ_c$, the splitting probabilities deviate from $1/2$ and develop oscillations as a function of initial position. The wavenumber associated with these oscillations is $Q=2\sin^{-1}(rτ_c/τ)$, where $r$ is a positive integer. We also explore the effects of relative phase and spatial separation between different components of a coherent initial state on the splitting probabilities. Finally, we study how a finite number of measurements modifies the splitting probabilities and broadens the resonances at special sampling times.
arXiv·2026-10-21·Mathieu Bertrand et al.
No generated summary available for this entry.
overview
Original abstract
We describe a compact and simplified experimental setup for the production of ultracold strontium atoms. Thanks to its low-power oven and coil-free Zeeman slower design, the vacuum system has an overall length of only 40cm including oven, Zeeman slower and all-glass science cell. The oven has a power consumption of 14W at 460°C and produces a collimated flux of 3 10^10at/(s cm^2) at this temperature. The laser system employs master-slave laser architecture throughout and requires neither second-harmonic generation nor tapered amplifiers, reducing cost and complexity. The system has been in continuous use for more than a year.
arXiv·2026-10-21·Heng-Yu Di et al.
No generated summary available for this entry.
overview
Original abstract
Electron--electron interactions can reconstruct Bloch wave functions, changing their geometry and the associated thermoelectric response. We derive the linear thermoelectric response within the Hartree--Fock (HF) approximation using the thermal length-gauge density-matrix approach, resolving Drude, symmetric quantum-metric, and antisymmetric Berry-curvature contributions. In a noninteracting Bloch eigenbasis, we separate the reconstructed Berry connection into the noninteracting connection and an interaction connection. This gives bare, coherence, and interaction-connection contributions to the anomalous thermoelectric response. We determine the constraints imposed by spatial inversion, rotational, time-reversal, and combined symmetries on the three transport channels. In the relaxation-time approximation, the leading weak-broadening behavior is $Γ^{-1}$ for the Drude contribution, $Γ$ for the quantum-metric contribution, and $Γ^0$ for the Berry-curvature contribution. The interband scalings apply away from band degeneracies. Self-consistent calculations for the triangular-lattice extended Hubbard model illustrate how interactions generate Berry curvature and a quantum metric, change the symmetry of the system, and thereby contribute to transverse thermoelectric transport.
arXiv·2026-10-21·T. J. Osborne, B. Braunecker, H. F. Legg
No generated summary available for this entry.
overview
Original abstract
Nanoscale nonreciprocal elements are needed to control signal flow in scalable quantum technologies, but existing nonreciprocal components are often bulky. Here, we show that a strongly nonreciprocal current-voltage relation can arise entirely from coherent elastic scattering in a mesoscopic Rashba nanowire with gate-defined scatterers. We first identify the symmetry constraints that enforce reciprocal transmission in a phase coherent conductor even when inversion and time-reversal symmetry are broken. We then show how gates that are capacitively coupled to the leads, together with a magnetic scatterer or transverse subband mixing, can remove these constraints. In the weak-scattering regime, nonreciprocal conductance originates from interference between distinct backscattering paths. In the strong-scattering regime, nonreciprocity can be resonantly enhanced by the hybridization of the transmitting channel with bound states that arise from a higher transverse subband or spin-split band. In this regime, we find that a bias-induced change in the gate potentials of about one percent can produce an order-unity diode response, i.e., electrons are transmitted almost as in a clean wire for one bias polarity, whereas for the other polarity the current is strongly suppressed.
arXiv·2026-10-21·Shiroman Prakash, K. L. Ramya
No generated summary available for this entry.
overview
Original abstract
We construct short triorthogonal codes for qudits of odd prime dimension by generalizing doubling, which combines a triorthogonal code with a code admitting a transversal phase gate, and raises the distance by up to two. This gives codes with parameters $[[28,1,4]]_3$, $[[37,1,5]]_3$, $[[72,1,6]]_3$, $[[118,1,8]]_3$, $[[33,1,5]]_5$ and $[[20,1,4]]_7$, each shorter than the cyclic, concatenated and Reed-Muller codes of the same distance, and a doubling construction of the $[[15,1,3]]_3$ code. When the columns of a generator matrix are regarded as charged points, triorthogonality becomes the vanishing of multipole moments up to octupole order, and doubling becomes a double layer of opposite charges; this picture explains why inputs with nontrivial coefficients can give shorter codes. We also show by exhaustive search that the shortest codes of distance three have length $11$ for $p=5$ and length $7$ for $p=7$. Combined with high-rate distance-two codes, the new codes reduce the cost of qutrit magic state distillation by up to an order of magnitude in regimes with high input noise.
arXiv·2026-10-21·Mingxuan Liu, Pavel Sekatski, Valerio Scarani
No generated summary available for this entry.
overview
Original abstract
A recent formulation of quantum belief showed that quantum retrodiction depends not only on the reduced density operator of the system of interest, but also on correlations with a hidden reference system, which leads to the notion of quantum belief equivalence. In this paper we formulate a multi-shot problem, where the extended posterior obtained after one update is used again as the prior for the next update. We first define a formal notion of $n$-shot equivalence and derive several propositions for arbitrary extended beliefs. We then argue that the agent must also specify why the data obtained in different rounds concern the same underlying object. Through the quantum de Finetti representation, this narrows the one-copy belief to a special class: candidate-state ensemble belief. In that sector, we show that two beliefs are $n$-shot equivalent if and only if their $(n+1)$-th moments are equal. We also give a physical interpretation of this moment condition and illustrate it through the equivalence between Haar priors and projective-design priors at bounded update depth.
arXiv·2026-10-21·J. Alejandro de Sousa et al.
No generated summary available for this entry.
overview
Original abstract
Optically addressable electron spin qubits that function at room temperature and under ambient conditions are essential for advancing quantum sensing. Solid state defect platforms offer robust spin-photon interfaces but lack precise defect positioning and electronic tunability. Molecular spin qubits enable bottom up chemical design yet suffer from limited photostability. Here, we introduce para-halophenyl (-Cl, -Br and -I) quantum defects in (6,5) single wall carbon nanotubes that trap triplet excitons with a spin-photon interface that is operable under ambient, room temperature conditions. These defects were shown to emit in the near infrared within the biological transparency window, and their placement on the nanotube surface provides nanoscale proximity to target environments. The deep optical traps formed by the defects yield exceptional photostability. Here, we demonstrate optical initialization and readout of these triplet states at room temperature, provide proof of principle sensing of paramagnetic molecules, and highlight potential for on chip detection. Together, these results establish SWCNT defects as a promising new platform for future quantum sensing.
arXiv·2026-10-21·Chenghong Huang, Yuta Fujihashi, Akihito Ishizaki
No generated summary available for this entry.
overview
Original abstract
Coherent multidimensional spectroscopy probes interactions and dynamics of molecular systems through nonlinear optical signals. Quantum light excitation has been explored as a means of controlling these signals, raising the question of how excitation-light correlations affect the precision of molecular parameter estimation from the emitted signal. In this work, we show that photon-number correlations and two-photon coherence play distinct roles in encoding molecular information in the emitted rephasing signal. In the weak-emission regime and within the single Schmidt pair approximation, we derive a normally ordered information law in which the joint photon-number moment and the squared magnitude of the two-photon coherence weight the amplitude and phase sensitivities of the molecular response, respectively. For matched temporal modes and mean photon numbers in each input mode, two-mode squeezed vacuum enhances both weights relative to coherent excitation, whereas independent displaced squeezing preserves the amplitude weight but reduces the phase weight. The background population and its parameter dependence also affect the total quantum Fisher information, which therefore cannot be inferred from the coherent mean-field signal alone. We derive a leading-order bound on its enhancement over coherent excitation when the background population is nonnegative and common to the compared sources. These findings provide criteria for selecting excitation sources according to how the target molecular parameter affects the amplitude and phase of the response.
arXiv·2026-10-21·Kaisei Ohata et al.
No generated summary available for this entry.
overview
Original abstract
Controlling transition rates is a central objective across quantum optics, condensed-matter physics, and chemical physics, encompassing processes such as spontaneous emission, energy and charge transfer, spin relaxation, and chemical reactions. Although Fermi's golden rule provides a powerful framework for calculating such rates of weakly coupled transitions, conventional calculations require the interaction to be specified in advance; the range of rate responses attainable over a broader interaction space remains unknown. We formulate spectral-overlap golden-rule rates as quadratic forms of the interaction and derive rigorous bounds on rate modulation over a specified interaction space. As an example, application to energy transfer from a donor to a molecular vibration coupled to an optical cavity reveals that enhancement and suppression depend jointly on the interaction and cavity detuning, including continuous reversal of the rate response for a fixed interaction. The same approach may elucidate rate control for other golden-rule processes, including excitation-energy transfer, nonadiabatic electron transfer, nonradiative electronic transitions, vibrational and spin relaxation, and spontaneous emission.
arXiv·2026-10-21·Zi-Xuan Li, Xiao-Dong Li, Towe Wang
No generated summary available for this entry.
overview
Original abstract
This work revisits the debate on fractional uncertainty relations that arose a decade ago and tries to settle it. After a careful study of the position-momentum uncertainty product of the Lévy wave packet, a novel lower bound is proposed for uncertainty relations in fractional quantum mechanics. This bound is nearly linear in the Lévy index and is satisfied by exact, calculable solutions available in the literature.
arXiv·2026-10-21·Junke Han, Yonglong Li
No generated summary available for this entry.
overview
Original abstract
In this work, we investigate the convergence rate of the quantum Blahut-Arimoto (BA) algorithm proposed for computing the coherent information of less noisy quantum channels. Previous work established exponential convergence under certain restrictive assumptions on the channel. Using a Taylor expansion around a positive definite optimizer, we show that, for an injective degradable channel whose degrading channel has a relative-entropy contraction coefficient strictly less than one, the algorithm converges at an exponential rate after sufficiently many iterations. We further verify this condition for qubit amplitude-damping (AD) channels in the relevant parameter regime. In addition, by analyzing the Bogoliubov-Kubo-Mori (BKM) metric on the Bloch ball, we derive an explicit characterization of the relative-entropy contraction coefficient of qubit AD channels. The proposed approach is further extended to calculate the relative contraction coefficient and the relative expansion coefficient of two qubit AD channels.
arXiv·2026-10-21·Hengzhun Chen, Zhenning Cai
No generated summary available for this entry.
overview
Original abstract
We present an error-controlled framework for the quantum simulation of non-Markovian open-system dynamics in Gaussian environments. For a system coupled linearly to a Gaussian environment with zero mean, the bath's influence on the reduced dynamics is completely determined by its two-time correlation kernel. This allows us to replace the microscopic environment with an equivalent bath that has the same kernel. On a finite simulation interval, a rank-$N$ approximation of the kernel yields an effective bath of $N$ bosonic modes with time-dependent couplings to the system. To encode these modes in qubits, we first truncate each mode to its lowest $d$ occupation levels. When stronger couplings lead to large occupations, we introduce coupling dilution, which replaces each mode with several more weakly coupled copies while preserving the bath correlation kernel. This distributes excitations across more modes and trades additional modes for smaller local dimensions. We derive explicit reduced-state error bounds and establish polynomial circuit width and depth in simulation time and inverse accuracy under stated spectral-decay and coupling-regularity assumptions, provided elementary unitaries admit polynomial-cost implementations.
arXiv·2026-10-21·Bik-Soon Sia
No generated summary available for this entry.
overview
Original abstract
The Fröhlich-Pizzo (FP) model is a quantum-mechanical model originally developed to describe the interaction between an atom and the electromagnetic field in the nonrelativistic limit $c\to\infty$. We show that an adaptation of the FP model based on the local algebras of a $U(1)$ chiral current captures essential features of the horizon-induced decoherence mechanism identified by Danielson, Satishchandran, and Wald (DSW) in the limit of large holding time $T$. Our analysis suggests that the effective dynamics of the system undergoing decoherence in the DSW setting retains non-Markovian features. Our approach also offers a glimpse into the possible role of quantum events in the dynamics underlying horizon-induced decoherence.
arXiv·2026-10-21·Qi-Rong Wang et al.
No generated summary available for this entry.
overview
Original abstract
We investigate spin-resolved momentum distributions and phase vortices in multiphoton electron-positron pair production within a modified two-level model. This model retains the diagonal spinor inner-product terms neglected in the adiabatic approximation, thereby inducing spin-resolved transverse asymmetries in the momentum distribution. For a circularly polarized pulse, the handedness determines the winding direction of the quantized vortices, whereas for a linearly polarized pulse, the phase distribution exhibits nodal lines rather than quantized vortices. For two time-delayed circularly polarized pulses, the time delay introduces a relative phase that governs the multiphoton interference, which in turn drives the vortex evolution in each spin configuration. These results demonstrate that pulse polarization and time delay enable coherent control over vortex topology in pair production.
arXiv·2026-10-21·Bikashkali Midya, Barsa Rani Sahu
No generated summary available for this entry.
overview
Original abstract
We theoretically investigate the interplay of topology and localized non-Hermiticity in a finite Su-Schrieffer-Heeger chain characterized by non-Hermitian potentials at its boundaries. By tuning the boundary gain and loss parameters, we exploit the finite-size hybridization of two mid-gap topological edge states to analytically derive the exact coordinates of boundary-induced exceptional points (EPs), $Γ_{\rm EP}=\pm i v^{N}/w^{N-1}$, at which these states undergo coalescence. We demonstrate that dynamically encircling these boundary EPs facilitates a robust, chiral edge state-transfer protocol. Depending on the orientation of the encircling loop, this protocol allows a topological edge state localized at one boundary to be either transferred to the opposite edge with perfect fidelity or returned to its starting position through a double switching process. Importantly, since the non-Hermiticity remains strictly confined to the boundaries, this chiral transport occurs without affecting the energy spectrum of the bulk bands. These results establish a minimal framework for a large-scale topological chiral switch that is experimentally verifiable and capable of being controlled through boundary non-Hermitian driving.
arXiv·2026-10-21·Chikara Shinei
No generated summary available for this entry.
overview
Original abstract
Dense ensembles of nitrogen-vacancy (NV$^-$) centres in nitrogen-rich diamond dephase on the electron spins of the substitutional nitrogen (P1) centres. If the paramagnetic nitrogen is instead converted into NV$^-$ centres, the laser that initializes the sensor also pumps the bath into $m_s$ = 0, a state with no moment along its own axis. Using cluster-correlation-expansion (CCE) calculations, combined with an exact solver for probe-bath exchange and with no adjustable parameter, this paper asks whether such an optically polarized NV$^-$ bath dephases a sensor more slowly than a P1 bath of the same density. The answer is set by the field. In a field along [111], three quarters of the bath centres lie off the field axis, and the moment of their $m_s$ = 0 state along the field grows from 0.04 at 25 G to 0.46 at 300 G and 0.81 at 800 G. At 25 G the polarized bath is therefore nearly silent: at $10^{17}$ cm$^{-3}$ the dephasing time $T_2^*$ of a separately addressed $^{15}$NV$^-$ probe is 112 us, six times the 18.1 us of a P1 bath, and still 2.4 times at 90 % polarization; an ensemble measurement gains a factor of two. At 300 G the advantage over P1 shrinks to 1.4, and at 800 G the polarized bath dephases faster than P1. The field dependence of every bath, P1 included, follows the mean moment of its centres along the field. For the Hahn echo, exchange with on-axis bath centres and bath relaxation ($T_1$ = 6 ms) limit the gain to 1.2 times the P1 value at 25 G. Optical polarization of an NV$^-$ bath at low field therefore offers dephasing times beyond the P1 limit of nitrogen-rich diamond.
arXiv·2026-10-21·Hassan Khodaiemehr, Khadijeh Bagheri, Chen Feng
No generated summary available for this entry.
overview
Original abstract
A quantum computer could recover the key of any Ethereum account whose public key appears on chain. We prove that no sidechain or bridge that leaves Ethereum's rules unchanged can protect such accounts: their funds must move into a contract whose release condition relies only on quantum-safe primitives. We design \emph{PQ-Vault}, a custody system for unmodified Ethereum combining this vault, a quantum-safe proof-of-stake sidechain whose checkpoints carry compact certificates, and an optimistic dispute protocol. We give the first security proof of compact certificates against quantum attackers and a matching attack: with classically chosen parameters, the guarantee falls from 128 to about 60 bits, and a simple rule restores it. We show that a common seed-update rule in hash-chain proof of stake lets an attacker steer chosen slots and profit from splitting its stake, and give an election whose steering gain and inclusion delay are provably bounded against quantum attackers. Since compressing certificates with a pairing-based SNARK breaks quantum security, we use fraud proofs that need a single signature check. For 65,536 validators, a certificate is 0.8 MB, 260 times smaller than all signatures, and verifies in about 20 ms; the vault accepts a checkpoint for about 420,000 gas.
arXiv·2026-10-21·Wei-can Yang, Xiang-dong Xu, Cheng Li
No generated summary available for this entry.
overview
Original abstract
Kelvin waves carry energy along vortices, but their resonant interactions contain information that is absent from the linear spectrum. We identify a geometry that exposes this information on a vortex surface in four spatial dimensions. Perpendicular incoming waves cancel the complete local-area four-wave coupling, leaving the finite nonlocal interaction mediated by the surrounding fluid. This interaction restores conversion at generic wave-number ratios, yet changes sign and vanishes at a selected ratio while momentum and frequency remain exactly matched. Matching to Gross-Pitaevskii (GP) theory, including the microscopic core response, establishes a zero of the full coupling at every sufficiently small nonzero wave number, with ratio tending to $λ_*\simeq1.469$. Finite-grid GP coefficients exhibit a sign reversal for the same resonant quartets. Separate coherent-mixing calculations and weak-probe spectra connect the coupling sign to the generated-wave phase and the ordering of reflection-even and reflection-odd modes. The resulting suppression removes a leading channel for changing propagation directions without changing the paired wavelengths. These results isolate a nonlinear effect of the surrounding flow that local tension misses, providing a microscopic benchmark for vortex-wave theories and a starting point for studying angular redistribution beyond the Kelvin spectrum.
arXiv·2026-10-21·Vladimir E. Zobov, Ivan S. Pichkovskiy
No generated summary available for this entry.
overview
Original abstract
The solution of combinatorial optimization problems by means of quantum annealing is based on the preparation of an equally superposition state. Such superposition is crucial to the associative memory problem of correctly recalling patterns. In this paper, we study the alignment of the amplitudes of stored states in memory using the proposed auxiliary Hamiltonian, which is switched off at the end of evolution. The results of the algorithm execution were obtained both by numerical modeling and by the perturbation theory method, which made it possible to obtain the dependences on physical parameters in explicit form. As examples, systems of two and three qutrits, represented by spins S=1, are considered. Since the Hamiltonian is expressed in a univer-sal form through projectors onto states stored in memory, it can be used for other quantum sys-tems (platforms).
arXiv·2026-10-21·Hyong Keun Park et al.
No generated summary available for this entry.
overview
Original abstract
A circuit parameter can change measured features without changing their projected Gaussian kernel. We characterize this lost dependence and distinguish recovery by metric design from nonlinear feature expansion. With analytic feature coefficients, a fixed finite data basis affinely independent on the input domain, a fixed positive definite metric, and fixed bandwidth, the coefficient Gram matrix determines all-input kernel equivalence, global coordinate inactivity, and generic differential rank. An exact four-qubit family exhibits a sharp boundary: diagonal metrics give rank two, dense metrics reach but cannot exceed three, and no fixed affine expansion crosses this ceiling. One appended nonlinear scalar coordinate suffices for rank four and is minimal when the original features are retained. A single pairwise product achieves this with an explicit nondiagonal metric; a scalar sum of two products achieves it with a diagonal metric. Both use existing ideal local means. Exact certificates establish ranks in 54 selected circuit/readout settings. Matched finite-shot comparisons show that minimal representation size need not give the best sensitivity among the tested designs. Under a factorized measurement distribution, conditional product estimation cannot increase variance at a fixed design. Execution audits further separate kernel identifiability from compiled cost.
arXiv·2026-10-21·Ming Zhong et al.
No generated summary available for this entry.
overview
Original abstract
Selecting an effective quantum compiler configuration requires coordinated decisions over both hardware targets and compiler settings, with the ultimate goal of improving circuit execution fidelity. Existing SOTA approaches typically decompose this problem into two sequential stages: a device is chosen first, after which compiler options are tuned on that device through RL-based search. This bottom-up strategy can be fundamentally limited by its initial device decision, since a poorly matched backend may constrain the best fidelity achievable regardless of how effectively later compiler options are optimized. In contrast to classical compiler tuning, where the search space is often prohibitively large, the configuration space of quantum compilers remains manageable enough to support exhaustive search. Consequently, rather than repeatedly searching from candidate configurations, one can derive reusable configuration knowledge from offline oracle results and apply it directly to new circuits. In this paper, we introduce a top-down configuration-selection paradigm and build QuOPTBench, an exhaustively searched benchmark containing oracle configurations for 268 quantum circuits. We first study whether LLMs can directly infer suitable configurations and evaluate ten representative LLMs. The results reveal that vanilla LLMs remain far from the oracle. We then employ an LLM to extract transferable rules from sampled circuits governing configuration selection. Using these rules together with predictors trained on the enumerated configuration data of the sampled circuits, we design QuTOP, a rule-guided ML framework that performs fast configuration selection without iterative online search. Across our evaluation, the distilled rules consistently strengthen LLM-based selection, while QuTOP provides the strongest overall balance between solution quality and selection latency among the baselines.
arXiv·2026-10-21·Qi Liu, Xin-Yu Hao, Jing Liu
No generated summary available for this entry.
overview
Original abstract
Quantum Fisher information (QFI) is a fundamental quantity in quantum information and quantum mechanics, and evaluating it in various physical systems has become an important research topic. However, its evaluation in large systems still faces many challenges. Hereby we propose an ancilla-based protocol for evaluating the QFI of large systems and establish the conditions under which this protocol can ``perfectly'' evaluate the QFI in theory. As a demonstration, the protocol is applied to quantum circuits to evaluate the QFI of the Greenberger-Horne-Zeilinger state.
arXiv·2026-10-21·Xin Hong et al.
No generated summary available for this entry.
overview
Original abstract
Quantum circuit optimization is a key step toward the efficient execution of quantum algorithms. Template matching has emerged as one of the dominant approaches for simplifying quantum circuits, yet it confronts the intrinsic challenge of accommodating gate commutativity. The state-of-the-art template-matching algorithm relies on a directed acyclic graph (DAG) representation. While this DAG-based technique handles gate commutativity satisfactorily, it fails to preserve the local connectivity inherent to quantum circuits, thereby leading to relatively high matching complexity. In this paper, we introduce a hypergraph representation (HG), a commutativity-aware representation that collapses commuting gates into a single super-node while retaining all local connectivity. This enables matches to be extended locally without revisiting the rest of the circuit, with incremental updates limited to the immediate neighborhood. Experimental results demonstrate that our HG matcher achieves 11--606x speed-up over the DAG-based implementation in Qiskit (Iten et al., 2022) on both random and arithmetic benchmarks, while maintaining the same optimization quality. The acceleration increases with circuit size, confirming that preserving locality and connectivity is the key to scalable quantum circuit optimisation.
arXiv·2026-10-21·Paul Menczel, Kay Brandner
No generated summary available for this entry.
overview
Original abstract
We derive sufficient criteria that guarantee convergence of open quantum system dynamics to a unique long-time state independent of the initial conditions. We refer to this behavior as complete relaxation. Focusing on systems described by Gorini-Kossakowski-Sudarshan-Lindblad (GKSL) master equations on finite-dimensional Hilbert spaces, our approach uses only elementary mathematical arguments. For autonomous systems, we recover three previously derived relaxation criteria, which can be expressed as algebraic conditions on the Lindblad operators and the Hamiltonian entering the GKSL equation. For periodically driven systems, we obtain a new criterion involving a similar algebraic condition and a local continuity requirement on the time-dependent GKSL generator. This result implies an earlier criterion for complete relaxation formulated in Ref. [J. Phys. A 52, 43LT01 (2019)]. We also discuss implications of our approach for periodically modulated classical master equations, as well as extensions to driven systems without a periodicity constraint.
arXiv·2026-10-21·Jiyun Lee et al.
No generated summary available for this entry.
overview
Original abstract
A ligand can adopt multiple conformations within the same binding site, and these conformations can interact differently with the surrounding protein. Multiconformer modeling must therefore determine which candidate conformations to retain and what occupancies to assign to them. An established automated approach uses mixed-integer quadratic programming (MIQP) with hard occupancy and conformer-count limits for this selection. Here, we reformulated conformer selection as a quadratic unconstrained binary optimization (QUBO) problem with finite penalties and discrete occupancies. We solved the QUBO using a quantum-classical hybrid solver. We compared this workflow with the MIQP-based qFit-ligand workflow across 83 paired X-ray ligand entries using the same experimental inputs and the same qFit-ligand processing protocol. For each entry, both final models were evaluated against the same composite-omit map generated from the common input structure before the two workflows diverged. Quantum-qFit produced higher ligand-region real-space correlation coefficients (RSCC) in 62 entries 74.7% and lower occupancy-weighted torsional strain in 66 entries 79.5%. Similar directional trends remained in the 28 entries with matched final conformer counts. The molecular Electron Density for Individual Atoms score (EDIAm) decreased in most entries. This result shows that higher regional map agreement did not necessarily correspond to stronger atom-level density support. Overall, the results show that the conformer-selection formulation can change which ligand states are represented from the same experimental data and provide a QUBO framework for studying multiconformer ligand selection.
arXiv·2026-10-21·Haruki Nakayama et al.
No generated summary available for this entry.
overview
Original abstract
Quantum Multi-Programming (QMP) enables the simultaneous execution of quantum circuits from multiple users on a single quantum chip in cloud quantum computing services. However, QMP is vulnerable to crosstalk attacks, in which a malicious user deliberately induces crosstalk to disrupt other users' computations. As a countermeasure, prior work has proposed the use of buffer qubits, which remain idle and are allocated between quantum circuits to suppress the effect of crosstalk. Nevertheless, to the best of our knowledge, such countermeasures have not been publicly reported in production quantum cloud software. In this paper, we extend the QMP of OQTOPUS, open-source software that is already in production use for operating real quantum computers, with a buffer-qubit-based circuit allocation method. Experiments on a real device characterize the attack effect in terms of energy relaxation and dephasing, showing that observable degradation appears in dephasing characteristics of qubits adjacent to the attacker circuit. Based on this result, we release the proposed method as part of OQTOPUS and confirm that the buffer qubits are correctly reserved around the allocated circuits.
arXiv·2026-10-21·Masaru Hitomi, Masayuki Ohzeki
No generated summary available for this entry.
overview
Original abstract
Reaching a degenerate ground-state manifold and sampling it uniformly are distinct properties of a quantum annealer. We quantify this distinction using an Ising ring with additional couplings between maximally separated sites. For antiferromagnetic benchmark couplings and $N \geq 5$, we derive the exact ground-state energy, degeneracy, and defect structure for each congruence class of $N$ modulo four. This classification separates ground-state hit probability from conditional sampling bias. We embed instances with up to 162 logical spins on a D-Wave Advantage processor using length-two chains and compare its output with simulated annealing on the embedded and logical problems. For a frustrated $N=83$ instance, the processor visits 164 of the 166 exact ground states, yet the conditional distributions over states and defect sectors remain nonuniform. For $N=160$, the processor has a larger ground-state hit probability than logical simulated annealing (0.869 versus 0.519), but also a larger total-variation distance from uniformity (0.317 versus 0.136). A pause during the anneal raises the ground-state hit probability from 0.42 to 0.86 without restoring uniform sampling. These results identify a relaxation window and demonstrate that optimization success and sampling quality need not improve together, providing an exactly characterized benchmark for open-system quantum annealing.
Quantum Computing Report·2026-10-20·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Taiyi Quantum, a Shanghai-based quantum hardware developer, has secured over ¥1 billion RMB (approx. $149.6M USD) in cumulative funding within nine months of its founding, achieving unicorn valuation status. The company specializes in Ytterbium neutral-atom arrays for fault-tolerant quantum computing and has made significant progress in hardware integration and open-sourced its LUOSHU compiler. The post Taiyi Quantum Surpasses ¥1 Billion RMB ($149.6M+ USD) in Cumulative Funding for Ytterbium Neutral-Atom Systems appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-20·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Vietnamese quantum expert Nguyen Luong Quang recommends closer EU partnerships to develop Vietnam’s quantum workforce, research infrastructure and industrial capabilities. His proposal identifies joint training, remote access to European quantum computers and participation in software, optical component and specialized chip supply chains. The recommendations build on broader EU–Vietnam cooperation but do not constitute an approved quantum agreement or funding commitment. Vietnam should make European partnerships a central part of its quantum technology development, using joint research, specialist training and access to computing infrastructure to build domestic capabilities, a Vietnamese expert has proposed. Nguyen Luong Quang, a member of the Vietnam Quantum Technology Network , or VNQuantum , outlined the approach in an interview with the Vietnam News Agency’s Brussels correspondent, according to VietnamNet Global . His recommendations would connect Vietnam’s emerging quantum sector more closely with European research institutions and technology businesses. The proposal comes as Hanoi and Brussels deepen their political and scientific relationship. The two sides upgraded relations to a Comprehensive Strategic Partnership in January, creating a broader framework for cooperation. In May, the European Commission and Vietnam’s Ministry of Science and Technology signed a letter of intent to strengthen research and innovation ties . The agreement aims to expand researcher exchanges, knowledge sharing and connections among universities, startups, industry and public institutions, according to the commission. Those arrangements provide a potential foundation, or framework for the deeper quantum cooperation that Quang advocates. Quang recommended closer ties with France, Germany, the Netherlands, Finland and Spain, including postgraduate training and pilot applications in banking, energy and cybersecurity. Connecting domestic laboratories with remotely acces
The Quantum Insider·2026-10-20·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Finland’s Coherence Quantum raised €2.78 million in seed funding to develop cryogenic signalling and control infrastructure for scaling solid-state quantum computers. The Aalto University spinout is developing signal conditioning and higher-density interfaces to manage wiring, heat and noise as qubit counts increase. Lifeline Ventures led the round, with participation from Mårten Mickos , to fund an Espoo laboratory, product prototypes, manufacturing development, research and hiring. Image: Coherence Quantum founding team. (Provided) PRESS RELEASE — Coherence Quantum , a Finnish quantum hardware company originating from Aalto University’ s Quantum Computing and Devices (QCD) group, has raised €2.78 million in seed funding to develop a new approach to the cryogenic infrastructure surrounding solid-state quantum processors. The €2.78 million round is led by Helsinki-based early-stage investor Lifeline Ventures , with participation from technology entrepreneur Mårten Mickos . Quantum computers are being developed to tackle calculations that are beyond the practical reach of today’s computers, with potential applications ranging from discovering new materials and medicines to modelling complex physical systems. Reaching that point will require machines with far more usable qubits than today’s systems. But adding more qubits creates another scaling problem: everything needed to control them. As quantum processors grow, more control and readout signals need to reach the quantum processing unit (QPU). Conventional approaches require more wiring and signal-conditioning hardware inside a system with very limited space and cooling power. At the same time, the qubit environment has to remain protected from thermal noise and other disturbances that can affect performance. Coherence Quantum is developing an integrated cryogenic signalling and control platform to address this scaling challenge. Its first technologies focus on cryogenic signal conditioning, hel
Phys.org Quantum Physics·2026-10-20
No generated summary available for this entry.
overview
Original abstract
For scientists, breakthroughs often stem from unexpected turns. A research team led by Oscar Dahlsten, an associate professor in the Department of Physics at City University of Hong Kong (CityUHK), set out to prove a theoretical limitation, only to discover a quantum solution. The finding breaks traditional physical constraints and introduces a strategy for harvesting energy from fluctuating sources.
The Quantum Insider·2026-10-20·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Postquant Labs has launched its Quip Virtual Machine (QVM) on the Aglais testnet, providing a shared programming and execution environment for quantum and classical computing systems. The QVM supports a constraint-based programming language, a compute-credit pricing model and a verification system for results, while researchers at Monash University , the University of Notre Dame and Purdue University assess the platform. In a demonstration at Quantum.Tech World, the QVM ran 1,930 portfolio optimization comparisons in which its quantum solver matched or outperformed the classical solver under the company’s stated evaluation criteria, with both typically returning results in 0.1 to 0.3 seconds. PRESS RELEASE — Postquant Labs , developer of the quantum computing marketplace quip.network , has launched its Quip Virtual Machine (QVM) and first quantum smart contracts. The QVM is live today on the Aglais testnet at aglais.quip.network and provides a shared programming and execution environment for quantum and classical computing, with support for the leading quantum hardware platforms. Researchers from Monash University , the University of Notre Dame , and Purdue University are currently assessing the QVM, while SiC Systems is exploring the QVM’s potential to address complex industrial optimization problems, including applications in AI-driven manufacturing and the design, control and operation of chemical and biological processes. In a live demonstration at Quantum.Tech world, the QVM ran 1,930 head-to-head portfolio optimization races between quantum and classical solvers, using problems created by around 100 visitors. Results within 0.5% of each other were treated as ties. The quantum solver matched or beat the classical solver in every race, and in every race where the results differed by more than 0.5%, the quantum solver produced the better portfolio, by a median of 2.56%. Both solvers typically returned answers in 0.1 to
The Quantum Insider·2026-10-20·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Monarch Quantum is supplying integrated photonics hardware to support Infleqtion ‘s work on NASA’s Quantum Gravity Gradiometer Pathfinder mission, backed by a $20 million follow-on contract. The mission, led by NASA’s Jet Propulsion Laboratory, aims to demonstrate a space-based quantum gravity gradient sensor, with the next phase focused on hardware development and testing. The technology could inform future gravity-mapping systems that measure changes in groundwater, ice, natural resources and other geophysical conditions, with instrument development targeting a 2030 launch. PRESS RELEASE — Monarch Quantum extends congratulations to Infleqtion on receiving the $20 million NASA follow-on contract supporting the Quantum Gravity Gradiometer Pathfinder (QGGPf). Led by NASA’s Jet Propulsion Laboratory in Southern California, the mission is anticipated to demonstrate the world’s first space-based Earth quantum gravity gradient sensor. The award advances the mission into its next phase of hardware development and testing. Monarch Quantum supports Infleqtion ‘s efforts on the mission by supplying integrated photonics hardware that delivers precise, stable light required to meet the performance of the sensor. “NASA’s continued investment in this pathfinder mission validates the progress being made to move quantum sensing beyond the laboratory and into demanding operational environments,” said Tim Day, Chief Executive Officer and Chairman of Monarch Quantum . “Space-qualified quantum systems require exceptional systems engineering paired with reliability and precision. We are proud to support Infleqtion and NASA in advancing the photonics subsystems needed to make this mission possible.” QGGPf is designed to demonstrate quantum sensor technologies that could inform future gravity-mapping instruments in low-Earth orbit. By measuring subtle variations in Earth’s gravitational field, fut
The Quantum Insider·2026-10-20·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Project Eleven and Relm Insurance have partnered to explore how post-quantum security controls could inform digital asset insurance underwriting and risk assessments. Relm will advise on Strongpoint, Project Eleven ‘s institutional custody product, with a focus on key exposure, signing systems, transaction approvals, migration readiness and third-party dependencies. The collaboration is exploratory, and any future effects on insurance underwriting or premiums will require further evaluation and remain subject to Relm’s independent underwriting processes. PRESS RELEASE — Project Eleven , the post-quantum security company for digital assets, today announced Relm Insurance as a development partner for Strongpoint , its flagship institutional custody product. The collaboration will explore how an institution’s post-quantum security controls could be evaluated within digital asset insurance underwriting, helping both companies better understand how quantum readiness may influence future assessments of digital asset risk. As quantum computing advances, a sufficiently powerful machine could derive private keys from exposed public keys and compromise digital assets. Institutions need custody infrastructure capable of adapting its cryptography before such a machine becomes available. Strongpoint is built for that transition. The platform combines classical and post-quantum signing and separates institutional controls from the cryptography layer, enabling institutions to replace signing algorithms while preserving approval rules and audit history. “Every institution holding digital assets will eventually need to prepare for post-quantum cryptography. The open question is whether that transition happens on the institution’s schedule or under pressure,” said Alex Pruden, CEO and Co-Founder of Project Eleven . “Insurance plays a critical role in how markets assess and manage risk. We believe there is an opportun
The Quantum Insider·2026-10-20·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Bechtle will provide the German Aerospace Center’s Quantum Computing Initiative with cloud access to IQM ’s superconducting quantum computers until June 2027, expanding its research resources and technology portfolio. The agreement enables application teams to develop and run quantum algorithms and compare superconducting systems with other quantum computing technologies. Bechtle will manage platform accounts and support, while a dedicated classical server at IQM ’s Munich data center will support hybrid quantum and classical workloads. PRESS RELEASE — Under a new framework agreement, Bechtle is providing German Aerospace Center ’s Quantum Computing Initiative (DLR QCI) with cloud-based computing time on quantum systems from IQM Quantum Computers. This expands the DLR QCI’s quantum computing resources for its application teams, complements its existing technology portfolio, and creates additional opportunities for comparison with quantum systems already in place. The IQM Resonance cloud platform supports efficient use through seamless user and group management and provides the foundation for planning, developing, running, and managing quantum algorithms across the entire development process. “ Our offering combines technological excellence with the flexibility that benefits the DLR QCI in its quantum computing applications. This is how we support the customer in expanding its research infrastructure, while also strengthening the technological sovereignty of Germany and Europe in international competition, ” says Christian Behma, Managing Director of Bechtle IT System House Bonn. The DLR QCI brings together start-ups, industry, research, and the public sector in a strong ecosystem for sovereign, competitive quantum computing. To this end, it commissions companies to develop quantum computers, quantum algorithms, and relevant use cases. The focus is on practical application scenarios, for example in materials research, aerospace, mobility, and secu
Quantum Computing Report·2026-10-20·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Quminex, a Quebec-based exploration technology startup, has successfully raised $1.5 million CAD (approximately $1.06 million USD) in pre-seed funding. This investment, led by Quantacet and QAI Ventures, will accelerate the commercial development and field deployment of its proprietary Quminex Discovery Platform™. The platform aims to modernize mineral discovery by using machine learning and high-performance computing to transform geological data into explainable mineral system models. The post Quminex Raises $1.5M CAD ($1.06M USD) Pre-Seed Round Led by Quantacet and QAI Ventures to Advance Mineral Discovery Platform appeared first on Quantum Computing Report .
Phys.org Quantum Physics·2026-10-20
No generated summary available for this entry.
overview
Original abstract
For nearly a century, physicists have relied on the Born rule to calculate the chances of different outcomes when they measure a quantum system. Yet despite decades of effort, nobody has managed to derive the rule from more basic mathematical principles without making assumptions about probability along the way.
Phys.org Quantum Physics·2026-10-20
No generated summary available for this entry.
overview
Original abstract
Light is one of the most powerful tools scientists have for probing matter. By interacting with electrons, light reveals how atoms, molecules and materials are structured and how they evolve in time. Highly energetic ultraviolet and X-ray photons are particularly attractive because they can access electrons located close to atomic nuclei, where each chemical element carries its own distinctive electronic fingerprint.
The Quantum Insider·2026-10-20·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Arqit Quantum has made a strategic investment in Sirius Computer to support the development of quantum-safe communications for defence, government and national security users. The companies are developing Crux, a software-based connectivity platform that combines Sirius’s secure networking technology with Arqit ’s Sovereign Key Platform and NetworkSecure adaptors. The investment will support product development and integration, while the companies pursue secure networking opportunities with NATO member countries, the UK Ministry of Defence and the US Department of Defense. PRESS RELEASE — Arqit Quantum Inc. (NASDAQ: ARQQ), a global leader in quantum-safe encryption helping safeguard sensitive information from current and future cyber threats, today announced a strategic investment in Sirius Computer, Inc., a technology provider of secure computing and networking solutions for defence, intelligence and critical national infrastructure. This will accelerate the development and delivery of quantum-safe communications for defence, government and national security users. The investment builds on an existing partnership that combines Sirius’s secure networking technology with Arqit ’s Sovereign Key Platform (SKP) and NetworkSecure adaptors to deliver Crux, a software-based connectivity platform. The companies’ joint offering protects sensitive communications across devices and networks, helping defence users share information securely in deployed environments, and when operating alongside allied forces. The software-based offering is designed to run on commercial devices and work alongside existing infrastructure, enabling users to extend secure communications without replacing their underlying networks. Applications include mobile devices, cloud and network systems, autonomous platforms such as Uncrewed Autonomous Vehicles (UAVs) and their associated control systems. The strategic investment will support the continued development of Crux and Sir
Phys.org Quantum Physics·2026-10-20
No generated summary available for this entry.
overview
Original abstract
Transmitting electricity without losing any energy may sound impossible, yet this is precisely the promise of superconductivity. For nearly 40 years, scientists have been working to understand materials that exhibit this remarkable property at relatively high temperatures. Unlocking their secrets could one day help make power grids more efficient, enhance medical technologies and support the development of quantum computing.
Phys.org Quantum Physics·2026-10-20
No generated summary available for this entry.
overview
Original abstract
Tiny atoms and molecules are constantly bombarding each other all around us. While we regularly measure the large-scale effects of these interactions, measuring the effect of each individual collision is far more difficult. But now, researchers have managed to measure how tiny gas particles affect a single silica particle in the lab. In their new study, published in Physical Review Letters, the team describes how they detected the momentum transfers of individual collisions of gas particles with a nanoparticle levitated in laser light.
The Quantum Insider·2026-10-20·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Alice & Bob reported Phase 1 PROQCIMA results demonstrating core components of its cat-qubit error-correction architecture on three hardware demonstrators. Tests included protected CNOT gates, repeated error-correction cycles and a non-Clifford gate, but the measured logical error rate remained above the error-correction threshold. A digital twin identified longer, more consistent qubit coherence as a priority, while automated monitoring software tracked performance and recalibration needs. PRESS RELEASE — – Alice & Bob , a leader in fault-tolerant quantum computing, today shares a summary of results from Phase 1 of PROQCIMA , the French government’s quantum computing programme. Led by the French Defense Innovation Agency (AID) and the Direction générale de l’Armement, PROQCIMA aims to develop two prototypes of universal quantum computers, each capable of supporting 1,000 logical qubits, ready for industrialisation by 2032. The programme is structured as a 10-year competition: three candidates will continue after the first four years, with two ultimately selected to continue beyond year eight. Five companies were selected to participate: Alice & Bob , Pasqal , Quandela , Quobly and C12 . The first phase of the programme was designed to assess the technical and industrial feasibility of each company’s approach. Each candidate was required to demonstrate the expected level of technological maturity, including through the development and testing of its technology on real hardware. Alice & Bob began work on Phase 1 of PROQCIMA in 2024, committing to build an integrated multi-block demonstrator with partial functional validation to demonstrate the core operations of its error-correction architecture on real hardware. Alice & Bob has delivered on that commitment. The company assembled and operated three independent demonstrators, two on 6-qubit chips and one on a 12-qubit chip. The team demonstrated each building block o
The Quantum Insider·2026-10-20·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief The BIRD Foundation has approved $7.4 million in conditional grants for seven joint U.S.-Israel R&D projects, with total investment expected to reach $20 million, including private-sector funding. The selected projects cover quantum computing, satellite communications, semiconductor memory, AI-driven cancer detection, precision agriculture, digital pathology and medical 3D printing. The quantum computing project pairs Israel’s Qarakal Quantum with U.S.-based Quantum Elements to develop a minimum viable product for mapping complex surface-catalysis reactions using quantum computing. PRESS RELEASE — In September 2026, the Board of Governors of the Israel-U.S. Binational Industrial Research and Development ( BIRD ) Foundation approved $7.4 million in conditional grants for seven joint R&D projects between U.S. and Israeli companies. Including private-sector investment, total investment in the projects is expected to reach $20 million. The BIRD Foundation supports strategic collaborations between U.S. and Israeli companies to jointly develop innovative products and technologies for global markets. In addition to providing conditional grants of up to $1.5 million per project, the Foundation helps companies identify suitable partners and build cross-border collaborations. Projects submitted to BIRD are evaluated by BIRD staff and by expert reviewers appointed by the National Institute of Standards and Technology (NIST) of the U.S. Department of Commerce, and by the Israel Innovation Authority. The seven newly approved projects bring the total number of BIRD -supported collaborations to more than 1,200 since the Foundation’s establishment in 1977. To date, BIRD has invested approximately $470 million in joint projects, helping generate more than $10 billion in direct and indirect revenue. The newly approved projects are: Ibex Medical Analytics (Tel Aviv, Israel) and Proscia (Philadelphia, PA) will develop an AI-based precision oncolo
The Quantum Insider·2026-10-20·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief A NowSecure analysis of 136,711 iOS and Android apps found that 96.9% contained no detectable post-quantum cryptography (PQC)-related code or libraries. The analysis also identified weak encryption algorithms in more than 3,100 mobile apps, pointing to existing cryptographic weaknesses alongside future quantum-related risks. NowSecure recommends that organizations inventory cryptography in first- and third-party mobile apps, remediate vulnerable implementations and retest applications as part of a planned PQC migration. PRESS RELEASE — NowSecure today released an analysis, conducted with NowSecure Platform, of 136,711 iOS and Android apps. It found that 97% contain no detectable post-quantum cryptography (PQC), the new generation of encryption standards designed to withstand attacks from quantum computers. Even among the most popular U.S. apps, fewer than 1 in 10 showed quantum-safe code. Security teams often leave mobile apps out of their cryptographic inventories, and organizations cannot migrate what they have not inventoried. The risk does not wait for quantum computers. Using runtime testing, NowSecure flagged weak encryption algorithms in more than 3,100 Android and iOS apps during the same study. These checks detect legacy algorithms such as DES and RC4. The findings highlight the need to address existing encryption weaknesses while identifying and migrating public-key cryptography vulnerable to future quantum attacks. Q-Day Is Close, and Migration Takes Years According to Gartner®, Q-Day is “the moment that state actors obtain a cryptographically relevant quantum computer (CRQC),” and “Q-Day arrives as soon as 2029, but most progress on PQC migration so far is inadequate.”¹ Gartner warns that such capabilities “threaten widely used public-key cryptography” and says the business risks include “harvest now, decrypt later”.¹ Because mobile applications transmit sensitive data over diverse public cellular and roaming n
Quantum
·2026-10-20
·Dor Elimelech, Arda Aydin, Alexander Barg
·doi
No generated summary available for this entry.
overview
Original abstract
We study the error-correction properties of multi-mode Fock-state codes under amplitude-damping (AD) noise, focusing on the asymptotic regime in which the total excitation of the code states grows without limit and the number of photon losses induced by the noise scales linearly with it. In this setting, existing code families, which correct only sublinearly many photon losses, do not protect against amplitude-damping (AD) noise with a constant loss parameter. As our main result, we address this gap by constructing asymptotically good Fock-state codes relying on random classical codes in the discrete simplex. Unlike many standard constructions of random quantum codes, our construction introduces randomness through the underlying classical indexing structure. Randomization also enables another desirable feature: bounded per-mode occupancy, which limits the number of photons in any individual mode and thereby increases the coherence lifetime of the code states. Finally, via a relation between Fock-state codes and permutation-invariant codes, our results also yield asymptotically good families of qudit permutation-invariant codes as well as codes in monolithic nuclear state spaces.
Quantum
·2026-10-20
·Matthias C. Caro et al.
·doi
No generated summary available for this entry.
overview
Original abstract
We consider the problem of testing and learning from data in the presence of resource constraints, such as limited memory or weak data access, which place limitations on the efficiency and feasibility of testing or learning. In particular, we ask the following question: Could a resource-constrained learner/tester use interaction with a resource-unconstrained but untrusted party to solve a learning or testing problem more efficiently than they could without such an interaction? In this work, we answer this question both abstractly and for concrete problems, in two complementary ways: For a wide variety of scenarios, we prove that a resource-constrained learner cannot gain any advantage through classical interaction with an untrusted prover. As a special case, we show that for the vast majority of testing and learning problems in which quantum memory is a meaningful resource, a memory-constrained quantum algorithm cannot overcome its limitations via classical communication with a memory-unconstrained quantum prover. In contrast, when quantum communication is allowed, we construct a variety of interactive proof protocols, for specific learning and testing problems, which allow memory-constrained quantum verifiers to gain significant advantages through delegation to untrusted provers. These results highlight both the limitations and potential of delegating learning and testing problems to resource-rich but untrusted third parties.
Quantum
·2026-10-20
·Gereon KoÃmann, René Schwonnek
·doi
No generated summary available for this entry.
overview
Original abstract
We introduce a numerical framework for reliably estimating conditional von Neumann entropies, a central quantity in device-independent quantum cryptography and randomness generation. Our method is based on semidefinite relaxations derived from the Navascués--Pironio--Acín hierarchy and provides entropy bounds directly from observed statistics, assuming only the validity of quantum mechanics. The approach builds on a recent integral representation of entropy and substantially improves efficiency: it requires about half as many support variables as existing methods, while allowing these variables to be chosen projectively, leading to a significant reduction in runtime. These advances enable the practical certification of randomness and security even in noisy conditions, while integrating seamlessly with modern entropy accumulation theorems. Consequently, our framework becomes a versatile tool for quantum cryptographic protocols, broadening the possibilities for secure communication in untrusted environments.
PRX Quantum
·2026-10-20
·Z. M. McIntyre, Daniel Loss
·doi
No generated summary available for this entry.
overview
PRX Quantum
·2026-10-20
·W. K. Yam et al.
·doi
No generated summary available for this entry.
overview
PRX Quantum
·2026-10-20
·Ammar Ali et al.
·doi
No generated summary available for this entry.
overview
arXiv·2026-10-20·Zhiyao Li
No generated summary available for this entry.
overview
Original abstract
Matter under extreme conditions behaves as a non-equilibrium, strongly-interacting quantum system. Such systems are in the non-perturbative regime of quantum chromodynamics (QCD), where their time evolution is classically intractable. Quantum computing offers a promising alternative, but present-day devices are limited in qubit count and circuit depth, so efficient formulations and algorithms are key to scaling toward experimentally relevant QCD simulations. A scalable framework is established for simulating energy loss and hadronization in 1+1-dimensional SU(2) lattice gauge theory, in which a heavy quark traverses a lattice of light quarks. Classical lattice QCD methods are translated into physics-informed circuits to prepare the interacting ground state. The evolution is run on IBM's quantum processor ibm_pittsburgh, where the charge distribution and energy loss are measured. A further study develops the quantum simulation of the fully gauge-fixed SU(2) Hamiltonian in a mixed basis, a formulation that is expected to remain efficient at all gauge couplings. Digitizing the continuous gauge fields with as few as three qubits per plaquette reproduces low-energy observables with $10^{-3}$ precision. Scaling to larger systems is limited by resource overhead, which motivates truncations that preserve the relevant observables. Sequency Hierarchy Truncation (SeqHT) exploits the hierarchy in basis-operator contributions. Demonstrated on the adiabatic preparation of the $λφ^4$ ground state on ibm_sherbrooke, SeqHT reduces circuit depth by ~30%, suppressing hardware noise in the extracted observables. All simulations in this dissertation are validated on quantum hardware against classical benchmarks. These studies advance quantum simulations of real-time QCD dynamics.
arXiv·2026-10-20·Md Khalid Syfullah, Alvi Ataur Khalil
No generated summary available for this entry.
overview
Original abstract
As quantum computing moves from the noisy intermediate-scale quantum (NISQ) era toward early fault-tolerant quantum computing (EFTQC), quantum-enhanced AI is shifting from a conceptual idea to experimental research. Quantum components are expected to extend the capabilities of existing AI systems, yet it remains unclear how such components will help within large multimodal models. In this study, we try to answer that question for vision-language models (VLMs) using classically simulated quantum layers. With LLaVA-OneVision as the backbone, we evaluate 4- and 8-qubit basic-ring and strongly entangling circuits at four insertion and four replacement locations. Insertion adds quantum layers to the classical model, while replacement substitutes them for classical components. Using the same setup, we compare performance and computational cost between classical and quantum-classical hybrid models. On the Visual Spatial Reasoning dataset, inserting a quantum layer after the visual projector reaches 80.7% development accuracy, 2.28 percentage-points above classical full fine-tuning. Replacing the final decoder feed-forward sublayer retains 79.22% accuracy with 13.07 million fewer trainable parameters. Quantum insertion can thus improve accuracy, and selective replacement can reduce parameters. These benefits depend strongly on where the quantum layer is inserted or which classical component it replaces: earlier replacements lower accuracy, and fewer parameters do not reliably shorten training or reduce computation. To assess potential security benefits, we evaluated the robustness of quantum-classical hybrid models under six attack settings. Overall, our study maps where quantum layers help and hurt within VLMs, offering a starting point for hybrid VLM design; whether these gains generalize remains open. The code is available at https://github.com/TITANS-Lab-Artifacts/QuantumVLM.
arXiv·2026-10-20·Tali Braester et al.
No generated summary available for this entry.
overview
Original abstract
This paper studies quantum spin systems: networks of spins coupled by local interactions. The Lieb-Robinson bound predicts that in these systems, information propagates at an essentially finite speed. We produce a new proof of this result. Our approach relies on a spectral bound on entries of resolvents of band matrices, the Combes-Thomas estimate, rather than on the standard path-counting argument.
arXiv·2026-10-20·Salman Beigi, Hami Mehrabi
No generated summary available for this entry.
overview
Original abstract
We develop a method for deriving Gaussian optimality results for bosonic quantum systems from inequalities for qubit systems. Inspired by Gross's derivation of the Gaussian logarithmic Sobolev inequality from an inequality on the two-point space, we use qubits as quantum two-point spaces and lift bosonic Weyl operators to pseudo-Weyl operators on large qubit systems. By controlling weighted norms and relative entropy in the fluctuation limit, we establish two transfer theorems that convert tensorized qubit inequalities into inequalities for bosonic Gaussian channels. As a first application, we prove that the sharp $2$-logarithmic Sobolev inequality for the bosonic Ornstein--Uhlenbeck semigroup tensorizes without loss in the constant. We also establish a sharp output entropy inequality for tensor powers of a class of qubit channels. This includes a quantum Mrs.~Gerber's lemma determining the minimum output entropy of tensor powers of the qubit depolarizing channel at fixed input entropy. Applying our relative entropy transfer theorem, we obtain multimode constrained minimum output entropy bounds for Gaussian additive-noise channels and thermal attenuators in the heating range.
arXiv·2026-10-20·Stefano Markidis, Luca Pennati, Ivy Peng
No generated summary available for this entry.
overview
Original abstract
We design and optimize a quantum error correction (QEC) decoder for NVIDIA GPUs, combining Relay belief propagation, a state-of-the-art message-passing algorithm, with order-zero ordered statistics post-processing. Our implementation uses CUDA Graphs to control GPU execution, stops updates for converged samples, and collects unresolved samples in queues for post-processing. We optimize sparse traversal through coalesced message accesses, prefetching, and register reuse, and accelerate binary post-processing with warp-level collectives. In addition, mixed FP16-FP32 arithmetic and INT8 quantization reduce message storage and traffic while retaining accuracy using accumulators at higher precision. We evaluate surface, hypergraph product, and bivariate bicycle code workloads on NVIDIA A100 and GH200 data-center GPUs and a commodity RTX 5080. On the bivariate bicycle code at error probability 0.003, INT8 halves amortized decoding time relative to independently tuned FP32 with a negligible logical error rate increase on RTX 5080. With independent syndrome batches submitted back-to-back to concurrent decoder instances, RTX 5080 delivers 91% of GH200's highest measured throughput with an 8.9x shorter median submission-to-correction latency. The combination of performance optimization, mixed precision, INT8 quantization, and concurrent decoder instances opens a path toward QEC decoder clusters built from commodity GPUs.
arXiv·2026-10-20·Yiyou Chen, Gabriele Herr, Herschel Rabitz
No generated summary available for this entry.
overview
Original abstract
Gradient-based algorithms are often applied to identify an optimal control for maximizing a quantum objective functional by following a steepest ascent path to the top of the control landscape. In contrast, this paper explores straight shots through control space where movement along such a path corresponds to a less demanding monotonic complete climb up the landscape for the optimal objective value. Existing studies of control landscapes have revealed the presence of straight shots, but identifying them required computationally intensive stochastic methods. In this paper, we introduce a non-stochastic straight-shot search algorithm (STSA) that identifies a large class of straight shots. We apply STSA to numerically generate more than 10,000 distinct straight-shot optimization paths and analyze their statistical distribution for each of the objectives of (i) state-to-state transitions, (ii) general observables, and (iii) unitary transformation generation. The results show a decrease in the nearest-neighbor distances among straight shots as the sample size increases, suggesting their prevalence in control space. We further conjecture that the starting locations of the straight-shot pathways on a landscape level set may form connected neighborhoods, motivating future investigation into their underlying topological structure. The present paper focuses on the use of STSA for locating massive numbers of straight solutions. However, the STSA is not a high-efficiency algorithm in its present form, but the discovered prevalence of control straight shots leaves open future advances to accelerate the discovery of straight shots as optimal controls.
arXiv·2026-10-20·Jun-Hyung Bae, Alexei Andreanov, Saurabh Maiti
No generated summary available for this entry.
overview
Original abstract
Systems with flat bands are interesting as they potentially host many exotic quantum phenomena that would be hard to observe in usual systems with dispersive bands. Multiple approaches were developed to construct flat band systems, with most of them requiring fine-tuning and/or solving a challenging inverse-eigenvalue problem. In this article we work with an idea that uses a parent bipartite system to generate a family of flat bands by means of Hilbert space projections. This method is largely free from fine-tuning constraints and allows us to identify conditions for a Hamiltonian to guarantee flat bands at desired energies, with desired degree of degeneracy. We also show that one can control the touching points of the flat band with dispersive bands at any desirable point in the Brillouin zone. In the process, we identify perturbations that preserve the flat bands or split them controllably. This approach provides easy tunability in designing flat band systems with desired properties.
arXiv·2026-10-20·V. I. Gerasimenko
No generated summary available for this entry.
overview
Original abstract
The article outlines key topics related to deriving kinetic equations and, in general, to the relationship between the evolution equations governing quantum many-particle systems. The main issues being considered are the mathematical origin of quantum kinetic equations, novel methods for deriving kinetic equations from hierarchies of evolution equations for quantum systems, specifically focusing on kinetics within the framework of the evolution of observables, and the generalization of the quantum kinetic equation specified by non-separable initial states.
arXiv·2026-10-20·Manuel S. Rudolph et al.
No generated summary available for this entry.
overview
Original abstract
Performant classical tools for simulating quantum circuits are important for benchmarking and supporting upcoming quantum devices. Pauli propagation offers promising capabilities, but deep circuits usually cause a rapid growth in the number of Pauli strings and can quickly exhaust the available memory. In this work, we introduce a randomized protocol that combines a specialized resampling schedule, merging, and a controlled amount of bias to keep the propagating Pauli sum within any prescribed memory budget. Additional computational resources can then be spent on embarrassingly parallel repetitions that systematically improve the estimate. Building on the open-source library PauliPropagation.jl, we show that 1) increasing memory of each simulation reduces the error systematically more than outside averaging, 2) resampling just enough to apply the next gate delays variance accumulation and gives better error-per-time trade-offs than more aggressive resampling, and 3) a small, controlled bias is crucial in cutting down variance and pushing far beyond unbiased randomization. The resulting framework can reproduce deterministic calculations while requiring several orders of magnitude less memory.
arXiv·2026-10-20·Jia-Long Zhang, Wen Huang
No generated summary available for this entry.
overview
Original abstract
Determining the symmetry of the Cooper pairing in superconductors is a central challenge in condensed matter physics. Time-reversal symmetry breaking (TRSB) is among the most distinctive symmetry-breaking pattern of a superconductor. An important subset of TRSB pairing states, including the topological $p_x+ip_y$ pairing, is expected to exhibit the optical anomalous Hall effect. However, the microscopic ingredients that enable the Hall response and their underlying organizing principle in clean superconductors remain unelucidated. Here, we develop a unified theory for TRSB multiband superconductors possessing inversion symmetry, and establish their intrinsic optical Hall response as fundamentally a quantum-geometric phenomenon. We distinguish unitary and nonunitary TRSB states. Diagrammatically, we identify two classes of processes: single-electron tunneling and Cooper-pair tunneling. Both involve at least one interband tunneling event driven by the interband velocity-which is closely tied to the interband Berry connection. We rigorously prove that interband pairing is a prerequisite for unitary states to generate intrinsic Hall response, whereas it is not absolutely needed for nonunitary states. In nonunitary states with intraband pairing alone, the Hall effect can arise through single-electron tunneling, provided spin-orbit coupling is present. An effective theory obtained by integrating out the hole degrees of freedom reproduces these results and shows how pairing may endow electrons with effective Berry curvature. Finally, through symmetry analysis, we show that intrinsic resonances near the superconducting gap edge are allowed in nonunitary states but forbidden in unitary states. Our work thus establishes quantum geometry as a unifying principle for the intrinsic Hall response in superconductors and provides a guide for distinguishing different candidate TRSB pairings.
arXiv·2026-10-20·Lingxian Kong et al.
No generated summary available for this entry.
overview
Original abstract
Double-layer systems with narrow or flat electronic bands may exhibit spontaneous interlayer coherence, described by a layer-pseudospin ferromagnetic order parameter. In modern realizations of layer-pseudospin ferromagnets, the electrons carry additional valley degeneracies, endowing each layer with a valley-pseudospin degree of freedom. We study their nonequilibrium steady states driven by a static interlayer voltage bias in the presence of interlayer tunneling. While in the low-bias regime, the system is in a static state with parallel valley pseudospins between the two layers, we show that in the high-bias regime, the dynamical precession of the layer-pseudospin stabilizes the valley pseudospins in the antiparallel configuration, strongly suppressing the interlayer tunneling. This dynamical tunneling blockade leads to an absence of ac current and a sharp drop of the dc tunneling current to a tiny value, in stark contrast to conventional quantum Hall double layers.
arXiv·2026-10-20·Oliver Benz, Marius Krumm, Wolfgang Wieland
No generated summary available for this entry.
overview
Original abstract
One of the major challenges of modern foundational physics is the combination of quantum physics and general relativity into a theory of quantum gravity. A severe obstacle are the required extremely high energy scales for direct tests of quantum gravity effects. In recent years, attention has shifted towards near-future experimental predictions of effective or phenomenological models, such as gravitationally induced entanglement or interactions of linearized gravity with non-relativistic measurement devices. These developments motivate us to study the coupling between the quantized metric perturbation and an anisotropic quantum rigid rotor. The intuitive motivation for our study is that a sufficiently heavy rotor consists of a very large number of component systems. Although quantum gravitational effects are completely negligible at the scale of a single atom or molecule, the effects can get amplified by the sheer number of constituents. The resulting effective model describes the gravitational analogue of the angulon quasiparticle excitations discussed in condensed matter physics, suggesting a pathway for future analogue experiments. As a first concrete test of our model, we derive the gravitational Lamb shift for the energy eigenstates of the rotor, which become dressed by a cloud of virtual gravitons. Although the effect is very small, it could provide a concrete test for whether gravity is truly quantum.
arXiv·2026-10-20·Kerem Yurtseven et al.
No generated summary available for this entry.
overview
Original abstract
Kerr-cat qubits offer a hardware-efficient route to fault-tolerant quantum computing by suppressing bit-flip errors exponentially, while phase-flip errors increase only linearly with the mean photon number. To maintain this protection, entangling operations must be bias-preserving, ensuring that phase-flip errors occurring during the gate do not propagate into bit-flip errors. In this paper, we propose an asymmetrically threaded SQUID (ATS) parametric coupler to implement high-fidelity, bias-preserving entangling gates between Kerr-cat qubits. By engineering a photon-number asymmetry between the control and target modes, we enable fast gate operations that suppress non-adiabatic leakage without complex pulse shaping. Through numerical simulations of the full circuit Hamiltonian, we demonstrate a bias-preserving CX gate achieving 99.69% fidelity in the absence of photon loss for a gate duration of 50 ns. Under a single-photon loss rate of 100 kHz, our protocol yields a noise bias of 9922, exceeding the noise bias of a naive non-bias-preserving CX implementation by approximately a factor of 570. These results support the ATS coupler as a valuable building block for concatenated cat-qubit architectures.
arXiv·2026-10-20·Yicheng Guang et al.
No generated summary available for this entry.
overview
Original abstract
Fault-tolerant quantum computers need fast and accurate error decoding. We present CoDecoder, a small neural frontend that composes with an existing decoder to improve accuracy and reduce mean decoding time. It predicts each shot's logical outcome, retains confident predictions and routes the remaining shots to the unchanged fallback. A logical-operator-aware output head scores shifted logical operators, combining equivalent logical lines on surface codes and deciding logical qubits jointly on bivariate-bicycle (BB) codes. Fused GPU inference and efficient routing reduce the overhead paid on every shot. In registered tests under circuit-level noise, composition reduces failures by 6.4-31.4% relative to correlated matching on surface codes of distance 7-17 and by 22-50% relative to full-DEM Relay-BP on two BB codes, with 2.3-124-fold speed-ups across these comparisons. With our re-implementations of the neural decoder Cascade, composition reduces decoding time in all four settings. A joint decision of both decoders on the routed shots keeps this speed and makes the composition more accurate than Cascade in all four, with 14-18% fewer failures on the [[72,12,6]] code. On the [[72,12,6]] BB code, a conventional head with independent logical outputs fails 3.8-5.0 times as often as our joint class score under matched training conditions. Per-shot analysis shows how composition gains accuracy. On retained shots, the frontend corrects more fallback errors than it introduces, even when it is less accurate overall.
arXiv·2026-10-20·Mingyuan Wang, Stefan Krastanov
No generated summary available for this entry.
overview
Original abstract
Calderbank--Shor--Steane (CSS) codes support decoding and fault-tolerant logical operations through separate pure $X$ and pure $Z$ stabilizer checks. Generator choices and single-qubit Clifford transformations can obscure this structure. We give a deterministic polynomial-time algorithm that decides whether an arbitrary stabilizer code is locally Clifford-equivalent to a CSS code and constructs the required transformation and CSS checks whenever such a form exists. For $m$ possibly redundant generator rows on $n$ qubits, the algorithm uses $O(mn^2+n^4)$ binary field operations. We reduce the problem to affine linear systems by characterizing local projectors that preserve the span of the binary stabilizer labels. The conversion preserves code parameters and check sparsity for quantum low-density parity-check (qLDPC) codes. We demonstrate CSS recovery and decoder reuse and resolve previously open LC-to-CSS classification questions for published code constructions. For graph states, LC-to-CSS equivalence corresponds to the existence of a bipartite graph in the local-complementation orbit. We derive a necessary-and-sufficient adjacency-matrix criterion for this property and construct such a graph whenever one exists. Our algorithm makes CSS decoding and fault-tolerant constructions accessible throughout the local Clifford equivalence classes of CSS codes.
arXiv·2026-10-20·Leonardo Chataignier, Alexander R. H. Smith
No generated summary available for this entry.
overview
Original abstract
We formulate quantum reference frames within the Dirac quantization of gauge theories, where physical states are obtained from a kinematical Hilbert space $\mathcal{H}_{\rm kin}$ by group averaging. We assume the gauge group $G$ is unimodular, and we define a quantum reference frame as a system of coherent states associated with a group $G_R$ of frame orientations acting on a tensor factor of $\mathcal{H}_{\rm kin}$. In direct analogy with the Faddeev-Popov procedure in path integrals, we show that the physical inner product can be written in terms of a choice of frame orientation with an appropriate operator measure, but that the physical Hilbert space is independent of this choice of frame. This yields a generalization of the Page-Wootters reduction map used to define conditional states and conditional probabilities of measurement outcomes given a frame orientation. These probabilities correspond to the expectation values of relational Dirac observables obtained from generalizations of previously considered relativization maps. Our main result is that the map that implements a change of frame is unitary, even when $G$ does not act as a tensor-product representation across a factorization of $\mathcal{H}_{\rm kin}$. The formalism therefore accommodates interactions between reference frames and the systems described relative to them. We apply this formalism to temporal frames, showing that a unitary Schrödinger equation emerges for an interacting clock and system, and that a previously reported time-nonlocal Schrödinger equation is recovered in an appropriate limit. With this, problems of non-unitarity are avoided by the use of the gauge-fixing measure in the physical inner product. We also discuss the case of interacting spatial frames, where the known correspondence between coherence in one frame and entanglement in another is shown to depend on the coupling.
arXiv·2026-10-20·Aryan Kumar
No generated summary available for this entry.
overview
Original abstract
Separately amplifying gate, latency, and mid-circuit measurement errors can simplify zero-noise extrapolation, but a weak interaction between amplification knobs does not establish an accurate zero-noise limit. We distinguish observable separability, response-model adequacy, and calibration of that limit, and test them in a pre-specified $2^3$ factorial experiment on three IBM dynamic circuits. For the primary echoed spectator observable, the latency-measurement coefficient is $b_{LM}=+0.0007$ with a nominal 95% bootstrap interval $[-0.0033,+0.0049]$. A separately planned follow-up meets a $\pm0.005$ equivalence criterion and recovers two injected interactions; both repeat runs nevertheless trigger the drift rule. Multi-knob extrapolations have smaller median absolute errors than the single-knob comparisons, yet all five original strategies exclude the known ideal value for three of six observables. Duration controls support a model-dependent contribution to the spectator deficit from unequal decay rates in native padding and added delay. We give an explicit construction showing why measurements at two measurement-knob levels cannot identify the extrapolated limit without response assumptions. A post-hoc precision analysis and an additive full-factorial estimator expose a further bias-variance trade-off hidden by point-error comparisons. The experiment provides a diagnostic of the implemented response surface, not a certification of physical channel independence or mitigation accuracy.
arXiv·2026-10-20·Julian Kusch, Lauriane Chomaz, Wyatt Kirkby
No generated summary available for this entry.
overview
Original abstract
Motivated by a recent experimental work $[\href{https://arxiv.org/abs/2608.20327}{\text{arXiv:}2608.20327}]$, we theoretically investigate the nature of phase transitions in a trapped dipolar quantum gas upon tuning the contact interaction strength and dipole orientation. Using extended Gross-Pitaevskii simulations including thermal and quantum effects, we map the phase diagram comprising unmodulated superfluids, triangular droplet arrays, and stripe states. We further characterize the order of the transitions separating them through imaginary-time hysteresis analysis. The unmodulated-to-modulated transition evolves from discontinuous to continuous with increasing dipole tilt before becoming discontinuous again at large tilts. The degree of continuity is further affected by particle number, temperature, and confinement. While continuous behavior generally correlates with the emergence of stripe states, this correspondence is not systematic, and finite-size effects also influence the continuity of the transition. The triangular-to-stripe transition is found to be discontinuous at small contact interaction strengths and becomes increasingly continuous upon approaching the unmodulated-to-modulated phase boundary. Our results reveal a tunable transition order in finite dipolar quantum gases and provide guidance for its experimental investigation.
arXiv·2026-10-20·Sebastián V. Romero, Xi Chen, Yue Ban
No generated summary available for this entry.
overview
Original abstract
Quantum batteries can outperform their classical counterparts through collective quantum effects, yet the conditions enabling such advantage remain unclear. Using a generic class of free-fermionic chargers we prove that global operators are insufficient for scalable superextensive charging and that a cumulative hierarchy of many-body operators is required, with the structure of the battery determining the degree of advantage. This is obtained by relating the charging power to the norm of the commutator between the battery and charger Hamiltonians and deriving an upper bound only capturing noncommuting terms. Moreover, we revisit the concept of participation number and propose an effective definition that accounts for the relative strength of the contributing terms, correlating it with the charging power scaling. Not limited to quadratic Hamiltonians, our results establish cumulative locality as a key resource for quantum charging advantage.
arXiv·2026-10-20·Li Gao, Jingyu Guo, Sihao Wang
No generated summary available for this entry.
overview
Original abstract
We prove a complete modified logarithmic Sobolev inequality with a system-size-independent constant for Chen--Kastoryano--Gilyén Gibbs samplers on one-dimensional spin chain at every fixed positive temperature. The result holds for Hamiltonians with bounded finite-range interactions, including noncommuting and spatially nonuniform interactions. It yields trace and diamond mixing times of order $O(\log N+\log(1/ε))$. The proof establishes complete spatial entropy factorization and absorbs quasi-local errors as conditional relative entropy at the original joint state and reference. The static estimate also yields a system-size-independent CMLSI for the single-site Petz heat-bath and regularised heat-bath dynamics.
arXiv·2026-10-20·Lei Hu et al.
No generated summary available for this entry.
overview
Original abstract
We study the minimum persistent memory required to distribute a graph state through a quantum switch. Specifically, consider a central switch that assists $n$ remote users in distributing a graph state, using independently generated user-switch Bell pairs. Since Bell-pair generation is probabilistic, different links generally succeed at different times. When a Bell-pair is generated, the qubits may need to be stored in memory while waiting for other links to succeed. Recently, new protocols have been proposed to reduce this storage overhead by processing and releasing some switch qubits before all Bell links are available. However, these protocols do not characterize the minimum persistent switch memory required at each stage. Moreover, the local-cover method in the state-of-the-art Piecemaker protocol is computationally expensive for general target graphs. In this work, we characterize the minimum persistent switch memory required after any subset of users' Bell links are generated and processed. We then develop an online stabilizer-transition protocol that attains this limit, which can be implemented in polynomial time in the number of qubits $n$. Remarkably, this optimal protocol can provide substantial memory reductions over existing heuristic approaches. In particular, for the path graph $P_n$ over $n$ users, Piecemaker protocol requires at least $\lfloor n/2\rfloor$ qubits of peak persistent memory for \textit{every Bell-links generation order}, whereas under the order $(1,2,\ldots,n)$, our protocol requires only one persistent switch qubit. Finally, the same stabilizer-transition framework also provides a direct forward construction for sequential graph-state generation using the minimum number of quantum emitters, equal to the maximum of the height function.
arXiv·2026-10-20·Adam Siegel
No generated summary available for this entry.
overview
Original abstract
Quantum low-density parity-check codes now reach encoding rates up to 50% at useful distances. Their checks however are long-range group actions, not local neighbourhoods, and that connectivity has so far been supplied by neutral atoms. Silicon spin qubits offer the same primitive --- coherent transport of qubit blocks --- through electron shuttling, and on microsecond rather than millisecond timescales. They however travel along fabricated tracks rather than free space: permutations an atom array obtains by moving tweezers must here become collision-free motions on a physical lattice. We here present the first code and spin-qubit hardware co-design. We build an architecture whose geometry mimics that of a family of non-abelian groups, broad enough to host codes of excellent parameters: a hierarchy of nested conveyor-belt loops on a plain square lattice of shuttling tracks, in which every group multiplication becomes a rigid, globally controlled motion of whole qubit trains. We call it NeST, for Nested Shuttling Tracks. A code search over the family returns rate-20% mitten codes up to $[[1400,280,\leq 28]]$, and circuit-level simulations including shuttling dephasing give thresholds above $10^{-3}$ with sub-$50μ$s stabiliser cycles, two to three orders of magnitude faster than neutral-atom implementations. Via extrapolations, we estimate that this largest code may reach a logical error probability per qubit per round of $10^{-14}$, assuming a ten-fold improvement on early shuttling demonstrations, with other physical errors at p=0.1%. Logic is compatible with NeST too: for the [[150,30,10]] code we build a code-surgery gadget in which every qubit again moves only by rigid belt motions, at no qubit cost and a 29% increase in gate layers. This demonstrates that ultra-low-overhead fault tolerance and a fast clock speed are not competing goals, and that silicon spin qubits can supply both.
arXiv·2026-10-20·Andrew J. Ochoa, Martin J. A. Schuetz, Helmut G. Katzgraber
No generated summary available for this entry.
overview
Original abstract
We demonstrate a hybrid quantum-classical approach for exploring ground-state manifolds of maximum independent set problems, in which quantum hardware supplies the initial solutions and an entirely classical post-processing algorithm expands them, increasing the solution diversity of quantum hardware measurements by up to several orders of magnitude. Quantum optimization devices, while capable of generating high-quality solutions, can suffer from fundamental sampling limitations. This is particularly problematic for applications that strongly depend on a large variety of uncorrelated optimal solutions. We apply the Houdayer cluster update algorithm to systematically expand quantum-generated solution sets through classical post-processing. We validate our approach on a test bed of 43 problem instances from QuEra's Aquila analog annealing device, achieving diversity amplification factors, defined as the increase in the number of distinct solutions at a given set size, of up to 11923x with a median of 24.3x across different problem scales and hardness parameters. Because exact ground-state degeneracies are known for these instances, the recovered fraction of the manifold can be measured rather than bounded: post-processing recovers a median of 21% of the ground-state manifold, and provably all of it for six instances. We also demonstrate that, in some cases, the classical post-processing can discover independent sets larger than those found by the quantum hardware, thus improving on solution quality and not just diversity. While the method is non-ergodic and cannot guarantee complete manifold coverage, it consistently discovers a larger number of high-quality, and in some cases strictly better, configurations than quantum sampling alone. This work demonstrates how simple classical post-processing can enhance the utility of quantum optimization results.
arXiv·2026-10-20·Sridevi Kuriyattil et al.
No generated summary available for this entry.
overview
Original abstract
Long-range interactions in many-body quantum systems give rise to a wide range of dynamical phenomena, from collective dynamics well described by integrable mean-field models with symmetric all-to-all couplings, to fast scrambling of quantum information from disordered long-range interactions. Here, we investigate scenarios in which both regimes emerge within a single deterministic, translation-invariant XY spin model with long-range couplings. We consider a sparse powers-of-two (PWR2) graph, where each spin interacts with a logarithmic number of neighbors, and a power-law-decaying model. By altering the initial state via local perturbations on a completely symmetric state, we show that the dynamics changes from collective to scrambling as witnessed by bipartite and multipartite entanglement measures. We characterize this collective-to-scrambling crossover using Lyapunov exponents in the semiclassical regime, and show that the spectral properties of the coupling graph adjacency matrix provide a very efficient tool to predict the onset of fast scrambling. Our results offer a unified framework for controlling the switch between collective and scrambling dynamics in a setup accessible in experiments with neutral atoms in cavities or in tweezer arrays.
arXiv·2026-10-20·Qingfeng Wang et al.
No generated summary available for this entry.
overview
Original abstract
Trapped-ion, neutral-atom, and circuit QED quantum computers naturally enable coupled qubit-boson simulations. Boson-fermion interactions arise in quantum field theory, where renormalization is required to obtain finite results. We study one of the simplest examples of a coupled fermion-boson system, the static Yukawa model, on the QSCOUT trapped-ion system. We use similarity renormalization to express the same physics in terms of effective particles described by different values of the renormalization parameter $s$. This enables us to map data taken in the window of bosonic occupancy that is experimentally accessible to larger occupancies of distinct effective particles. We use this to study strongly coupled, high-occupancy regimes despite limited readout ranges. Using a trapped-ion qubit-boson device on Sandia National Laboratories' QSCOUT platform, we demonstrate the time evolution of the static Yukawa model.
arXiv·2026-10-20·Nicholas A. Lanzillo, Ion Garate, Ching-Tzu Chen
No generated summary available for this entry.
overview
Original abstract
We evaluate the electron scattering properties in CoSi thin films having either twin (heterochiral) or non-twin (homochiral) grain boundaries using first-principles quantum transport calculations. We find that scattering across a twin grain boundary is more resistive than scattering across a non-twin grain boundary and that non-twin grain boundaries have a greater percentage of surface conduction than twin grain boundaries. This is corroborated by the transmission eigenstate profiles, which show that the surface Fermi-arc electrons can transmit past the non-twin grain boundaries between homochiral domains on the same surface without significant backscattering. In contrast, these surface electrons get scattered along the twin grain boundaries between heterochiral domains to the opposite surface, resulting in partial forward transmission and partial backscattering that yields higher grain-boundary resistivity. This work helps elucidate the complexities of electron transport in chiral topological semimetals for potential application in next-generation nano-interconnects.
arXiv·2026-10-20·Long-Jie Li et al.
No generated summary available for this entry.
overview
Original abstract
Identifying the quantum signatures of classical chaos remains a central question in quantum physics, and quantum scrambling provides a new perspective on this correspondence. We study two distinct limits of the same model to examine how the correspondence between chaos and scrambling changes across different regimes. The thermodynamic-limit anisotropic Dicke model exhibits a close correspondence between chaos and scrambling, whereas this correspondence breaks down in the large-frequency-ratio limit of the anisotropic Rabi model (ARM). The contrasting chaotic behavior in the two limits originates from the different numbers of classical degrees of freedom, whereas their similar scrambling behavior stems from eigenstate delocalization. This implies that, in the large-frequency-ratio limit, eigenstate delocalization alone is insufficient to qualify the ARM as a classically chaotic model. This finding suggests that identifying chaos in quantum systems requires jointly considering the classical degrees of freedom and eigenstate delocalization.
arXiv·2026-10-20·Long-Jie Li et al.
No generated summary available for this entry.
overview
Original abstract
Early studies on the Dicke model linked superradiance to quantum chaos, whereas later anisotropic Dicke and Rabi studies reached apparently conflicting conclusions. We resolve this tension by distinguishing global chaos from local instability. Along the isotropic Dicke path, a sweep at fixed low excitation energy crosses both the superradiant boundary and a nearby chaotic window, explaining the reported correlation. However, the anisotropic Dicke model can be chaotic in the normal phase and regular in the superradiant phase, making superradiance neither necessary nor sufficient for global chaos. A fidelity out-of-time-order correlator (FOTOC), in contrast, probes the local stability of the stationary point selected by the initial wave packet. The superradiant transition destabilizes the origin, whereas a change in anisotropy can restore its stability and create displaced saddles. Wave packets centered at these saddles exhibit exponential FOTOC growth even on a classically regular Dicke energy shell with Poisson statistics. This local sensitivity also enables quantitative spectroscopy: combined with the topology of stationary points and local density of states relations, FOTOC dynamics reconstructs the absolute amplitudes of spectral singularities in both models without fitting the density of states.
arXiv·2026-10-20·Seif Alwan
No generated summary available for this entry.
overview
Original abstract
We present a fully quantum formulation of the spinterface model for the chirality-induced spin selectivity (CISS) effect, implemented within the non-equilibrium Green's function (NEGF) formalism. The model consists of a gold atom hosting a localised magnetic moment, coupled to a chiral molecular chain with Rashba spin-orbit coupling, and contacted by two non-magnetic leads. The magnetic moment is determined self-consistently from the non-equilibrium electronic distribution, and the spin-resolved transmission is computed from the mean-field Hamiltonian. We show that the interfacial magnetic moment and the chiral Rashba term cooperate to produce large current polarisations that reproduce the key experimental signatures of CISS: high polarisation, a threshold emergence at four total sites followed by interference-modulated growth with chain length, thermal suppression, and sign reversal upon chirality inversion. The central new result of this work is a clean separation of the CISS effect into an even (achiral) and an odd (chiral) contribution to the spin current, $I_{S_z}(φ) = I_{S_z}^{\rm even}(φ) + I_{S_z}^{\rm odd}(φ)$. We demonstrate that $I_{S_z}^{\rm odd}$ vanishes exactly at fixed $m_z$ for chains of fewer than four sites and becomes non-zero for chains of four or more sites, with the smallest junction exhibiting a non-zero odd part being the four-site geometry (one gold atom plus three molecular sites). The odd part arises from reciprocity breaking in a device that is simultaneously chiral, magnetically asymmetric (moment on the gold end only), and long enough to support two or more Rashba-active bonds. This provides a direct, parameter-free test of whether an observed spin signal is genuinely chiral or arises from an achiral spin-valve mechanism.
arXiv·2026-10-20·Kyle S. Netherwood et al.
No generated summary available for this entry.
overview
Original abstract
Structured light provides a route to controlling quantum materials not only through its polarization, but also through its spatial profile and orbital angular momentum (OAM). We develop real space theories of a Weyl semimetal driven by a vortex beam and show that optical OAM generates highly localized Floquet vortex states with pronounced circulating photocurrents. Exploiting cylindrical symmetry, we derive a Bogoliubov-de Gennes-like radial equation that resolves the states by angular momentum and reveals their evolution between the light-dressed Weyl cones. For Laguerre-Gaussian beams, the spatially varying drive produces strong hybridization between localized vortex states and bulk states. We complement this continuum description with a Wilson-lattice formulation that retains the full two-dimensional spatial structure and enables direct calculation of local photocurrents. Both approaches consistently identify OAM-induced vortex states localized around the beam axis. The lattice calculation further shows that these states support substantially stronger circulating current densities than the more extended surface states, with the largest current densities associated with the most strongly localized, low-angular-momentum vortex modes. Our results establish optical OAM as a tunable control parameter for creating and manipulating localized current-carrying states in Weyl systems and provide a real-space framework for studying photocurrents generated by spatially structured light.
arXiv·2026-10-20·Shao-Fan He, Lv-Ting Gong, Fu-Quan Dou
No generated summary available for this entry.
overview
Original abstract
Phase transitions (PTs) in quantum many-body systems offer a powerful route to manipulate the performance of quantum batteries (QBs). Here, we investigate an anisotropic Dicke QB with Kerr nonlinearity, focusing on the role of PTs in the charging process of the QB system. By analyzing how the Kerr nonlinearity reshapes the cavity level-spacing structure, we find that multiple near-degeneracies emerge at specific nonlinearity strengths. Away from the region of multiple near-degeneracies, the stable stored energy is governed primarily by the ergodic-nonergodic transition (ENET), whereas within this region it is controlled by first- and second-order dissipative phase transitions (DPTs). We employ Liouvillian spectral theory to quantify the critical slowing down associated with the DPTs, and use the Wigner function to characterize the properties of the cavity field in the vicinity of criticality. We optimize the charging process via reinforcement learning (RL) and reveal the physical mechanism underlying performance enhancement from the perspective of ergodic and nonergodic phase dynamics. Our results offer a feasible pathway for manipulating and optimizing quantum battery performance based on intrinsic PT behaviors.
arXiv·2026-10-20·Muhammad Imran
No generated summary available for this entry.
overview
Original abstract
We give a bounded-error quantum polynomial-time algorithm for finding hidden parabolic subgroups of $\mathrm{GL}_n(R)$ over any effectively presented finite chain ring $R$. We call auxiliary group elements or subgroups used to extract information through oracle queries \emph{probes}. For chain length at least two, elementary abelian socle probes first recover the complete flag modulo the maximal ideal. When the residue field has size $q\ge3$, we reconstruct the flag recursively, lifting rank-one terminal members one digit at a time. The intermediate digits reduce to abelian hidden subgroup problems, while the final digit is a finite-field multiple-shift problem solved using learning from subset and Fourier sampling. For $q=2$, where distinct flags can have the same stabilizer, we instead lift the conjugate parabolic subgroup through the congruence filtration. A final linear system determines it modulo normalizer directions. The algorithm outputs generators with probability at least $1-ε$ in time $\mathrm{poly}(n,\log|R|,\log(1/ε))$. Consequences include $\mathrm{GL}_n(\mathbb{Z}/N\mathbb{Z})$ for every $N\ge2$ and, with an explicit maximal-order presentation, $\mathrm{GL}_n(\mathcal{O_K}/N\mathcal{O_K})$ for number fields $K$.
arXiv·2026-10-20·Zachary Giles, Dvira Segal
No generated summary available for this entry.
overview
Original abstract
We advance the compact dressed Hamiltonian (CDH) framework to simulate the dynamics of open quantum systems strongly coupled to structured bosonic environments. The CDH approach combines reaction-coordinate mapping with a polaron transformation, incorporating strong system-environment hybridization into a dressed representation before truncating the collective bosonic mode. As a result of this truncation, dynamical features are captured with substantially fewer states than in the original representation. The residual environment is treated using a weak-coupling Markovian quantum master equation. We benchmark the method for spin-boson-type models including a single spin, coupled spins, and spin ensembles, considering both resonant and off-resonant regimes and weak to strong system-bath coupling. Comparisons with hierarchical equations of motion and converged reaction-coordinate calculations demonstrate that the CDH representation systematically approaches the reference dynamics with a compact Hilbert space, accurately reproducing oscillation frequencies, relaxation behavior, and long-time populations over a broad parameter regime. The method further captures cooperative phenomena, including bath-mediated interactions, synchronization between spins, and signatures for collective emission. Beyond efficient time propagation, the CDH framework provides direct access to the spectrum and eigenmodes of the Liouvillian. We demonstrate that slow dynamical modes converge rapidly in the CDH representation, enabling identification of relaxation timescales without fitting time-dependent observables. As a whole, the CDH framework provides an efficient and physical description of strongly coupled open quantum-system dynamics.
arXiv·2026-10-20·Grzegorz Czelusta et al.
No generated summary available for this entry.
overview
Original abstract
Photonic and qubit-based (digital) approaches to quantum computing are largely regarded as separate paradigms. This article aims to bridge these paradigms by developing a method for mapping quantum-optical systems onto qubit-based quantum circuits. The key ingredient enabling this mapping is the introduction of a truncation of the Fock space describing single-mode optical states. Within this framework, representations of basic photonic operations are developed, including the phase-rotation operator, the displacement operator, the squeezing operator, and the beam splitter. Explicit quantum circuit constructions are provided for Fock-space truncations of dimension $N=2$ and $N=4$. We discuss benchmarking of the implemented operations and identify the regime of applicability and the limitations of the proposed method. The presented results can be used to simulate quantum optical circuits on qubit-based quantum computers, with special relevance to Gaussian Boson Sampling in the low-photon-number regime. To demonstrate the practical applicability of this approach, we complement the theoretical framework with a Python-based quantum programming tool CO$Φ$ that compiles Blackbird quantum-optics programs into qubit-based OpenQASM circuits using a truncated Fock-space encoding. The compiler is available on GitHub at https://github.com/Quantum-Cosmos-Lab/cophi.
arXiv·2026-10-20·Giuseppe Bisicchia et al.
No generated summary available for this entry.
overview
Original abstract
Cloud-accessible quantum computing has made heterogeneous Quantum Processing Units (QPUs) available through provider platforms that differ in qubit technology, calibration state, queueing behavior, and pricing model. This heterogeneity makes execution management a quantum-engineering concern: a quantum circuit may be executable on several backends, but the resulting cost, latency, fidelity, and reproducibility depend on backend selection and on how measurement shots are allocated. This paper presents the Quantum Broker, an open-source and provider-agnostic framework for Quality-of-Service-aware quantum execution management. The framework operationalizes shot-wise distribution by exploiting the statistical independence of quantum measurement shots to dispatch a single circuit across multiple heterogeneous QPUs according to user-defined constraints and optimization objectives. It combines a modular execution architecture, interchangeable backend-profiling strategies, and the Quantum QoS Specification Language (QQSpec), a declarative language for expressing QoS requirements. Dispatch planning is supported by two solver backends: a mixed-integer linear-programming (MILP) solver, and a nonlinear dual-annealing solver. Experiments on benchmark quantum circuits and noisy simulator backends show that the Quantum Broker can produce feasible QoS-aware dispatch plans under heterogeneous backend conditions and can improve QoS satisfaction with respect to single-backend and naive multi-backend baselines. The results also expose a practical trade-off between planning time and dispatch quality, with the nonlinear solver producing higher-quality allocations at increased computational cost. Overall, the Quantum Broker provides an extensible execution-management layer for engineering portable, reproducible, and QoS-aware quantum software over fragmented quantum cloud infrastructures.
arXiv·2026-10-20·Suman Mondal, Paul M. Schindler, Marin Bukov
No generated summary available for this entry.
overview
Original abstract
Clean, interacting, periodically driven systems are believed to thermalize to featureless, infinite-temperature states that preclude the formation of stable ordered states. Here, we show stable quantum order, distinct from prethermal order, and its phase transitions in the ground state of the average-energy operator. Decomposing the time evolution into geometric and average-energy dynamics, we apply Geometric Floquet theory to identify the Floquet ground state. We derive a general variational principle to compute the Floquet ground state in large interacting periodically driven systems, and use it to develop a matrix product state algorithm. In driven nonintegrable chains of more than 100 interacting spins, our numerical simulations exhibit a gapped, area-law entangled Floquet ground state in extended parameter regimes; the ground-state manifold can support both dressed equilibrium order (e.g., Floquet antiferromagnets) and inherently nonequilibrium order (e.g., ground-state time crystals). This quantum order is protected by a finite average-energy gap, which closes at phase transition points upon changing model parameters. We decompose Floquet phases of matter into their equilibrium and nonequilibrium elements: whereas the Floquet ground state at any fixed time is a representative of an equilibrium phase of matter, the nonequilibrium content is entirely produced by the drive holonomy and is geometric. Finally, we identify quasilocal counterdiabatic driving as a mechanism for the stability against heating of gapped Floquet ground states in nonintegrable quantum systems, and argue why Floquet ground states evade the Eigenstate Thermalization Hypothesis. Our work enables the study of interacting nonequilibrium matter deep into the many-body regime, and lays the foundations for the engineering of strongly correlated ordered quantum states.
arXiv·2026-10-20·Aleksei Kodukhov
No generated summary available for this entry.
overview
Original abstract
The resource theory of coherence quantifies the quantum properties of states and their role in quantum information processing. Extending coherence theory to ensembles, the natural objects in quantum communication, remains an active research direction, with their operational potential still being explored. In this work, we establish a maximally coherent ensemble in every finite dimension: the continuous ensemble of pure states distributed according to the normalized Haar measure attains the tight upper bound on basis-free relative entropy ensemble coherence. We then prove that ensemble coherence bounds the effective informational advantage of postselective measurements over the Holevo quantity for two equiprobable pure states. Finally, for the qubit B92 QKD protocol, we show that the coherence of Alice's ensemble upper-bounds the secret key rate in the asymptotic regime. These results give ensemble coherence a quantitative operational meaning in quantum communication and cryptography
arXiv·2026-10-20·Koji Yamada et al.
No generated summary available for this entry.
overview
Original abstract
We theoretically investigate electronic driving of a torsional mode in a suspended carbon nanotube quantum dot. The valley states in a nanotube carry opposite orbital magnetic moments along the tube axis, and intervalley mixing forms valley-mixed eigenstates whose splitting can be controlled by an axial magnetic field. We formulate an orbital-rotation coupling between the torsional angular velocity and the valley orbital angular momentum. Using a master equation for sequential tunneling through normal-metal electrodes, we calculate the steady-state current and the phonon distribution of the torsional mode. When the valley-state splitting matches the torsional phonon energy, orbital transitions can drive the mode out of equilibrium. The contacts control both phonon pumping and its electrical readout, allowing substantial excitation with a positive, vanishing, or negative current response. The mechanism requires no intrinsic spin or valley polarization of the electrodes, but uses state-dependent tunneling at the contacts.
arXiv·2026-10-20·Andrés M. Mier Valdivia et al.
No generated summary available for this entry.
overview
Original abstract
When an ensemble of emitters is confined within an optical wavelength, its radiation can become correlated, leading to cooperative emission. In two-dimensional (2D) transition metal dichalcogenide (TMD) electron-hole bilayers, strong light-matter coupling enables the formation of interlayer excitons (IXs), long-lived dipolar excitations that provide an ideal setting for emergent collective phenomena. Here, we engineer an atomically thin light-emitting diode (LED) that generates electroluminescence (EL) from electrically injected IXs that are confined near the sample edges by an edge-enhanced fringing electric field. By measuring Hanbury-Brown-Twiss photon-photon correlations, we find pronounced signatures of collective decay in the form of large photon bunching followed by finite delay antibunching and bunching revivals. These emitter correlation signatures disappear when free charge carriers are doped to form a degenerate Fermi sea but are enhanced by the introduction of localized electrons. The results are consistent with a many-body quantum master equation that models the steady-state superradiant photon statistics of incoherently injected IXs. Our work establishes steady-state cooperative emission in a 2D TMD LED as a platform for studying strong light-matter interactions in electrically driven, non-equilibrium phases of Bose-Fermi mixtures.
arXiv·2026-10-20·Muhammad S. Hasan, Vikash Mittal, Tomasz Sowiński
No generated summary available for this entry.
overview
Original abstract
We investigate the dynamics of two bosons in a tilted one-dimensional optical lattice with both standard and density-assisted tunnelling. The relative sign of the two tunnelling processes strongly affects the Bloch dynamics, leading to distinct reinforcing and competing regimes. We examine how the tunnelling processes generate correlations and find that, in the absence of onsite interactions, the early-time entanglement growth follows the same scaling with the density-assisted tunnelling amplitude. Finite onsite interaction changes this picture by breaking the symmetry between the reinforcing and competing regimes and enhancing the correlation differently in two regimes. This shows how the interplay between the two tunnelling mechanisms can change dyanmics and entanglement in a controlled few-body setting. Particularly, at equal tunnelling amplitudes, the doublon and singlon sectors decouple completely for arbitrary onsite interaction, lattice tilting, and initial state.
arXiv·2026-10-20·Aryan Kuntal et al.
No generated summary available for this entry.
overview
Original abstract
Practical security analysis of Coherent-One-Way (COW) quantum key distribution requires optical-device modeling, finite experimental statistics, and security inference to be treated consistently without conflating assumptions. We present a modular observable-level simulation framework organized through the pipeline θ_phys -> p -> O -> S_j(O), in which physical source, channel, receiver, and detector parameters determine detector-resolved event probabilities, a finite-block layer applies an effective dead-time treatment and generates aggregate detector counts, and interchangeable security evaluators act on the same observable record. The framework is verified against analytical optical, virtual-state, and finite-key relations and evaluated against reported experimental COW-QKD operating points. The Kato finite-key calculation reproduces the refined experimentally reported secure-key rates most closely at intermediate distances, with deviations of -1.5% at 50 km and -10.3% at 75 km. Monitoring bright-port decoy counts agree within 0.9-2.4%, while remaining distance-dependent dark-port residual identifies the principal model-sensitive observable of the present physical description. Applying Kato and Azuma-Hoeffding concentration treatments to identical detector records isolates the effect of finite-key statistical inference and shows substantially tighter Kato phase-error bounds for rare-event monitoring records studied here. Holding the Kato evaluator fixed, joint optimization of coherent-state mean photon number mu and receiver splitting fraction t_B increases model-predicted secure-key rate by 7.4-20.2% relative to optimization of mu alone with t_B = 0.3. The framework therefore provides a common computational interface for experimental reproduction, controlled security-model comparison, model-based protocol optimization, and modular adversarial stress testing in COW-QKD.
arXiv·2026-10-20·Stefan Wolf et al.
No generated summary available for this entry.
overview
Original abstract
We design a hybrid quantum-classical computational workflow, combining density functional theory and dynamical mean-field theory, to investigate the electronic properties of CaCuO2, a parent structure of high-temperature cuprate superconductors. Our approach uses a quantum algorithm as an impurity solver that is based on variational quantum compressed time evolution to compute the time-dependent Greens function on an IBM Heron quantum device. Utilizing error mitigation techniques and a Lehmann representation fitting procedure, we extract the density of states from the signal in the accessible time regime. Despite the significant challenges rooted in the residual imprecision of currently accessible NISQ devices, we successfully resolve the characteristic features of the spectral function. However, we find that the required numerical accuracy for full DMFT self-consistency exceeds current hardware capabilities, indicating that practical real-material DMFT applications will necessitate post-NISQ hardware developments.
arXiv·2026-10-20·Pablo Viñas et al.
No generated summary available for this entry.
overview
Original abstract
Geometric phase gates with addressed laser radiation are widely used in trapped-ion quantum computers to drive high-fidelity entangling gates on an arbitrary qubit pair of a larger ion chain. Such programmable connectivity exploits the collective phonons to mediate the desired interaction, while simultaneously achieving robustness to their thermal fluctuations by a careful calibration of the gate time with respect to the laser and vibrational-mode frequencies. Crosstalk errors can arise when the spectator qubits, which should ideally remain idle during the gate, are partially driven by the laser fields. The minimal crosstalk, which is set by the laser beam size on the spectator ions, can be achieved when the addressing beams propagate perpendicular to the ion chain. However, this results in exciting the radial phonons, and can complicate achieving high-fidelities as the ion chain grows due to the so-called spectral mode crowding. In this work, we present the theoretical description of a scheme recently implemented by Faorlin et $al.$. This scheme overcomes these complications by engineering addressable state-dependent forces along the ion-chain with laser beams that propagate perpendicular to it through the use of structured light gradients. In this way, one can excite the axial phonons and avoid the spectral mode crowding, while simultaneously minimizing the crosstalk. We present a detailed derivation of the entangling gate scheme, together with analytical closed-form expressions for the leading contribution to the gate error caused by thermal motional fluctuations and dephasing noise. Our results confirm that such fluctuations account for up to 93$\%$ of the error budget under the operating conditions of the gate implemented by Faorlin et $al.$. We identify target parameters to reduce the motional error from the reported $10^{-3}$ to the $10^{-5}$ level.
arXiv·2026-10-20·Zheng Liang Lim, Hoi-Kwong Lo
No generated summary available for this entry.
overview
Original abstract
The five-qubit Absolutely Maximally Entangled AME$(5,2)$ state, whose every pair of qubits is maximally mixed so that all its information lives in non-local correlations, could in principle serve as a single shared quantum networking resource for teleporting two unknown qubits in parallel (each via its own Bell measurement and Pauli correction). Nonetheless, its hardware implementations remain scarce despite its theoretical importance. Here, we demonstrate parallel teleportation based on a five-qubit absolutely maximally entangled state, AME$(5,2)$, on the superconducting processor ibm_pittsburgh. We construct three-qubit Clifford decoders that extract two Bell pairs using three logical two-qubit gates for each of 60 inequivalent sender-receiver assignments. Using parallelization and classical Pauli frame post-processing, we retain reference-receiver entanglement on both channels after three teleportation rounds. With XY4 dynamical decoupling and the lowest-cost decoder, the final entanglement fidelities are $0.704\pm0.028$ and $0.680\pm0.022$, where uncertainties are pointwise $99\%$ confidence-interval half-widths over eight trials. Their lower bounds exceed the separability threshold of $1/2$. The decoder with lower circuit depth generally retains higher mean fidelity, and XY4 generally improves on XX. These results establish a hardware demonstration of two-channel entanglement transmission through repeated AME-assisted teleportation and provide compact decoding circuits for reconfigurable multipartite communication.
arXiv·2026-10-20·Aude Corbeel, Sebastian De Haro
No generated summary available for this entry.
overview
Original abstract
We review and analyse quantum information-theoretic approaches to black hole evaporation that purport to bring us closer to a resolution of the black hole information paradox. Our focus is on the Page-time paradox and on the contribution of the Hayden-Preskill model to understanding information release under the assumption of unitary evaporation. In this model, the black hole is taken to be a finite-dimensional quantum system whose dynamics can be represented by a quantum circuit, and its information-processing and communication abilities are studied. We identify the assumptions underlying this modelling and highlight two key features, fast scrambling dynamics and entanglement as a resource, that underpin the information release in the model. We argue that this reasoning exemplifies a broader change in how information is used in black hole physics, in which quantum information theory now provides a useful operational modelling framework. This application avoids earlier philosophical objections insofar as it is not based on epistemic ignorance and does not regard information as a substance. This line of reasoning has become central to the debate and, as such, warrants greater attention from the philosophy of physics community.
arXiv·2026-10-20·Simon Morelli
No generated summary available for this entry.
overview
Original abstract
The quantum marginal problem, concerned with the compatibility of local and global properties of a multipartite quantum system, is arguably one of the fundamental questions in quantum theory. In this article we introduce a novel family of inequalities bounding the allowed local spectra of a pure tripartite state. The number of inequalities in this family grows with the dimension of the system. Most importantly, the inequalities hold for arbitrary dimensions. For equal local dimension at most 4, they generate the complete set of eigenvalue inequalities.
arXiv·2026-10-20·Md. Muktadir Hasan, Md. Mafizul Islam, Ahmed Zubair
No generated summary available for this entry.
overview
Original abstract
The growing demand for high-capacity, fast-charging, and durable rechargeable batteries has intensified the search for advanced electrode materials, with two-dimensional materials offering large surface-to-mass ratios and short ion-diffusion pathways. Here, pristine and Co-doped Janus HfSSe monolayers were investigated as anode materials for Li-ion and Na-ion batteries using first-principles density functional theory. Pristine HfSSe was found to be dynamically stable and exhibited a 0.85 eV band gap, while Co substitution shifted the Fermi level toward the valence-band region. Adsorption of the first Li or Na layer induced metallic behavior, thereby improving charge transport. Co doping strengthened alkali-metal binding, with the most favorable Li and Na adsorption energies changing from -2.6125 and -1.9800 eV to -3.7405 and -3.0529 eV, respectively. Co doping created electron-deficient sites that enhanced Li/Na binding. Co-doped HfSSe accommodated up to four Li layers and three Na layers, increasing the theoretical capacities from 555.43 to 776.19 mAh/g for Li and from 370.29 to 582.14 mAh/g for Na. The average open-circuit voltages were 0.62 V for Li and 0.29-0.30 V for Na, with minimum migration barriers of 0.2153 and 0.1044 eV, respectively. These results identified Co-doped Janus HfSSe as a promising anode material for Li-ion and Na-ion batteries.
arXiv·2026-10-20·Musajan Kadir et al.
No generated summary available for this entry.
overview
Original abstract
We investigate photon-to-axion-like-particle (ALP) conversion in a finite, linearly polarized laser pulse for a single ALP field with simultaneous scalar-type and pseudoscalar-type couplings to photons. Varying the collision angle between the strong pulse and the probe provides a continuous kinematic scan of the resonant ALP mass. For fixed kinematics in this setting, the scalar-type and pseudoscalar-type ALP conversion amplitudes interfere coherently, making both the photon-to-ALP conversion probability and the polarization rotation depend on the difference between the probe polarization angle $α$ and the coupling angle $θ_g$. Conversion is maximal at $|α-θ_g|=90^\circ$, where the polarization rotation vanishes, while the rotation magnitude peaks at $α-θ_g=45^\circ$ modulo $90^\circ$, where conversion is half-maximal. These complementary polarization-angle dependences provide polarization-resolved signatures of mixed scalar--pseudoscalar photon couplings.
arXiv·2026-10-20·Francisco M. Fernández
No generated summary available for this entry.
overview
Original abstract
We show that several potential-energy functions based on the exponential function $e^{-αr}$, $α> 0$, are either equivalent or identical to the Tietz potential. Some of those potentials exhibit redundant parameters that can be removed without affecting their performance for the description of the vibration-rotation spectra of diatomic molecules.
arXiv·2026-10-20·Yubing Qian, Weiluo Ren, Ji Chen
No generated summary available for this entry.
overview
Original abstract
Neural network fractional quantum Hall (FQH) states offer a promising alternative for capturing Landau level (LL) mixing and for understanding FQH physics, yet the incorporation of physical priors has so far been limited to the minimal exact constraints built into the ansatz. Working in spherical geometry, we show that the network's flexibility suffers both when only minimal additional physical priors are supplied and when priors such as flux attachment are imposed rigidly. In the former case, the monopole harmonic product orbital (MHPO) ansatz is difficult to optimize, whereas in the latter, the expressivity of the neural network is restricted. We therefore propose the orbital pair matrix factor MHPO (MHPO-M) ansatz, which balances physical priors against flexibility by not only replacing the fixed Laughlin structure with learnable pair factors but also making them dependent on both the electron configurations and the orbitals. Across $ν=1/5$, $1/3$, and $2/5$, MHPO-M achieves the lowest variational energy among the tested variants, and a factorized orbital readout based on it enables scaling to 35 electrons, with energies competitive with trends inferred from three-LL exact-diagonalization results. These results demonstrate that physical priors can be appropriately incorporated without sacrificing the flexibility of neural network wavefunctions, opening a promising path toward accurate, scalable modeling of FQH systems with LL mixing.
arXiv·2026-10-20·Francesco Albarelli, Stefano Chessa, Jesús Rubio
No generated summary available for this entry.
overview
Original abstract
In single-shot Bayesian multiparameter quantum estimation, measurement incompatibility can increase the minimum joint quadratic loss by at most a factor of two relative to the bound obtained by optimising each parameter separately. Using the generalised Barnum--Knill inequality, we establish the same bound for a wider class of additive losses generated by positive score functions, showing that this limitation extends beyond the standard quadratic setting. To illustrate this result, we consider a broad family of periodic losses, including the sine loss sometimes employed in interferometry, and derive the corresponding incompatibility bound for Bayesian multiphase estimation with arbitrary prior knowledge. We further extend the framework to unbounded losses, such as absolute losses; this also recovers the case of quadratic losses.
arXiv·2026-10-20·Kunihiro Yananose, Changwon Park, Young-Woo Son
No generated summary available for this entry.
overview
Original abstract
Electrons in graphene move like massless relativistic particles, making them exceptionally mobile but difficult to trap because Klein tunnelling permits unimpeded passage through electrostatic barriers. This challenge extends to atomic collapse and hadron confinement. Twisted trilayers form Bernal and rhombohedral domains joined by smooth boundaries, bringing their carriers into contact. Here we show that a new mechanism, distinct from established approaches, confines massless fermions in equilateral triangular Bernal domains without mass barriers, bulk gaps or physical edges. Simulations and analytical modeling reveal that massless carriers have no adiabatic continuation into rhombohedral domains, while escape through nonadiabatic coupling to massive carriers is exponentially suppressed by smooth stacking variation. Perfect reflection in the adiabatic limit turns Bernal domains into quantum cavities in a gapless, edgeless metal. Striking density-of-states oscillations encode Eisenstein-integer arithmetic, linking energies and degeneracies to norms and prime factorizations. These findings bring relativistic confinement and number theory into experimentally accessible electronic spectra.
arXiv·2026-10-20·Mir Afrasiar, Xian-Hui Ge
No generated summary available for this entry.
overview
Original abstract
We study how the one-dimensional deformation suggested by nonadditive $q$-calculus can be extended to a rotationally covariant quantum model and what observable consequences follow from this extension. We choose a radial extension about a distinguished center in which only the radial derivative is deformed, while tangential derivatives retain their ordinary form. Within this model, we construct self-adjoint frame-momentum operators and derive a rotationally invariant uncertainty bound with a correction proportional to the mean distance from the center. We then adopt a non-negative kinetic Hamiltonian built from these momenta and derive the leading harmonic-oscillator energy shifts for weak deformation. The energy corrections split the levels with different orbital angular momenta that are degenerate in the undeformed oscillator, while preserving the degeneracy associated with rotational symmetry.
arXiv·2026-10-20·Heikki Suominen et al.
No generated summary available for this entry.
overview
Original abstract
We theoretically introduce a quantum-circuit synthesis protocol to realize any $n$-qubit transformation $U\in U(2^n)$, up to a diagonal. The resulting circuit is directly native to and optimal in gate count and depth for systems where bitstring-conditioned rotations with tunable angle and axis, $C^{(n-1)}R(θ,φ)$, form the set of native operations. Subsequently, we suggest how this protocol can be implemented in a few-mode superconducting circuit, and experimentally demonstrate the method for the smallest nontrivial case, i.e., for two qubits. We report an average gate fidelity of 97.6 % for Haar-random two-qubit unitaries up to phase shifts in the computational basis. Importantly, these results suggest that multimode devices, such as those in the multimon or multiunimon families may become competitive with qubit-array networks for general-unitary implementations for qubit counts as low as three.
arXiv·2026-10-20·Zhiqiang Huang
No generated summary available for this entry.
overview
Original abstract
The exact multi-resolvent hierarchy of dense many-body spectra encodes higher-order spectral-weight correlations, but closing it predictively for interacting Hamiltonians remains a challenge. We introduce the multi-resolvent self-consistency (MRSC) equations, which separate an exact algebraic hierarchy from an approximate finite-parameter closure. The exact Feshbach geometric identity organizes r-resolvent cumulants into a ladder over irreducible vertices Gamma^(r), and the projected hierarchy expresses those vertices as functionals of the cumulants. The closure works in finite parameters: a connectivity basis organizes a general Hamiltonian's seed into class amplitudes, and a causal r-fold Stieltjes representation with a moment-field identity reduce moment matching to a finite-dimensional problem closed at a predictive fixed point. On the free-fermion benchmark the tested exact identities are reproduced and the Faddeeva closure is recovered at r=1. In a blind test on the interacting Ising chain, with the exact two-resolvent data withheld, the Hamiltonian-derived closure predicts the tested probes to 0.35%-0.97%. At the observable level the exact two-resolvent sector supplies a sign-correct, energy-resolved correction to the single-resolvent baseline for the off-diagonal eigenstate-thermalization-hypothesis (ETH) variance, of order one relative to it. Closure errors organize hierarchically: a level-by-level deficit decomposition, anchor measurements of the isolatable terms, and an explicit propagation bound. The same moments further yield a diagnostic chain for the window conditions of local rotational invariance -- an exact drift-kernel identity, a proven single-state identifiability boundary, and a transferability census over couplings and realizations -- a finite-order framework, not a proof of universal emergence.
arXiv·2026-10-20·Dmitrii Akatev, Jakub Lewandowski, Maria Chekhova
No generated summary available for this entry.
overview
Original abstract
Thin-film spontaneous parametric down-conversion, due to the relaxed phase-matching condition, generates photon pairs that are extremely broadband in frequency and angle and highly entangled in time/frequency and position/momentum. Here we show that it also provides a very broad orbital angular momentum (OAM) spectrum, which, in contrast to the case of bulk crystals, is decoupled from the frequency spectrum. To demonstrate it experimentally, we generate photon pairs in a $7~μ\mathrm{m}$-thick lithium niobate film and compare them with those from a $500~μ\mathrm{m}$-thick periodically poled lithium niobate crystal under identical pump conditions. The thin-film source exhibits a substantially broader OAM spectrum, with the azimuthal Schmidt number almost 9 times larger than that of the bulk source. On this highly entangled state, we perform quantum-state tomography in selected two- and four-dimensional OAM subspaces, demonstrating high-purity maximally entangled states. These results highlight thin nonlinear films as a promising platform for high-dimensional quantum-state generation with weak spatial--spectral coupling.
arXiv·2026-10-20·Zhilong Liu et al.
No generated summary available for this entry.
overview
Original abstract
The Unruh effect links acceleration to thermalization, providing a relativistic setting for anomalous quantum relaxation. We demonstrate a {\it relativistic} strong quantum Mpemba effect in the Unruh thermalization of a two-level detector coupled to a massless scalar field. For a fixed pair of isospectral initial states, relaxation curves that never cross in inertial motion exhibit a Mpemba crossing above a threshold acceleration. At a higher, precisely tuned acceleration, the initially farther state has zero overlap with the slowest decay mode and relaxes with a faster asymptotic exponential rate. We identify how competition between transition and dephasing channels governs the relaxation spectrum, where sufficiently strong longitudinal coupling enables acceleration to switch the relaxation bottleneck between population and coherence modes. We derive the spectral-switching condition and construct isospectral preparation protocols that eliminate slow-mode contributions within their physical domains. These protocols reveal how coherence can suppress or enhance slow-mode overlap at fixed purity, depending on the underlying spectral structure. Our results establish acceleration as a control parameter for anomalous quantum relaxation, connecting relativistic quantum dynamics with nonequilibrium thermodynamics.
arXiv·2026-10-20·Franco Meroi et al.
No generated summary available for this entry.
overview
Original abstract
Optimal approximate state conversion is a fundamental task in quantum resource theories, yet existing solutions are largely tailored to specific distinguishability measures and resource theories. We show that every optimal approximate-conversion problem in the three paradigmatic majorization-based quantum resource theories of non-uniformity, bipartite pure-state entanglement, and pure-state coherence reduces exactly to one of only four elementary taut-string constructions. This holds for problems generated by Schur-convex spectral distances and by a broad family of quantum divergences satisfying a natural reduction property with respect to the corresponding equivalence group. The resulting framework encompasses a broad class of physically relevant distinguishability measures, including the trace distance, all unitarily invariant norms, quantum relative entropy, maximal quantum $f$-divergences, and the $α$-$z$ Rényi relative entropies. The increment vector of the corresponding taut string completely determines both the optimal approximation error and a canonical optimal state. Our results establish a common geometric framework for approximate quantum resource conversion, revealing that a broad class of seemingly different optimization problems is governed by the same taut-string geometric principle.
arXiv·2026-10-20·Michele Banfi et al.
No generated summary available for this entry.
overview
Original abstract
The measured logical error rate of a quantum low-density parity-check (QLDPC) code depends on the decoding algorithm. We develop a framework that certifies non-degenerate maximum-likelihood (ML) decoding outcomes on individual sampled shots under circuit-level noise, providing a common reference for comparing decoders and codes. Upper and lower bounds on the minimum correction cost in the true and competing logical classes establish success, failure, or an undecided outcome. Branch-and-bound search refines these intervals while retaining valid bounds under resource limits. Counting the outcomes bounds the empirical ML logical error rate, with interval width equal to the undecided fraction. Results for two bivariate bicycle codes show that best-first ordered statistics decoding (BF-OSD) tracks the non-degenerate ML benchmark closely while leaving some ML-correctable shots.
arXiv·2026-10-20·Alexander Bott, Fabio Di Pumpo, Enno Giese
No generated summary available for this entry.
overview
Original abstract
Ions possess both center-of-mass motion and internal states, rendering trapped-ion optical clocks susceptible to perturbations of both degrees of freedom, which results in systematic shifts and fluctuations with motional and relativistic origins. We develop a quantum theory that connects these effects to filter functions determined by the employed pulse sequences and show how the interrogation can be tailored to suppress or enhance specific perturbations. Our treatment includes laser frequency noise and motional effects such as recoil and Doppler shifts, micromotion and excess micromotion, as well as state-dependent trap imperfections and accelerations, e.g., caused by Stark shifts. We further account for relativistic effects including time dilation and the mass defect, and show how the same framework can be applied to hypothetical dark-matter signals. By considering ensemble-averaged phases and their variances, we characterize both systematic shifts and fluctuations, while asynchronous operation relative to the Paul-trap drive allows motional fluctuations to average down between runs. Our results provide a unified framework for characterizing and controlling the systematic and statistical contributions that determine the trueness and precision of trapped-ion optical clocks.
arXiv·2026-10-20·Lorenzo Bagnasacco et al.
No generated summary available for this entry.
overview
Original abstract
The Fer expansion writes the propagator of a driven quantum system as an ordered product of exponentials, each generated by the time integral of an effective Hamiltonian that governs the evolution left over by the previous factors. It can be stopped after finitely many factors whenever this leftover evolution is known in closed form, for instance when the effective Hamiltonian commutes with itself at all times, or precesses about a fixed axis with constant angular velocity. For $\mathfrak{su}(2)$, in any representation, from a qubit to a spin of any size, we resum the Fer recursion into a closed map on curves in $\mathbb{R}^3$. We prove that, for a real-analytic drive, in both cases the expansion stops beyond the first factor only trivially, when the first exponential is already exact.
arXiv·2026-10-20·Andrea Canzio et al.
No generated summary available for this entry.
overview
Original abstract
We show that, starting from the same state, optimal driving can sometimes reach a colder (or hotter) target in the same amount of time while dissipating less energy, or equivalently dissipate the same amount of energy in a shorter time. We study this counterintuitive phenomenon in the slow-driving regime of an open quantum system, where we name it Near-Equilibrium Anomalous Tradeoff (NEAT). We establish necessary conditions for its occurrence and show its underlying geometric origin. While NEAT is reminiscent of the well-known Mpemba effect, the two phenomena are distinct in general. We demonstrate NEAT in an exactly solvable qutrit model, as well as for d-dimensional birth-death dynamics with independently controlled energy levels. Finally, we show how NEAT can improve the performance of Carnot engines.
arXiv·2026-10-20·Guanxi Xun, Weiguang Cao, Haruki Watanabe
No generated summary available for this entry.
overview
Original abstract
We establish sufficient conditions for two-way local quantum-channel stability in classical $\mathbb Z_2$ lattice gauge models with spins on $m$-dimensional cells of a $d$-dimensional lattice. Each interaction multiplies the spins on the boundary of an $(m+1)$-cell. This family, defined on the full spin Hilbert space without a Gauss-law constraint, includes the Ising model at $m=0$ and the magnetic sector of the toric code at $m=1$. The low-temperature proof combines two ingredients: locally indistinguishable flat sectors and extended magnetic defects of dimension $d-m-1$. For $1\le m\le d-2$, sufficiently weak local classical perturbations at sufficiently low positive temperature preserve equivalence to the canonical flat ensemble. No internal or gauge symmetry is required of the perturbation. For weak noncommuting perturbations, we prove the same conclusion in a smaller sufficient window by reducing the diagonal probabilities to a weak classical interaction and recovering the coherences with a local channel. The conversion channels use product ancillary inputs, have polylogarithmic causal radius, and achieve any prescribed inverse-power whole-system trace-norm error. Sufficiently high-temperature states are instead two-way equivalent to a product state. Independent finite-dimensional onsite systems can be included with weak local couplings. An optimized covariance between two distant neighborhoods of parallel $m$-tori is nonincreasing under one-way local conversion and invariant under two-way conversion. Its values $\mathcal F_m=1$ and $0$ distinguish the proved low- and high-temperature domains without a protecting symmetry. These sufficient domains do not determine the full phase diagram.
arXiv·2026-10-20·Ji-Hui Mo, Yuan-Hong Tao
No generated summary available for this entry.
overview
Original abstract
Quantum amplitude estimation offers a theoretical quadratic speedup over classical Monte Carlo methods for financial derivative pricing. However, extending gate-based algorithms to path-dependent barrier options has historically been hampered by sequential path discretization, where tracking price paths across $d$ monitoring dates incurs a linear escalation in qubit footprint and gate depth ($\mathcal{O}(d)$), posing severe coherence challenges for near-term quantum processors. In this work, we present a constant-depth quantum pricing framework that fundamentally eliminates the temporal dependency of barrier monitoring. Leveraging the Brownian reflection principle and Girsanov theorem, we project the continuous supremum dynamics onto a static bivariate joint distribution of the terminal price $S_T$ and running supremum $M_T$. This allows decoupling dynamic boundary checks into a static bivariate oracle comprising two parallel comparators and a dual-controlled rotation gate. We prove this architecture reduces circuit depth and comparator complexity from $\mathcal{O}(d)$ to an invariant $\mathcal{O}(1)$, while supporting discrete monitoring via zero-quantum-cost boundary corrections. Transpilation benchmarks for daily monitoring ($d = 252$) show our framework slashes physical CNOT count by 98.59% (from 2262 to 32) and compresses two-qubit depth by 98.02% (from 1514 to 30 layers). Under a realistic 127-qubit IBM Eagle noise model, the shallow circuit achieves a 7.84% relative valuation error with M3 readout mitigation. Finally, the framework seamlessly extends to nonlinear exotic payoffs lacking analytical solutions, establishing a noise-resilient pathway toward practical quantum advantage in computational finance.
arXiv·2026-10-20·Leigh Lapworth, Jarrett Smalley, Christoph Sünderhauf
No generated summary available for this entry.
overview
Original abstract
Unstructured meshes are widely used in modelling and simulation in Computational Fluid Dynamics (CFD) due to their geometric flexibility. However, they require an efficient block encoding circuit describing the system. Here, we present a new block encoding methodology for unstructured mesh solvers based on decomposing the system matrix into a sum of 1-sparse matrices. This block encoding is engineered to reduce subnormalisation even in the absence of structure by hiding the contribution of large matrix elements behind others. We investigate three methods of 1-sparse decomposition. Our circuit constructions can optionally take advantage of limited matrix bandwidth and repeated values. For example we consider digitisation (reduced precision), where the number of multiplexed rotation gates is equal to the number of non-unique matrix entries. We evaluate our methodologies using 2D and 3D CFD matrices for unstructured aerofoil meshes, structured cavity, and duct meshes, with and without matrix preconditioning. Our results show that we are able to achieve a block encoding with a near constant subnormalisation factor as the number of matrix preconditioning infill levels increases. This significantly reduces the subnormalised condition number and, in one case, reduces the degree of the QSP polynomial approximation to $1/x$ by 100,000. Reduced precision digitisation is shown to become more effective as the number of preconditioning infill levels is increased and, in one case, reduces the number of multiplexed rotations from 2,785,576 to 546 whilst maintaining an infidelity of $2.6\times10^{-5}$ relative to the classical solution. The effect of digitisation on QSVT solutions is demonstrated using 2D and 3D unstructured mesh aerofoil cases. Due to its flexibility and automatic applicability, we believe our 1-sparse decomposition block encoding can offer benefits to other quantum applications.
arXiv·2026-10-20·Fu Zheng, Wei Liu, Xu Qian
No generated summary available for this entry.
overview
Original abstract
Dipolar Bose--Einstein condensates (BECs), i.e., BECs with long-range dipole-dipole interactions (DDI), exhibit extraordinarily rich physics and serve as a versatile experimental platform for exploring exotic quantum states of matter. Within the mean-field framework, a dipolar BEC can be described by the Gross--Pitaevskii (GP) model with a DDI term. Its stationary states consist of the ground state, which minimizes the GP energy functional under the normalization constraint, and excited states, which are higher-energy critical points that typically correspond to constrained saddle points. Excited states encode collective excitation modes and play a key role in the dynamical stability and quantum phase transitions of cold-atom systems. However, in contrast to the extensively studied ground state, they remain far less explored numerically, especially in dipolar systems. In this work, we develop a numerical method based on the constrained gentlest ascent dynamics (CGAD) that systematically computes excited states of dipolar BECs by stably targeting constrained saddle points with any prescribed Morse index. Specifically, a semi-implicit sine-pseudospectral discretization with an orthonormalization correction step is adopted, and the nonlocal DDI terms are evaluated efficiently and accurately via the nonuniform fast Fourier transform (NUFFT). The resulting scheme is applied to one-, two-, and three-dimensional dipolar BECs, enabling a detailed numerical investigation of their excited states. Remarkably, our simulations reveal that excited states can persist even in regimes where the ground state of the condensate becomes mean-field unstable. This work provides a computational framework for studying excited states in dipolar quantum gases and offers insights for future theoretical and experimental investigations.
arXiv·2026-10-20·Paolo Facchi et al.
No generated summary available for this entry.
overview
Original abstract
Using contour-integral representations of the permanent and of the Hafnian, we turn the computation of their moments for random matrices into a replica calculation, analogous to that of the moments of the partition function of a mean-field spin glass. For the $2k$-th moment of $N\times N$ matrices with independent entries, the dominant saddle point is replica symmetric for $k>2$, and we obtain in closed form the exponential growth rate, the prefactor and the first $1/N$ correction, in agreement with exact enumerations. The growth rate depends only on whether the entries are real or complex; higher cumulants affect only the prefactor and the $1/N$ term. At $k=2$ the replica-symmetric solution becomes unstable, separating a power-law bulk of the distribution from a large-deviation tail, which we compute. The results apply to boson sampling with single photons and with squeezed light.
arXiv·2026-10-20·Sergio Gándara Gándara et al.
No generated summary available for this entry.
overview
Original abstract
Atmospheric turbulence and channel loss represent the primary limiting factors in ground-to-satellite quantum communication systems, yet their joint impact remains insufficiently characterized across diverse operational conditions. In this work, we develop a comprehensive and open atmospheric channel model for quantum optical links along ground-to-satellite paths, integrating altitude-dependent molecular and aerosol absorptions. The model is validated with available data from missions such as Micius and Hispasat, including a secondary viability assessment for a hypothetical Starlink-based quantum communication network, where we evaluate the predicted channel behavior in terms of single-photon transmittance and power balance, alongside the channel capacity of the link for uplink and downlink exclusively. Our comparative analysis demonstrates the ability of our channel model to predict real data under simple atmospheric behavior assumptions, which offer practical guidelines for the design and optimization of future quantum satellite missions.
arXiv·2026-10-20·K. Fabitha et al.
No generated summary available for this entry.
overview
Original abstract
Concatenation of quantum repeater nodes has been proposed as a means to distribute entanglement efficiently across future long-distance networks. Here, we demonstrate a trapped-ion repeater node that establishes photonic entanglement over a 17 km fiber traversing a city, moving beyond laboratory-only prototypes. The node comprises two atomic ions coupled to an optical cavity. First, a detailed characterization is performed of the long fiber channel and of ion-photon entanglement distributed across it. Next, a repeater-node protocol is implemented, achieving entanglement between a local photon and a remote photon with a Bell-state fidelity of $81.6^{+1.9}_{-1.4}\%$. These results demonstrate that trapped-ion repeater-node technology can operate over existing city-scale fiber infrastructure and represent a step toward distributed quantum repeater networks.
arXiv·2026-10-20·Yutao Chen et al.
No generated summary available for this entry.
overview
Original abstract
High-fidelity entangling gates are essential for quantum information processing. In transmon circuits, higher excited states provide additional pathways for engineering interactions within the computational subspace. Here we demonstrate controlled-Z (CZ) gates that exploit two noncomputational states, $\ket{02}$ and $\ket{20}$, through selective Floquet coupling. The nontrivial parametric modulation can activate both auxiliary transitions from $\ket{11}$ while suppressing the leading exchange between $\ket{01}$ and $\ket{10}$. Based on this approach, we develop two gate protocols: a nonadiabatic round trip through a bright auxiliary superposition and adiabatic evolution along a zero-energy dark state, both achieving average gate fidelities above $99.99\%$ in numerical simulations. Control of the modulation phase further extends the bright-state protocol to conventional and unconventional geometric CZ gates. Effective-model simulations show that unconventional control improves tolerance to residual $ZZ$ coupling and static qubit-frequency offsets relative to conventional control over the parameter ranges examined. Simulations including neighboring spectator qubits show that the original nonadiabatic bright-state and adiabatic dark-state CZ protocols retain high gate fidelities. This framework offers new routes toward the experimental realization of CZ gates and their geometric implementations.
arXiv·2026-10-20·Zhi-Qiang Zhang et al.
No generated summary available for this entry.
overview
Original abstract
Understanding the three-dimensional (3D) quantum Hall effect, characterized by a Chern vector rather than a single Chern number, has been a central pursuit in topological physics. While quantized Hall transport is established for the special case with one nonzero Chern component, recent realizations of more general Chern-vector states raise a fundamental question: how does such topology protect quantized transport? Here, we predict a distinct 3D quantized Hall effect protected by $\mathbf{C}=(0,m,n)$. For samples with dimensions $L_y$ and $L_z$, global topology enforces collective quantization of $mL_y+nL_z$, despite the fragility of individual edge modes to disorder. This reveals a novel transport regime in which robust quantization emerges as a holistic property of a unified chiral network,rather than of its constituent modes. Crucially, this collective response manifests as a quantized Hall conductance $G_{xy}=\pm(mL_y+nL_z)e^2/h$, with a distinctive dependence on both Chern-vector components and sample dimensions. We propose candidate materials to facilitate experimental observation.
arXiv·2026-10-20·Ying-Xue Zhang, Hui-Min Zhao, Yan-Kui Bai
No generated summary available for this entry.
overview
Original abstract
We theoretically investigate narrowband nonreciprocal transmission in a Doppler-broadened five-level M-type atomic medium. After Doppler averaging, the M-type system retains a narrow near-resonant electromagnetically induced transparency window that is narrower than that of a standard three-level $Λ$ system. This spectral narrowing is associated with the decreasing separation between the two inner dressed states as atomic velocity increases. The transparency window exhibits pronounced direction-dependent transmission, with high forward transmission and strong suppression in the reverse direction. The transparency linewidth and forward-backward probe transmission can be controlled via two independent driving fields, while the central transparency frequency is kept essentially unchanged. The resulting narrowband nonreciprocity supports high forward transmission together with strong suppression in the reverse direction, which is suitable for frequency-selective optical filtering and nonreciprocal optical transmission in thermal atomic media. Our scheme with these specific features is geared towards enabling compact vapor-cell-based nonreciprocal devices for quantum network applications.
arXiv·2026-10-20·Jiong Li et al.
No generated summary available for this entry.
overview
Original abstract
Symmetry-protected ground-state crossings can produce exact first-order transitions (FOTs) even at finite $N$, in contrast to continuous transitions governed by soft-mode criticality. We establish exact Juddian ground-state crossings for arbitrary finite $N$ in the one- and two-photon anisotropic Dicke models and identify a common two-channel structure: the eigenvalues of the coupling matrix set the local normal-state instability thresholds, whereas its determinant fixes the exact crossing. Despite this common structure, the resulting FOTs have distinct fates determined by the bosonic response. In the one-photon model, the overlap between coherent Juddian branches vanishes in the thermodynamic or infinite frequency-ratio limits, asymptotically suppressing the FOT cusp. In the two-photon model, squeezed Juddian states lose normalizability at spectral collapse, thereby terminating the physical FOT line at finite $N$. Although the cusp strength tends to zero as the endpoint is approached, the terminating FOT retains a collective spectral signature: the different-parity gap is predicted to close with an $N$-dependent exponent $μ_N=(2N+3)/4$, one greater than the cusp termination exponent. By contrast, the same-parity soft mode retains $N$-independent square-root scaling and governs the critical response. Thus spectral collapse can terminate an exact finite-$N$ FOT while preserving its collective imprint in the parity-resolved spectrum.
arXiv·2026-10-20·Luis Paulo Santos, Thomas Bashford-Rogers
No generated summary available for this entry.
overview
Original abstract
We propose an approximate classical algorithm for estimating quantum circuits' transition amplitudes, $\langle Ψ_f | \hat{U} | Ψ_0 \rangle$, based on Monte Carlo sums over bidirectionally sampled Feynman paths. The algorithm generates Feynman paths, i.e., sequences of intermediate computational basis states, by combining information from random walks initiated at both the input and output states, $Ψ_0$ and $Ψ_f$, respectively. It further combines this bidirectional approach with Multiple Importance Sampling, a powerful variance reduction technique that avoids variance peaks caused by divisions by the very low sampling probabilities associated with hard to reach paths. Empirical data demonstrate the superior convergence rate exhibited by the bidirectional algorithm over a unidirectional, forward-only sampling approach. This superiority is due to the effectiveness of the proposed algorithm in finding and weighting paths with non-zero amplitude in an extremely sparse path space. Sum of paths algorithms exhibit very favourable space complexity. Monte Carlo replaces exhaustive enumeration of the exponentially large path space by stochastic sampling, the computational cost being determined by the variance of the estimator. This work demonstrates these two features by presenting results on very large quantum circuits, with up to 4096 qubits.
arXiv·2026-10-20·Runqi Kang et al.
No generated summary available for this entry.
overview
Original abstract
Axions are a compelling dark matter candidate suggested by theories beyond the Standard Model. The predicted axion-electron coupling and the resulting pseudomagnetic field allow for laboratory axion searches. Here we report an experimental axion search via a superconductor-spin hybrid magnetometer. A state-of-the-art broadband magnetometer with a sensitivity of sub-100 aT/Hz$^{1/2}$ at tens of kHz has been realized by coupling a ferrite spin sensor to a readout system based on a superconducting quantum interference device. The most stringent terrestrial constraints on the axion-electron coupling have been established in the frequency range 5$\sim$60 kHz. In the future, an improvement on the constraints of more than 4 orders of magnitude is foreseeable through arrays of superconductor-spin hybrid magnetometers with optimized designs. This work demonstrates the potential of superconductor-spin hybrid magnetometers in high-precision magnetic field sensing and the study of fundamental physics.
arXiv·2026-10-20·Chulwoo Ahn, Vladimir Manucharyan
No generated summary available for this entry.
overview
Original abstract
We demonstrate K-band nondegenerate three-wave-mixing amplification in a multimode resonator comprising an array of 500 SNAILs. Pairing K-band signal modes with lower-frequency internal idler modes enables 20 dB of gain continuously from 19.6 to 25.6 GHz with pump frequencies below 32.2 GHz. At 20 dB gain, the 3-dB bandwidth ranges from 2.6 to 11.7 MHz, and the input-referred 1-dB compression power reaches -100.9 dBm. In the 20-22 GHz band, the average added noise is 0.73 quanta. A two-mode nondegenerate parametric amplification model describes the measured gain response and gain-bandwidth behavior, while a multimode Kerr model captures the overall compression scale. Our amplifier provides a practical solution for implementing a state-of-the-art readout of superconducting qubits in the K-band.
arXiv·2026-10-20·Jing Dong et al.
No generated summary available for this entry.
overview
Original abstract
The detection of axion dark matter poses a significant challenge due to its exceptionally weak coupling to standard-model particles. Here we develop a noise-tolerant quantum-metrology scheme based on coupled $^{129}$Xe spin ensembles to search for such weakly interacting particles. Within an experimentally accessible parameter regime, our scheme achieves an ideal exclusion limit on the axion coupling constant that is several orders of magnitude more stringent than that of conventional detection methods. We further investigate the performance of our scheme under dissipative noise and find that its robustness is fundamentally governed by the energy-spectrum structure of the composite spin-environment system. Remarkably, when a bound state emerges in the spectrum, the exclusion limit asymptotically recovers its ideal value in the non-Markovian dynamics, whereas under the Markovian approximation the limit deteriorates significantly due to noise. Our results establish a universal mechanism for noise-resilient exploration of beyond-standard-model physics, which can be practically implemented by engineering bound-state formation via tuning the Larmor frequency of the spin ensembles.
arXiv·2026-10-20·Tai Hyun Yoon
No generated summary available for this entry.
overview
Original abstract
Treating the arrow of time as a controllable quantum variable rather than a fixed external parameter is a central challenge in quantum physics. Recently, Bloch~\cite{Bloch2025} proposed the theoretical concept of a \emph{time qubit}, a two-level control space $\mathcal{H}_T=\mathrm{span}\{\ket{+},\ket{-}\}$ that selects between opposite Hamiltonian evolutions $\hat{H}_{\pm}=\hat{H}_0\pm\hat{V}$, but this paradigm has remained experimentally unrealized. Here we formulate the quantum-optical theory of a single-photon time qubit---uncovering quantum-vacuum control and complementarity of the arrow of time---and experimentally probe and validate its predictions using phase-resolved single-photon interferometry from two coherently seeded entangled nonlinear biphoton sources~\cite{Lee2018,Yoon2021}. First, we show theoretically and verify experimentally that a controlled $π$ pump--seed phase inversion during pair creation from the quantum vacuum flips the stimulated displacement generator $\hat{V}\to -\hat{V}$ on top of the spontaneous two-mode squeezing background $\hat{H}_0$, reversing the stimulated evolution time [$\hat{U}_{\mathrm{stim},-}(t)=\hat{U}_{\mathrm{stim},+}(-t)$] and enabling universal single-qubit $\mathrm{SU}(2)$ control and postselection-free first-order tomography on the temporal Bloch sphere. Second, we prove that spontaneous idler vacuum fluctuations record complete which-branch (temporal-direction) information whereas the shared coherent seed erases it without cascading or aligning the idler beams, establishing an exact wave--particle complementarity law $|\bm{r}|=\mathcal{V}=|α|^2/(1+|α|^2)$ for the purity of the arrow of time and enabling direct first-order measurement of the Loschmidt time-reversal echo.
arXiv·2026-10-20·Tai Hyun Yoon
No generated summary available for this entry.
overview
Original abstract
How macroscopic definite outcomes and nonlocal correlations emerge from entangled superpositions across spacelike-separated regions without superluminal action or {\it ad hoc} wavefunction collapse remains a defining open question in the foundations of quantum mechanics. Here, we resolve this century-long paradox within \textit{linear} relativistic quantum electrodynamics by developing an open-system and measurement-defined framework realized in dual, spacelike-separated nonlinear crystals driven synchronously by a multi-mode optical frequency comb and seeded by an ultra-narrow coherent laser. Expanding the transverse electromagnetic vector potential into discrete single-photon frequency-comb supermodes, we show that tracing out the unmeasured continuous-wave idler field yields an exact spatial dephasing Lindblad master equation whose decoherence rate is governed by the non-orthogonal state overlap of single-photon-added coherent states. Connecting this open-system map to free-vector-space quotient measurement theory, we demonstrate that single-particle interference arises from the geometric projection of the composite state onto detector-defined conditional cosets rather than remote collapse, establishing strict operational equivalence across pump, seed, and signal phase scans. The resulting wave-particle-entanglement triality equality $P^2 + E^2 + V^2 = 1$ is saturated across the complete parameter space, while the atomic-clock-referenced comb structure anchors continuous-variable time-frequency displacement stabilizers directly at the hardware layer. Our work unifies induced coherence, Bohr's complementarity, and quotient measurement theory, providing a microscopic pathway toward fault-tolerant bosonic quantum information processing.
arXiv·2026-10-20·Vishnu Jejjala, Joydeep Naskar
No generated summary available for this entry.
overview
Original abstract
Stabilizer Rényi moments depend on a choice of operator basis and need not be determined by entanglement spectra. In this paper, we study their spatial decay in critical quantum chains described by two-dimensional conformal field theories. We derive an exact entanglement baseline for reductions of pure stabilizer states and a symmetry selection rule for the charged contribution at fixed support. An exact Ising example shows that an on-site rotation changes the full decay exponent while preserving every subsystem entanglement spectrum. For growing Ising intervals at index two, we obtain an exact Pfaffian representation and compare the charged amplitude with a candidate conformal boundary calculation. The data support this prediction, but its identification with the lattice limit still requires endpoint matching and control of the order of limits.
arXiv·2026-10-20·Haimi Nguyen, David R. Reichman
No generated summary available for this entry.
overview
Original abstract
It has been shown that Discrete Time Crystal (DTC) behavior may arise in the periodically driven, open Dicke model in the thermodynamic limit ($N \rightarrow \infty$). In this work, we demonstrate that finite $N$ non-mean-field fluctuations in this model can lead to decay rates and amplitudes of transient DTCs that display a non-trivial non-monotonic behavior with an increasing number of atoms. We show that the second-order cumulant expansion fails to capture the finite-size dynamics, while a stochastic version of the Truncated Wigner Approximation (TWA) is remarkably accurate, particularly in the large atom ensemble limit. Using the TWA and the Monte Carlo Wave Function (MCWF) approach, we identify three distinct dynamical regimes of transient DTC behavior in the finite-size Dicke model. We outline the mechanism behind the non-monotonic finite size dynamical decay of DTC order and discuss the implications for experiments performed on finite-sized atomic assemblies.
arXiv·2026-10-20·Zhe Wang, Dongxu Liu, Zheng Yan
No generated summary available for this entry.
overview
Original abstract
Universal information extracted from entanglement at a critical point is commonly associated with the long-distance properties of the bulk state, while microscopic details of a lattice bipartition are expected to be washed out under coarse graining. Counterintuitively, we show directly that such microscopic information can survive in the statistical ensemble that determines the second Rényi entropy and obviously change the physics there. Using quantum Monte Carlo simulations of the square-lattice $J$-$Q_3$ model at the Néel--valence-bond-solid (VBS) transition, we measure magnetic and dimer order parameters in the Rényi-2 ensemble. For a standard axis-aligned bipartition, the VBS component perpendicular to the entanglement boundary remains finite in the thermodynamic extrapolation and is inequivalent to the parallel component, while the Néel order vanishes. For a $45^\circ$ tilted bipartition, in contrast, the two VBS components remain equivalent within numerical accuracy. We interpret this contrast in terms of the Rényi twist defect: the two bipartitions have the same bulk theory but realize different microscopic defect symmetries. Our results demonstrate that lattice information invisible to the bulk continuum theory alone can remain active in the long-distance Rényi ensemble, providing a microscopic explanation for the strong bipartition dependence previously observed in entanglement studies of deconfined criticality.
arXiv·2026-10-20·Grace Ding, Yanzhu Chen, Sheng-Jie Huang
No generated summary available for this entry.
overview
Original abstract
We develop smooth hybrid lattice surgery for group surface codes, enabling joint logical measurements through merge and split operations along smooth boundaries. The code patches may correspond to identical or different finite groups, including non-Abelian groups. Our central result is that smooth merge and split realize a logical $K$-coset measurement, where $K$ is the subgroup defining the interface. This generalizes the joint logical parity measurement of ordinary surface codes. Using a tensor-network representation, we derive explicit measurement circuits and develop procedures for correcting nonidentity measurement outcomes. We illustrate the framework through a generalized controlled multiplication gate between group surface codes and protocols for preparing the $T$, $CZ$, $CCX$, and $CS$ magic states, producing resources encoded in one or more $\mathbb{Z}_2$ surface code patches. Our results show how smooth hybrid lattice surgery broadens the range of logical operations available for group surface codes.
arXiv·2026-10-20·Hikaru Shimizu et al.
No generated summary available for this entry.
overview
Original abstract
Coexistence of classical and quantum light in optical fiber is a key requirement for scalable quantum networks. However, it is fundamentally limited by nonlinear crosstalk from intense classical signals. Hollow-core fiber (HCF), with its intrinsically low optical nonlinearity, offers a promising solution. Here, we experimentally demonstrate the coexistence of polarization-entangled photons with dense wavelength-division multiplexed (DWDM) classical signals with a total launch power of 11.2 dBm, and perform a direct comparison between equal-length single-mode fiber (SMF) and photonic-bandgap-based HCF deployed in a campus network. We observe that HCF suppresses background noise by approximately two orders of magnitude compared to SMF, while preserving high-fidelity entanglement distribution. Our results provide clear experimental evidence of the advantage of HCF and establish its potential as a transmission medium.
arXiv·2026-10-20·Katsuhiro Takahashi, Shouya Yoshida, Katsunori Wakabayashi
No generated summary available for this entry.
overview
Original abstract
We investigate the electronic states of the K$_4$ lattice in a uniform magnetic field within a nearest-neighbor tight-binding model. The K$_4$ lattice is a \rev{noncentrosymmetric three-dimensional network with triple-Dirac cones at the $Γ$ and H points}. By fixing the Bloch momentum component parallel to the field, the Peierls-substituted tight-binding problem reduces to an effective two-dimensional problem and yields a Hofstadter spectrum \rev{whose self-similar subpatterns reflect the geometry of the lattice projected onto the plane perpendicular to the field}. A square-like substructure emerges on the flux scale $φ= 1/8$ for $\bm{B}\parallel[100]$, and honeycomb- and triangular-like substructures emerge on the finer scale $φ= 1/32$ for $\bm{B}\parallel[111]$\rev{. Here $φ$ is the flux through the elementary plaquette of the projected lattice, and these scales correspond to one flux quantum per projected unit cell. Owing to the screw axes of the chiral K$_4$ network, the field-parallel momentum acts as an additional flux, which, for commensurate values of this momentum, shifts the spectrum along the flux axis and brings the second triple-Dirac cone at the H point into the magnetic spectrum}. In the weak-field limit, we derive the Landau-level structure from a low-energy effective Hamiltonian around the $Γ$ point. The three-component nature of the triple-Dirac cone gives rise to a cubic secular equation, whose solutions describe how a pseudospin-flat branch coexists with two relativistic Landau ladders \rev{and a single chiral $n=0$ level dispersing linearly along the field, in agreement with the lattice calculation}.
arXiv·2026-10-20·Dong Wang, Thomas Wolfs
No generated summary available for this entry.
overview
Original abstract
We consider the DMPK ensemble, which models quantum transport in a disordered wire, and describe its limiting local statistics as the number of particles tends to infinity. In the metallic regime, as well as at crossover I, we obtain sine statistics in the bulk, Bessel statistics at the hard edge and Airy statistics at the soft edge. In the insulating regime, we prove localization around certain explicit deterministic positions with Gaussian fluctuations. This confirms and quantifies the predicted universal and localized behavior in the physics literature. At crossover II, we obtain explicit limiting kernels in the bulk and at both edges, which interpolate between these regimes. The hard edge kernel involves Legendre functions and, to the best of our knowledge, is new, while the bulk and soft edge kernels agree with those derived for the squared singular values of critically scaled products of independent Ginibre matrices. To explain these similarities, we construct a class of invariant pseudo-unitary matrices that is closed under taking products and use it to interpret the DMPK ensemble as the joint density of the spectral variables of a product of such random matrices. More generally, the latter takes the form of a polynomial ensemble of derivative type involving a second order differential operator compatible with the Legendre functions. Finally, we obtain uniform asymptotic expansions of the mean and variance of the conductance and prove that the DMPK ensemble admits universal conductance fluctuations, i.e. the variance of the conductance tends to $1/15$ throughout the whole metallic regime. This again confirms the predictions in the physics literature.
arXiv·2026-10-20·Seungwoo Kim et al.
No generated summary available for this entry.
overview
Original abstract
Photon loss is the dominant noise source in linear optical quantum circuits. Each lost photon turns an ideal n-photon outcome into a pattern with fewer photons, so the detector counts no longer follow the ideal output distribution, and the lossless events that do follow it become exponentially rare as the photon number grows. Discarding the lossy events (postselection) therefore wastes most of the data at realistic loss rates, and the ideal distribution has to be inferred from the lossy counts themselves. Recycling-based mitigation (Mills & Mezher, Quantum 2026; Quandela's photon_recycling) reweights lossy samples to recover lossless probabilities, but its estimators are biased and restricted to the no-collision sector, where each output mode holds at most one photon. We instead treat the raw counts as Multinomial observations under per-photon binomial loss and infer the ideal output distribution and the loss rate jointly from a Bayesian posterior, which extends naturally to outputs with collisions. On data from the independent Perceval simulator at the scale of prior work (n=4 photons in m=20 and m=10 modes), the posterior has lower KL divergence than both recycling and postselection at every tested loss rate in the no-collision benchmark. In the collision regime it recovers the loss rate and the collision-pattern probabilities, which recycling cannot estimate, and stays below recycling at every loss rate and below postselection except at low loss, where the two are comparable. Its advantage over recycling grows with the sample count, and it supplies credible intervals that the baselines lack.
arXiv·2026-10-20·Yan-Ying Zhu et al.
No generated summary available for this entry.
overview
Original abstract
With the rapid advancement of quantum computing, the security of traditional cryptographic systems is facing significant challenges. As a fundamental component of symmetric cryptography, block ciphers have attracted increasing attention regarding their quantum security in recent years. In this paper, we propose new quantum attacks on two Feistel-type constructions, i.e., New Structure IV and the lightweight block cipher LBlock, under the quantum chosen-plaintext attack (qCPA) model. First, we construct an 8-round quantum distinguisher for New Structure IV and perform an $r(r>12)$-round quantum key-recovery attack. Compared with Li et al.'s qCPA-based result presented at INSCRYPT 2024, our attack reduces the time complexity by a factor of $2^{n/2}$, where $n$ denotes the subkey length. Second, we design a 9-round quantum distinguisher for LBlock and extend it to an $r(r>15)$-round quantum key-recovery attack. The proposed quantum distinguisher covers one more round than Liu et al.'s automated-search distinguisher at ASIACRYPT 2025, which results in a $2^{16}$ reduction in the time complexity of our $r$-round quantum key-recovery attack on LBlock. Furthermore, by analyzing the structure of the round function and the key scheduling of LBlock, we reduce the subkey guess space for the 15-round attack from 76 bits to 52 bits, lowering the time complexity from \(O(2^{38})\) to \(O(2^{26})\) by a factor of \(2^{12}\).
arXiv·2026-10-20·Da-Wei Wang, Yu-xi Liu
No generated summary available for this entry.
overview
Original abstract
Waveguides provide a flexible platform for long-range interactions between superconducting qubits. Here, we study how to engineer the effective \(XY\) and \(ZZ\) interactions between two qubits via qubit frequency assignments and multimode interference determined by the mode configuration and standing-wave parities of a finite multimode waveguide. For a single-mode waveguide, we find that \(XY\) and \(ZZ\) interactions cannot be simultaneously suppressed to zero and the residual qubit-qubit coupling always exists. For example, the \(XY\) interaction may be suppressed to a negligible level when two qubits and the waveguide mode satisfy the two-photon resonant condition, but the \(ZZ\) interaction cannot be switched off. For multimode configurations within the central dispersive window, the engineered interaction types are very different for odd and even numbers of modes. Even-mode configurations can readily produce strong \(XY\) interactions, whereas odd-mode configurations can strongly suppress the \(XY\) interaction while retaining a finite \(ZZ\) interaction. Full-Hamiltonian simulations of minimal two- and three-mode configurations confirm \(XY\)-dominated SWAP dynamics and \(ZZ\)-dominated CZ-type dynamics, respectively. These results establish a frequency assignment criterion of qubits and waveguide modes for selectively engineering long-range qubit-qubit interaction types induced by the waveguide with finite multimode.
arXiv·2026-10-20·Igor Timofeev, Dawid A. Hryniuk, Marzena H. Szymańska
No generated summary available for this entry.
overview
Original abstract
Long-range interactions can protect dissipative order against fluctuations, but determining when they do so in two dimensions remains out of reach for existing many-body methods. We develop a continuous SU(2)-covariant truncated-Wigner framework that maps the problem onto stochastic dynamics with one Bloch sphere per site. Derived systematically from the exact Stratonovich-Weyl evolution of the Lindblad equation, it generates both drift and reservoir noise for arbitrary spin $S$. Benchmarks against exact and tensor-network calculations validate its description of non-equilibrium dynamics and steady states. Applied to 400-site two-dimensional dissipative anisotropic XY lattices, our method reveals physics missed by mean-field and perturbative approaches: vortex-antivortex proliferation destroys the predicted staggered-XY phase for nearest-neighbour coupling, whereas algebraically decaying interactions stabilize an extended $\mathbb{Z}_2$-ordered phase. We obtain the first beyond-mean-field steady-state phase diagram of the long-range interacting model, revealing reentrant loss of order at strong coupling and closure of the ordered region beyond $α\approx 3.5$. Our new method provides a scalable route to strongly correlated driven-dissipative systems with long-range interactions, higher-dimensional geometries, spin-boson couplings, and spins beyond one half, relevant to modern experiments with magnetic atoms and polar molecules in optical lattices and tweezer arrays.
arXiv·2026-10-20·Juan A. Cañas, Guo-Qing Zhang, A. Martín-Ruiz
No generated summary available for this entry.
overview
Original abstract
We investigate the topological phase in a one-dimensional Su-Schrieffer-Heeger (SSH) chain in the presence of a finite concentration of non-Hermitian substitutional impurities. Our primary focus is the discovery of a deterministic mechanism to actively reconfigure the topological phase boundaries by introducing site-dependent, non-reciprocal intracell and intercell hopping amplitudes. Specifically, breaking the internal structural symmetry of the non-reciprocal impurity hoppings induces a targeted macroscopic displacement of the critical point. This mechanism allows for the controlled expansion or compression of the topological phase strictly via local defect asymmetry. We validate this boundary displacement through finite-size scaling analysis. The extracted correlation length critical exponents ($ν\approx 1.455$ and $ν\approx 1.397$ for symmetric and asymmetric configurations, respectively) confirm a disorder-induced departure from the pristine SSH universality class, with the exponent diverging at high defect densities. We also report an impurity-induced real-to-complex spectral transition geometrically characterized by the Non-Hermitian Skin Effect. Ultimately, our results establish how isolated non-Hermitian asymmetries cooperatively interact to deterministically shift macroscopic topological protection.
arXiv·2026-10-20·Dongkyu Kim et al.
No generated summary available for this entry.
overview
Original abstract
In this work, we demonstrate a dual-function, common-aperture free-space optical system that simultaneously supports decoy-state BB84 quantum key distribution (QKD) at 803 nm and bidirectional classical laser communication at 640/660 nm over a 10.31 km terrestrial link from a mobile platform to a stationary ground station. To the best of our knowledge, this is the first field demonstration of a fully integrated common-aperture architecture where a co-propagating classical optical link simultaneously performs full QKD post-processing and ecrypted payload transmission over a 10 km atmospheric channel. The classical link utilizes Manchester-coded on-off keying (MC-OOK) at 10 MHz, achieving a packet error rate of $\sim$ 0.4 $\%$ (estimated bit error rate (BER) of 3.13 $\times$ 10$^{-5}$) with hardware-based self-synchronization and error-packet retransmission. Over the 10.31 km link, the QKD system achieved an average quantum bit error rate (QBER) of 2.512 $\%$ and an average secret key rate of 644 bps using rate-adaptive low-density parity-check (LDPC) codes. Finally, using the distilled keys, real-time AES-256 encrypted image transmission was executed over the co-aligned classical optical channel, proving the feasibility of a completely self-contained, jam resistant mobile quantum optical network.
arXiv·2026-10-20·Koichi Miyamoto
No generated summary available for this entry.
overview
Original abstract
Addressing nonlinear numerical problems in quantum computing remains challenging, but several approaches, including Carleman linearization (CL), have been proposed to construct quantum algorithms for such problems. In this work, we develop a CL-based method for a high-dimensional nonlinear stochastic differential equation (SDE) $\mathrm{d} \mathbf{X}_t = \left(A(t) \mathbf{X}_t + F(t) \mathbf{X}_t^{\otimes s}\right) \mathrm{d} t + B(t) \mathrm{d} \mathbf{W}_t$ for an $\mathbb{R}^N$-valued random process $\mathbf{X}_t$, aiming at quantum speed-up with respect to the dimension $N$. We introduce auxiliary processes $\mathbf{Y}^j_t$ that approximate $\mathbf{X}_t^{\otimes j}$, derive a linearized system of SDEs for them, and obtain the linear ordinary differential equation (ODE) governing their expectations. We then apply a quantum ODE solver to it and, from the resulting quantum state, extract an estimate for the expectation of a linear function of $\mathbf{X}_t$ by overlap estimation. We show that, provided the nonlinear and noise terms in the SDE are sufficiently small relative to the linear term, the CL error decreases exponentially with the truncation order $J$ in CL, and we can estimate the target expectation with a ${\rm polylog}(N)$ number of queries to unitaries encoding coefficient matrices $A$, $F$, and $B$. Finally, we also run a numerical demonstration for an SDE related to Langevin dynamics, observing the exponential decay of the CL error as $J$ increases.
Quantum Computing Report·2026-10-19·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
NVIDIA and Jülich Supercomputing Centre simulated a 104-qubit fault-tolerant quantum computing experiment on the JUPITER supercomputer, Europe's first exascale system. This simulation, detailed in an NVIDIA technical report, validated a magic state cultivation protocol that significantly reduces physical qubit overhead. The project utilized JUPITER's 8,192 NVIDIA GH200 Grace Hopper Superchips and advanced software to model complex quantum error correction. The post NVIDIA and Jülich Run 104-Qubit Magic State Cultivation Simulation on JUPITER Supercomputer appeared first on Quantum Computing Report .
Phys.org Quantum Physics·2026-10-19
No generated summary available for this entry.
overview
Original abstract
The Korea Research Institute of Standards and Science (KRISS) has remeasured a key transition frequency of the strontium (Sr) atom for the first time in 88 years, since 1938, using a photonic grating chip. It has established a new absolute frequency value with a measurement uncertainty reduced by more than 50 times. By providing an accurate reference value for next-generation quantum technologies, this achievement is expected to contribute to the precise control and miniaturization of quantum devices, including atomic clocks and neutral-atom quantum computers. The work is published in the journal Metrologia.
The Quantum Insider·2026-10-19·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Quantinuum reported 99.9995% logical fidelity on its Helios quantum computer using a color code, equivalent to five errors per million operations and a tenfold reduction from its previous result. Logical errors decreased exponentially as code distance increased, with each tested increase reducing remaining errors by a factor of 12. Tests on the same Helios hardware showed a tradeoff between codes, with Helix using 10 physical qubits per logical qubit while the color code used up to 37 but achieved lower logical error rates. Image: Rendering of a deployed Helios system. (Quantinuum) PRESS RELEASE — Quantinuum (NASDAQ: QNT), a leading full-stack quantum computing company, today announced a world-record quantum error-correction result, achieving a logical fidelity of 99.9995% on its Helios commercial computer using the company’s error-correction architecture. This marks Quantinuum ’s second breakthrough in two months, demonstrating how its highly accurate trapped-ion hardware and flexible architecture work together to deliver rapid improvements in accuracy. The achievement reinforces Quantinuum ’s error-correction leadership and validates that its accuracy performance is now within the target range for Apollo, the company’s planned universal fault-tolerant quantum computer expected to be available by 2029. Quantinuum ’s architecture is an end-to-end framework programmable through the company’s developer platform. It integrates tailored AI decoders, all-to-all qubit connectivity, high-fidelity physical operations, and hardware-level error correction. This architecture also allows the company to test, refine, and combine different error-correction codes and optimize between accuracy and efficiency. In the latest study, Quantinuum used a well-known “color code” within this architecture to achieve the world-record logical fidelity result, which is equivalent to just five errors per million operations. The error rate is 10 times lower than Quantinuum’s o
Phys.org Quantum Physics·2026-10-19
No generated summary available for this entry.
overview
Original abstract
Voltage fluctuations, light fluctuations, temperature fluctuations—any fluctuations are troublesome and thus undesirable. They don't just cause discomfort; in engineering and medical applications, they affect the accuracy of measurements or introduce errors in controls. Even at the minute level of quantum phenomena, fluctuations are considered undesirable.
Quantum Computing Report·2026-10-19·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Quantinuum has demonstrated a 99.9995% logical memory fidelity on its Helios trapped-ion quantum computer, achieving a logical error rate of 5 × 10-6 per syndrome-extraction round on a distance-7 code. This performance shows exponential error suppression with increasing code distance, with a suppression factor of 12. These results align with the performance targets for Quantinuum's future universal fault-tolerant quantum system, Apollo. The post Quantinuum Demonstrates 99.9995% Logical Memory Fidelity on Helios Trapped-Ion Processor appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-19·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Chinese startup Tuoyuan, led by quantum researcher Mu Qiao, is pursuing neutral-atom quantum computing with a reported development target of 100 logical qubits. QbitAI reported that the company raised hundreds of millions of yuan in seed and angel financing, but those details have not been independently verified. Qiao has published research on neutral-atom and trapped-ion quantum simulation, while Tuoyuan has yet to disclose hardware benchmarks or a timeline for its planned system. Photo by Christian Lue on Unsplash A new Chinese startup led by quantum researcher Mu Qiao is pursuing neutral-atom quantum computing, with a reported development goal of building a system with 100 logical qubits. The company, identified as FlipFlop Tuoyuan in a QbitAI report republished by 36Kr , brings together Qiao’s experience in trapped-ion and neutral-atom experiments. Its reported plans focus on fault-tolerant computing, which uses error correction to protect calculations from the errors that limit quantum processors. QbitAI reported that Tuoyuan completed seed and angel financing totaling hundreds of millions of yuan — or tens of millions in U.S. dollars, citing people familiar with the company. The report named Source Code Capital, Oasis Capital and CICC Capital among the investors but did not provide an exact amount or valuation. Those financing details could not be independently verified for this article. Qiao’s research record provides better details on the technical experience behind the venture. He is a shared first author and a corresponding author of a study published in Nature in August 2025 that used an array of Rydberg atoms to investigate a quantum magnet with mobile vacancies, known as holes. Such experiments let researchers reproduce selected features of complex quantum systems under controlled conditions. The study examined interactions between magnetism and particle motion, a problem relevant to understanding strongly correlated materials, inclu
Phys.org Quantum Physics·2026-10-19
No generated summary available for this entry.
overview
Original abstract
Today's computer technology, based on silicon chips, is slowly reaching its physical limits. Components cannot be miniaturized indefinitely, and clock speeds cannot be increased indefinitely. At the same time, huge AI data centers are being built in many places, and these consume an immense amount of electricity. This is why scientists around the world are searching for novel materials that can replace or complement silicon technology and consume significantly less electricity.
The Quantum Insider·2026-10-19·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief RIKEN researchers demonstrated high-accuracy parallel control of silicon spin qubits using a shared microwave line and a calibration method that reduces control errors. Pairwise phase calibrations helped maintain gate fidelities above 99.99% when operating up to three qubits simultaneously and approximately 99.9% across all five. Increased microwave power caused remaining losses in quantum coherence, identifying a limitation that further device improvements could help address. Image: Rendered illustration of five silicon spin qubits controlled in parallel through a shared microwave line. ( RIKEN ) PRESS RELEASE — Silicon spin qubits are a promising platform for building scalable quantum computers as they are compatible with the semiconductor manufacturing technologies used to produce today’s computer chips. However, they have an important weakness: silicon spin qubits typically lose accuracy when several qubits are under parallel control. To be useful, quantum computers will need to operate many qubits simultaneously without compromising the accuracy of their operations. Now, in a study published in Nature Physics , researchers from the RIKEN Center for Emergent Matter Science and collaborators have addressed this challenge by achieving high-fidelity control of multiple silicon spin qubits operating in parallel. Using a five-qubit silicon array controlled through a single shared microwave line, they identified a key source of errors during the simultaneous operation of qubits and developed a way to mitigate its effects. According to Leon Camenzind, a research scientist at RIKEN and co-first author who supervised the experiments, “This shows that high-fidelity control can be maintained even when several qubits are operated at the same time and represents an important step toward scaling up silicon-based quantum processors.” Unmasking the culprit behind control errors Quantum computers process information using quantum bits, or qubits, which
Quantum Computing Report·2026-10-19·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Xanadu, a photonic quantum computing company, has secured up to $10 million in additional DARPA funding through the Quantum Benchmarking Initiative (QBI). This one-year contract extension will support Xanadu's hardware and software development, particularly for its fault-tolerant photonic architecture and the PennyLane open-source quantum software framework. The funding aims to accelerate the development of practical, fault-tolerant quantum computing for various industrial and government applications. The post Xanadu Secures Up to $10 Million in Additional DARPA Funding Under QBI Program appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-19·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief NVIDIA simulated a 104-qubit fault-tolerant quantum processor on Europe’s JUPITER supercomputer to evaluate magic-state cultivation under realistic hardware noise. The approach studied could reduce the qubits needed to produce magic states by 90% compared with previous methods, according to NVIDIA. The simulation used 8,192 GPUs and NVIDIA’s quantum computing software to help researchers assess processor designs before building hardware. PRESS RELEASE — NVIDIA today announced a record-breaking quantum computing simulation on JUPITER, Europe’s first exascale supercomputer, allowing researchers to fully explore and validate magic state cultivation — a leading approach to fault-tolerant quantum computing that requires 90% fewer qubits than previous methods. Running on a system of NVIDIA GH200 superchips at Jülich Supercomputing Centre, the 104-qubit simulation is the largest comprehensive simulation of a fault-tolerant quantum processor to date, modeling how a realistic quantum processor performs fault-tolerant computation at record scale. That level of fidelity gives researchers the data and tools needed to predict the performance of future designs before they are built — reducing reliance on hardware trial and error, and accelerating the path to useful quantum applications in fields like drug discovery, financial modeling and materials science. “Useful quantum computing will require fantastically complex, fault-tolerant systems — and understanding how they behave at scale is essential to building them,” said Jensen Huang, founder and CEO of NVIDIA. “Our results from Jülich show how quantum processors and GPU supercomputers can work together to tackle research that would otherwise be out of reach — accelerating the discovery of transformative quantum applications.” “Europe’s investment in JUPITER gives researchers the ability to investigate questions that were previously beyond reach,” said Kristel Michielsen, director of the Jülich Supercomputing
Quantum Computing Report·2026-10-19·Doug Finke
No generated summary available for this entry.
overview
Original abstract
Podcast with Joel Van Dyk, a physicist turned Wall Street cybersecurity veteran, about the quantum threat to cryptography and what organizations should be doing right now to prepare. The post Podcast with Joel Van Dyk, CTO/CISO and Co-Founder of Done. Quantum Security Limited appeared first on Quantum Computing Report .
Nature: Quantum Information·2026-10-19
No generated summary available for this entry.
overview
Quantum Computing Report·2026-10-19·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
FlipFlop Tuoyuan, a Chinese quantum hardware startup, has secured over $14 million in early-stage funding to develop neutral-atom quantum processing units. Founded in July 2026 by Dr. Qiao Mu, the company aims to build a 100-logical-qubit fault-tolerant quantum computer and utilize AI for experimental design and hardware control. The post Chinese Startup FlipFlop Tuoyuan Emerges with Major VC Backing for 100-Logical-Qubit Neutral-Atom Systems appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-19·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
The UK government and UK Research and Innovation (UKRI) have announced a £78 million (approximately $103.8 million USD) funding package to advance quantum sensing, networking, and workforce development. This initiative, part of the National Quantum Strategy, includes grants for commercial applications, supply-chain development, and an expansion of the QuEST Apprentices Programme. An additional £17 million has been allocated for integrating AI and high-performance computing with quantum platforms, aiming to solidify the UK's global leadership in quantum technologies. The post UK Government and UKRI Unveil £78M ($103.8M USD) Quantum Commercialization, Networking, and Skills Package appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-19·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Researchers developed an algorithm that allows standard computers to simulate photonic quantum devices using about 5% of the computing power previously required, according to the team. In tests involving Gaussian boson sampling, classical computers using the algorithm matched or exceeded the performance of some current quantum devices. The team is working to scale up the algorithm to support larger simulations that could help researchers assess current devices and design improved photonic quantum computers. PRESS RELEASE — Researchers have developed an algorithm that enables off-the-shelf computers to run quantum simulations previously only possible using the world’s most powerful supercomputers. It means the simulations can be run using around five percent of the computing power previously needed to perform them with a supercomputer, the team says. Quantum experiments The advance could make it cheaper and easier to run experiments vital for understanding the limitations of current quantum computers and informing the design of improved devices, experts say. Quantum computers could, in theory, perform calculations far beyond the capabilities of even the most advanced supercomputers, but current devices are small and error-prone, hindering their performance. Key to informing the creation of bigger, more reliable quantum computers is the development of algorithms to simulate how devices might work in reality. However, running these simulations has until now required vast amounts of computing power available at only a handful of facilities worldwide. Light-based technology The new algorithm was developed by a team led by scientists at Edinburgh and EPCC, the UK’s first National Supercomputing Centre, which is part of the University. The work could aid the development of light-based quantum devices, one of several branches of current quantum research by academics and industry, the team says. Computing power For the first
The Quantum Insider·2026-10-19·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief UK Research and Innovation (UKRI) has announced £50 million for UK quantum technology projects, alongside separate funding for quantum networking infrastructure and workforce training. The funded projects include MoniRail ‘s quantum railway monitoring system, Siloton ‘s handheld quantum eye scanner and ColdQuanta UK’s compact quantum radio system for signal detection and navigation. UKRI is also allocating £20 million to quantum networking businesses and expanding its QuEST Apprentices Programme with £8 million to support training for quantum and engineering roles. A share of £50 million is going to British businesses developing quantum technologies for uses that include keeping railways running, shortening eye scan waits and maintaining military connectivity, UKRI said. The money forms part of a new government package. According to UKRI , the package is delivered through its Quantum Technologies Priority Programme, as part of its Industrial Strategy programme The funding is aimed at companies building next-generation systems that could outperform current technology in critical areas. Projects Named Among the winning projects, as listed by UKRI: MoniRail , based in the West Midlands, is leading a quantum monitoring system that could locate faults in railway tracks and signalling equipment in places GPS cannot reach. UKRI said this would let track staff respond to problems as they arise and spare commuters last-minute delays. Siloton , based in Bristol, is developing a handheld quantum eye scanner. UKRI described it as designed to make advanced eye diagnostics available outside specialist hospitals through smaller, more accessible devices, and said it will improve access to care for patients nationwide. ColdQuanta UK, based in Oxfordshire, is being supported to develop a compact, mobile quantum radio system able to locate signals with high accuracy. According to UKRI, it could assist military operational intelligence, improve the resil
npj Quantum Information
·2026-10-19
·Xingyu Wang et al.
·doi
No generated summary available for this entry.
overview
arXiv·2026-10-19·Ethan Seefried et al.
No generated summary available for this entry.
overview
Original abstract
Large language models (LLMs) can generate quantum programs, but reliable evaluation remains difficult because benchmarks differ in task composition, scoring, and failure handling. We evaluate 15 hosted frontier, open-weight, quantum-specialized, and retrieval-augmented models on five quantum code-generation suites (530 tasks), plus 10 models on our new QuantumBenchEval (QBE) benchmark (96 tasks across six topics). We report bootstrap confidence intervals, multiplicity-adjusted paired comparisons, and audits of output validity and evaluator behavior. QiskitHumanEval-Standard approaches saturation (98.7% pass@1), while its Hard variant retains headroom (63.8%). None of the five top-two comparisons across primary suites remains significant after multiple-comparison correction. Evaluator design substantially changes scores: removing checks for unspecified quantities raises GPT-6 Astra's QBE pass@1 from 0% to 94.1% (T1) and from 1.2% to 92.9% (T6), without changing model outputs. We identify 17 QuanBench-117 tasks with shared failures linked to benchmark-owned imports. Controlled probes also reveal unexecuted unit tests, leakage of canonical functions into candidate execution, and reference imports that block otherwise valid candidates. These defects can produce both false failures and false passes, so historical QuanBench results require revalidation under an isolated evaluator. Overall, leaderboard scores alone do not adequately characterize progress in quantum code generation. We release our harness, per-sample results, and audit artifacts and recommend validating evaluators, isolating candidate code, and reporting uncertainty and output validity.
arXiv·2026-10-19·Amir Subba, Yu Shi
No generated summary available for this entry.
overview
Original abstract
We perform a phenomenological study of non-classical correlations in the mixed-dimensional qubit-qutrit system realized by leading order $pp\to tW$ production at $\sqrt{s}=13$ TeV in the leptonic final state. The two missing neutrinos are reconstructed with conditional normalizing flows trained on simulated detector-level objects, and the joint spin density matrix $ρ_{tW}\in\mathcal{H}_2\otimes\mathcal{H}_3$ is obtained in a generalized Bloch representation from the angular distributions of the leptonic decay products. Non-classical correlations are quantified using the Peres--Horodecki negativity and geometric quantum discord. We quantify the correlations at different region of $m_{tW}$ at the reconstruction level within the Standard Model and the impact of two reducible backgrounds viz. $t\bar{t}$ and $WWj$ processes, tagged using boosted decision trees. We further study the behavior of correlations in presence of anomalous chromomagnetic and chromoelectric dipole moments of the top quark. The sensitivity reach of the quantum observables along with polarization and spin correlation parameters are reported for current LHC and future HL-LHC scenario.
arXiv·2026-10-19·Paul E. Lammert
No generated summary available for this entry.
overview
Original abstract
Provided a maximally entangled state vector in ${\mathcal{H}}\otimes{\mathcal{H}}$, the Choi-Jamiolkowski isomorphism of quantum information theory (or channel/state duality) produces a mapping of ${\mathsf CP}({\mathcal{H}},{\mathcal{K}})$ (completely positive maps of density operators on ${\mathcal{H}}$ tothose on ${\mathcal{K}}$) onto the density operators on ${\mathcal{K}}\otimes{\mathcal{H}}$, which extends to a unitary map. Here, ${\mathcal{H}}$ and ${\mathcal{K}}$ are {finite-dimensional} Hilbert spaces.The nature of this construction, the form of the associated formulas, and the possibility of versions which do not require an entangled vector seed, are illuminated from the perspective of {naturality}, in the sense of Eilenberg and MacLane.There is a unique such correspondence (``Choi map'') natural in both ${\mathcal{H}}$ and ${\mathcal{K}}$ which produces density operators on either ${\mathsf L}({\mathcal{H}},{\mathcal{K}})$ (Hilbert-Schmidt inner product) or ${\mathcal{K}}\otimes{\mathcal{H}}^*$ instead of ${\mathcal{K}}\otimes{\mathcal{H}}$. In particular, no entangled state input is required. There are no such binatural maps carried on ${\mathcal{K}}\otimes{\mathcal{H}}$, but those natural in only ${\mathcal{K}}$ are canonically associated with unitary maps ${\mathcal{H}}\rightarrow{\mathcal{H}}^*$ and derive from the binatural maps. The construction recovers the standard Choi-Jamiolkowski formulae and shows how they express naturality.
arXiv·2026-10-19·David E. Bernal Neira
No generated summary available for this entry.
overview
Original abstract
Quantum and physics-inspired solvers provide specialized sampling interfaces for Ising and quadratic unconstrained binary optimization models, but constrained optimization requires broader coordination and certification. This survey uses classical decomposition to analyze how such solvers can be integrated into hybrid quantum-classical algorithms. We distinguish formal decomposition, reformulation and reduction, and computational orchestration. For each interface, we ask what the transformation preserves, which assumptions make the outer method converge, and which certificates the implemented inner routine supplies. The central questions are whether that information meets the classical algorithm's requirements and whether hybridization improves solution quality or total cost enough to justify its coordination overhead. Benders decomposition, column generation, graph reduction, and copositive methods illustrate this distinction by separating heuristic proposals from classical certification. We also distinguish component effects within a fixed wrapper, reduction--solver interactions, and comparisons between complete quantum-enabled and classical systems. The analyzed studies provide conditional component benefits and favorable co-design evidence, but do not establish transferable end-to-end superiority over strong classical comparators. The resulting framework identifies opportunities for constraint programming and operations research in structure-preserving design, safeguarded hybrid algorithms, and controlled benchmarking.
arXiv·2026-10-19·James Fullwood, Weixiang Ye
No generated summary available for this entry.
overview
Original abstract
Given an open quantum system $S$ with environment $E$, we establish a one-to-one correspondence between completely positive trace-preserving (CPTP) maps from $S$ to $E$ and assignment maps initializing the composite system $SE$ in a possibly correlated state prior to unitary evolution. We show that every possible joint state $ρ_{SE}$ can be realized by such assignment maps, which are inherently Hermiticity-preserving and trace-preserving (HPTP). While these maps sacrifice global positivity, we derive a simple necessary and sufficient condition for any local state of $S$ to belong to their domain of validity. Furthermore, we prove that the geometry of this domain is governed by the joint state assigned to the maximally mixed input, ensuring that a non-zero volume of admissible local states can readily coexist with initial system-environment entanglement. Finally, we provide an operational protocol for witnessing such limits of validity.
arXiv·2026-10-19·Era Thaqi, Coco Gong, Margaret Martonosi
No generated summary available for this entry.
overview
Original abstract
Debugging quantum programs remains challenging due to the nature of quantum measurement. As quantum algorithms and systems scale, it is increasingly crucial to develop rigorous debugging and verification approaches. Statistical assertion-based debugging validates quantum program behavior through repeated circuit execution and statistical hypothesis testing, but existing frameworks treat shot count as a fixed input parameter, leaving the problem of optimal shot allocation across multiple mid-circuit assertions unexplored. To improve debugging efficiency by making better use of given shot counts, this paper proposes and evaluates four shot allocation strategies within the QDB quantum debugger implemented within the CUDA-Q framework. These allocation approaches: equal split, static weight allocation, adaptive entropy routing, and sequential retirement, use statistical approaches to test whether qubits have expected state characteristics at different points in execution. We evaluate these allocation strategies on different circuits, under both noise-free and depolarizing noise conditions. We show how adaptive strategies use shots efficiently by concentrating them on assertions with high uncertainty. This substantially reduces total shot usage while maintaining comparable debugging confidence.
arXiv·2026-10-19·Pablo P. Rejo et al.
No generated summary available for this entry.
overview
Original abstract
This article presents a Distributed Key Management System (DKMS) that provisions quantum-safe symmetric encryption keys to applications across a network. To overcome the distance and rate limitations inherent to Quantum Key Distribution (QKD), the architecture adopts a hybrid design: it utilizes multi-hop trusted relays for physical key transport, while applying an end-to-end Post-Quantum Cryptography (PQC) layer to ensure the relayed key material remains strictly protected from intermediate nodes. Because QKD transforms key generation into a scarce physical resource, managing unpredictable application demands poses a critical capacity allocation problem. The core contribution of this work is an SDN-driven control plane that globally orchestrates the network. Rather than relying on vulnerable hop-by-hop capacity reservations, a central controller simultaneously computes optimal filling rates and multipath routing for all per-peer key buffers. This global orchestration ensures that no application is starved and that all key buffers synchronize their filling processes. Evaluated on a Kubernetes-based digital twin across five distinct network topologies, the controller successfully filled all key buffers to capacity in under six minutes. Furthermore, under deliberately excessive demand, the network demonstrated graceful degradation, safely rejecting excess requests through controlled rate-limiting rather than experiencing catastrophic failure.
arXiv·2026-10-19·P. Blanco-Casal et al.
No generated summary available for this entry.
overview
Original abstract
Vehicle-to-Everything (V2X) communications rely on elliptic-curve signatures that a quantum adversary breaks and on pseudonym certificates whose anonymity rests on rotation rate, not cryptography. This work presents qDGSP, a post-quantum V2X infrastructure: a hash-based dynamic group signature scheme (DGSP, over SPHINCS+ and WOTS+) distributed between a central controller and roadside verifiers. Group keys derive deterministically from quantum key distribution (QKD) seeds served over the ETSI GS QKD 014 interface, so no group-signature secret crosses the classical channel. qDGSP-EA (Ephemeral Association) binds an ephemeral ML-DSA-65 key to one group signature per 5G cell: messages remain unlinkable across cells, linkable within one. On a testbed with emulated 5G links, median end-to-end latency stayed within the 100ms ETSI budget for every variant. The qDGSP-EA intra-cell DENM matched the NIST ML-DSA-65 baseline on the wire, and under load EA mode raised delivery from roughly 78% to 93%.
arXiv·2026-10-19·Andre Laestadius, Mihály A. Csirik
No generated summary available for this entry.
overview
Original abstract
The total-current Hohenberg-Kohn conjecture asserts that the ground-state particle density and total current determine the scalar potential up to an additive constant and the vector potential up to a gauge transformation. We give three counterexamples for two spinless fermions in the physically relevant setting of three spatial dimensions. In each, a Hamiltonian $H^{v,\mathbf{A}}$ has a nondegenerate ground state with identically zero total current but nonzero magnetic field. Complex conjugation then yields a second Hamiltonian $H^{v,-\mathbf{A}}$, with the same scalar potential and interaction, whose ground state has the same density and the same zero current, while the magnetic field is reversed. The first two examples are noninteracting. One is explicit, with a smooth bounded vector potential and a Gaussian density. The other has smooth bounded scalar and vector potentials in the standard potential spaces. The third example has Coulomb repulsion with unit coupling, an isotropic harmonic scalar potential, and Dirac monopole fields of magnetic charge $\pm 1/2$. The monopole example uses vector potentials defined on separate spatial patches, since these fields are not curls of globally defined smooth vector potentials.
arXiv·2026-10-19·Federico Tomás B. Pérez et al.
No generated summary available for this entry.
overview
Original abstract
The three-tangle, $τ_3$, is a measure of genuine tripartite entanglement that distinguishes GHZ-type from W-type entanglement in pure three-qubit states. Here, we identify the statistically optimal one-sided four-copy detector of the three-tangle and study its implementation cost. The optimal detector has click probability $τ_3^2/48$, while previous four-copy constructions achieve $τ_3^2/256$ and therefore require asymptotically $16/3$ times as many experimental repetitions. Using the representation-theoretic structure of the problem, we construct an ancilla-free implementation of the optimal detector using 15 CNOT gates, together with an 11-CNOT detector with click probability $τ_3^2/96$. These results reveal a tradeoff between statistical efficiency and implementation cost, since reducing the number of repetitions requires increasingly expensive circuits. We then show that this tradeoff persists once the circuits are encoded. In a fully fault-tolerant setting, the increased click probability comes with a substantial non-Clifford synthesis cost, while an early fault-tolerant implementation based on $T$ gates and STAR rotations reduces this overhead at the expense of additional encoded resources. We quantify these costs using both the Steane and $[[8,3,2]]$ codes, providing explicit resource estimates for implementing the optimal detector across different computational regimes.
arXiv·2026-10-19·Lawrence M. Qin et al.
No generated summary available for this entry.
overview
Original abstract
The ability to efficiently control optical quantum interference by the same device is a challenging task that promises to enable key operations in quantum information processing. Here, we tackle this problem by presenting a composite quantum plasmonic metasurface operating as an ultrathin non-unitary beamsplitter capable of achieving both single photon bosonic bunching and fermionic anti-bunching interference just by varying the incident photons frequency or changing the design dimensions. The presented metasurface combines a plasmonic grating corrugated by periodic nanoslits that can achieve extraordinary optical transmission with additional nanostripes on top forming nanocavities characterized by localized gap plasmon resonances. The photon-photon interactions are analyzed based on calculating the quantum coalescence metric which accurately portrays the obtained bunching or anti-bunching quantum interference. The presented quantum interference operation is applicable to both fundamental non-classical light interactions and in the design of more applied quantum optical logic gates used in quantum computing and communications.
arXiv·2026-10-19·Farhad Rasekh et al.
No generated summary available for this entry.
overview
Original abstract
Rare-earth molecular complexes are attracting increasing interest for quantum information applications because of their structural flexibility and chemical tunability. Here, we compare the cryogenic optical properties of Er$^{3+}$, Tm$^{3+}$, and Eu$^{3+}$ complexes in the same ligand environment. Optical spectroscopy shows differing behavior across the three systems: spectral hole burning is observed in the Eu$^{3+}$ complex, whereas no measurable hole is detected in the Er$^{3+}$ and Tm$^{3+}$ complexes. We measure laser-induced local heating and rethermalization in the Er$^{3+}$ and Tm$^{3+}$ powder-like samples, observing strong local heating and slow thermal relaxation in the cold-plate cryostat. The recovery occurs over several seconds and, for some Er$^{3+}$ excitation conditions, extends over tens of seconds. The comparison across the three ions nevertheless suggests that heating alone is unlikely to account for the full contrast. Rather, the different behaviors of Eu$^{3+}$, Tm$^{3+}$, and Er$^{3+}$ point to ion-dependent relaxation and decoherence processes associated with their electronic level structure and coupling to the molecular environment. Temperature-dependent linewidth and line-shift measurements are further consistent with phonon-mediated broadening through coupling to crystal-field levels.
arXiv·2026-10-19·Krzysztof Pomorski, Eryk Halubek
No generated summary available for this entry.
overview
Original abstract
The methodology of non-Hermitian quantum mechanics is employed to parameterize the dynamics of coupled classical diffusion equations describing low- and high-energy quasiparticles in superconducting single-photon detectors in one to three spatial dimensions.
arXiv·2026-10-19·Edilberto O. Silva
No generated summary available for this entry.
overview
Original abstract
We study coherent two-terminal transport through a finite-width $d$-wave altermagnetic quantum ring with nonmagnetic leads. A confined Aharonov--Bohm flux remains exactly $h/e$ periodic and, in the symmetric one-mode geometry, produces an exact half-flux transmission zero. A perpendicular field shifts the interference pattern according to an effective area $A_{\rm eff}=1.0342\,πr_0^2$ and the altermagnetic splitting resolves the common zero into nearby spin-dependent nodes. Rotating the crystal reverses the transmitted spin, whereas the mirror orientation $θ_A=π/4$ is exactly spin degenerate. For a $50$~nm reference ring, sub-tesla fields yield windows with $|P_T|>0.99$, the most accessible of which requires a uniform field alone and no confined flux. Finite-bias, thermal, disorder, Zeeman, and spin-conserving voltage-probe calculations show that the polarization is appreciably more stable than individual coherent-resonance amplitudes. These results identify interference-node positions, flux periodicity, and crystal-controlled spin polarization as experimentally useful signatures of an altermagnetic mesoscopic interferometer.
arXiv·2026-10-19·Conrad Silio, Cristian Staii
No generated summary available for this entry.
overview
Original abstract
Suspended carbon nanotubes provide a useful platform for studying controlled nanomechanical motion in regimes where environmental fluctuations, memory effects, and quantum coherence can all influence the dynamics. We model the fundamental flexural mode of a carbon nanotube driven by an atomic force microscope as a harmonic quantum Brownian oscillator subject to a prescribed classical force and coupled linearly to a thermal environment. Starting from the generalized Langevin equation, we formulate the reduced dynamics directly in phase space, where the Wigner function evolves through a Gaussian propagator determined by dissipative linear transport, a deterministic force-induced displacement, and bath-induced fluctuations. For a Drude memory kernel, the retarded response is expressed through the three roots of a characteristic cubic equation. In the classical-noise limit, the three independent entries of the finite-time covariance matrix reduce to explicit finite sums over these response poles, eliminating numerical double-time covariance integration. We extend the construction to the full quantum fluctuation spectrum, obtaining a thermal frequency series representation that retains zero-point and low-temperature fluctuations. For an initial two-packet superposition, we examine interference attenuation and the integrated negative part of the Wigner function, which provides a phase space measure of nonclassicality. These results provide an explicit analytical framework for finite-memory quantum Brownian motion of bound oscillators and a tractable phase space description of driven carbon nanotube dynamics relevant to future quantum state preparation and quantum tomography experiments.
arXiv·2026-10-19·Florian Metzler et al.
No generated summary available for this entry.
overview
Original abstract
A growing research community spanning quantum batteries, molecular and excitonic energy transport, polaritonics, quantum materials and nuclear control has begun to describe its work in terms of quantum energy or quantum energy science. What connects these otherwise disparate efforts is the deliberate use of quantum states, couplings, collective effects and engineered environments to control energetic states and pathways. A key difference from quantum information science is that the complete quantum state does not always need to be preserved; engineered dissipation or dephasing can even improve the desired outcome. We organize this emerging domain through a framework that connects mechanisms, functions, capabilities, and applications. We identify five elementary functions (Excite, Hold, Release, Transfer, and Transform) and examine the mechanisms that implement them. The same functions recur from the molecular to the nuclear scale, although their relative implementation difficulty can differ sharply. Moving toward technology, we highlight three engineering capabilities (Storage, Routing, and Conversion) through the performance metrics that matter for their applications. Stretch scenarios illustrate what performance targets could make these capabilities technologically consequential.
arXiv·2026-10-19·Dan Porat, Ran Finkelstein, Tal Carmon
No generated summary available for this entry.
overview
Original abstract
Collecting photons from quantum emitters remains a key limitation in light-matter interaction because conventional lenses collect light only from one direction. Here, we introduce a perfect light collector by inverse-designing a surrounding dielectric structure that encloses the emitter to increase photon-collection efficiency toward unity. Decomposing the device into several refractive interfaces enables emission collection from the full 4$π$ solid angle with adiabatic reshaping into a collimated beam. We experimentally demonstrate, in two dimensions, the ray bending that collimates omnidirectional emission. Our collector transforms current paradigms for highly efficient photon collection from narrowband, cavity-based techniques into experimentally robust, broadband, non-resonant dielectric devices.
arXiv·2026-10-19·Chunyang Ding et al.
No generated summary available for this entry.
overview
Original abstract
Scalable superconducting quantum computation requires fast, high-fidelity readout. Currently, this is assisted through cryogenic amplification of the readout signal. In traditional dispersive readout schemes, the amplifiers that are used to provide high signal-to-noise ratio also generate thermal noise that can decohere the qubits, demanding additional ferrite-based isolators to suppress this noise. Here, we integrate a chip-scale microwave switch, the tunable inductive bridge, into the readout chain of a fixed-frequency transmon. Flux-pulsing the switch, such that it transmits only during the readout, did not make a discernable difference to qubit coherence, residual excited-state population, or readout fidelity metrics. By injecting broadband noise that mimics amplifier thermal photons, we show that the switch suppresses the resulting qubit dephasing by more than $30$~dB, consistent with its independently measured on-off ratio, establishing it as a potential chip-based integrated replacement for readout-chain isolators.
arXiv·2026-10-19·Daniele Guerci, Enrico Rossi
No generated summary available for this entry.
overview
Original abstract
Recent quantum-oscillation measurements in rhombohedral graphene reveal an abrupt increase in the dominant frequency and the emergence of additional frequencies as the carrier density is lowered toward superconductivity. Noninteracting band models can account for multiple frequencies but do not explain the upward jump. We show that these features can arise from two competing fates of the inner hole pocket in an annular Fermi sea: collapse into a simply connected Fermi liquid or crystallization into an anticrystal, in which localized holes coexist with itinerant electrons. Pocket collapse contracts the outer Fermi contour at fixed density, whereas hole crystallization preserves a larger contour that supports magnetic-breakdown orbits. This contrast provides a possible explanation for the frequency jump, while additional reconstructed orbits produce a multitone spectrum. Our results support the anticrystal as a candidate normal state near superconductivity in rhombohedral graphene.
arXiv·2026-10-19·Bartlomiej Czech et al.
No generated summary available for this entry.
overview
Original abstract
We study multi-invariants---a multi-partite generalization of Renyi entropies---of simple stabilizer states, for an arbitrary replica symmetry group. We develop a group theoretic technique for evaluating such invariants, which operates on the replica group and involves counting intersections among its cosets. Our techniques streamline the calculations of multi-invariants for graph states with two GHZ-like nodes and for certain generalizations thereof. The methodology developed here is most suitable when the quantum state is simple but flexibility over the replica group is desired.
arXiv·2026-10-19·Jiabin Yu et al.
No generated summary available for this entry.
overview
Original abstract
Ternary layered transition metal dichalcogenides (TMDCs) offer high tunability and access to correlated and topological states. However, like the broader family of layered TMDCs, their properties are sensitive to stacking order and interlayer coupling. Here, we investigate the electronic structure and surface states of NbIrTe$_4$, a candidate Weyl semimetal in bulk, and predicted to be a quantum spin Hall insulator in monolayer form. Using scanning tunnelling microscopy (STM), angle-resolved photoemission spectroscopy (ARPES), and density-functional theory (DFT), we attribute the strong resonance in tunnelling spectroscopy located approximately 8 meV below the Fermi level to a surface-derived flat band which shows sensitivity to the local stacking order at the surface. In regions where the top layer is laterally shifted, tunnelling spectroscopy instead shows a gap-like feature with intensity near the Fermi level shifted in energy. Combining DFT and quasiparticle interference (QPI) measurements, we find this dramatic change in the spectroscopy in the vicinity of the quasi-1D flat-band surface state becomes dispersive due to a change in the spatial distribution of the density of states in the top two layers. These findings establish NbIrTe$_4$ as a platform where surface band dispersion can be effectively tuned through local structural manipulation.
arXiv·2026-10-19·Sriram Akella, Abhijit Gadde
No generated summary available for this entry.
overview
Original abstract
Rényi multi-entropy extends the Rényi entropy to pure states of more than two parties. It is defined by a replica contraction at integer replica number $n$, and the multi-entropy is its $n\to1$ limit. In holography this limit is conjectured to compute the area of a minimal soap-film web in the bulk. Understanding multi-entropy for general states, however, is harder. Unlike the bipartite case, the replica contraction is not a moment of a density matrix, and the continuation to $n=1$ has to be found by other means. We study this problem for qubit graph states. We show that at every odd $n$ the contraction equals $2^{-k/2}$, where $k$ is a sum of ranks of matrices over a finite field, one row and one column per qubit. We define a class of graphs that we call collision-controlled, for which the rank sum is a polynomial in $n$. This class includes graphs without even cycles and all complete bipartite graphs. The natural polynomial $n \to 1$ continuation is a finite sum over partitions of the parties. While the Rényi multi-entropy is non-increasing under single-qubit Pauli measurements at every odd integer $n>1$, the continuation to $n=1$ is not. A $Z$ measurement on one qubit of an odd ring with $2r + 1 \geq 7$ qubits raises it from $(r+1)\log 2$ to $(2r-1) \log 2$. Thus the continuation is not an entanglement monotone.
arXiv·2026-10-19·Lucia Valor et al.
No generated summary available for this entry.
overview
Original abstract
In quantum optics and related fields, cavity quantum electrodynamics provides a powerful framework for modeling the low-energy properties of bound charges coupled to electromagnetic fields, using a minimal set of atomic levels and isolated photonic modes. Here, we develop a similar framework for non-Abelian gauge theories, focusing on the pure-gauge dynamics of SU(2) fields as the conceptually simplest example. Starting from the corresponding Yang-Mills Lagrangian, we derive an SU(2) cavity Hamiltonian in the Coulomb gauge, represented in terms of only three localized bosonic modes. Unlike its non-interacting electromagnetic counterpart, this model exhibits a nontrivial excitation spectrum featuring bound composite gauge particles ('glueballs') as the lowest-energy configurations. We extend this framework to one-dimensional arrays of coupled SU(2) cavities and discuss the driven excitation of a glueball condensate and the clustering of multi-glueball states as two elementary interaction-induced processes in these models. These examples offer a glimpse into the multitude of novel many-body phenomena that arise within this cavity SU(2) framework and we show how this physics at the interface between particle physics and quantum optics can be experimentally explored using state-of-the-art superconducting quantum circuits.
arXiv·2026-10-19·Byeongseon Go, Hyunseok Jeong
No generated summary available for this entry.
overview
Original abstract
Understanding how photon loss changes the classical complexity of BosonSampling is central to assessing the robustness of near-term photonic quantum advantage. In this work, we present a polynomial-time classical simulation algorithm for lossy BosonSampling that applies whenever a constant fraction of the input photons survives. We consider the standard fixed-loss model, where $N$ input photons propagate through an $M$-mode interferometer and exactly $N-n$ photons are lost uniformly at random, leaving $n$ surviving photons at the output. For any constant surviving fraction $n/N\in(0,1)$, the algorithm samples from a distribution within total variation distance $\varepsilon$ of the fixed-loss BosonSampling distribution with probability at least $1-δ$ over Haar-random interferometers, in time $\operatorname{poly}(M,N,\varepsilon^{-1},δ^{-1})$. We further extend the fixed-loss analysis to the uniform-transmission-loss model and obtain analogous polynomial-time simulability for any fixed transmission rate $η\in(0,1)$. These results substantially extend the known provably simulable regime of $n=O(\sqrt{\varepsilon N})$ surviving photons or $η=O(\sqrt{\varepsilon/N})$ transmission rate, and demonstrate that even the experimentally relevant linear-survival regime can admit efficient classical simulation under the conditions considered here.
arXiv·2026-10-19·Reja H. Wilke et al.
No generated summary available for this entry.
overview
Original abstract
Hidden-order phases elude the conventional Ginzburg-Landau framework: although they spontaneously break symmetry, their order remains invisible to standard local two-point correlators. Instead, they are typically characterized by nonlocal (string) order parameters and are believed to underlie a range of exotic quantum states, such as symmetry-protected topological (SPT) phases. While hidden correlations have previously been detected through nonlocal observables in quantum gas microscope experiments, in realistic solid-state systems multipoint observables are typically inaccessible and the signatures of hidden order remain largely unexplored. In this work, we show that hidden order in doped spin chains can be directly probed through dynamical two-point response functions measurable by resonant inelastic X-ray scattering (RIXS) and neutron scattering. Focusing on a minimal model, we numerically identify clear spectral fingerprints of both the hidden-order phase, its associated hidden quantum critical point as well as a specific group of gapless SPT phases. Complementing our numerical results with analytical insights, we uncover the microscopic origin of these spectral signatures and demonstrate how they emerge from the interplay between spin and charge degrees of freedom. Together, our results establish spectroscopy as a practical probe of hidden order and gapless SPT phases and provide a unified understanding of the low-energy physics governing these unconventional quantum phases.
arXiv·2026-10-19·Eugene Chen, Daniel Green
No generated summary available for this entry.
overview
Original abstract
The quantum Fisher matrix and geometric tensor are powerful tools for quantifying the nature of quantum systems. Unfortunately, the formalism needed to compute these quantities is opaque and has limited the development of physical intuition for their behavior, even in the ground state. For quantum systems with continuous symmetries, we know the ground state can be understood in a model-independent and intuitive way from the correlation functions of conserved currents and charges. In this paper, we demonstrate an equivalence between the quantum Fisher matrix associated with the ground states of systems with continuous symmetries and the Nambu-Goldstone. bosons produced by broken generators. We will show that the information metric defined by the Fisher matrix is the same as the Zamolodchikov metric that defines the coset space of the system. Next we show that the Uhlmann curvature associated with multi-parameter estimation is the same as the charge density matrix that defines the difference between type-A and type-B Nambu-Goldstone bosons. We demonstrate these connections in several examples and discuss the generalization to finite temperature.
arXiv·2026-10-19·Samuel A. Engel et al.
No generated summary available for this entry.
overview
Original abstract
The ability to assemble and reconfigure individual atoms is central to performing quantum science using optical tweezer arrays. Here, we demonstrate parallel omnidirectional atom transport and rearrangement using dynamic holograms generated by a single kilohertz-rate spatial light modulator. By carefully characterizing survival and heating, we show that atoms remain confined even when successive holograms are commanded before the liquid crystal has settled, enabling significantly faster transport. To generate holograms in real time, we develop and implement a warm-start, weighted Gerchberg-Saxton algorithm that achieves performance comparable to neural-network methods without requiring any training. Combining these techniques, we assemble ytterbium atoms into a 2078-site kagome lattice with 99.0% mean filling. In addition, we demonstrate parallel transport between array layers, combining axial and transverse motion to reconfigure atoms in three dimensions. Our approach is readily adaptable to existing tweezer platforms and provides a method for large-scale SLM-based atom assembly as well as programmable three-dimensional control.
arXiv·2026-10-19·Bingxuan Jiang, Shihao Zhang
No generated summary available for this entry.
overview
Original abstract
Two-dimensional layers coupled by position-dependent interlayer tunnelling host a layer pseudo-spin whose polarization is a controllable internal degree of freedom. We introduce the quantum geometry of this layer pseudo-spin: a mixed tensor formed from the interband Berry connection and the layer matrix element, which governs the response to an oscillating in-plane electric field. Because the layer pseudo-spin is an Ising-type scalar invariant under threefold rotation, its selection rules differ from those of a pseudovector spin. In a minimal two-band model, the layer-pseudo-spin quantum metric and Zeeman--Berry curvature are nonzero, while their zone integrals vanish. An in-plane drive therefore leaves the spatially averaged polarization unchanged at linear order but imprints a moiré-periodic intracell pattern, directly imageable by layer-resolved tunnelling. For twisted MoTe$_2$ bilayer, we quantify the local dipole modulation and identify the rectified, helicity-odd, and third-harmonic channels through which a net response appears at higher order.
arXiv·2026-10-19·Xingzhi Wang, Zohar Nussinov, Gerardo Ortiz
No generated summary available for this entry.
overview
Original abstract
We show that quantum systems on non-amenable lattices, whose boundaries constitute an extensive fraction of the system, host novel forms of bulk ordering with no Euclidean counterpart. Combining boundary-retaining iDMRG with an exact symmetry-fixing duality, we investigate $p<5$ state clock models on the coordination-3 infinite Cayley tree. We find that between the ordered and disordered phases lies an emergent intermediate phase with bulk order induced by an arbitrarily weak boundary field rather than by conventional spontaneous symmetry-breaking. This establishes boundary-sensitive order as a distinct quantum ordering mechanism defying Landau's spontaneous symmetry-breaking paradigm. The intermediate phase realizes a bulk-boundary correspondence in which the unpolarized boundary selects a specific ordered bulk state.
arXiv·2026-10-19·Xiajie Huang et al.
No generated summary available for this entry.
overview
Original abstract
We develop quantum algorithms for optimal control over a prescribed finite time interval (finite horizon), focusing on continuous-time linear-quadratic regulation (LQR). This foundational control problem often requires solving a nonlinear matrix Riccati equation, which can be costly for large systems and long control durations on conventional classical solvers. We instead work directly with the state-costate optimality equations, reformulating the LQR problem as a multiple-shooting linear system. Importantly, we prove a condition-number bound for the system that is independent of the horizon, under stabilizability and detectability assumptions. By incorporating the initial and final conditions into a single linear system, we can solve the subsequent linear system more efficiently with a quantum linear systems subroutine. For a given initial state, our quantum algorithms return classical estimates of the optimal cost and the optimal control inputs at a selected time, without constructing a Riccati solution operator. Given sparse-matrix block-encodings, an initial-state preparation oracle and a fixed number of control inputs, the query and gate complexities scale polylogarithmically with system size and control duration, provided that sparsity, relevant norms, and stability parameters are bounded. The dependence on the target error is inverse-linear up to logarithmic factors. We establish the required bounds uniformly in system size and duration for a family of damped mass-spring chains with two endpoint controls. Numerical experiments support the analysis.
arXiv·2026-10-19·Riccardo Molteni et al.
No generated summary available for this entry.
overview
Original abstract
Machine learning is widely regarded as a promising application in which quantum computing could offer a computational advantage. However, general quantum machine learning models with provable guarantees on performance, trainability, and efficient inference remain limited. In this work, we introduce quantum Hamiltonian embeddings, a supervised learning framework in which a classical training dataset is encoded into a single effective, parameterized Hamiltonian. Training optimizes the parameters of this data-dependent Hamiltonian, whose approximate ground state defines the classification rule. Once the ground state has been approximated using a quantum algorithm, inference can be performed either classically using a classical representation of the learned state, or with a quantum representation of the state. We establish efficient methods for gradient estimation and prove favorable generalization guarantees. Furthermore, under standard cryptographic assumptions, we show that Hamiltonian embeddings can realize hypothesis functions beyond the reach of efficient classical algorithms. We then demonstrate the framework at scale on IBM Heron processors using a standard benchmark dataset. Together, these results establish Hamiltonian embeddings as a new framework for quantum machine learning, combining theoretical guarantees with a path for experimental investigations at scale on quantum hardware.
arXiv·2026-10-19·Alexander Chansky
No generated summary available for this entry.
overview
Original abstract
Counterdiabatic (CD) driving suppresses the excitations of fast protocols by adding an auxiliary Hamiltonian, but in many-body and topological systems the exact CD term is generally non-local and multi-body. We study this obstruction for Thouless pumping in the Rice-Mele model, first without and then with interactions. For noninteracting fermions, the exact CD term of the pump is non-local, but the variational framework of Sels and Polkovnikov yields accurate nearest-neighbor approximations. For the spinful Rice-Mele chain with onsite and nearest-neighbor repulsion, in the regime where the competition of the two interactions stabilizes quantized pumping, this approach fails: the infinite-temperature variational action only penalizes the CD amplitudes, and the resulting two-parameter nearest-neighbor term does not prevent the pump from breaking down when the cycle time is reduced from $50/t$ to $2/t$. We trace the failure to the structure of the exact many-body gauge potential, whose amplitude for each hop depends on the interaction energy that the hop costs. Resolving the nearest-neighbor currents by this energy, and fixing the coefficients with a ground-state-weighted action, gives a local ansatz with 14 coefficients that keeps the interacting pump quantized for cycle times $T=2/t$ and $T=1/t$, with an accuracy per site that does not degrade between rings of 8 and 12 sites.
arXiv·2026-10-19·César Hernando de la Fuente et al.
No generated summary available for this entry.
overview
Original abstract
Correlated decoding improves matching and clustering surface-code decoders by reweighting one decoding subgraph conditioned on the other's correction. We show that standard reweighting can cause correlated decoders to fail on size-$(d-1)/2$ fault configurations that a distance-$d$ code should correct, reducing error suppression deep below threshold. Under circuit-level noise, a single first-pass edge can discount several correlated edges, even though their joint occurrence requires additional independent faults, so the decoder favors an over-discounted correction. Regularizing the reweighting rule restores the nominal distance scaling and a clear correlated-decoding advantage.
arXiv·2026-10-19·Mark Webber et al.
No generated summary available for this entry.
overview
Original abstract
We benchmark the Iterative Redecode Scheme (IRS) on fast transversal Clifford circuits, achieving high-accuracy correlated decoding using local memory-style detectors and decoders. On a deep random Clifford benchmark, IRS yields approximately $4\times$ lower logical failure rates than the ghost protocol at $d=11$ with matched buffers, and $15\times$ lower rates than logical observable matching (LOM). In three-block GHZ preparation, IRS achieves $2\times$ lower logical error rates than reliable logical Pauli-product decoding with matched initialisation, improving to $25\times$ at $d=19$ with $\lceil d/2\rceil$ full initialisation rounds. We place IRS, which builds on Wan et al.'s scheme, within a broader propagation-assisted local (PAL) framework, where local decoders exchange messages rather than decoding a global hypergraph. IRS alternates local minimum-weight perfect matching (MWPM) on memory-equivalent detector error models (DEMs) with Pauli-frame propagation and detector updates across transversal CNOT layers, seeking local error estimates consistent with the global detector record. Prior-informed DEMs account for probabilities of propagated errors missing from the memory-equivalent model, improving initial decoding and reducing logical error rates. Zero-weight physical Pauli mechanisms enable inference and propagation of initially indeterminate stabilizer outcomes. Error rates saturate after a few iterations even for deep, adversarial alternating-tCNOT circuits, allowing iteration caps with negligible loss of accuracy. We find syndrome-extraction buffers of order $\lfloor d/4\rfloor$ sufficient for distance-dependent error suppression in the demanding regimes studied. The approach extends to other local decoders and CSS codes; for repeated logical $S$ gates, IRS achieves approximately $4$ to $10\times$ lower logical error rates than LOM, depending on initialisation.
arXiv·2026-10-19·Matthew Barber, Stefano Pirandola
No generated summary available for this entry.
overview
Original abstract
We determine the exact quantum communication and entanglement-distribution capacities of three fundamental bosonic channels, namely thermal loss, thermal amplification and additive Gaussian noise, assisted by operations that completely preserve positive partial transpose (PPT). These operations are more powerful than local operations and classical communication (LOCC), but cannot generate distillable entanglement on their own. For thermal loss, the unconstrained capacity coincides with the Pirandola-Laurenza-Ottaviani-Banchi (PLOB) bound throughout the non-entanglement-breaking regime. The corresponding upper bounds are also attained for thermal amplification and additive noise. We extend these results to energy-constrained communication, establishing exact capacities for all three channels at every prescribed mean input energy. Our results solve a class of bosonic capacity problems under PPT assistance and establish exact benchmarks for determining whether the same communication rates can be achieved via LOCC alone.
arXiv·2026-10-19·Riccardo Acquaviva, Paolo Facchi
No generated summary available for this entry.
overview
Original abstract
We derive a general Gorini-Kossakowski-Lindblad-Sudarshan master equation for two co-located, uniformly accelerated two-level detectors weakly coupled to scalar fields in the Minkowski vacuum, retaining coherent and dissipative contributions for arbitrary orientations, field masses, and spacetime dimensions. For equal orientations, we determine stationary states and their entanglement for two couplings to massless fields in four dimensions: symmetric coupling yields acceleration-dependent concurrence, whereas rotating-wave coupling gives acceleration-independent concurrence.
arXiv·2026-10-19·Onofre Rojas et al.
No generated summary available for this entry.
overview
Original abstract
We investigate quantum-state texture during the thermal relaxation of an anisotropic spin-$1/2$ Heisenberg dimer subject to a longitudinal magnetic field and a Dzyaloshinskii-Moriya (DM) interaction. Starting from local transverse and longitudinal couplings to a bosonic bath, we construct a global weak-coupling Lindblad equation, identify its transition channels, and discuss the applicability and limitations of the secular approximation. The Gibbs state is obtained explicitly in the local spin basis, revealing that the DM coupling controls both the modulus and phase of the single-excitation coherence by modifying the energy splitting and rotating the chiral phase. For heating and cooling protocols, we compare rugosity, fidelity-based texture, and trace-distance texture with coherence, vector spin chirality, and purity. The relaxation dynamics separates population thermalization from the decay and precession of deliberately prepared energy-basis coherence. Their combined contribution to local coherence produces DM-dependent texture overshoots and, during cooling, damped oscillations and sign changes of the coherence quadratures. These transients differ from the evolution of coherence magnitude and purity, while trace-distance texture weights them differently from the overlap-based quantifiers. Calculations at reduced dissipation preserve the texture maxima within the secular model. The results identify a phase-sensitive diagnostic of relaxation.
arXiv·2026-10-19·Ignacio R. Sola
No generated summary available for this entry.
overview
Original abstract
This is a set of detailed notes that are part of a Ph.D. Course on Quantum Control delivered at the Department of Chemistry of Seoul National University in 2014. Part of this course was also taught in the Department of Chemistry of the Friedrich Schiller University Jena. It focuses on quantum optimal control and quantum optimal control algorithms based on the gradient and extended gradient methods.
arXiv·2026-10-19·Connor Lenihan et al.
No generated summary available for this entry.
overview
Original abstract
Accurate modelling of chemical reaction rates requires precise correlated energy differences. Quantum computing offers a potential route to their determination, but extracting energies from quantum-prepared states can demand prohibitive sampling. We demonstrate measurement-efficient correlated energy estimation using an electronically challenging H$_2$DBB--Ru model derived from a Ru-functionalized hafnium metal-organic framework relevant to radiodynamic and photodynamic therapies. The mixed estimator combines a quantum-prepared target with sparse multiconfiguration references and recovers ground-state corrections using magnitude-only compute-uncompute measurements. Analytical variance estimates predict 1.6 mHa precision with a few hundred shots, about 100 times fewer than the single-determinant formulation and three orders of magnitude fewer than optimized Hamiltonian-term sampling. With approximate targets, it reaches comparable accuracy using simpler state preparation than direct expectation-value estimation. Emulator and trapped-ion experiments on Quantinuum Helios validate the approach up to (10,10), including a 50-qubit circuit combining AI-assisted state preparation with error detection, providing a measurement-efficient route to correlated energy differences for challenging chemical problems.
arXiv·2026-10-19·Shunta Ide, Shu Tanaka
No generated summary available for this entry.
overview
Original abstract
Quantum annealing generally samples degenerate ground states with nonuniform probabilities. This unfair sampling depends on how the driver Hamiltonian couples these states near the end of annealing. For combinatorial optimization problems with a cardinality constraint, the penalty method and constrained quantum annealing (CQA) differ in these couplings. The transverse-field driver of the penalty method does not directly couple feasible ground states, whereas the fully connected XY driver of CQA couples pairs of them related by a single spin exchange. We investigate how this difference affects ground-state sampling, using closed-system simulations of random graph bipartitioning instances together with degenerate perturbation theory. For the instances studied, the conditional ground-state distribution of penalty-based quantum annealing approaches that of CQA at sufficiently large penalties and long annealing times. This convergence can be explained by the effective Hamiltonian of penalty-based quantum annealing, in which virtual single-spin flips to infeasible states generate a second-order interaction proportional to the CQA driver projected onto the feasible ground-state manifold, which is the leading term of the effective Hamiltonian of CQA. In the numerical simulations, the Jensen--Shannon divergence between the conditional ground-state distributions of penalty-based quantum annealing and CQA decreases approximately as the inverse square of the penalty-to-objective energy ratio, consistent with the perturbative analysis. This correspondence between the effective Hamiltonians extends to equal-weight fixed-magnetization constraints under the same perturbative conditions, providing a common mechanism for sampling bias in the two implementations.
arXiv·2026-10-19·Charles L. Fefferman et al.
No generated summary available for this entry.
overview
Original abstract
We study tunneling between two identical, smooth, compactly supported potential wells in a constant perpendicular magnetic field, with the coupling and magnetic field fixed and the well separation tending to infinity. For a sufficiently small positive magnetic field, we prove lower bounds on the hopping coefficient and on the splitting of the two lowest eigenvalues outside a set of separations of density zero. If the well centers are separated by $2d_1$ and the magnetic field strength is $bλ$, the lower bounds have the form $e^{-bλd_1^2-Cd_1^{1+δ}}$ for every fixed $δ\in(0,1)$. No radial or reflection symmetry of the single-well potential is assumed. The proof combines the explicit Landau resolvent kernel with a complex analytic estimate for logarithmic averages of the hopping coefficient.
arXiv·2026-10-19·Daniel Holst, Gianmichele Blasi, Shishir Khandelwal
No generated summary available for this entry.
overview
Original abstract
The primary pathway to the investigation of exceptional points (EPs) in open quantum systems has been the use of Markovian master equations. However, recently it has been realised that they can arise in settings that show non-Markovian behaviour. The main approach in this direction has been the use of pseudomodes, which allow the influence of a structured environment to be replaced by new damped auxiliary modes. In this work, we use a Heisenberg-equation approach which relies on the reaction-coordinate formalism to obtain exact analytical dynamics. First, we show how our method considerably simplifies the analysis compared to the use of master equations. Second, we utilise it to discuss non-Markovian revivals in systems with second and higher-order EPs, showing that the notion that EPs demarcate the onset of revivals is not generally true. We then utilise our results to discuss the dynamical effects of higher-order non-Markovian EPs, deriving bounds on the number of revivals and investigating enhanced asymptotic relaxation near higher-order EPs. Finally, we investigate non-Markovian EPs with engineered reservoirs and show how they can be utilised to control the rate of irreversible information loss.
arXiv·2026-10-19·Sambit Mohapatra et al.
No generated summary available for this entry.
overview
Original abstract
Electrostatic gates on two-dimensional electron gases (2DEGs) in GaAs/AlGaAs heterostructures are essential for numerous studies of correlation driven phenomena, many performed within the fractional quantum Hall effect. However, the most commonly used type of gates, the metallic Schottky gate, has the propensity to adversely impact the electron mobility and suppress the fractional quantum Hall states. Here we demonstrate through commensurability oscillations under specially designed nanostructured superlattice gates, that strain effects are responsible for the mobility reduction. The experimental results agree well with COMSOL Multiphysics simulations. In a regular, unpatterned gate the disordered, granular nature of the metal film fills the same role as the superlattice in creating a strain field penetrating down to the 2DEG, as we show with a simplified model. These results will help in understanding, improving and finding novel methods to reduce strain-induced disorder in gated high-mobility 2DEGs.
arXiv·2026-10-19·Sara Bartolucci et al.
No generated summary available for this entry.
overview
Original abstract
An important aspect of many linear optical quantum computing architectures is probabilistically generating small dual-rail qubit entangled states, or seed states. While many schemes to achieve this have been discovered, attention has been primarily focused on minimizing input resources and maximizing success probability rather than establishing a detailed understanding of linear-optical error performance. In this work, we develop a framework for resolving sensitivities to physically distinct errors in linear optical state generation, allowing us to identify precise ways in which these errors affect the properties of the output state. We use this framework to identify seed state generators in which destructive many-photon interference prevents detector loss and detector noise from causing a falsely successful heralding event. We show that this effect suppresses errors, for example cutting the effective loss on the output of particular Bell state generators in half relative to a standard scheme. We also present a new Bell state generator in which both detector loss and detector noise do not affect the quality of the output Bell state to first order, and a 4GHZ generator with >75% higher success probability than a standard circuit. In addition we provide some useful identities, bounds and invariants for studying linear optical seed state generation.
arXiv·2026-10-19·Tommaso Brambilla, Alessandro Tosini, Paolo Perinotti
No generated summary available for this entry.
overview
Original abstract
The formulation of quantum measurements compatible with relativistic causality is obstructed by the tension between the locality of observable algebras and the dynamical state transformations induced by measurement processes. We develop a local measurement theory for quantum cellular automata, lattices of finite-dimensional quantum systems with a causal reversible dynamics evolving in discrete time steps. Measurement processes are described by localized completely positive maps and organized into operational measurement protocols, finite non-adaptive sequences of local instruments distributed across the causal cone induced by the automaton local dynamics. Each protocol induces an effective measurement on the initial time slice, whose support is constrained by the causal structure generated by the automaton. Non-local measurement effects therefore arise through causal propagation and composition of local operations, rather than from primitive non-local interventions or instantaneous collapse prescriptions. We establish the corresponding spatial support bounds and characterize the resulting measurement architecture. As an explicit example, we construct a two-step protocol for a one-dimensional nearest-neighbour qubit automaton which, for suitable automaton parameters, realizes a Bell-basis projective measurement on two neighbouring sites after coarse-graining of the local outcomes. Away from this point, the same protocol generates a continuous family of deformed Bell measurements whose entanglement and stabilizer Rényi non-classicality can be quantified explicitly. The framework thus provides a causally consistent operator-algebraic mechanism for synthesizing spatially extended quantum measurements from strictly local operations.
arXiv·2026-10-19·Weicheng Miao, Linzhi Jiang, Bingbing Li
No generated summary available for this entry.
overview
Original abstract
In hyperon-antihyperon production through electron-positron annihilation, quantum steering provides a stricter test of nonclassical spin correlations than entanglement. We determine when steering survives angular averaging and optimize angular selections to reduce the sample size needed to resolve it. In the specified production-frame spin convention, we show that windows symmetric about 90 degrees with even production-angle acceptance yield phase-independent Bell-diagonal states. Applying the necessary and sufficient criterion for steering under arbitrary dichotomic projective measurements determines the exact boundary for this family and reveals a steering region missed by the three-setting Cavalcanti-Jones-Wiseman-Reid (CJWR) criterion. For positive production parameters and uniform full-range acceptance, the steering threshold is $α\simeq0.36065$. We derive the covariance of weak-decay angular moments, construct fixed linear witnesses, and optimize the angular window. For $J/ψ\toΛ\barΛ$, steering survives full-range averaging. The statistical model predicts that, after separately optimizing the two angular selections at nominal $z=5$, the required full-range pair sample decreases from $8.61\times10^4$ for CJWR to $2.80\times10^4$ for the projective witness, a 67.4% reduction. This advantage persists under the production-acceptance and analyzing-power variations studied.
arXiv·2026-10-19·Konrad Schröder, Erik Lennart Weerda, Matteo Rizzi
No generated summary available for this entry.
overview
Original abstract
Rydberg atom arrays (RAA) have been advocated as a promising avenue for the quantum simulation of different exotic quantum states. Numerical predictions for the ground state properties of this experimental platform can, however, be challenging in two-dimensional setups. In particular, faithfully treating long-range interactions is often crucial for distinguishing the fate of competing phases, but it usually comes at considerable cost. Projected entangled-pair states (PEPS), optimized via a sampling-based approach, have been shown to deal with such terms on the same ground as shorter-range ones. In this work, we employ these tools to investigate debated physical questions in different frustrated geometries of RAA, from the emergence of spin-glass physics on the Kagomé lattice to topological order beyond the PXP model on the Ruby lattice. By that, we contribute to establishing PEPS as well-suited tools for creating digital twins of RAA experiments.
arXiv·2026-10-19·Gökhan Torun
No generated summary available for this entry.
overview
Original abstract
In the resource theory of superposition relative to linearly independent, nonorthogonal reference states, golden states are known for two reference states and for special overlap matrices, and all of them are maximally coherent in the Löwdin basis. We clarify what decides their existence and their Löwdin structure. The robustness and the geometric measure of superposition are maximized by the same states, which overlap equally with every reference state; their maximal values are set by the ground-state energy of a classical $XY$ model on the overlaps of the dual basis. For every overlap matrix, these states, and only these, are golden under the maximal superposition-free operations, but they need not be maximally coherent in the Löwdin basis. For the Kraus-type free operations, we prove a necessary and sufficient criterion, Gram majorization, for converting pure states into targets with nonzero coefficients; it reduces to majorization for orthonormal reference states. It shows that golden states of these operations must be maximally coherent in the Löwdin basis, but that this does not ensure their existence: three reference states that are not orthonormal admit a golden state if and only if their overlaps have a common modulus $s$ and their Bargmann phase $Φ$ obeys $s\geq2\cos[(π+|Φ|)/3]$. Equal-overlap states also yield a complete family of superposition witnesses in the Löwdin basis, which show that white noise on the span of the reference states is a resource unless these states are orthonormal.
arXiv·2026-10-19·Teng Zhang et al.
No generated summary available for this entry.
overview
Original abstract
The establishment of metrics and control of fundamental noise sources in quantum sensing is a long-standing goal in quantum science and technology. We report on the observation of polariton-mediated optical noise in a thermal Rydberg atom vapor and demonstrate its active control and suppression using a radio-frequency field in Rydberg electrometry. The noise exhibits structured amplification and reduction across the Rydberg electromagnetically induced transparency resonance. This reveals a nonlinear slow-light feedback mechanism in which the polariton medium stores and releases probe-field energy. We show that the reference radio-frequency field used in Rydberg heterodyne receivers can also tune the medium into an operating regime where high electromagnetic-field responsivity coincides with reduced optical noise. This operating-point control enables optimization of the electric-field sensitivity within the constraints imposed by Rydberg-polariton physics. These results establish polariton noise as a previously unrecognized intrinsic noise source in thermal Rydberg vapors and the corresponding control method as a crucial aspect of continued efforts to achieve fundamental sensitivity limits in Rydberg electrometry.
arXiv·2026-10-19·Matthias Gruber et al.
No generated summary available for this entry.
overview
Original abstract
While quantum technologies are rapidly evolving, near-term applications heavily rely on hybrid quantum-classical paradigms. Among these, the classical shadows framework has gained a lot of traction, not only for quantum information science, but also for the development and verification of quantum hardware. It allows to efficiently classically estimate many properties of quantum states from randomized measurements alone, a task that is otherwise intractable due to the destructive nature of measurements in quantum systems. There are, however, many properties of interest that are, due to their very problem formulation, not efficiently estimable. In this work, we identify a computational kernel occurring in estimators of polynomial functions, a class of problems that are in general computationally difficult to solve. We show that this structure allows a row-wise partition that, together with a custom SIMD vectorization, enables massive parallelization and can reduce the computational cost significantly. We show applicability and scalability of the approach on different tasks, and our results showcase that the approach allows high sequential throughput and close-to-ideal parallel scaling. The work thus provides a new way of identifying and exploiting structure in classical shadow estimators, resulting in practical advantages on inherently difficult problems.
arXiv·2026-10-19·Stefano Veroni, Aydin Deger, Andrew J. Daley
No generated summary available for this entry.
overview
Original abstract
Fault-tolerant (FT) quantum computation offers a pathway to quantum advantage, but its realization is hindered by its significant overhead. The partially FT "STAR" architecture reduces the cost of universal computation at the price of relaxing FT requirements for non-Clifford operations, increasing exposure to hardware noise. Therefore, maximizing its performance and applicability demands careful co-design with the underlying hardware. In this work we investigate the co-design of the STAR architecture with neutral-atom platforms, connecting the underlying atomic physics to logical error modeling and application-level performance. At the physical level, we identify a favorable noise bias in $^{171}\mathrm{Yb}$ Rydberg gates, and show how it can be enhanced through error-selective pulse optimization. At the logical level, we identify an intrinsic error suppression mechanism, yielding vanishing logical coherent noise in leading order. Detailed circuit-level simulations of surface code implementations show more than an order of magnitude reduction in logical error relative to previous estimates. As a concrete target application, we focus on the Fermi-Hubbard model with periodic boundaries, for which we design a simulation circuit particularly suited to early implementations. We quantify the resource tradeoff of partially and fully FT approaches to gate synthesis, with the former showing approximately an order of magnitude reduction in state-injection depth, and an even larger reduction in Clifford resources. Comparing with classical and fully FT approaches, we identify regimes where partial fault tolerance provides both lower overheads and lower error rates. In our estimates, this is accessible with moderate error rates $p\sim 10^{-3}$ and a few thousand qubits, underlining that for these types of problems, partial FT approaches provide a compelling pathway to early quantum advantage.
arXiv·2026-10-19·Zhengyu Li, Amandeep Gupta, Vijay Ganesh
No generated summary available for this entry.
overview
Original abstract
The contextuality degree of a set of Pauli contexts is the least number of contexts that every noncontextual $\pm1$ assignment violates. For the four-qubit hyperbolic quadric $\mathcal{Q}^{+}(7,2)$, with $135$ points and $1575$ lines as contexts, Muller et al. conjectured from heuristic searches that the degree is $315$ and that the violated contexts of every optimal assignment form a dual polar space $DW(5,2)$. We prove both conjectures. The lower bound has a short proof by hand: every doily ($GQ(2,2)$) of the quadric contains ten Peres-Mermin grids covering each of its lines four times, so every assignment violates at least three of its fifteen lines, and averaging over the doilies gives $1575/5=315$. The equality case is local: an assignment is optimal exactly when it violates one ruling of one grid in every doily. Using this as a SAT encoding, we show that there are exactly $240$ optimal violated sets, one orbit of $\mathrm{O}^+(8,2)$, each isomorphic to $DW(5,2)$. The same argument gives the first lower bounds $\lceil L/5\rceil$ for all quadrics with $L$ lines in $N\ge4$ qubits. The degree theorem is kernel-checked in Lean 4, and the completeness of the enumeration is certified by a DRAT proof checked by the verified checker cake_lpr.
arXiv·2026-10-19·Mitsuyoshi Takahata, Ikuko Akimoto, Nobuko Naka
No generated summary available for this entry.
overview
Original abstract
We examined the energy-momentum relationship of the valence band of Cu$_2$O, which has gained interest as an emerging solid host for giant Rydberg states. Our findings reveal a nonparabolic dispersion, described using the rest mass (0.570 times the free electron mass) and rescaled light speed ($1.6\times 10^5$ m/s), which draws parallels with relativistic theory for high-energy particles. We propose a straightforward expression for the bound-state energies of Rydberg excitons with finite quantum defects, whose energy scheme deviates from the hydrogenic series. This formulation identifies relativistic kinematics as the physical origin of quantum defects, offering a streamlined basis for future studies on complex many-body correlations.
arXiv·2026-10-19·H. B. van Ommen et al.
No generated summary available for this entry.
overview
Original abstract
Utility-scale quantum technologies will not only require a well-performing quantum platform, but also classical control hardware that is scalable, efficient, and meets the design requirements set by the quantum system of interest. One approach is the application of silicon CMOS technology, a highly scalable and mature technology, to design application-specific integrated circuits (ASIC) that are optimized for the quantum system. In this work, we present two-qubit control of electron and nuclear spins in NV centres in diamond, using a cryogenic CMOS qubit controller integrated with a diamond quantum device in a cryostat. Using Gate Set Tomography (GST) we characterize the performance of the single-qubit gates on both electron- and carbon nuclear spins, and analyze the limiting noise processes. We use dynamical decoupling to engineer a two-qubit gate, and estimate $F_\text{2q,avg} = 95(2)\%$ for the electron-nuclear two-qubit gate fidelity. Our demonstration of cryo-CMOS-driven two-qubit gates is a key step towards highly-integrated quantum devices based on colour centres.
arXiv·2026-10-19·Anita Weidinger et al.
No generated summary available for this entry.
overview
Original abstract
The Parity Architecture was originally introduced in the context of quantum optimization algorithms to overcome hardware connectivity constraints. Here, we show that its benefits extend beyond this role by identifying specific parity transformations that enhance the success probability of the Quantum Approximate Optimization Algorithm (QAOA) for optimization problems defined on hardware-native and sparse graphs. Numerical simulations suggest that this enhancement originates from the higher-order operators introduced by the Parity representation, which accelerate the propagation of correlations across the physical device. We investigate this mechanism for the Signed Max-Cut problem on 3-regular graph instances and demonstrate its practical relevance on IBM Heron quantum processors. QAOA parameters are first classically optimized on small training instances containing up to 14 vertices and subsequently transferred to larger instances executed on quantum hardware. We consider Signed Max-Cut instances of up to 40 vertices and find that, together with an error mitigation technique, the parity-based QAOA identifies the optimal solutions for all the considered 40-vertex instances, whereas the conventional QAOA fails under the same conditions.
arXiv·2026-10-19·Jiahe Chang, Hongzheng Zhao
No generated summary available for this entry.
overview
Original abstract
A linear potential gradient can strongly suppress quantum dynamics, while interactions can activate resonant many-body processes whose higher-order structure remains largely unexplored. Here we uncover a systematic hierarchy of high-order interaction--tilt resonances in an interacting Stark chain, where the resonance order counts the minimal number of elementary exchange steps involved. These resonances manifest as long-lived coherent oscillations with order-dependent timescales. By isolating individual resonant channels and developing a microscopic effective description, we connect these dynamical timescales to the underlying many-body exchange processes and reveal a pronounced dependence on the initial-state structure. Our results provide crucial insights into high-order many-body resonances and show how commensurate interaction-to-tilt ratios generate a hierarchy of parametrically slow coherent many-body dynamics.
arXiv·2026-10-19·Irene García-Martínez, Manuel Gessner
No generated summary available for this entry.
overview
Original abstract
We introduce squeezing-type lower bounds for a hierarchy of variance bounds under specific unbiasedness constraints, which generalizes the quantum Cramér-Rao bound. Our construction directly extends standard squeezing coefficients to the corresponding generalized metrological sensitivities while retaining their experimentally accessible structure. We show how observables maximizing these bounds can be identified analytically within families of accessible observables. If arbitrary observables are accessible, the optimized squeezing-type bound recovers the exact generalized metrological sensitivity. These bounds provide efficient and experimentally viable characterizations of generalized metrological sensitivities that are especially relevant in finite-shot scenarios and in the transition from local to global parameter estimation.
arXiv·2026-10-19·Zhuo Wang, Ce Yu, Bin Yang
No generated summary available for this entry.
overview
Original abstract
Compact quantum neural networks have been explored for cloud-cover parameterization, but their predictive value depends on how physical knowledge is incorporated and which classical models provide the reference. We investigate an offline residual formulation that retains a fitted \XR\ cloud-cover estimate and learns a correction to its logit in transformed target space. Using released ICON/DYAMOND-derived data, we compare ten model variants in six- and eight-input settings, with three matched replicates and 10,000 training samples per replicate. All quantum circuits use local Z readout and noiseless exact expectation values. Under a common 30-epoch protocol, residual prediction reduced physical-space test mean squared error relative to direct QNN prediction by 54.3\% and 38.8\% for six-input XYZ and ZZXY circuits, and by 49.2\% and 38.9\% for their eight-input versions. Residual QNNs also outperformed the selected compact residual multilayer perceptron in every paired replicate. A larger, longer-trained Grundner-Q1 adaptation nevertheless achieved lower error: residual Q1 reached mean MSEs of 0.00778 and 0.00791, compared with 0.01124 and 0.01082 for residual XYZ. The results support residual prediction for compact simulated QNNs within the tested budget and establish a clear boundary set by stronger classical references. They do not establish computational quantum advantage or online climate-model skill.
arXiv·2026-10-19·Reyhaneh Khasseh et al.
No generated summary available for this entry.
overview
Original abstract
Universal behavior at continuous phase transitions is encoded in long-wavelength fixed-point theories controlled by dimensionality and symmetries. It is a central question for which systems this universal behavior and the underlying long-wavelength description can be captured by a noninteracting theory allowing for analytical and accurate predictions. In this work we provide a systematic procedure for obtaining the best noninteracting fermionic description of a quantum phase transition through fermionic Gaussian states. We demonstrate the performance of our procedure for the interacting long-range transverse-field Ising chain. This formulation reduces the problem to a self-consistent Euler equation that yields a critical line in close agreement with independent numerical benchmarks, while its singular momentum structure provides analytic predictions for continuously varying critical properties. Yet exact diagonalization shows that Gaussian-state fidelity to the exact ground state is poorest, and non-Gaussianity strongest, near the transition. Thus, accurate predictions for critical properties can emerge from the Gaussian variational description even where its microscopic wave-function approximation is weakest.
arXiv·2026-10-19·Walid El Maouaki et al.
No generated summary available for this entry.
overview
Original abstract
Quantum machine-learning (QML) models are increasingly considered for security applications, yet their adversarial robustness in malware analysis remains insufficiently understood. This paper presents Q-MALDetect, a hybrid convolutional and variational-quantum detector for byte-image representations of x86-64 Executable and Linkable Format (ELF) binaries, and evaluates it under feature-space and a range of Grad-CAM-guided, executable-aware evasion attacks. The model achieves 97.2% training accuracy, but its robustness deteriorates as attack strength increases, with the strongest evaluated feature-space attack reaching a 78.7% attack success rate (ASR). Among executable-aware attacks, Grad-CAM-guided no-operation (NOP) insertion produces the highest conditional ASR of 32.9%. Dynamic adversarial training is the most effective evaluated defense, reducing feature-space ASR to as low as 5.0%, executable-aware ASR to 7.7%, and the sequential-attack ASR to 34.0%. In contrast, convolutional-autoencoder preprocessing increases executable-aware ASR to 39.7%, coinciding with a rise in Grad-CAM attribution mass within the mutable .text region from 35.2% to 45.7%. Ablation results reveal no monotonic relationship between qubit count and robustness, while the encoding interface modifies the learned attack surface without neutralizing the strongest attack. These findings demonstrate that the effectiveness of attacks and defenses depends strongly on the perturbation constraints and evaluation conditions. Reliable deployment of QML malware detectors therefore requires assessment against both feature-space and executable-aware attacks rather than reliance on clean accuracy or generic denoising alone.
arXiv·2026-10-19·Zhi-Yuan Wei et al.
No generated summary available for this entry.
overview
Original abstract
Mixed quantum states can exhibit unconventional forms of symmetry breaking without pure-state counterparts. A prominent example is strong-to-weak spontaneous symmetry breaking (SW-SSB), which cannot be diagnosed by observables linear in the density matrix. Here, we experimentally resolve finite-size critical signatures of SW-SSB transitions on a superconducting quantum processor. We develop a measurement protocol that combines quantum measurements with classical processing based on the known dephasing channel to reconstruct nonlinear mixed-state correlators. Using only two measurement settings, the protocol reconstructs fidelity, Rényi-2, and linear correlators, as well as string observables. Applying this approach to matrix-product states subjected to power-law-correlated dephasing, we observe finite-size crossings and scaling collapses in nonlinear correlators, accompanied by decaying linear correlations. We further map the estimated SW-SSB transition points across initial-state and channel parameters. Measurements of linear and Rényi-2 string observables further reveal signatures of mixed-state symmetry-protected topological (SPT) phases, with a nonlinear string-order crossover aligned with an independently estimated SW-SSB transition point. Our results establish a quantum-classical approach to probing SW-SSB critical behavior and mixed-state SPT order.
arXiv·2026-10-19·Markus Baumann, Jonas Stein, Claudia Linnhoff-Popien
No generated summary available for this entry.
overview
Original abstract
Fresh qubits, not size, set how long a noisy quantum system can remember. With $k$ input qubits reinitialized per time step, the longest memory any reservoir can attain under depolarizing noise is $\exp[Θ(k)]$ time steps, whatever its size, dynamics, and input encoding. A universal upper bound and an explicit reservoir that attains the exponential scaling establish this optimal resource law. The bound depends on the dynamics only through the entropy that fresh qubits remove per time step, so it holds for any Markovian noisy dynamics without feedback, including measurement-free error correction.
arXiv·2026-10-19·Jørgen Garnæs et al.
No generated summary available for this entry.
overview
Original abstract
Sidewall morphology is a potentially important factor influencing superconducting qubit performance, yet its quantitative characterization remains challenging due to the absence of standardized measurement protocols. In this work, we develop a scanning probe microscopy-based measurement framework for the quantitative characterization of superconducting qubit sidewalls. The framework introduces a refined root mean square lateral sidewall roughness descriptor and a new curvature-equivalent radius for quantifying vertical sidewall morphology. The descriptors and measurement procedures are applied to different components of qubit devices, forming the basis of a proposed sidewall characterization protocol. This provides a foundation for quantitative comparisons of fabrication processes across laboratories, enabling future investigations of correlations between sidewall geometry and qubit performance.
arXiv·2026-10-19·Yubraj Bhandari, Jakob S. Kottmann, Adelina Bärligea
No generated summary available for this entry.
overview
Original abstract
Classical methods for computing quantum expectation values often propagate observables in the Heisenberg picture. To remain tractable, these methods rely on approximations that discard operator components during evolution. Yet the magnitude of these components alone does not determine the resulting expectation-value error, which also depends on their subsequent evolution and the input state. We develop \emph{generalized Pauli propagation}, a common algebraic framework encompassing Pauli propagation, Lie-algebraic simulation, and Krylov subspace methods. Using weighted commutator graphs, we derive exact identities that relate approximation errors to the signed contributions of omitted and discarded operator components. Our central result establishes \emph{delayed observability}, identifying conditions under which these contributions vanish at low orders in propagation time. We use this structure to develop finite-order error estimates and state-dependent selection rules. We further prove that retaining the symmetry-preserving part of a weak perturbation eliminates first-order expectation-value errors under suitable symmetry conditions. By revealing how approximation errors affect the desired expectation value, our framework provides a basis for more informative error analysis and the development of readout-aware simulation strategies.
arXiv·2026-10-19·Norio Konno et al.
No generated summary available for this entry.
overview
Original abstract
A quantum walk is a mathematical model and a quantum version of a random walk. For the past two decades, it has been studied from mathematical and physical viewpoints. It has many desirable properties. This paper reevaluates quantum walk from a quantum mechanical perspective, as Feynman essentially proposed it as a toy model in his path integral method. Then we demonstrate that the quantum walk model exhibits both particle-like and wave-like properties by showing reflection and partial reflection as a particle and interference as a wave. In particular, for an initial state supported at two sites $\pm\ell$, we explicitly derive the weak limit distribution of the Hadamard walk and show that the Konno distribution is modulated by the interference factor $2\cos^2(\ell k(x))$. The resulting interference profile is reminiscent of far-field (Fraunhofer-type) diffraction.
arXiv·2026-10-19·Md Afsar Reja, Awadhesh Narayan
No generated summary available for this entry.
overview
Original abstract
Altermagnets are an emerging class of magnetic materials that exhibit characteristic features of both ferromagnets and antiferromagnets. Odd-wave magnets, where the momentum-dependent spin splitting follows an odd-parity form factor, provide a distinct platform for exploring unconventional magnetic and topological phenomena. In this work, we demonstrate light-induced topological phase transitions in odd-parity magnets driven by bicircular light. We show that a cascade of topological phase transitions occur as the relative amplitude ratio of the two beams is varied. These are accompanied by sharp changes of the quantum metric. We demonstrate that bicircular light unlocks nonlinear Hall responses arising from Berry curvature and quantum metric in irradiated odd-wave magnets, and formulate the underlying selection rules. Our results show that both the topology and the nonlinear responses in odd-parity magnets can be directly controlled by a bicircular drive.
arXiv·2026-10-19·Zuo Wang et al.
No generated summary available for this entry.
overview
Original abstract
The Renormalization Group (RG) establishes relations between effective descriptions of physical systems at different scales; in Hamiltonian RG, these relations induce a flow in the space of Hamiltonians. In direct correspondence, we design an RG framework for quantum control by constructing a flow in the space of time-dependent Hamiltonians. A prescribed control subspace, selected to contain only experimentally accessible terms, forms the fixed-point manifold, while the flow preserves the target unitary and monotonically reduces the Hamiltonian weight outside this subspace. Exploiting the freedom in constructing the flow, we introduce flow-equation engineering to enhance the versatility of the framework for diverse control problems, including time-periodic and open-interval smooth protocols with prescribed endpoints. We provide two disparate applications to exhibit the utility of our approach: (i) Nonperturbative Floquet engineering beyond the regime of validity of high-frequency expansions, which we demonstrate by constructing an implementable time-periodic protocol for the Haldane model; (ii) Accessible fast-forward driving from unit-fidelity counterdiabatic evolution, which we showcase for large transverse-field Ising chains away from the adiabatic regime by compressing the long-range multibody adiabatic gauge potential into the original time-dependent Ising control schedules. Our control RG framework reveals a unifying perspective on Hamiltonian engineering and unitary quantum control, and can serve as an organizing principle behind seemingly disparate nonequilibrium quantum dynamics.
arXiv·2026-10-19·A-Long Zhou et al.
No generated summary available for this entry.
overview
Original abstract
We investigate open-system charging protocols for Rabi and Dicke quantum batteries under direct incoherent pumping. The charging dynamics follows a Lindblad master equation, while effective non-Hermitian generators describe the conditioned no-jump mechanism. For a single Rabi battery, this pumping suppresses coherent energy backflow, broadens the high-energy charging window, and improves robustness against both timing errors and detuning. At the selected Rabi operating points, pumping also increases ergotropy and the extractable fraction of the stored energy. For finite Dicke batteries, direct incoherent pumping likewise stabilizes the charging dynamics. Across the finite-size scan, the strongest pump considered improves the peak stored energy and ergotropy per cell and near-peak timing robustness relative to the Hermitian reference. The maximum average charging power also increases, although this metric includes pump-assisted jump contributions. Equal-input comparisons show that the relative performance of common-cavity Dicke and independent Rabi batteries varies with the pump-input bound. Taken together, these results show that direct incoherent pumping provides a route to stabilized charging in Rabi and finite Dicke quantum batteries.
arXiv·2026-10-19·Muhammad Kumail Haider, Aeysha Khalique
No generated summary available for this entry.
overview
Original abstract
Quantum communication networks promise information-theoretic security but this security collapses if intermediate relay nodes are compromised, a risk that grows sharply when compromised nodes cannot be identified. We address this twofold: first, we show that multi-path routing provides quantifiable protection against unidentified compromised nodes. Second, we provide a comprehensive statistical and graph-theoretic analysis of network and node security under compromise, covering full and partial node compromise, optimal placement of additional edges via an iterative method, and comparative hacking-probability analysis across network topologies. Together, these results identify the topology and multi-path routing strategy that most improves security for a given network. We apply this framework to quantum key distribution across multiple network topologies, demonstrating a scalable route to secure, reliable quantum communication under realistic, unidentified adversarial threats, without relying on quantum memory.
arXiv·2026-10-19·Yukun Yang, Ranjani G. Sundaram, Himanshu Gupta
No generated summary available for this entry.
overview
Original abstract
Distributing quantum circuits across a network of quantum devices is a recent approach to improve the scalability of quantum computation. Entangled pairs of qubits distributed across network nodes are used as a communication resource for executing inter-node (remote) gates. However, establishing these entanglement pairs incurs significant latency, and doing so during the circuit's execution may lead to the decoherence of logical qubits. Instead, it may be beneficial to distribute certain entanglement pairs before the circuit is executed. Thus, we consider the problem of distributing a quantum circuit across a quantum network containing some pre-distributed entanglement pairs and seek to minimize the execution time of the circuit. We address this problem in three steps. First, given the quantum network and (optionally) a probability distribution over training circuits, we determine a set of pre-distributed entanglement pairs under a specified budget. Second, we compute a qubit-to-memory allocation that minimizes the expected execution time given these pre-distributed resources. Finally, we identify any additional entanglement pairs required during execution, generate them concurrently, and execute the circuit gates. We evaluate our methods on a broad range of benchmark circuits.
arXiv·2026-10-19·Darren Ming Zhi Koh, Peng Kian Tan, Christian Kurtsiefer
No generated summary available for this entry.
overview
Original abstract
Thermal light exhibits intensity fluctuations or photon bunching that has been used as a source of entropy or temporally correlated light. However, its low spectral density limits its use in practical applications like LIDAR. One method of remedying this is optical amplification to boost its brightness. In this paper, we show that the normalized second order coherence function $g^{(2)}(τ)$ of a thermal light source is preserved after amplification. We then use amplified thermal light to demonstrate a LIDAR raster scan of a building at 1.3 km with a depth resolution of 2 cm.
arXiv·2026-10-19·Xinghang Yu, Bin Yang
No generated summary available for this entry.
overview
Original abstract
Light curves reveal stellar variability and support studies of stellar evolution and cosmic distances. Reliable classification is therefore important for large time-domain surveys. We present HyQ-LC for ten-class stellar light-curve classification using 359 handcrafted features and 633,034 training objects. The main model combines a window multilayer perceptron (MLP) backbone with a nine-qubit readout using amplitude encoding and angle re-uploading. Both this hybrid and its pure-MLP control have 44,238 parameters. On a shared 20,000-object test set, the hybrid has macro-averaged F1 (Macro-F1) point gains of 0.8276 and 1.2393 percentage points over the pure MLP on two fine-tuning seeds. A separate fixed-fusion configuration achieves slightly higher Macro-F1 but lower accuracy than approximately budget-matched LightGBM. Its positive class-level differences are concentrated in CEP, RRC, and ROT, while the full-budget LightGBM reference scores higher on both metrics. All circuits are simulated classically. The comparisons retain existing validation-selected checkpoints and use the same test objects, with features, predictions, and recomputation code publicly available. The results identify point-estimate improvements over the tested controls while leaving the specific contribution of the quantum branch unresolved.
arXiv·2026-10-19·Mingrui Yuan, Nikolay V. Golubev
No generated summary available for this entry.
overview
Original abstract
We present a fully quantum theory of time-resolved transient absorption spectroscopy, providing a general framework for describing the linear response of a nonequilibrium target to quantum probe fields beyond the semiclassical approximation. We elucidate how quantum correlations between probe-field frequency modes couple to coherences in the target and derive a simple expression for computing the resulting spectroscopic signals. We identify conditions under which quantum light can modify transient absorption spectra beyond the limits achievable with classical fields. Our work establishes a theoretical foundation for exploiting quantum light in ultrafast spectroscopy and suggests new routes for resolving dynamics in matter on timescales shorter than the duration of the probe pulse.
arXiv·2026-10-19·Charilaos C. Angelidis, Ioannis K. Marmorkos
No generated summary available for this entry.
overview
Original abstract
Satellite-based quantum links are a promising enabler of long-distance entanglement distribution, overcoming the exponential losses of optical fibers. In uplink architectures, entangled photons are generated at ground stations and transmitted to orbiting satellites, reducing space-segment complexity but introducing significant atmospheric and geometric losses. Single-satellite dual-uplink configurations are additionally limited by the requirement of simultaneous visibility between both ground stations and the satellite. In this work, we investigate a dual-uplink dual-satellite network architecture and compare its performance with the single-satellite scheme under identical physical assumptions. The proposed topology introduces an inter-satellite link (ISL) that decouples the ground-station separation from the atmospheric uplink geometry. A realistic channel model is employed, incorporating geometric attenuation, atmospheric turbulence, background noise, and Bell-state measurement efficiency. The overall success probability and practical fidelity are evaluated as functions of satellite altitude and ground-station separation. Our results show that while the single-satellite configuration is suitable for regional-scale networks, it becomes infeasible for large separations due to geometric constraints. The proposed dual-satellite architecture mitigates this limitation and significantly extends the achievable communication distance, representing a key step toward scalable quantum internet infrastructures.
arXiv·2026-10-19·Shohei Kobayashi et al.
No generated summary available for this entry.
overview
Original abstract
Controlling fermion parity in quantum-dot Josephson junctions (QDJJs) enables access to novel superconducting physics. While parity transitions are usually tuned electrically, we study phase-induced transitions in a strongly coupled QDJJ using the superconducting phase difference across the dot terminals, denoted by $φ$. We find that this phase allows control over the ground state parity, with parity transitions observed as the Andreev bound states (ABSs) energies crossing zero. These crossings occur near $φ= π$, and their behavior is in good correspondence to a simple model considering a single-level quantum dot proximitized by a superconductor. These results place phase-controlled QDJJ arrays as a promising platform for exploring exotic phenomena such as Majorana zero modes.
arXiv·2026-10-19·S. Adarsh, T. P. Sreeraj
No generated summary available for this entry.
overview
Original abstract
In an earlier work, we showed that, in the interaction-dominant setting, coupling the conjugate variables of a subsystem to distinct environment modes drives the subsystem to a maximally mixed state. Here, we extend the study to the full quadratic dynamics of a single-mode subsystem coupled to a two-mode environment, and identify the phase-space mechanism responsible for the asymptotic behavior. By tracking the exact reduced Weyl characteristic and Wigner functions, we demonstrate that they lose their dependence on local phase-space coordinates on every fixed compact region. In free-particle model, this happens for all values of coupling, whereas in the harmonic oscillator model, it happens above a critical value of the coupling. Under a finite-volume and momentum regularization, this behavior corresponds to the reduced subsystem approaching a maximally mixed state.
arXiv·2026-10-19·Cristian L. Cortes et al.
No generated summary available for this entry.
overview
Original abstract
Accurately characterizing molecular properties and reactivity often requires electronic-structure calculations across an ensemble of molecular geometries. Quantum algorithms that process such ensembles coherently could address this challenge, but they require Hamiltonian block encoding circuits that combine advanced factorization techniques with sublinear scaling in ensemble size. Here, we introduce SVD-THC, which extends tensor hypercontraction to sets of Hamiltonians defined at different nuclear geometries through a singular value decomposition of the ensemble. We use SVD-THC to construct a single multiplexed block encoding circuit for all geometries in an ensemble. We then evaluate the approach on ensembles generated by varying internal rotational coordinates in 1-bromo-2-chloroethane as well as in glycine and alanine dipeptides, corresponding to established model systems for peptide conformational landscapes, with up to 5,184 geometries. Across several resolutions of the internal-coordinate grids, the Toffoli complexity of the resulting circuits grows only weakly with the number of geometries, changing by at most 12\% over grids that differ in size by up to 576$\times$. In an energy-thresholding circuit, this yields 35--200$\times$ fewer Toffoli gates than slicing together single-geometry block encodings. This approach could help make coherent processing of molecular geometry ensembles a useful primitive for fault-tolerant quantum computing.
arXiv·2026-10-19·Noah Kaufmann, Anders Søndberg Sørensen
No generated summary available for this entry.
overview
Original abstract
The use of entanglement in sensing is often motivated by improved sensitivity arising from non-classical correlations among probes. For static signals, however, this quantum advantage in Ramsey spectroscopy with $N$ probes is known to be highly susceptible to dephasing, which severely limits the possible gain from entanglement. In contrast, we consider sensing of signals that vary in time. Considering the simplest example of dephasing by classical white noise, we show that entanglement allows a large increase in bandwidth when estimating the frequency components of a time-dependent signal. Without sacrificing any sensitivity, entanglement allows for an increase in bandwidth by a factor of $N$. Alternatively, when interrogation times are limited by the signal bandwidth rather than by dephasing, the average estimation uncertainty over a fixed bandwidth is reduced by a factor of $\sqrt{N}$ compared with separable states.
arXiv·2026-10-19·Soumyakanti Bose et al.
No generated summary available for this entry.
overview
Original abstract
Quantum states are ultimately responsible for numerous counterintuitive phenomena that defy classical intuition. As the development of quantum technologies accelerates, our ability to harness these quantum resources becomes essential. This review addresses a fundamental question. How do we quantify the quantumness of a state, and which specific traits distinguish it from its classical counterparts? We examine quantumness through both theoretical and operational lenses, providing a clear framework for state characterization. Ultimately, we demonstrate that certifying quantumness is not just a theoretical exercise. It is a practical necessity for identifying, and realizing quantum advantage in real-world applications.
arXiv·2026-10-19·Chenjia Zhu et al.
No generated summary available for this entry.
overview
Original abstract
Plasma simulations for magnetic-confinement fusion (MCF) involve high-dimensional kinetic dynamics, strong nonlinear coupling, complex geometries, and multiscale spatiotemporal behavior, imposing severe computational bottlenecks. While quantum computing offers a potential alternative for accelerating plasma simulation problems, its practical advantage for fusion research has not yet been demonstrated. We review existing quantum computing studies across kinetic dynamics, wave interactions, equilibrium, and macroscopic stability, evaluating their hardware implementations and operational bottlenecks. Current studies remain largely restricted to linearized equations, reduced models, or isolated computational subroutines, leaving a substantial gap from realistic fusion simulations. We summarize key problem characteristics, including high dimensionality, structured dynamics, and measurement requirements, under which plasma applications are most likely to yield a quantum advantage. Guided by these considerations, we highlight potential approaches and present a roadmap toward practical quantum advantage of simulating plasma in MCF.
arXiv·2026-10-19·Atsuhide Mori
No generated summary available for this entry.
overview
Original abstract
This paper is a non-planar counterpart of the author's earlier work on planar contact structures and topological quantum computation. On a planar page every branch point is paired by a liftable arc, and the pairing matches the Ising representation exactly, in that fixing the channels of the pairs already fixes the state. Here the page has genus g and connected binding, presented as a simple degree-three cover of the disk. Every maximal system of disjoint liftable arcs then has exactly g members and leaves two branch points unused, and the half-twist interchanging the two points is not liftable, although its cube is and lifts to the identity. Ising fusion does not see that leftover pair, determining its channel from the other g and acting there only by scalars, whereas Fibonacci fusion can leave the channel undetermined. The powers of the cube then act by ten distinct relative phases on a single joint eigenspace, while the Calabi-Yau Stein filling stays fixed. An integral residue criterion supplies the Calabi-Yau test, a factorization localized on a contact connected sum is automatically Calabi-Yau, and, unlike in the planar case, a Calabi-Yau factorization need not be the shortest.
arXiv·2026-10-19·Yukun Yang, Himanshu Gupta
No generated summary available for this entry.
overview
Original abstract
Emerging quantum networks enable distributed quantum computing (DQC) by interconnecting modest, noisy quantum processors. However, practical deployments face tight memory budgets, probabilistic entanglement generation, and decoherence, all while serving multiple users. In realistic settings -- cloud execution, iterative/interactive workloads and concurrent jobs -- circuits do not arrive in a single batch but as a stream. This creates a fundamentally online problem: the system must react to stochastic arrivals, balance latency and throughput, and remain stable under varying loads without foresight of future jobs. We study Online Scheduling and Distribution of Quantum Circuits (OS-DQC) and formalize the online scheduling problem for quantum networks: circuits arrive over time and must be executed without knowledge of future arrivals. At each event time (arrival or completion), the system decides which waiting circuits to launch and how to place their qubits, while accounting for congestion from in-flight circuits and constraints due to finite memories and decoherence. The objective is to minimize the mean completion time and makespan under these physical and resource constraints.
arXiv·2026-10-19·Zihao Gong, Saikat Guha
No generated summary available for this entry.
overview
Original abstract
Many quantum-information tasks can benefit from Gaussian quantum resources, while their fundamental performance limits are characterized by quantum information quantities. However, a unified perturbation theory for these quantities directly within the Gaussian-state formalism has been lacking. We develop such a theory for the von Neumann entropy, quantum relative entropy, quantum Chernoff quantity, and quantum fidelity, using perturbations of the moments of a reference Gaussian state. Using general Fréchet-derivative identities, we derive compact second-order expressions for reference-state covariance matrices whose symplectic eigenvalues are all greater than $1/2$. We also show that the perturbative quantum Chernoff quantity is maximized at its symmetric point, yielding the quantum Chernoff exponent (QCE). We further show that symplectic eigenvalues equal to 1/2 can lead to slower asymptotic vanishing, potentially improving the corresponding fundamental performance limits. For reference-state covariance matrices containing symplectic eigenvalues both equal to and greater than 1/2, we identify sufficient conditions under which the former determine the leading covariance-matrix contributions, allowing the remaining modes to be traced out without changing the leading-order asymptotic scaling or the coefficient. Applying the framework to quantum illumination and incoherent-light sub-Rayleigh object discrimination, we recover known asymptotic QCEs directly within the Gaussian-state formalism. In the latter problem, the slower asymptotic vanishing explains the known quadratic scaling of the QCE with the source separation.
arXiv·2026-10-19·Ian Baum et al.
No generated summary available for this entry.
overview
Original abstract
The quantum phase of a multiparticle system has remained a long-standing mystery in quantum physics. The absence of a phase operator that faithfully represents this physical quantity has prevented the formulation of a meaningful uncertainty relation with particle number. Here, we resolve this problem by measuring, for the first time, the quantum phase of multiparticle systems containing up to fifteen particles. We achieve this through a new quantum state tomography scheme that combines homodyne interferometry with photon-number-resolving detection. This approach enables us to reconstruct complementary photon-number and phase representations and establish the corresponding number-phase uncertainty relation. Our measurements further provide access to the mutually unbiased basis of a multiparticle system, a fundamental resource for multiparticle quantum information processing. Furthermore, we report the spatially resolved characterization of the quantum phase. These results provide an operational framework for measuring quantum phase in multiparticle systems, with implications for fundamental quantum physics and scalable multiparticle quantum technologies.
arXiv·2026-10-19·Dan-Adrian German, Tony Newton
No generated summary available for this entry.
overview
Original abstract
Complex amplitudes can be simulated over real Hilbert spaces by adjoining a two-dimensional real/imaginary degree of freedom. In a multipartite program, however, one globally shared phase tag is not a locality-preserving program transformation: every party would have to act on the same auxiliary system. We recast the distributed real simulation of multipartite quantum mechanics as a syntax-directed compiler into a real misty-state intermediate language. For $n$ parties we give explicit phase-reference codewords $|0\rangle_{P_n}$ and $|1\rangle_{P_n}$ on $n$ local tags and prove that the same real operator $J=XZ$ on any single tag realizes the logical action of multiplication by $i$. If a complex party-local gate is $A=A_R+iA_I$, its real translation is \[ \widehat A_j=A_R\otimes I+A_I\otimes J_j, \] which acts only on party $j$'s data and local phase tag. We prove an intertwining theorem for arbitrary finite party-local pure-state circuits, exact preservation of computational-basis measurement probabilities, preservation of the run-time interaction graph, and one-rebit-per-party overhead. For the canonical three-party GHZ program, the translation lies entirely inside the ordinary black-and-white misty gate fragment: controlled-$J$ replaces the complex phase operation, while the invariant $J_jJ_k|0\rangle_P=-|0\rangle_P$ transfers the required branch sign. This yields a short correctness proof for all four promised GHZ inputs and explains the earlier 64-path cancellation calculation at a single logical phase-code boundary. We distinguish this program realification problem from the weaker task of finding any real strategy with the same correlations, and state precisely which parts are known real-Hilbert-space simulation and which parts belong to the misty-language compilation layer developed here.
arXiv·2026-10-19·Yihao Wang, Jiaju Zhang
No generated summary available for this entry.
overview
Original abstract
We develop a systematic method to compute the subsystem fidelity and Rényi fidelity in two-dimensional conformal field theories (CFTs) from the operator product expansion of twist operators, and apply it to the subsystem quantum Bhattacharyya distance (BD) and Rényi-Bhattacharyya distance (RBD). We validate the method against exact results in the free massless fermion and boson theories, and then use it to compute the BD and RBD in holographic CFTs between two heavy primary states, between two thermal states, and between a heavy primary state and a thermal state. When the two states differ in their classical, order-$c$ data, the distances are of order $c$, and the states are distinguishable already at the level of classical gravity; when the leading data coincide, the distances are of order $1/c$ at every order of the short interval expansion, so that the distinguishability becomes a perturbative quantum gravity effect. For a heavy primary state and its thermal counterpart, the leading contribution to the BD appears at order $\ell^8$ and is of order $c^0$, whereas the RBD is generically of order $c$, in line with the earlier finding that a heavy primary state and a thermal state share the same order-$c$ entanglement entropy but have different order-$c$ Rényi entropies in the short interval expansion.
arXiv·2026-10-19·Mohammed Barhoush
No generated summary available for this entry.
overview
Original abstract
We study whether a quantum verifier can find a hidden quantum state by exchanging classical messages with an unbounded prover who knows the state. The verifier has access to a reflection oracle about the target. For a Haar-random $n$-qubit target, we prove that achieving constant average fidelity with the target requires $(q+1)^2(B+1)=Ω(2^n)$, where $q$ is the number of verifier queries and $B$ is the total prover-to-verifier communication. The bound allows arbitrary classical interaction and unrestricted computation between queries. Our proof extends the lower bound of Aaronson and Kuperberg from a single classical proof to an arbitrary classical interaction. As a result, we obtain a quantum-oracle separation of UniqueQMA from QCIP with polynomially many classical messages. In particular, we give a unitary oracle $\mathcal{U}$ such that there exists a language $L\in\mathrm{UniqueQMA}^{\mathcal{U}}$ but $L\notin\mathrm{QCIP}^{\mathcal{U}}$. We further give an oracle construction for a notion known as QMA-QCIP[2] gap problem. This gives average case hardness for a QMA language under classical access to a QCIP[2] decision oracle and is used in establishing negative results on witness encryption and quantum indistinguishability obfuscation.
Phys.org Quantum Physics·2026-10-18
No generated summary available for this entry.
overview
Original abstract
In optical fibers, chips and other light-guiding devices, minor defects can scatter photons and disrupt their path. A new study demonstrates a way to reveal properties which, in certain systems, help light wave behavior withstand such flaws. The method could help speed up the search for new kinds of electronics and optical technologies, and contribute to more reliable quantum devices.
Phys.org Quantum Physics·2026-10-18
No generated summary available for this entry.
overview
Original abstract
Researchers have developed and demonstrated a new hybrid photonic platform that integrates quantum emitters with photonic devices, providing a way to reliably control the interaction between photons and quantum information carriers. The chip-based platform, which combines gallium phosphide (GaP) with a diamond substrate, could help make quantum networks more practical by providing a way to connect quantum devices over long distances.
Phys.org Quantum Physics·2026-10-18
No generated summary available for this entry.
overview
Original abstract
Some quantum systems are so complex that even the most powerful supercomputers struggle to simulate their behavior. One solution is quantum simulation: building a controllable quantum system in the lab and tuning it to mimic the one researchers want to understand.
Phys.org Quantum Physics·2026-10-18
No generated summary available for this entry.
overview
Original abstract
Whether we are waiting for a car windshield to defrost in winter or a warm drink to cool down, how long it takes for an object to settle into a stable, even temperature within its environment (thermal equilibrium) depends on numerous factors. These can include surface area, the material properties of an object and airflow.
npj Quantum Information
·2026-10-18
·Changhoon Baek et al.
·doi
No generated summary available for this entry.
overview
arXiv·2026-10-18·G. Sonnino et al.
No generated summary available for this entry.
overview
Original abstract
Laser amplification kicks off with just a few photons in the cavity, a regime where standard additive Langevin noise cannot capture the real fluctuations. To understand how this amplification begins, we map out a single-mode photon-carrier model that links macroscopic lasers directly into nanolasers. Stationary rate equations reveal that stimulated emission takes over across a tight pump window. In nanolasers, however, spontaneous processes coexist across a much broader range. Because steady-state averages miss the individual events that lead to the macroscopic photon number, we frame the stochastic dynamics around the actual discrete transitions, deriving a state-dependent diffusion approximation. The destruction of an excited carrier concurrent with the generation of a photon creates a negative photon-carrier cross-correlation. This unavoidably leads to a correlated, multiplicative Gaussian-noise framework. We track the resulting discrete dynamics with an established, event-based Laser Markov Chain (LMC) which stochastically samples pump, relaxation, emission, and cavity-loss events keeping all physical quantities as non-negative integers. Comparing its predictions to those of our multiplicative model proves that the latter reproduces excellently well the statistical behavior of photons and carrier, as long as a continuous diffusion description holds. Once the emission drops into the few-photon regime, however, the discrete model becomes indispensable. On the other hand, at large photon counts relative fluctuations shrink to a level where the state-dependence of the diffusion matrix can be ignored, to leading order, thus returning to the classic Langevin description of the system's stochastic dynamics.
arXiv·2026-10-18·Ilya Merkulov, Rotem Arnon
No generated summary available for this entry.
overview
Original abstract
Randomness certification aims to guarantee that the output of an untrusted quantum device contains genuine randomness that remains unpredictable even given quantum side information held by an adversary. For a classical verifier interacting with a single quantum device, such a guarantee cannot rely on the physical separation underlying standard Bell tests and must instead follow from computational restrictions on the prover. Building on the framework of Computational Bell Inequalities, we distinguish classical and quantum virtual-input hiding, showing that the former suffices for proofs of quantumness, whereas the latter enables randomness certification against quantum side information. Our main technical contribution is to establish quantum virtual-input hiding for a commitment-based protocol derived from the proof of quantumness from one-way-functions by Morimae and Yamakawa. We show that statistical hiding together with ordinary computational binding against quantum polynomial-time senders suffices, without requiring stronger quantum binding notions such as sum-binding or collapse-binding. This yields a randomness-certification protocol from post-quantum statistically hiding bit commitments. In particular, existing constructions of such commitments from post-quantum one-way permutations imply that post-quantum one-way permutations suffice for randomness certification. We further instantiate our construction using quantum-secure trapdoor claw-free functions, obtaining an efficient classical verifier, and in the quantum random oracle model, obtaining randomness certification without additional computational assumptions but with an inefficient verifier. These instantiations separate the cryptographic properties sufficient for randomness certification from the additional structure required for efficient verification within our commitment-based framework.
arXiv·2026-10-18·Mohamed Gharib et al.
No generated summary available for this entry.
overview
Original abstract
Wiring and bandwidth bottlenecks between a quantum processor and room-temperature electronics can be reduced by placing digital control at the cryogenic stage, but commercial foundry standard-cell libraries are not specified for operation at 4 K. A cryogenic recharacterization flow is therefore developed for a commercial 22 nm FD-SOI foundry standard-cell library using commercially available cryogenic compact-device models, while retaining the original cell circuits, layouts, logic functions, and implementation semantics and remaining compatible with the commercial synthesis, place-and-route, and signoff methodology used at room temperature. Body-bias dependence is quantified over 38,640 matched slew/load points at zero, +/-0.9 V, and +/-1.8 V body bias. Relative to full bias, zero-bias operation increases the median rising and falling delays by 38.6x and 33.0x, while approximately 90% of transitions exceed the foundry-defined maximum-transition envelope. The 0.8 V-to-0.4 V level shifter is even more sensitive to body bias: its worst-case falling delay decreases from 30.6 ns at zero bias to 0.56 ns at +/-1.8 V. For the outbound 0.4 V-to-0.8 V crossing, driving the 0.8 V receiver without a level shifter dissipates 57.7 uW of static power per bit at full bias, against 0.196 nW when level-shifted. In post-route analysis of the unchanged extracted physical database of a fabricated 32-bit ALU, the register-to-register setup boundary increases from 1.3 MHz at zero bias to 37.9 MHz at +/-0.9 V and 132.9 MHz at +/-1.8 V.
arXiv·2026-10-18·Hisham Sati, Urs Schreiber
No generated summary available for this entry.
overview
Original abstract
Two-band 2D fractional Chern insulators (FCIs) have recently been shown, in principle, to admit unusual anyonic order, associated with Bloch Hopfions localized in momentum space. Here we show that bounding the integrated quantum metric along one primitive Brillouin-zone cycle may refine this topological order to $|C|$ distinct braiding observables, cyclically permuted by lattice translations, for Chern numbers $|C| > 1$. The cyclic structure entails mildly non-abelian braiding phases and otherwise matches the spectral flow exhibited by the FCI's hybrid Wannier states, with the metric bound equivalently a bound on the states' real-space spread. We give a classification of quantum gates in principle implementable on this topological order; among them we find the non-Clifford T-gate and the non-Clifford entangling CCZ-gate. This points to novel pathways to fault-tolerant quantum processes within the known orbital structure of FCIs, potentially informing experimental searches towards hardware for future topological quantum computers.
arXiv·2026-10-18·Valery Shchesnovich
No generated summary available for this entry.
overview
Original abstract
We propose a scalable and efficient \textit{in situ} method for assessing the multiparticle indistinguishability of identical bosons or fermions in quantum interference experiments on linear interferometers by harnessing quantum parallelism and the bunching/anti-bunching tendencies of these particles. The proposed certification method can be applied to any generic linear interferometer. For particles occupying distinct input ports of a Haar-random unitary interferometer, the number of experimental runs required to attain a prescribed statistical precision is polynomial in the number of particles, the interferometer size, and the inverse precision, with high probability. Our method is robust under losses: for uniform particle losses, the polynomial scaling is preserved when the inverse single-particle survival probability is polynomially bounded. Our scheme is especially suitable for certifying the indistinguishability of single photons in large-scale interference experiments, such as Boson Sampling in the regime of quantum advantage over classical computation.
arXiv·2026-10-18·Vasileios Fragkos, Igor Pikovski
No generated summary available for this entry.
overview
Original abstract
Bosonic particles beyond the Standard Model, such as axions, are among the leading candidates for dark matter. If such particles have a small mass, they are usually described as a purely classical field. However, it was recently shown that this description is incomplete: their inherent gravitational self-interactions can squeeze the field, producing a quantum feature beyond the classical description. Here we analyze squeezing of light dark matter in the presence of decoherence. We show that squeezing is continuously generated, and rapidly enough to survive dissipation, and may also remain present under thermal fluctuations and dephasing. Our results demonstrate that dark matter might possess persistent quantum features and motivate further investigation of their implications for dark matter detection.
arXiv·2026-10-18·Minze Chen et al.
No generated summary available for this entry.
overview
Original abstract
With the escalating development of the quantum information technologies, the Rydberg atomic receiver has been envisioned as a promising alternative to its classical electronic counterparts, attracting extensive attentions from both physics and electronic engineering disciplines. By exploiting the electrical acuteness of Alkali atoms with diverse Rydberg energy states for electromagnetic field measurement, Rydberg atomic receiver is capable of surmounting the inherent limitations on the operating bandwidth and detection sensitivity of the classical electronic counterparts. Against this background, this article provides an extensive overview of Rydberg atomic communication and sensing from fundamental theory, critical technologies to practical implementations. Firstly, the milestones of the Rydberg atomic receiver evolution was introduced. Then we provide a clear understanding of Rydberg atomic receiver mechanisms from the perspective of classical communication and sensing, and highlight the unprecedented advantages over traditional electronic receivers as well as the technical challenges. Afterwards, necessary fundamentals are presented including the Rydberg atoms, typical non-coherent/coherent structures, and explicit experimental configurations, followed by discussions on state-of-the-art development of the Rydberg atomic receiver. Specifically, advancements on electric-field detection methods for accurate measurement of amplitude, phase, frequency and polarization, are extensively investigated. Based on the established methodologies, recent innovations in Rydberg atomic communication and sensing are reviewed, ranging from waveform design and array-based signal processing to radar applications like localization, imaging and remote sensing, with practical experimental results presented. Finally, we summarize the promising research trends around Rydberg atomic receiver.
arXiv·2026-10-18·Xianghui Cao et al.
No generated summary available for this entry.
overview
Original abstract
We develop a quantum simulation framework for meson production in deep inelastic scattering based on light-front QCD Hamiltonian formalism. A quark-antiquark dipole, prepared either as a single-momentum state or as the $q\bar q$ component of a virtual photon, is evolved in real time through the color field of a nuclear target via Trotterized unitary evolution. We consider both proton and gold nuclear targets, each characterized by their respective saturation scale. From the evolved state we extract the transverse momentum broadening, the total and elastic cross sections, and the $J/ψ$ production rate by projecting onto the $J/ψ$ light-front wavefunction. We then extract the nuclear modification factor $R_A$ at different photon virtuality $Q^2$ and analyze nuclear modification effect. Results of classical simulations show good agreement with analytical eikonal predictions across a broad range of parameters. For the single-momentum dipole, quantum simulation is demonstrated on a quantum circuit emulator with a smaller lattice size, and results are consistent with the classical benchmark. This work establishes a first-principles, amplitude-level pathway toward computing exclusive hadron production in deep inelastic scattering, directly relevant to the physics program of the Electron-Ion Collider.
arXiv·2026-10-18·Elsa Mizrahi, Uzi Pereg
No generated summary available for this entry.
overview
Original abstract
We show positive and negative results on classical relay channels with entanglement assistance, revealing a sharp contrast between strictly causal and causal relay encoding. First, we consider van der Meulen's setting of a unit-delay relay, with strictly causal encoding. We show that the standard cutset upper bound continues to hold with entanglement assistance, and deduce that entanglement does not increase the capacity for several classes of relay channels. Second, we consider a zero-delay relay, where the encoding is causal. We present an example in which entanglement enables rates that exceed the cutset upper bound by at least 12.5%. Namely, entanglement shared between the source and relay significantly increases the capacity of a classical zero-delay relay channel.
arXiv·2026-10-18·Yi Liang
No generated summary available for this entry.
overview
Original abstract
Under local magnetic Gauss constraints, vertex-disjoint regions can have commuting physical observable algebras that do not generate all observables on their union. We construct such counterexamples for every finite non-Abelian group on regular square tori, retaining the full magnetic physical space and original supports inside a fixed contractible disk. A peripheral projector selects inputs on which a joint transition preserves the constraints, while its loop factor alone fails the universal test over physical exterior completions. For a specified support family around a fixed eight-edge square loop, additivity fails if and only if the group is non-Abelian and each inner face is covered by at least one of its two prescribed peripheral edges. Leaving a face uncovered restores full additivity. For the same loop, additivity also holds with any region at vertex-set graph distance at least two. These results refute a recent group-double additivity proposition.
arXiv·2026-10-18·Wei Zi, Pei Yuan, Junhong Nie
No generated summary available for this entry.
overview
Original abstract
Hamming-weight computation and symmetric Boolean functions are basic primitives for quantum arithmetic and state preparation, where circuit depth and qubit overhead matter. We construct an exact circuit computing the Hamming weight of an $n$-qubit register with depth $O(\log n)$ and size $O(n\log n)$, using only the $n$ input qubits and $m=\lceil\log_2(n+1)\rceil$ binary output qubits. The circuit uses arbitrary one-qubit gates and CNOTs with all-to-all connectivity. Both depth and total width are optimal. Our constructions combine tree structures and pipelining, temporarily using input qubits as workspace. We also give exact circuits for every symmetric Boolean function with the same depth and size bounds, using only $m$ ancillary qubits returned to zero. Finally, we apply the counter to exact preparation of balanced Dicke states for even $n$. With only $O(\log n)$ ancillary qubits, we obtain expected depth $O(\log^2 n)$ using measurements and classical feedforward, and depth $O(n^{1/4}\log n)$ using unitary gates alone.
arXiv·2026-10-18·Tairan Lou et al.
No generated summary available for this entry.
overview
Original abstract
We identify a strong quantum Mpemba effect in which a many-body ground state heats faster than every Gibbs state at finite positive temperature under the same dissipative dynamics within a fixed-color sector. In ferromagnetic $SU(N)$ exchange systems with local dephasing, exact coherence shells confine the ground-state evolution and exclude all slower Liouvillian modes. Its relaxation rate is fixed by the bath, independently of system size, exchange graph, and integrability. We derive an energy-resolved sign criterion that guarantees a slower thermal contribution throughout the positive-temperature range. An exact finite-chain solution proves this rate inversion, and symmetry-resolved calculations confirm the criterion in larger spin-one chains, including nonintegrable exchange. The zero-temperature endpoint of a continuous Gibbs family can therefore be dynamically isolated by its exact exclusion from slow relaxation channels.
arXiv·2026-10-18·Matthew Simon Tan, Ernest Y. -Z. Tan
No generated summary available for this entry.
overview
Original abstract
We present a continuity bound for quantum conditional entropies in terms of fidelity, with no dependence on the dimension of the conditioning system. Our results encompass both the von Neumann entropy and one version of sandwiched Rényi entropy, which is particularly relevant for applications in quantum key distribution (QKD). In such applications, this bound should provide improved results as compared to previous continuity bounds based on trace distance. We also show that the bounds can be sharpened as expected for classical-quantum states, and verify that they hold when the conditioning system has countably infinite dimension. Finally, we present several variants tailored for exponential functions of the Rényi entropies instead, which should be relevant for QKD applications.
arXiv·2026-10-18·Gavin Hull, Marco Merkli
No generated summary available for this entry.
overview
Original abstract
Consider $N$ identical quantum systems at the vertices of a graph, interacting via pairwise edge couplings. We designate $K$ vertices as a system of interest $\mathrm S$ and the remaining $N-K$ as a reservoir $\mathrm R$. Under generic connectivity assumptions between $\mathrm S$ and $\mathrm R$, we show that for $N\to\infty$, the reduced state of $\mathrm S$ converges to a convex combination of symmetric product states of $K$ single-vertex density matrices -- called a de Finetti representation. Unlike in standard derivations for symmetric (exchangeable) systems, we establish de Finetti representations for quantum networks, which are inherently non-exchangeable. We construct the representations explicitly and quantify the convergence rate. We show that Erdős--Rényi random graphs exhibit the de Finetti structure: as the reservoir grows, the reduced state of any fixed finite subgraph converges almost surely to an explicit deterministic product state. As applications, we establish a general area law for the entanglement entropy of $\mathrm S$, analyze mean-field and fluctuation scalings of the $\mathrm S$-$\mathrm R$ interaction, and illustrate our results on qubit networks. We also derive quantitative convergence estimates for information-theoretic quantities, including von Neumann entropy, mutual information, and entanglement within $\mathrm S$ and between $\mathrm S$ and $\mathrm R$.
arXiv·2026-10-18·Niels Benedikter et al.
No generated summary available for this entry.
overview
Original abstract
We prove that the random phase approximation provides an upper bound on the correlation energy of a three-dimensional, weakly interacting, Fermi gas in the thermodynamic limit at high density. More precisely, we consider a mean-field scaling regime where the kinetic and interaction Hamiltonian are scaled by $ρ^{-2/3}$ and $ρ^{-1}$, respectively. We use a correlated trial state constructed through a quasi-bosonic Bogoliubov transformation of collective particle--hole excitations associated to patches on the Fermi surface. Key of the proof is to control the position-space localization of the collective excitations. Combined with an iterated Duhamel expansion of the expectation values of (localized) particle number operators we obtain extensive estimates, which justify the reduction to an effective quadratic Hamiltonian and its approximate diagonalization.
arXiv·2026-10-18·Di Fang, Jiaqi Zhang
No generated summary available for this entry.
overview
Original abstract
Nonrelativistic quantum chemistry is based on the Schrödinger equation in continuous, unbounded space. Computational approaches on classical and quantum computers often truncate the spatial domain and introduce a finite-dimensional basis, reducing the continuum problem to a finite-dimensional one. There is therefore a fundamental question: to what extent does this approximation capture the original continuum problem? In this work, we develop a general Sobolev-Galerkin framework for estimating spatial discretization errors in quantum simulation with unbounded Hamiltonians. We apply this framework to many-body Coulomb systems and establish both periodization and Galerkin error estimates for wave-function dynamics and ground-state energies. For dynamics, the finite-basis projection error of the exact wave function does not capture the full basis-discretization error: an additional dynamical projection error enters our bound at a different rate, and we introduce an inner-product argument to control this contribution. Interestingly, the spatial convergence rates for wave-function dynamics and ground-state energies differ quantitatively. For ground-state energies, we establish a sharp $M^{-1}$ convergence rate at fixed cell size, where $M$ is the number of one-particle basis functions. We also show that a uniform $M^{-1}$ convergence rate is impossible for the corresponding real-time wave-function error with general $H^2$ initial data. The analysis relies on many-body Sobolev estimates with explicit polynomial dependence on system size. Combining these estimates with state-of-the-art quantum algorithms, we obtain, to our knowledge, the first rigorous end-to-end complexity bounds for quantum simulation of molecular and electronic dynamics with all spatial errors explicitly controlled. The number of basis functions is determined directly from the continuum problem, without regularization.
arXiv·2026-10-18·Joscha Henheik, Marius Lemm, Tom Wessel
No generated summary available for this entry.
overview
Original abstract
Recent work by Greenblatt, Lange, Marcelli, and Porta (Commun. Math. Phys. 2024) provides the first rigorous justification of adiabatic theory for interacting quantum systems at positive temperature. Their analysis treats weakly interacting lattice fermions and combines a rigorous Wick rotation with fermionic cluster expansion techniques. Here, we study a class of weakly interacting quantum spin systems and derive response theory at positive temperature, thereby covering non-Fermi systems for the first time. Our proof identifies and exploits the locality property of local indistinguishability as a key ingredient in carrying out low-temperature adiabatic expansions. The fact that these systems satisfy local indistinguishability was recently established jointly with Adhikari (arXiv:2508.15907) using cluster expansion methods together with a probabilistic swapping trick.
arXiv·2026-10-18·Mir Mohammad Yousuf, Shabir Ahmad Sofi, Bisma Majid
No generated summary available for this entry.
overview
Original abstract
Noisy Intermediate-Scale Quantum (NISQ) hardware has transformed quantum computing into a practical experimental platform while introducing fundamental challenges associated with hardware noise, decoherence, and probabilistic execution. Although quantum software testing (QST) has rapidly emerged as an active research area, it remains unclear to what extent existing testing methodologies explicitly engage with noisy and hardware-constrained execution environments. This paper presents a systematic empirical landscape analysis of noise-awareness in QST research through a deterministic, taxonomy-guided analytical framework applied to 61 papers published between 2018 and 2025 across eight testing paradigms, contrasting how contributions are framed with how they are evaluated. Among the analyzed papers, 47 (77.0%) are noise-oblivious and only 14 (23.0%) explicitly engage with noise-related execution concerns, while only 11 (18.0%) report evaluation on physical hardware or a noisy simulator. Test generation, the largest paradigm, exhibits a noise-awareness rate of only 14.3%, and debugging and repair 18.2%; coverage-based, metamorphic, and differential testing contain no noise-aware contributions. Noise-aware methodologies emerged late and remain outnumbered in all analyzed years. Framing and evaluation are strongly associated (odds ratio 40.5, p < 0.001) yet diverge for individual papers: 5 of the 14 noise-aware papers evaluate only on ideal simulators. Inferential statistical tests are reported in only 16.4% of papers. The classification framework was validated against a blinded, human-coded reference sample, achieving almost perfect inter-rater agreement on testing-technique classification and substantial agreement on noise-awareness. The framework provides a reusable empirical basis for longitudinal analysis of hardware-conscious testing practice.
arXiv·2026-10-18·Yotam Peled, Eliya Nachmani
No generated summary available for this entry.
overview
Original abstract
The realization of fault-tolerant quantum computation relies on Quantum Error-Correcting Codes (QECC). Of particular interest are codes that combine a high encoding rate with sufficient distance. Existing algebraic constructions, such as lifted product (LP) codes, build a large quantum low-density parity-check (qLDPC) code from a classical base matrix. In this work we introduce LiftDiff, a generative approach to the discovery of QECC. A discrete denoising diffusion model is trained to generate base matrices over the group algebra $\mathbb{F}_2[\mathbb{Z}_\ell]$, which are then expanded into LP codes. The reverse diffusion process is guided by an energy function that evaluates quantum code properties, including girth, degree, sparsity and decoding performance, steering the sampler toward matrices that yield LP codes with favorable parameters. Our method discovers codes with parameters such as $[[169,13,11]]$, $[[143,15,9]]$, and $[[260,24,10]]$, including a $[[247,19,14]]$ code that achieves the highest ${kd^2}/{n}$ among the baselines. Moreover, several discovered codes outperform the Gross code across a broad range of the tested physical error rates under both code-capacity and circuit-level noise.
arXiv·2026-10-18·Madhab Chandra Das et al.
No generated summary available for this entry.
overview
Original abstract
Quantum Key Distribution (QKD) supports secure key establishment under ideal protocol assumptions, but practical systems remain exposed to implementation-level attacks against optical channels, detectors, and controller behavior. This study presents Quantum Forensic Log (QF-LOG), a simulation-based forensic framework for analyzing aggregated QKD operational logs rather than raw quantum states. QF-LOG uses four observable features: quantum bit error rate (QBER), photon count, latency in milliseconds, and abort flag. The framework classifies normal operation and three simulated attack-related conditions: partial intercept-resend, detector-blind, and fiber-tap. A physics-inspired Generator-A dataset with 5 million balanced records was constructed using explicit mathematical generation models for all four features. A transparent threshold baseline, logistic regression, random forest, and XGBoost were evaluated on Generator-A. The full-feature learning models achieved macro F1-scores from 0.8211 to 0.8243 and outperformed the transparent two-feature comparator. Feature diagnostics showed that QBER contributed most, followed by latency in milliseconds and photon count, while no single feature reproduced the full feature set performance. Robustness was assessed on a separately generated Generator-B dataset of 5 million records that uses the same governing equations under shifted simulated operating parameters. Without retraining or tuning, their macro F1-scores decreased to values from 0.5645 to 0.5669. These findings show that QF-LOG can support interpretable forensic classification in a controlled synthetic setting, but stable internal evaluation does not establish reliability under changed simulated QKD operating conditions. The framework provides a documented basis for future evaluation across broader simulated settings and hardware-generated QKD logs.
arXiv·2026-10-18·Lin Zhang
No generated summary available for this entry.
overview
Original abstract
Inner products of random matrices and random quantum states---such as orbital inner products, expectation values, overlaps, and cyclic Bargmann invariants---are shown to follow from two underlying mechanisms: the diagonal of an induced random state is Dirichlet distributed, and the expectation value of a random pure state in a rank-one or two-by-two operator is a numerical shadow on an elliptical disk. For states induced by an environment of dimension $K$, the expectation value of any observable is a Curry--Schoenberg spline with each eigenvalue repeated $K$ times, and the vector of moments has an explicit density on a simplex; for a qutrit, the variance law is obtained in finite form. The overlap of two random qubit states attains its mode at its mean for every rotation-invariant ensemble, but for Hilbert--Schmidt qutrits the density at the mean has a strictly negative derivative, so mode and mean separate; for large environments, the centred overlap converges to a variance-gamma law rather than a Gaussian. For two noncommuting qubit observables, the joint law of the two standard deviations is derived for all $K$, and the probability of coming within a small distance of the optimal sum of variances scales as a power of that distance, with a different exponent when the Bloch axes are orthogonal. For three Haar-random qubit states, the exact density of the Bargmann invariant is given in terms of a complete elliptic integral, together with its local behaviour and elementary marginals. In every dimension, the probability that its real part is negative---certifying basis-independent coherence---is computed, along with all mixed moments. For cycles of arbitrary length, the invariant is shown to be driven by an exact three-parameter Markov chain, and the logarithm of its modulus obeys a law of large numbers and a central limit theorem.
arXiv·2026-10-18·Michael R. R. Good
No generated summary available for this entry.
overview
Original abstract
We obtain an exact closed-form total photon count for a prescribed Newtonian Kepler parabola, with a fully relativistic treatment of its radiation. We also obtain closed expressions for the angularly resolved photon spectrum and elementary expressions for the total radiated energy and momenta. The count is finite, scale-independent, and analytic in subluminal speed at closest approach. At large maximum rapidity $η$, $N\sim(7α/\sqrt6)η$, while $E\propto e^{3η}$ at fixed passage timescale: the radiation chiefly hardens. For slow motion at fixed coupling and closest distance, a nearby ellipse emits fewer photons but more energy and angular momentum per orbit. The hyperbolic photon count remains IR divergent arbitrarily close to threshold, while the count at the exact parabolic threshold is finite.
arXiv·2026-10-18·Ara Sedrakyan
No generated summary available for this entry.
overview
Original abstract
We investigate how structural correlations beyond the power spectrum affect phonon counting in a one-dimensional acoustic stack. An integer-thickness construction cancels the extensive leading backscattering term and leaves a finite-chain reflection amplitude determined by endpoint innovations. For symmetric independent innovations with unit variance and fourth moment $μ_4$, the normalized reflected-power second moment tends to $(μ_4+5)/4$. With vacuum environmental inputs, a two-phonon Fock input therefore gives an ensemble-averaged reflected factorial correlation $g^{(2)}=(μ_4+5)/8$. Two explicitly constructed ensembles with identical mean and complete two-point correlation function yield $g^{(2)}=3/4$ and $9/8$, placing their counting variances on opposite sides of the Poisson value. Conditional tensor averaging also gives a general fourth-order resistance-growth coefficient for arbitrary impedance contrast, including a positive higher-scattering contribution not recovered by shifting the lowest-order spectrum. Exact enumeration confirms the fixed-$N$, small-detuning limit and shows that increasing $N$ at fixed detuning produces a crossover governed by accumulated higher-order bulk scattering rather than convergence to the endpoint formula. Further calculations test bandwidth, thickness error, propagation loss and thermal background. The result concerns disorder-averaged pulse statistics; it neither creates nonclassicality from coherent input nor changes the conditional factorial correlation of an individually resolved passive sample.
arXiv·2026-10-18·Michael Blondin et al.
No generated summary available for this entry.
overview
Original abstract
Reliable quantum computation requires methods for verifying quantum circuits. Level-synchronized tree automata (LSTAs) were recently introduced to represent sets of quantum states for this purpose. We study LSTAs along two axes relevant to verification: the complexity of their decision problems and the size of their representations under circuit operations. We prove that acyclic LSTAs have NP-complete nonemptiness and $Π_2^P$-complete language inclusion, and that general language inclusion is EXPSPACE-complete. We further prove inherent quadratic representation growth under individual quantum gates in a fixed qubit order, and give an adjacent-qubit reordering construction that preserves level synchronization. These results clarify the scope of applicability of the automata-theoretic toolbox for quantum circuit verification.
arXiv·2026-10-18·Jing-Song Huang, Yongzhi Luan, Yinuo Xue
No generated summary available for this entry.
overview
Original abstract
We characterize the hybrid Fourier transform on the Schwartz--Grassmann space $\caS(\bbR^m)\otimesΛ_{2n}$ by operator intertwining relations. Using the bosonic oscillator Howe decomposition and the fermionic Lefschetz decomposition, we describe the action of the hybrid Fourier transform on both tensor factors. We show that first-order covariance with respect to coordinate multiplication and differentiation determines the transform up to a scalar. For $m,n\ge1$, we prove that covariance under all even quadratic operators, together with any one nonzero mixed quadratic operator, determines the linear span of the hybrid Fourier transform and its inverse. This rigidity result is obtained by computing the ordinary commutants of the even and full quadratic oscillator actions of $\fosp(4n|2m)$. After a degree-scaling change of normalization, we make the hybrid Fourier transform unitary with respect to the occupation number inner product, and factor it into a bosonic oscillator rotation and (up to a scalar phase) an $SU(2)$ rotation in the fermionic Lefschetz representation. For $m=1$ and $n\ge2$, we show that full even quadratic covariance together with the parity-preserving cubic relation for $qQ_f$ determines the unitary transform up to a global phase and a fermion-parity phase. Finally we calculate the unitary conjugation formulas for Hubbard--Holstein Hamiltonian for a hybrid continuous-variable and discrete-variable quantum system.
arXiv·2026-10-18·Jia-Hao Wen, Wen-Hao Bian, Jing Wang
No generated summary available for this entry.
overview
Original abstract
Two-dimensional quadratic band crossing point (QBCP) semimetals serve as a fertile platform for interaction-driven quantum criticality, nevertheless, the role of the complete fermion-fermion interactions remains largely unexplored. To address this, we systematically investigate the low-energy physics of a spin-1/2 checkerboard-lattice QBCP semimetal by considering all 16 marginally short-range fermion-fermion interactions. Using the momentum-shell renormalization group, we derive the coupled flow equations, which reveal that the low-energy physics is governed by a series of fixed points. Depending on the initial conditions, the system may exhibit a single stable fixed point, several discrete fixed points, or three continuous groups of fixed points parameterized by a few variables. By introducing source terms and evaluating susceptibilities, we identify the dominant and subdominant instabilities. The leading phases include nematic spin-nematic (NSN), quantum anomalous Hall (QAH), chiral superconducting ($\mathrm{SC}_1$), and quantum spin Hall (QSH) orders. Moreover, several features distinguish our findings from previous simplified models. Off-diagonal interactions generate terms that promote orders absent in such models, the continuous groups allow systematic tuning of the leading instability, and trajectory-dependent instabilities emerge where the full RG flow, rather than the fixed point alone, determines the dominant state. These results offer a comprehensive theoretical understanding of low-energy quantum critical behaviors and phase instabilities in two-dimensional QBCP semimetals and related electron systems.
arXiv·2026-10-18·Wen-hao Wang et al.
No generated summary available for this entry.
overview
Original abstract
Reconfigurable neutral-atom processors require rapid, high-fidelity transport of atoms between optical-tweezer sites. In finite-depth Gaussian traps, fast motion can leave residual motional excitation even when the atom reaches its destination. We develop a basis-parameterized gradient-ascent pulse-engineering (GRAPE) framework for one-dimensional transport of a single $^{87}$Rb atom. A shortcut-to-adiabaticity reference is refined using 17 trajectory parameters, with ten additional parameters providing bounded trap-depth modulation; depth affects both confinement and the inverse construction of the physical trap center. For a $12.6\,μ$m transfer completed in only $30.5\,μ$s, corresponding to approximately $2.75$ periods of the reference trap, the selected joint protocol achieves a ground-state infidelity of $2.41\times10^{-7}$. Because preparing an exactly pure motional ground state is experimentally challenging, we also optimize population-weighted transport for initial distributions with mean vibrational occupations $\nbar\simeq0.16$ and $1.87$, reaching same-state probabilities of about $0.99993$ and $0.9934$. Trap-depth fluctuations can further degrade transport fidelity. Robust optimization under a measurement-informed depth-noise model improves the mean error, worst sampled error, and fidelity dispersion for the specified noise realizations. Coordinated control of tweezer position and confinement thus offers a route to rapid transport with low residual excitation for flexible atom rearrangement and dynamic connectivity in neutral-atom processors.
arXiv·2026-10-18·Cheng Sheng et al.
No generated summary available for this entry.
overview
Original abstract
Controlling quantum hardware requires choosing and revising experimental strategies as nonlinear response, coupling, and drift limit calibration. We experimentally investigate a general-purpose large language model (LLM) as a human-in-the-loop strategy layer for a neutral-atom tweezer platform. Through step-by-step interaction with experimental feedback, the LLM guides a transition from multiplicative row--column correction to a drift-corrected local response-matrix method when separable feedback stalls. Deterministic software performs image analysis and numerical updates, while an experimentalist verifies and authorizes each waveform. For a $10\times10$ crossed-acousto-optic-deflector array, this workflow reduces the Gaussian-peak coefficient of variation from $20.30\%$ to $1.57\%$ in 30 candidate-update rounds. The experiment demonstrates feedback-informed strategy selection on a physical quantum-control subsystem, rather than direct generation of control parameters alone. These results highlight the potential of LLMs to guide control optimization across diverse quantum platforms by adaptively formulating and refining experimental strategies.
arXiv·2026-10-18·X. Z. Zhang, X. F. ZHang, M. W. Liu
No generated summary available for this entry.
overview
Original abstract
Bound states in the continuum (BICs) remain localized despite the presence of extended modes at the same energy. In driven systems with long-range couplings, the absence of radiation does not by itself determine how a bound state decays in space. We study a Hermitian Rydberg spin waveguide coupled to a four-site plaquette, where a winding drive phase combines rotation with time translation to forbid propagating guide channels in one symmetry sector. The resulting eigenstate remains embedded in the continuum of other sectors and carries an inverse-cube waveguide amplitude, with coherent contributions from direct plaquette--guide coupling and long-range guide propagation. Pair-state calculations determine the microscopic couplings in the axial geometry, while coherent Floquet mixing sets the weight of the dominant circulating plaquette mode. The bound state thus retains the spatial signature of the long-range coupling even when radiation is forbidden.
arXiv·2026-10-18·Jinlei Li et al.
No generated summary available for this entry.
overview
Original abstract
Optical initialization and readout of molecular electron spins in water remains challenging for 3d transition-metal complexes. Their Laporte-forbidden d-d transitions yield weak transition dipole moments, so optical spin detection in aqueous Cu(II) previously required ~1 M concentrations. Here we overcome this constraint through symmetry-breaking chelation. Coordinating Cu(II) with EDTA imposes a non-centrosymmetric ligand field with enhanced metal-ligand covalency, relaxing Laporte restrictions and amplifying d-d transition dipole moments. This design enhances absorption and magnetic circular dichroism by 7.3- and 5.6-fold, enabling ultrafast spin readout down to 100 μM with an apparent dephasing time T2^*~0.54 ns. As a proof-of-concept for selective molecular-spin sensing, histidine addition extends T_2^* to ~0.8 ns in a concentration-dependent manner, whereas glycine produces no measurable effect. These results show that symmetry breaking provides a strategy to create molecular spin-photon interfaces, opening avenues toward all-optical, analyte-responsive quantum sensing in water.
Quantum Computing Report·2026-10-17·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Researchers at RIKEN and collaborators have achieved high-fidelity simultaneous control of five silicon spin qubits, maintaining over 99.9% accuracy. They overcame crosstalk caused by AC-Stark shifts through a new calibration protocol, enabling the use of a single microwave control line. This breakthrough meets the fault-tolerant threshold for quantum error correction and paves the way for more scalable quantum computers. The post RIKEN Demonstrates High-Fidelity Simultaneous Control of Silicon Spin Qubits Above 99.9% Threshold appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-17·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
A joint study by Chalmers Next Labs AB, ConScience AB, and Singapore’s National Quantum Federated Foundry (NQFF) validated the stability of a superconducting quantum processor (QiB1) when transported between international research facilities. The study, conducted under the WACQT–NQFF Twin Testbed initiative, confirmed that environmental changes between Gothenburg and Singapore did not degrade the processor’s performance. This collaboration is now being commercialized as a standardized cross-facility measurement service. The post Chalmers Next Labs, ConScience, and NQFF Validate Superconducting Qubit Chip Stability Across International Testbeds appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-17·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Kipu Quantum demonstrated a novel method for molecular toxicity classification using analog quantum feature extraction on QuEra's 256-qubit Aquila neutral-atom quantum processor. This approach, detailed in their technical report, utilizes 200-qubit neutral-atom arrays to generate high-dimensional quantum features. These quantum features significantly improved performance over classical methods, particularly on imbalanced datasets, doubling the F1-score and raising balanced accuracy for drug discovery and chemical safety. The post Kipu Quantum Demonstrates Neutral-Atom Quantum Feature Extraction for Molecular Toxicity Classification on QuEra Hardware appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-17·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
MIT researchers used a specialized self-attention neural network to solve complex equations related to quantum particles, confirming the existence of anti-Pfaffian topological states. This breakthrough provides a roadmap for building noise-resistant topological qubits in materials like monolayer WSe2 and semiconductor quantum wells. The post MIT Physicists Use First-Principles AI to Resolve Non-Abelian Anyon Order at Strong Landau Level Mixing appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-17·Resonance
No generated summary available for this entry.
overview
Original abstract
Guest Post By George Varghese, Head of Investment, 0G Labs We’re witnessing one of the largest infrastructure investment cycles in modern technology, and I believe we’re still early in understanding its economic potential. AI has already changed how companies think about computing, with enormous investment flowing into GPUs, data centres, energy infrastructure and models. As AI expands across industries, computational demand has room to grow. Quantum computing could add another dimension to that growth. Hardware and error-correction progress is accelerating research, and I see enormous potential in combining quantum capabilities with today’s AI systems. The opportunity extends across hardware, software and connecting infrastructure. The investment case for AI infrastructure remains strong. Enterprises are incorporating AI into core processes, while reasoning models, multimodal systems and autonomous agents are widening the range of applications worth deploying. Each advance brings new requirements for computing, networking, storage and power. More efficient models can lower the cost of individual tasks, making additional applications commercially viable and potentially expanding overall demand. I expect sustained investment across computing. Still, investors need to understand the economics of individual assets. A data centre can operate for decades while the chips inside it undergo several replacement cycles. Changes in hardware performance, software efficiency and utilisation affect returns, even when aggregate demand continues growing. That is why I pay close attention to infrastructure that can accommodate changing computational requirements without excessive reinvestment. I’m particularly optimistic about quantum computing’s potential in fields where computational complexity currently limits progress. Molecular simulation, materials science and certain optimization problems are promising areas, although the practical advantag
The Quantum Insider·2026-10-17·Yuval Boger
No generated summary available for this entry.
overview
Original abstract
Yuval interviews Robert Wille, a computer scientist and co-founder focused on quantum computing software. They discuss the field’s transition from research to practical deployment, the need for heterogeneous and hardware-agnostic software stacks, and the integration of quantum into HPC environments. Robert explains the importance of design automation, open-source strategy, and AI-assisted development, arguing that quantum’s complex optimization challenges resemble those long solved in classical computing. Transcript Yuval: Hello Robert and thank you for joining me today. Robert: Hello Yuval, happy to be here. Yuval: So who are you and what do you do? Robert: Yeah, I’m Robert, I’m a computer scientist by training and for more than 15 years now actually involved in quantum computing. We are building software for quantum computing, which is important because it is awesome to have great quantum computing hardware and have great quantum computing applications, but you definitely need software to connect the end users to the hardware and to make these applications work. Yuval: I think you have at least two hats, right? One is an academic and the other is an entrepreneur. Could you tell us a little bit about that, please? Robert: Absolutely. By heart, I’m an academic and a researcher. I work at the Technical University of Munich and at the same time we also figured out it is great to do innovation at the university, in an academic setting, but for real impact we also need production-ready software and this cannot really be done at the university environment anymore. That’s why a little bit more than a year ago we also founded a company, and there we now take all the innovation from the academic developments and make it production-ready in a commercial context. Yuval: Since you’ve been doing it for so long, software in the context of quantum, where are we today? What is the state of quantum software tod
Quantum Computing Report·2026-10-17·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Open Quantum has launched a native Qrisp integration, enabling high-level QPU execution across IonQ, Rigetti, IQM, and AQT hardware. This allows developers to compile and execute Qrisp programs directly on physical QPUs without writing vendor-specific gate-level code. The integration simplifies quantum programming by providing software-engineering abstractions, automated qubit allocation, and memory management. The post Open Quantum Launches Native Qrisp Integration for High-Level QPU Execution Across IonQ, Rigetti, IQM, and AQT Hardware appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-17·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Researchers from Harvard, Anthropic, and QuEra Computing developed an AI framework that uses Large Language Models (LLMs) to discover and optimize fault-tolerant quantum circuits. This framework significantly reduces the resource costs of core computational primitives, achieving up to 9,100x lower costs compared to hand-crafted baselines. The LLMs achieved this by proposing complete Python programs for circuits, which were then evaluated and refined through an evolutionary process, leading to the discovery of new co-design principles and circuit architectures. The post Harvard, Anthropic, and QuEra Use LLMs to Discover Quantum Circuits with Up to 9,100x Lower Resource Costs appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-17·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
D-Wave has successfully demonstrated 3D analog-digital quantum simulation of higher-order topological insulators using up to 728 qubits on an Advantage2 superconducting quantum annealing processor. This achievement, detailed in a research study on arXiv, involved new analog-digital quantum control protocols to measure localized boundary modes and extract 3D bulk topological invariants. This breakthrough confirms the utility of analog-digital quantum annealing hardware as a programmable simulator for condensed matter physics and topological materials. The post D-Wave Demonstrates 3D Analog-Digital Quantum Simulation of Higher-Order Topological Insulators Using 728 Qubits appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-17·Doug Finke
No generated summary available for this entry.
overview
Original abstract
Johannes Pollanen, co-founder of EeroQ and a professor of physics at Michigan State University, explains how EeroQ builds qubits from single electrons floating on a film of superfluid helium, and why he thinks the semiconductor chip is the only proven way to scale a quantum computer. The post Podcast with Johannes Pollanen, Co-founder of EeroQ and a Professor of Physics at Michigan State University appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-17·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Manipal Institute of Technology (MIT Bengaluru) has inaugurated the Manipal House of Quantum (Q-HUB@MAHE) in Bengaluru, India, on October 13, 2026. This facility features QuantrolOx’s VIDYAQAR open-architecture quantum system, a 25-qubit-capable dilution refrigeration platform that is part of a national roadmap to scale to over 1,000 qubits. The initiative aims to train 100 quantum engineers by December 2026 and allows researchers to test and benchmark quantum components using custom Python workflows. The post MIT Bengaluru Inaugurates Q-HUB@MAHE and Deploys QuantrolOx’s Open-Architecture VIDYAQAR Quantum System appeared first on Quantum Computing Report .
Phys.org Quantum Physics·2026-10-17
No generated summary available for this entry.
overview
Original abstract
Qubits, the quantum equivalent of digital bits, are fragile and prone to errors. That makes building reliable quantum computers extremely difficult. One fix has been to use traditional magic state distillation, which filters out flaws, but it is extremely resource-intensive.
The Quantum Insider·2026-10-17·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Anthropic and Harvard researchers used Claude to design more efficient quantum circuits across eight tasks, reducing estimated computing resources for key routines used in quantum algorithms. One redesigned decoding circuit used roughly 12 times fewer costly quantum operations, while a new arithmetic design offered improved trade-offs between gate counts and qubit requirements. The results were evaluated through computational checks and resource estimates rather than demonstrations on quantum hardware, and practical benefits will depend on integration into complete algorithms and machines. A team of researchers from Anthropic and Harvard used an artificial intelligence (AI) system to design quantum circuits that require fewer operations and qubits, potentially lowering the hardware demands of useful quantum computing. The researchers, who posted their work on the preprint server arXiv, tested the approach on eight computational building blocks used in chemistry, optimization, physics simulation and number theory. Seven of those designs reduced both the number of costly quantum operations and the number of qubits compared with the study’s baselines. The eighth produced a new approach to arithmetic that offers better choices between computing time and memory. The results concern circuit designs and resource estimates, rather than calculations demonstrated on a working quantum computer. The team nevertheless addressed a central problem for the industry that, in order for quantum computers to become more useful quantum, algorithms will need to improve computing alongside the development larger, more reliable machines. According to the study, one redesigned decoding circuit required about 440,000 Toffoli gates, down from 5.1 million in the comparison design, while reducing its peak qubit requirement from 1,938 to 1,837. Toffoli gates are operations that are particularly costly in many proposed error-corrected quantum computers, making their number a useful
Nature: Quantum Information·2026-10-17
No generated summary available for this entry.
overview
Quantum Computing Report·2026-10-17·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
A new review paper by Hoong Chuin Lau examines the intersection of AI and quantum computing for combinatorial optimization, categorizing research into three paradigms: AI-for-Quantum Optimization (AI-for-QO), Quantum-for-AI (Q-for-AI), and AI-Quantum Co-Optimization. The study, which analyzed 119 papers, concludes that AI-assisted quantum optimization shows promise, while quantum-assisted AI models are largely unproven. The review emphasizes that scaling quantum optimization is a systems engineering problem requiring selective quantum use, with only a few studies isolating quantum contributions or establishing classical baselines. The post Review Evaluates AI and Quantum Computing Paradigms for Adaptive Combinatorial Optimization appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-17·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
The European Quantum Industry Consortium (QuIC) has published a position paper urging the European Commission to harmonize EU dual-use controls on quantum technologies. They warn that fragmented national implementations of export controls on quantum technologies are causing administrative difficulties, shipment delays, and revenue loss for European quantum companies. QuIC proposes reforms focusing on single market harmonization, expanded allied trade, clearer rules for intangible transfers and cloud access, and differentiated scrutiny for supply chain components to ensure European competitiveness. The post QuIC Publishes Position Paper Calling for Harmonized EU Dual-Use Controls on Quantum Technologies appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-17·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Physicists at the University of Oxford have developed a quantum network using different atomic elements, strontium and calcium, to create entangled states. They successfully generated up to 4-qubit Greenberger-Horne-Zeilinger (GHZ) states and stored this entanglement in calcium memory qubits for over 10 seconds. This significantly extends entanglement lifetimes, marking a major step forward for distributed quantum computing and sensing. The post University of Oxford Entangles Multi-Species Atom Network and Extends Memory Storage Beyond 10 Seconds appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-17·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Kipu Quantum and NTT DATA have partnered to advance enterprise quantum computing and QML solutions. The collaboration will integrate quantum algorithms into existing enterprise technology, leveraging Kipu Quantum's expertise in hardware-specific compression techniques. This partnership, which began with a pilot program at Komatsu Peru, aims to develop and deploy commercial algorithms for various applications, including supply chain logistics and financial risk modeling, initially in Latin America and then globally. The post Kipu Quantum and NTT DATA Partner to Scale Enterprise Quantum Computing and QML Applications appeared first on Quantum Computing Report .
arXiv·2026-10-17·Jerome Nicolas, Albert Schwarz
No generated summary available for this entry.
overview
Original abstract
We argue that the experimental measurement of the lifetime and decay law of metastable helium is a promising way to find a deviation from quantum mechanics. We analyze the decay of the metastable state for a quartic deformation of quantum mechanics. We find that the absolute change of the mean lifetime can be significant even if the modification is small. We show that, in the Wigner--Weisskopf approximation, the deviation from the exponential law in the modified theory can occur on time scales comparable with the lifetime.
arXiv·2026-10-17·L. Anjos et al.
No generated summary available for this entry.
overview
Original abstract
We analytically characterize how the location and the local or correlated structure of stochastic Pauli errors affect a three-qubit coherent quantum-teleportation circuit. Independent local channels and a fully correlated two-qubit channel are inserted separately in six configurations. Propagating each Pauli-error realization through the Clifford circuit yields the effective channel on Bob's qubit and analytical expressions for the average and state-resolved fidelities. Under a common ordered-pair probability convention, the six configurations form three pairs that induce equivalent reduced channels on Bob. Within each pair, corresponding Pauli-error realizations have the same probabilities and produce the same effective Pauli operator on Bob's output state. The equivalence therefore holds for every input state within the stochastic Pauli models considered here, rather than only for the average fidelity. Correlated Z errors do not affect the output for the first pair; local X and Z errors exhibit complementary qubit sensitivity for the second; and correlated same-axis Pauli errors cancel for the third. These results classify the error response of the selected circuit configurations and show that it depends jointly on the error statistics, Pauli axis, and position within the protocol.
arXiv·2026-10-17·Stephen J. DeVience et al.
No generated summary available for this entry.
overview
Original abstract
Nitrogen vacancy centers in diamond (NVs) are point defects well suited to quantum sensing of magnetic fields. NV spin states can be initialized and read out optically with high spatial resolution, enabling detection of pL-scale volumes of nuclear spins. Using Coherently Averaged Synchronized Readout (CASR), standard NMR spectroscopy techniques such as free decay, spin echo, and PGSE have been performed with Hz-scale spectral resolution using NV-diamond sensors. However, using NV detection for conventional high-resolution NMR at multi-tesla fields is challenging due to the need to manipulate NV electronic spins at resonance frequencies 100 GHz or higher. Low-field J-coupling spectroscopy provides an alternative path to chemical resolution in a regime more easily accessible to NVs. Here, we demonstrate homonuclear and heteronuclear J-coupling spectroscopy using an NV-NMR spectrometer based on permanent magnets operating at $\sim$890 kHz proton Larmor frequency (bias magnetic field $\sim$21 mT). This field strength enables chemical characterization based on J-coupling using sequences such as Synchronized Echo (SyncE) and Spin-Echo Double Resonance (SEDOR), which do not require the strong chemical shift dispersion and pristine field homogeneity of high-field NMR. The frequency range is easily detected by NVs using standard XY dynamical decoupling sequences and is well-suited for applying Overhauser DNP, which can boost proton signal by two orders of magnitude. We acquire initial NV-NMR measurements of T$_1$, T$_2$, and Overhauser DNP in glycerol before advancing to SEDOR spectroscopy of methanol-$^{13}$C and a methanol-$^{13}$C/acetonitrile-2-$^{13}$C mixture at sample volumes $\sim$50 pL, in which we demonstrate measurement of $^1J_\text{CH}$ couplings and resolution between species. We also acquire a homonuclear J-coupling spectrum of a natural-abundance propylene carbonate sample.
arXiv·2026-10-17·Sadhvikas Addamane et al.
No generated summary available for this entry.
overview
Original abstract
Semiconductor quantum dots (QDs) are essential components for integrated photonic and quantum information systems, yet current epitaxial growth techniques face significant limitations in complexity of growth, material selection, and density tunability. Here we report a displacement etch technique that enables controlled formation of GaAsSb QDs with emission at telecommunications wavelengths. Our approach uses arsenic molecular flux (As$_2$) to react with antimonide surfaces through thermodynamically favorable displacement reactions, creating three-dimensional quantum confined nanostructures without requiring strain-driven growth or complex droplet-based processes. Density functional theory shows the two competing As-for-Sb exchange pathways to be nearly equivalent in both reaction energy and activation barrier, which places morphological control in the subsequent adatom kinetics rather than in the surface reaction itself. A single process parameter, the As$_2$ exposure, sets the QD areal density across three orders of magnitude, from 10$^2$ to 10$^5$ $μm^{-2}$, covering both isolated emitters and dense gain media. Structural analysis reveals well-defined GaAsSb QDs with a mixed GaAs/GaSb composition and no extended defects. Temperature-dependent photoluminescence measurements confirm emission at 1550 nm (0.8 eV) within the telecommunications C-band, with characteristic QD-like temperature dependence. Because the QDs form on a lattice-matched GaSb surface in a single growth step, the technique offers a practical route to C-band emitters built into the GaSb/AlGaSb device family already used for mid-infrared sources and detectors.
arXiv·2026-10-17·Diksha Thapliyal, Ajay Wasan
No generated summary available for this entry.
overview
Original abstract
We study an adiabatic controlled-$Z$ (CZ) gate for neutral atoms in which dipole-dipole coupling between nearly degenerate Rydberg pair states enhances the interaction between dressed ground states. This coupling produces an avoided crossing in the two-atom dressed-state spectrum. Approaching the crossing enhances the dressed interaction, but also reduces the dressed-state gap and increases the Rydberg admixture. We identify a Förster-enhanced operating range in which the required conditional phase is accumulated with adiabatic return and small transient Rydberg population. We then analyze the finite-time dynamics of the two-qubit computational states under a smooth pulse. Reducing the dressing strength weakens the dressed interaction, so maintaining the target phase at the same pulse duration requires operation closer to the avoided crossing, where the Rydberg admixture increases. This dependence is then used to select the shortest gate at a fixed peak Rabi frequency in the Förster-enhanced operating range that accumulates the CZ phase with high Bell-state fidelity while keeping the Rydberg population small. Changing the Förster defect shifts the avoided crossing, while the gate parameters change only weakly. For a specific rubidium Förster channel, the selected gate corresponds to experimentally relevant laser coupling, pulse duration, and interatomic separation. We also estimate errors from the finite Rydberg lifetime and from weak excitation of a neighboring spectator atom. For the parameters considered, the spectator-induced error remains below the finite-lifetime contribution.
arXiv·2026-10-17·Dmytro Gavinsky
No generated summary available for this entry.
overview
Original abstract
We exhibit a bipartite language with a poly-logarithmic quantum communication protocol and polynomial Merlin-Arthur communication complexity.
arXiv·2026-10-17·Chenyang Wang et al.
No generated summary available for this entry.
overview
Original abstract
Mixed-state quantum geometry plays a fundamental role in quantum metrology, multiparameter estimation, and the characterization of quantum many-body systems. Yet, unlike its pure-state counterpart, accessing mixed-state geometry requires solving an ill-conditioned Lyapunov equation for the symmetric logarithmic derivative (SLD), posing a major challenge for resource-efficient quantum computation. Here we address the challenge and develop a novel quantum algorithmic framework for efficiently accessing the quantum Fisher information matrix (QFIM) and quantum geometric tensor (QGT) of mixed states. Our key insight is to uncover a previously unexplored connection between the positive semidefinite structure of density matrices and exponentially convergent Gauss-Laguerre quadrature, enabling an efficient integral-based construction of the SLD. A rigorous complexity analysis further establishes the resource efficiency of our algorithm, demonstrating logarithmic precision dependence and double-logarithmic ancillary-qubit overhead at fixed conditioning. Building on this construction, we achieve near-Heisenberg precision scaling for diagonal QFI estimation without quantum phase estimation and construct unified block encodings of the full QFIM and QGT under a bounded spectral-gap assumption. A complementary regularized algorithm extends efficient diagonal estimation to exponentially small spectral gaps under a bounded-response condition. Our results establish a resource-efficient route to coherent mixed-state quantum geometry, enabling its direct integration into quantum linear-algebra algorithms without classical reconstruction and opening new possibilities for quantum-enhanced multiparameter metrology.
arXiv·2026-10-17·G. D. de Moraes Neto, Richard Q. Matos, Norton G. de Almeida
No generated summary available for this entry.
overview
Original abstract
Collective coupling to the Minkowski vacuum allows uniformly accelerated quantum detectors to exhibit a strong quantum Mpemba effect, in which a state initially farther from equilibrium relaxes faster than a closer one. We establish the existence of this effect for every fixed finite number of detectors $N\geq 2$ at sufficiently small transverse separation within the pointlike secular master equation. The mechanism originates from two reflection sectors whose populations are conserved by the leading collective dynamics. Weak intersector transfer at finite separation generates an isolated, parametrically slow relaxation mode. A simple family of initial states permits its leading-order cancellation by matching the equilibrium sector populations, while a corrected preparation eliminates the slow-mode amplitude exactly. We construct a reference state that establishes a genuine reversal of trace-distance ordering. Numerical calculations and local-rate-preserving controls identify the collective origin of the effect, while spatially smeared detector calculations support its persistence within the second-order secular framework. The same mechanism extends to detectors coupled to a common thermal field, with analytically distinct slow relaxation rates. Thus, strong Mpemba relaxation is not exclusive to acceleration but emerges from a more general interplay between collective dissipation, reflection-sector conservation, and weak symmetry-breaking transfer.
arXiv·2026-10-17·Lars Emmrich, Michael Potthoff
No generated summary available for this entry.
overview
Original abstract
The geometry of momentum-space Hamiltonian maps derived from the zero-frequency single-particle Green's function provides a route to a refined topological characterization of quantum systems beyond the noninteracting clean limit. The central idea is to complement standard topological invariants by invariants that characterize the geometry of the map itself. As a paradigmatic example, we study the one-dimensional chiral Su-Schrieffer-Heeger model with disorder, where the topological Hamiltonian defines a planar Bloch loop. In addition to its conventional winding number, this loop possesses an integer turning number that characterizes the winding of its tangent vector. We identify turning-number transitions that occur while the topological Hamiltonian remains finite and spectrally gapped, driven solely by a vanishing tangent vector of the Bloch loop, and obtain an extended phase diagram with additional topological structure beyond the winding-number classification. Asymptotic analysis predicts the emergence and disorder dependence of the corresponding transition regime, in agreement with the numerical results. Our findings establish the geometry of momentum-space Hamiltonian maps as an additional source of topological structure beyond conventional classifications.
arXiv·2026-10-17·Soomin Oh et al.
No generated summary available for this entry.
overview
Original abstract
Fractional Chern insulators bring the fractional quantum Hall effect, with its anyonic excitations, to zero magnetic field. So far they have been realized in moiré materials, where the long superlattice period weakens electronic interactions and confines these phases to cryogenic temperatures. Early proposals instead envisioned topological flat bands on atomic-scale lattices, where fractionalization could persist to far higher temperatures, but a suitable material has been lacking. Here we theoretically identify monolayers of the recently synthesized van der Waals kagome family $\mathrm{A}_2\mathrm{T}_3\mathrm{X}_4$ as such a platform, combining intrinsic topological flat bands and strong Coulomb interactions with gate-tunable carrier density and layer assembly. Exact diagonalization of models derived from density functional theory reveals ferromagnetism over broad filling ranges, supporting diverse fractional Chern insulators, anomalous composite Fermi liquids, and charge-ordered phases. In particular, in $\mathrm{Cs}_2\mathrm{Pd}_3\mathrm{S}_4$, the fractional Chern insulator exhibits a many-body gap of approximately 26 meV in the largest system accessible with band mixing allowing at most one interband electron-hole excitation. Layer assembly further provides a natural route to fractional quantum spin Hall insulators: bilayers with antiparallel magnetizations support this phase at realistic separations. These results identify an experimentally accessible material family in which chemical composition, carrier density, and stacking offer complementary routes to fractionalization at enhanced energy scales and control over topological order.
arXiv·2026-10-17·Takuma Kuno et al.
No generated summary available for this entry.
overview
Original abstract
Exchange-based two-qubit gates in semiconductor spin qubits are sensitive to low-frequency detuning noise and control errors. Here, we extend concatenated continuous driving (CCD), implemented by phase modulation of a global microwave drive, to exchange-based SWAP and $\sqrt{\mathrm{SWAP}}$ operations between double-dressed spin qubits and investigate its effectiveness for protecting two-qubit gates. We find that CCD retains strong protection against quasistatic common-mode detuning errors while substantially improving robustness against Rabi-frequency errors and qubit-to-qubit Rabi-frequency mismatch compared with conventional continuous dressing. By contrast, the gate fidelity is impacted by differential detuning errors. By modeling partially correlated quasistatic detuning noise, we further show that the noise-averaged gate fidelity depends strongly on the spatial correlation of the qubit-frequency fluctuations, with positive correlations enhancing CCD protection by suppressing the differential-noise component. These results identify the symmetry and spatial correlation of qubit-frequency noise as key factors governing continuous-drive protection in coupled spin-qubit systems.
arXiv·2026-10-17·Xing-Xing Hu et al.
No generated summary available for this entry.
overview
Original abstract
Understanding the generation and activation of ergotropy, the maximum work extractable by cyclic unitary operations, is central to quantum battery research. Positive-temperature thermal states are passive, whereas nonequilibrium environments can sustain nonpassive steady states with nonzero ergotropy. However, the full secular approximation commonly used in Lindblad descriptions can suppress steady-state coherence and obscure its contribution to ergotropy. Using a Bloch-Redfield master equation beyond the full secular approximation, we investigate the ergotropy of the nonequilibrium steady state (NESS) of two exchange-coupled qubits connected to independent thermal reservoirs. The NESS ergotropy of two qubits with the same frequency is entirely coherent and grows quadratically with temperature bias near equilibrium. In contrast, detuned qubits can exhibit incoherent ergotropy. We derive an exact analytical criterion for its activation and show that activation requires the hotter reservoir to be coupled to the qubit with the higher bare frequency. Comparing NESSs obtained with and without full secularization reveals quantitative and qualitative differences in ergotropy that reflect changes in both its coherent and incoherent contributions. The results clarify the mechanisms of NESS ergotropy activation and demonstrate the importance of retaining steady-state coherence beyond the full secular approximation when characterizing stationary work resources.
arXiv·2026-10-17·Julius A. Zeiss
No generated summary available for this entry.
overview
Original abstract
We revisit the feasibility and convergence claims for the polarization hierarchy of Plávala, Ligthart and Gross [Linear Algebra Appl.\ 723 (2025) 15--32]. Counterexamples show that the stated assumption is insufficient for the feasibility characterization and for convergence of the hierarchy with the polarization constraint. We establish corrected results under a stronger algebraic condition and supply a missing compactness argument.
arXiv·2026-10-17·Guoliang Xu et al.
No generated summary available for this entry.
overview
Original abstract
Let \(f = \text{EXACT}^5_{3,4}\) be the Boolean function that equals 1 exactly on inputs of Hamming weight 3 or 4. Earlier numerical studies reported success probabilities close to one using three queries, but the existence of an exact three-query algorithm had remained unresolved. This paper settles this problem by proving that the exact quantum query complexity of \(f\) is \(4\). For the lower bound, we express every three-query algorithm through layer-by-layer Gram matrices of low-degree Fourier coefficients. We then construct a fixed rational dual certificate whose slack matrices are all positive definite. This certificate separates the necessary Gram-matrix region from the exact-output condition and therefore rules out every exact algorithm using at most three queries in the stated model. The positivity verification reduces to five small rational matrices and Sylvester's criterion. For the upper bound, we invoke the previously known four-query algorithm for the seven-bit function \(\text{EXACT}^7_{3,4}\) and apply the standard padding reduction. To quantify the near-exact behavior, we use the same certificate to derive a valid, though not claimed tight, lower bound \(\frac{25600}{43779488192449}>0\) on the worst-case error of every algorithm using at most three queries. This positive error gap is compatible with the near-unit success probabilities reported in earlier numerical studies, which do not establish exact computation.
arXiv·2026-10-17·Yun Shang
No generated summary available for this entry.
overview
Original abstract
Quantum decoding succeeds when a correction matches the logical class of the error, whereas ordered-statistics decoding (OSD) searches a finite list of physical corrections. We connect these spaces through a rank-$k$ logical-signature map $M_{\rm log}:\mathbb F_2^q\to\mathbb F_2^k$. For fixed, error-independent orderings it yields the exact logical-signature distribution, the OSD-0 logical error rate, and the logical-class coverage of any fixed list. For minimum-cost list decoding we prove $P_L=P_{\rm miss}+P_{\rm sel}$, separating absent-class from wrong-selection failures. Hypergraph-product and bivariate-bicycle codes are consistent with the coverage predictions. On the $[\![144,12,12]\!]$ gross code, 672 coverage-aware candidates outperform 899 combination-sweep candidates (paired McNemar $p=0.013$), while two lists with identical logical coverage give $P_L=11.30\%$ and $3.78\%$; the signature-based coverage compression persists across 30 random column orderings. Logical coverage and within-class representative selection are therefore complementary resources that candidate count alone does not capture. The framework guides OSD list construction and compression by identifying coverage requirements and distinguishing coverage losses from failures of representative selection.
arXiv·2026-10-17·Dehua Liu et al.
No generated summary available for this entry.
overview
Original abstract
Multiparameter quantum Otto engines raise an optimization problem absent in single-parameter cycles: which small quench vector maximizes the quadratic approximation to the exact output work in a multidimensional control space? We develop a local response theory for sudden-quench Otto engines with quantum working media described by linearly controlled Hamiltonians. We show that the local quadratic work decomposes into a thermal-bias gain and a quadratic response cost, whose competition determines the quench vector that maximizes the local quadratic work at a prescribed quench amplitude. We illustrate the theory in a minimal two-level working medium, where radial and transverse quenches play distinct roles, and in a finite interacting XYZ spin chain, where the resulting quench vector is determined by the balance between thermal-bias and response cost. Our results provide a practical local criterion for designing small multiparameter quenches in sudden-quench quantum Otto engines.
arXiv·2026-10-17·Sanket K. Tripathy, Simeon I. Bogdanov
No generated summary available for this entry.
overview
Original abstract
Quantum correlation measurements have emerged as a powerful tool for localizing multiple emitters with subwavelength separation. Multi-emitter localization consists of two distinct tasks: identifying the emitter count $N$ and estimating their positions $\left\{x^{i}\right\}$. Existing fit-and-select frameworks fit the measured intensity and autocorrelation data using several models corresponding to different values of $N$ and then select the best-supported model. This procedure lets errors from the multi-parameter optimization of emitter positions propagate into the choice of model, degrading performance under photon-limited and high-background conditions. We propose a method that directly infers the emitter count and positions from the multimodal data via learned inference. Learned inference improves both the emitter-counting accuracy and localization precision compared to the fit-and-select method. It achieves more than tenfold improvement in precision and requires up to five times fewer photons to achieve practically meaningful localization with the largest gains observed under low photon counts, strong background, narrowly spaced emitter configurations, and spatially truncated data. This photon-efficient quantum-assisted localization framework offers a promising route toward real-time biological imaging and single-particle tracking in densely labeled samples.
arXiv·2026-10-17·Payman Kazemikhah et al.
No generated summary available for this entry.
overview
Original abstract
Quantum entanglement is intrinsically nonlocal, whereas tunneling spectroscopy measures one site at a time. We show that this apparent mismatch can be overcome: local tunneling spectra can certify spin entanglement without coherent control or absolute intensity calibration. An exact spin sum rule turns the high-bias conductance into an internal normalization, allowing the inelastic spin-flip weight to place a lower bound on the local quantum Fisher information. Total-spin conservation then fixes the otherwise inaccessible intersite fluctuation, converting two local spectra into a bound on a collective entanglement witness. We incorporate coupling to the substrate through a spectroscopic bound on spin leakage, while a hierarchy of thresholds distinguishes entanglement between the spins from entanglement with their environment. Including instrumental broadening and noise, the resulting certificate holds at a stated confidence level. These results establish a route for extracting nonlocal quantum information from equilibrium local spectroscopy.
arXiv·2026-10-17·Ju-Young Ryu, Tak Hur, Daniel K. Park
No generated summary available for this entry.
overview
Original abstract
Understanding generalization is essential for assessing the practical viability of quantum machine learning. In many applications, quantum models operate on classical data that must first be encoded into quantum states, making the encoding part of the effective hypothesis class. We develop a margin-based generalization framework for this setting, covering both fixed and trainable quantum data encodings. For fixed encodings, the existing margin bound transfers unchanged. For trainable encodings, we derive a bound using a two-scale covering argument that combines the original margin-dependent term with an additive encoding-capacity term of order $\tilde O(\sqrt{L/m})$, where $L$ is the number of trainable encoding parameters and $m$ is the training-sample size. Across 19,440 simulated training runs spanning various image datasets, circuit architectures, and optimization settings, the inverse margin performs best among five baseline and two bound-derived complexity measures under conditional-independence and 90th-percentile sign-error criteria, within bootstrap uncertainty. These results provide a unified margin-based view of generalization in quantum machine learning with classical data.
arXiv·2026-10-17·Seokhoon Jeong, Daniel K. Park
No generated summary available for this entry.
overview
Original abstract
In supervised quantum machine learning with classical data, classification performance critically depends on the geometry induced by quantum data embedding. Existing data-adaptive approaches rely on pairwise fidelity evaluations between samples, which scale as $O(B^2)$ for $B$ samples and create a computational bottleneck in iterative embedding optimization. To address this issue, we propose a prototype-guided framework for efficient data-adaptive quantum embedding. Using class-prototype separation and sample-to-prototype compactness, we derive a measurable lower certificate for class-ensemble distinguishability and construct a prototype-based objective requiring only $O(B)$ fidelity evaluations. We integrate this objective into an end-to-end pipeline that combines task-specific quantum circuit architecture optimization with continuous refinement of the data-embedding parameters. Across five benchmark datasets with up to 20 qubits, our method retains competitive quantum kernel support vector machine (SVM) performance while reducing fidelity-evaluation cost, with particularly strong gains over budget-matched pairwise optimization on T-MNIST. Geometric analyses examine how the learned embeddings relate to kernel alignment and classification margins, revealing dataset-dependent benefits and limitations. We further derive a prototype-based classifier in the reproducing kernel Hilbert space that provides an explicit witness for the SVM objective and a low-cost proxy for model selection, and extend the framework to multiple prototypes for multimodal class structures.
arXiv·2026-10-17·Mohammad Abrarul Hasanat et al.
No generated summary available for this entry.
overview
Original abstract
An orbital quantum sensor is more precise than classical and holds its information in a quantum state's superposition and entanglement, which classical measurement collapses. Learning on quantum-sensed data therefore requires a distributed system in which the data stay quantum from sensor to inference. We present EntangledEdge, the first system architecture to unify orbital quantum sensing and learning end-to-end, with a quantum data plane and a classical control plane. It routes each event to a channel-matched model in a capacity-diverse bank, adapts its detection threshold without labels, and aggregates across stations by hardware fidelity. Evaluated with a hybrid prototype (real quantum processors, simulated orbit-to-ground link) over satellite telemetry, EntangledEdge achieves high-quality inference at bounded per-event cost, improves quantum processor utilization, and scales with fleet size.
arXiv·2026-10-17·Panayiotis Christou, Shuwen Kan, Ying Mao
No generated summary available for this entry.
overview
Original abstract
Fault-tolerant quantum applications depend on both decoded measurement information and a continuing supply of magic states. While an operation waits for either, its logical data require protection that produces more syndrome data and decoding work. Architects must provision the quantum and classical parts of the machine together, before complete systems are available to measure. FTWeave is a system-level simulator for this architectural exploration. It accepts OpenQASM 2/3 circuits, CUDA-Q Logical compiler artifacts, Stim circuits, and provider-derived physical inputs through adapters that preserve operation and measurement dependencies. Users bind these inputs to quantum resources, classical processors, memory, communication, and factory configurations. One event timeline determines application progress, resource ownership, and continuing protection. This supplies the system model needed to connect circuit and decoder evidence to application performance. Controlled demand studies and complete multiplier and Ising circuits show why the coupling changes provisioning decisions. A fixed-work approximation predicts a 3.55x multiplier speedup from additional factories where the coupled model gives almost none. Explicit ownership also changes useful capacity: increasing decoder workers alone has no benefit in a storage-constrained case, while increasing workers and feedback entries together gives 4.93x speedup. Selected color and hypergraph-product code mappings take 53-90% longer under decoder service variability, despite an unchanged mean. These comparisons identify useful resource combinations and distinguish protection work from the elapsed lifetime of quantum data.
arXiv·2026-10-17·Doyeol "David" Ahn et al.
No generated summary available for this entry.
overview
Original abstract
We present a hybrid quantum-classical iterative refinement for the pressure-Poisson equation of the incompressible Navier-Stokes projection method on noisy quantum hardware. Rather than solving the pressure equation once per time step, we solve it repeatedly for the normalized residual and scale each quantum direction by a least-squares fit to the physical residual. As a result, the error of the quantum solve enters as a contraction factor $\sinθ_k$ of the residual rather than as an error floor. This removes the requirement of a state infidelity below $10^{-7}$ that was estimated for single-solve schemes. The hardware noise then sets the rate of convergence but not the attainable accuracy, and it is this change of the role of the quantum solve, not an improvement of the hardware, that allows the residual to converge. With a boundary-consistent staggered (MAC) discretization, the pressure residual equals the velocity divergence left after projection up to the factor $Δt/ρ$. On the IBM processor ibm_cleveland, a four-qubit ($16\times16$) problem reached a relative residual below $10^{-7}$ within eight to ten corrections in all 20 runs of a pre-registered experiment, whereas a single solve with a comparable number of shots stopped at 0.33-0.59. In a six-qubit ($64\times64$) pilot, all three runs reached the same tolerance in 13 corrections. On the IonQ Forte processor, a manufactured-solution benchmark reached $5.6\times10^{-8}$ in nine corrections. With the variational training itself carried out on ibm_cleveland, the residual fell to $5.6\times10^{-4}$ in seven corrections, below the pre-specified tolerance of $10^{-3}$, at the rate predicted by a noise model. To the best of our knowledge, these are the first converged pressure solutions obtained on quantum hardware.
Phys.org Quantum Physics·2026-10-16
No generated summary available for this entry.
overview
Original abstract
For the first time, scientists have achieved strong coupling between light and long-lived acoustic vibrations in an optical fiber. Optical fibers are used in both classical telecommunications and quantum communication and could serve not only as connections between computing nodes but also as quantum processors themselves in the future. The results, published in Nature Physics, pave the way for new technologies in quantum signal processing.
Quantum Computing Report·2026-10-16·Doug Finke
No generated summary available for this entry.
overview
Original abstract
Guest post by Sarah Schlotter and Adam R. Wichman describe how the U.S. Patent Office may treat domestic manufacturing as a factor affecting when it will hear a challenge to the patentability of an issued patent claim. The article goes on to recommend best practices for quantum companies to work with this. The post Manufacturing Announcements Can Influence Patentability Challenges: What Quantum Computing Companies Should Know appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-16·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief QuEra Computing scientists will serve as co-principal investigators on three of nine teams selected for the US Department of Energy ‘s $37 million Quantum Computing for Computational Chemistry (QC3) program. The projects target high-temperature superconductors, ultra-strong lightweight magnets and hydrogen production, using quantum algorithms and computational methods to address energy-related materials and chemistry challenges. QuEra will contribute neutral-atom quantum hardware access and expertise in algorithm and architecture co-design, with the three-year program aiming to demonstrate major improvements over classical methods at approximately 100 logical qubits. PRESS RELEASE — QuEra Computing , the leader in quantum computing, today announced that its scientists will work with three of the nine teams selected for the Quantum Computing for Computational Chemistry (QC3) program at the Advanced Research Projects Agency for Energy (ARPA-E) to develop neutral-atom based modeling frameworks for complex materials and molecules. The three-year program, announced by the Department of Energy in March 2026, directs $37 million across the program performers. QC3 exists to close the gap between vendor roadmaps that are rapidly transitioning to expanded logical capabilities by the end of the decade but don’t yet clearly map to the resources required for published algorithms for energy-relevant chemistry applications. ARPA-E’s premise is that the gap closes through full-stack co-design, where improvements of two to three times at each layer of the stack compound into an order of magnitude overall. The program asks its teams to identify an application worth a quadrillion BTU of energy or a gigaton of CO₂-equivalent, and to pursue a scalable hundredfold improvement over classical state of the art, validated at approximately 100 logical qubits. QuEra ‘s updated roadmap targets 1,000 logical qubits by 2029, providing ample hardware cap
The Quantum Insider·2026-10-16·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Anderon has released its first superconducting quantum Process Design Kit (PDK), providing design components for quantum devices and circuits on its 300mm wafer fabrication platform. The PDK includes components for qubits, signal routing, amplifiers and filters, alongside a reference design for coherence validation and electromagnetic parameters for simulation. Anderon is offering early access through a license agreement, aiming to help developers prepare superconducting quantum designs for fabrication. Anderon has released its first Superconducting Quantum Process Design Kit (PDK), the company said in a blog post . According to Anderon , the kit is meant to give quantum device and circuit developers a more efficient, standardized way to work. The company said it supplies designers with the basic building blocks for manufacturable designs on its 300mm wafer fabrication platform. Anderon tied the release to the growth of the quantum computing ecosystem. As that ecosystem scales, the post says, comprehensive design infrastructure matters as much as access to advanced process technology. The blog post states that the PDK covers Anderon ’s full portfolio of 300mm wafer offerings, which it lists as: Qubits for quantum information processing I/O components for signal routing and device connectivity Amplifiers and filters for high-fidelity quantum control and readout The kit also contains a reference design for baseline coherence validation, along with electromagnetic parameters for simulation. Anderon said the PDK is intended to narrow the gap between device innovation and scalable manufacturing, so developers can take quantum designs to fabrication more efficiently. Anderon is offering early access to its first-generation PDK. The company described this as a milestone in its commitment to building infrastructure for the next era of superconducting quantum computing. Access is available through a license agreement. Interested parties can contact the Anderon
The Quantum Insider·2026-10-16·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Germany’s BMI, BMDS and BSI have published a national guideline for implementing the EU roadmap for transitioning to post-quantum cryptography (PQC). The guideline recommends completing migrations for high-risk systems by the end of 2030 at the latest and largely completing the broader transition by 2035. The recommendations call for clear migration responsibilities and deadlines, systematic quantum-risk assessments, early coordination with manufacturers and supply chains, and cryptographic agility. PRESS RELEASE — Quantum computers pose an increasingly real threat to the security of cryptographic methods and thus to cybersecurity itself. The Federal Ministry of the Interior (BMI), the Federal Ministry for Digital Affairs and State Modernization (BMDS) and the Federal Office for Information Security (BSI) are now jointly publishing the Guideline for the implementation of the EU Roadmap on Post-Quantum Cryptography for Germany. It stems from an initiative by EU member states that had put forward recommendations for an EU-wide coordinated transition to quantum-safe cryptography, so-called post-quantum cryptography (PQC). Objectives of the Guideline The national guideline is aimed particularly at federal, state and local governments, as well as organizations and companies, including operators of critical infrastructure. It provides structured recommendations for the transition to quantum-safe cryptography and confirms the timelines of the European Roadmap: high-risk use cases should be switched to quantum-safe methods as early as possible; for these systems, the migration should be completed by the end of 2030 at the latest. The entire transition should be largely completed by 2035. The measures recommended in the national guideline include, in particular, the establishment of clear responsibilities and binding deadlines for the transition, the consideration of post-quantum cryptography in accordance with the state of the art, the systematic a
Phys.org Quantum Physics·2026-10-16
No generated summary available for this entry.
overview
Original abstract
Quantum computers represent a next step in the fast-paced evolution of technology. Using quantum bits (qubits), they have the potential to run certain calculations exponentially faster than conventional computers. However, developing and fine-tuning quantum computers requires an enormous number of repetitive tests. To accelerate quantum technology development, we need a method that can read quantum states at ultrafast speeds.
The Quantum Insider·2026-10-16·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief A “Quantum 101” session at the World Trade Organization, co-organized by the permanent missions of Israel, Singapore and Switzerland, introduced trade negotiators to quantum technologies and their implications for trade. Speakers from industry, academia and national programs said the most direct link between quantum and trade is encryption, which secures payments, letters of credit, customs filings and e-signatures. Panelists also pointed to concentrated supply chains, diverging standards and a possible “quantum divide” between countries as trade questions that are already emerging. The World Trade Organization’s (WTO) member delegations were told this week that the encryption underpinning international trade could be broken by quantum computers within roughly five years, and that the trading system has no shared definition yet of what it means to be “quantum safe.” The warning came at a one-hour session in Geneva, organized by the permanent missions of Israel, Singapore and Switzerland to the WTO. The panel was moderated by Dylan Barry, executive director of the von Neumann Commission. “We are not here to ask whether the WTO needs rules on quantum technologies,” Carolinn Hjalmroth, head of Israel’s Trade and Economic Mission to the WTO, Foreign Trade Administration , Ministry of Economy and Industry, told the room, adding, “We simply want to start to understand what is changing, what is realistic and what may matter for our economies.” Trade Runs on Encryption Miriam Shtilman-Lavsovski , a partner at Tal Ventures , gave the introductory talk before turning to the issue she framed as most important for trade. “Trade runs on trust and trust runs on encryption,” Shtilman-Lavsovski, said. “ And one of the main issues today is how do we encrypt what we have and how do we encrypt what we’re going to have in the future? It’s e signatures, letters of credit, customs, payment, etc.” She to
The Quantum Insider·2026-10-16·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Google demonstrated magic-state cultivation on its Willow quantum processor, reducing state-preparation errors about 40-fold and reporting 99.99% logical fidelity, potentially lowering resource demands for error-corrected computing. The team used reinforcement learning to improve processor calibration and developed a measurement technique to avoid overstating the prepared states’ quality. Researchers transferred prepared states between two error-correcting codes, but larger demonstrations remain necessary, and a storage test produced errors about seven times higher than simulations predicted. Google researchers reduced errors in a crucial quantum computing resource about 40-fold, demonstrating a method that could lower the hardware demands of useful, error-corrected machines. The experiment, published in Science , showed that a technique called magic-state cultivation works on Google ’s Willow processor , according to a Google Quantum AI blog post written by Emma Rosenfeld, research scientist and Craig Gidney, quantum software engineer. The team reported producing states known as T-states with a logical fidelity of 99.99%, which is a measure of how closely a protected quantum state matches its intended form. The result addresses a problem in quantum computing that preparing these states could consume much of a future machine’s resources and leave less capacity for the calculations it is meant to perform. Google ’s demonstration moves a proposed way to reduce that burden from theory to hardware. The researchers were also able to transfer these prepared states between two forms of quantum error correction as an early test of whether the preparation method can connect with the architecture intended to support larger computations. The work does not necessarily establish that the resource problem has been solved at a practical scale. Ultimately, then, this looks to be an important, incremental advance toward practical quantum computing that demonstrates a w
Phys.org Quantum Physics·2026-10-16
No generated summary available for this entry.
overview
Original abstract
The researchers in the Quantum Detection Microscopy group at CIC nanoGUNE, in collaboration with chemists at CiQUS of the University of Santiago de Compostela, have demonstrated that adding or removing a single molecule from a quantum chain can fundamentally change its interaction with a superconductor.
Quantum Computing Report·2026-10-16·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
NVision Quantum Technologies is expanding from its commercial hyperpolarized MRI platform into quantum computing hardware with its new PIQC (Photonic Integrated Quantum Chip) molecular architecture. This strategy utilizes synthetic organic molecules with optically addressable spin states deposited on silicon photonic chips, aiming for a scalable, photonically-entangled gate architecture for fault-tolerant quantum computing. This expansion builds on their commercial success with their Polaris MRI systems and recent significant financing and project involvement. The post NVision Quantum Technologies Expands into Molecular Quantum Computing with Photonic Integrated Architecture appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-16·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Google Quantum AI has successfully demonstrated magic state cultivation on its Willow quantum processor, achieving a 40-fold error reduction and producing T-states with 99.99(1)% logical fidelity. This breakthrough addresses a major bottleneck in fault-tolerant quantum computing by significantly reducing the physical qubit footprint required for generating these essential states, directly validating Google's 2024 cultivation theory framework. The post Google Quantum AI Demonstrates Magic State Cultivation on Willow Processor in Science Milestone appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-16·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Terra Quantum has joined the QuEra Quantum Alliance, adding its quantum software, algorithms and enterprise application expertise to the neutral-atom quantum computing partner network. Terra Quantum ‘s TQ42 platform provides a cloud-based quantum software environment with a Python SDK, APIs and algorithms for optimization, quantum machine learning and simulation. The partnership aims to connect enterprise applications with QuEra’s neutral-atom hardware, as QuEra targets availability of its 256-logical-qubit Libra fault-tolerant quantum computer through Amazon Braket in 2028. PRESS RELEASE — Terra Quantum , a global leader in the development of quantum technologies and their industrial application, the leader in neutral-atom quantum computing, today announced that Terra Quantum has joined the QuEra Quantum Alliance, a global partner program dedicated to accelerating the development, deployment, and utilization of neutral-atom quantum computers to solve the world’s most challenging computational problems. Reinforcing the Applications Layer of the QuEra Quantum Alliance Terra Quantum is hardware-agnostic by design, developing proprietary algorithms and software rather than quantum processors. Its TQ42 platform, a cloud-based quantum software-as-a-service environment, gives developers a Python SDK, APIs, and command-line tools alongside a library of algorithms for optimization, quantum machine learning, and simulation. The company works with customers across financial services, manufacturing, pharmaceuticals, logistics, energy, and the public sector. As a member of the QuEra Quantum Alliance, Terra Quantum will gain access to technical expertise and go-to-market resources from QuEra as well as partnership opportunities with other, complementary alliance members. Both QuEra and Terra Quantum see their expanded partnership as an opportunity to shorten the distance between an enterprise use case and hardware designed to scale toward fa
Quantum Computing Report·2026-10-16·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
EMode Photonix, a quantum integrated photonics software startup, has successfully raised $1 million in pre-seed funding. This investment, led by Ground State Ventures, will enable the company to expand its engineering team and accelerate the development of its enterprise software. EMode Photonix specializes in a multi-physics simulation platform for non-linear integrated photonic circuits, offering significantly faster modeling capabilities for various applications including quantum computing and optical sensing. The post EMode Photonix Raises $1M Pre-Seed Round Led by Ground State Ventures for Photonic Circuit Simulation Stack appeared first on Quantum Computing Report .
PRX Quantum
·2026-10-16
·Hugo Thomas, Ulysse Chabaud, Pierre-Emmanuel Emeriau
·doi
No generated summary available for this entry.
overview
Quantum Science and Technology
·2026-10-16
·Santiago Beltràn-Romero et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract Recent advances in transmission electron microscopy (TEM) have opened the path toward spin resonance spectroscopy with single-spin sensitivity. To assess this potential, we investigate the quantum precision limits for sensing magnetic moments with free-electron probes. Using a scattering model where an electron wavepacket interacts with a localized spin, we study two metrological tasks: estimating the magnitude of the magnetic moment and discriminating the presence of a spin. The sensitivity for a given measurement setting is generally determined by the classical Fisher information, which we benchmark against the quantum bound optimized over all measurements. We find that conventional TEM imaging can saturate the quantum bound when backaction of the probe electron onto the spin state is negligible. We also find that, when backaction is relevant, one could do better by realizing a measurement of the electron's orbital angular momentum state. These results establish the quantum limits of spin sensing in TEM and guide the development of future experiments probing individual electron spins or nanoscale ensembles of nuclear spins.
Quantum Science and Technology
·2026-10-16
·Mattia Orlandini et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract We investigate the non-equilibrium work statistics originating from a sudden quench in a bosonic Josephson junction. In particular, by employing the Holstein-Primakoff approximation, the work statistics are analytically characterized in the weak-interaction regime, where the dynamics map onto a time-dependent quantum harmonic oscillator. For a junction initialized in the ground state of the pre-quench Hamiltonian, we demonstrate that the work statistics are governed by a negative binomial distribution, as occurs in fully-connected models driven across a critical point. Furthermore, we also consider initial superposition states containing quantum coherences in the energy basis. To characterize the corresponding work distributions, we employ Kirkwood-Dirac quasiprobabilities (KDQ). Even in the simplest case, when the junction is initialized in a superposition of the ground and second excited states, the KDQ distribution of work exhibits negative or complex values, reflecting non-classical features. Moreover, the coherence content of the initial state can be optimized to enhance the extractable work extracted from the quench, beyond classical bounds. Finally, we propose an experimental interferometric protocol to directly measure the characteristic function of the work distribution in experimentally accessible settings.
arXiv·2026-10-16·C. Figueira de Morisson Faria et al.
No generated summary available for this entry.
overview
Original abstract
In this review, we examine the interplay of symmetry and quantum interference in the attosecond domain primarily through one- and two-electron photoelectron momentum distributions. Using our own work, we discuss how tailored laser fields provide control over dynamical symmetries, and how quantum-orbit methods make it possible to connect the resulting momentum-space structures to specific ionisation, propagation, and rescattering pathways. Particular emphasis is placed on ultrafast photoelectron holography and nonsequential double ionisation through recollision excitation with subsequent ionisation, where several distinct forms of quantum interference can be identified and manipulated. We also discuss how target properties, including the binding potential, orbital symmetry and parity, modify this mapping. Finally, we consider emerging opportunities offered by non-classical states of light, for which photon statistics and quantum fluctuations provide additional degrees of freedom for controlling symmetry and strong-field electron dynamics.
arXiv·2026-10-16·Gongyu Ni, Lester Ho
No generated summary available for this entry.
overview
Original abstract
Quantum networks must deliver end-to-end entanglement whose fidelity meets application requirements, which typically requires entanglement purification along multi-hop paths. Existing scheduling approaches either purify at the link level or optimize end-to-end fidelity for a static set of requests, and do not capture concurrent requests competing for network resources over time. This paper studies concurrent entanglement purification scheduling in a time-slotted quantum network with heterogeneous links, in which requests compete for link capacity and quantum memories, and each request may be served by multiple parallel paths for increased reliability. We formulate a mixed-integer linear programming (MILP) scheduler that maximizes the number of scheduled requests, with max-min path allocation as a fairness criterion, and develop reinforcement learning (RL) schedulers based on DQN, PPO, and SAC, whose rewards balance request success against Bell-pair consumption. Simulations under varying network load, topologies and target fidelity thresholds show that the RL schedulers achieve the highest success rates, improving on MILP by up to 6% and on Progressive Filling and Greedy heuristics by 16.5% and 19.5% respectively, at the cost of higher Bell pair consumption and the deferral of a small fraction of requests. MILP, in contrast, achieves the highest fairness and the lowest Bell pair consumption in most scenarios.
arXiv·2026-10-16·Thao Dinh et al.
No generated summary available for this entry.
overview
Original abstract
The interplay between chirality and magnetism is a profound topic, spanning particle physics, condensed matter, chemistry and origin of life. In this paper, we study this interplay in the new antiferromagnet (AFM) UOTe, and we report a chiral superlattice route to spin-split topological phenomena from collinear antiferromagnetism. Pristine UOTe is a collinear AFM without Berry curvature or spin-split bands. However, we identify the spontaneous formation of a chiral superlattice in UOTe, which can be viewed as frozen chiral phonons at finite wave vector. When electrons move through the chiral superlattice, their orbital Bloch wavefunction and quantum geometry are modulated by the strong chiral superlattice potential, generating large Berry curvature in the chiral superlattice, which we detect by the nonlinear Hall effect. At 150 K, the chiral superlattice induced Berry curvature couples to the collinear AFM order, generating a giant anomalous Hall angle ~0.14 abruptly near $T_N$ that is among the largest in bulk magnets. Moreover, our spin Hanle precession measurement shows that the chiral superlattice also generates spin-polarized current from the collinear AFM, a long-standing goal in spintronics. We shed light on the supermodulation formation mechanism based on chemical ion size and physical interlayer-intralayer energy competitions, using which we propose a design principle to discover similar bond-mismatch superlattices, providing a chiral superlattice pathway through real space engineering of quantum geometry.
arXiv·2026-10-16·Andrés Camilo Granda Arango et al.
No generated summary available for this entry.
overview
Original abstract
A cross-platform benchmark should be device-independent yet sensitive to imperfections accumulated during execution. Building on prior work, we formulate and validate a protocol through demonstrations based on generalized Svetlichny inequality violations (a simulation, rather than a loophole-free certification, of multipartite nonlocality) for larger subsystem sizes. We apply it unchanged to three processors, the trapped-ion Marmot and IBEX Q1 (both manufactured by AQT) and the superconducting Euro-Q-Exa System 1 (IQM), using identical GHZ-state circuits with fixed theoretical measurement settings from N=2 to N=10 qubits. Both trapped-ion processors sustain violations up to ten qubits, while the superconducting processor loses them beyond six qubits under unmitigated (raw) conditions; readout-error mitigation recovers violations up to eight qubits, with a substantial fraction of the degradation attributable to measurement imperfections. These processors provide a heterogeneous testbed for validating the protocol's cross-platform applicability and discriminating power, demonstrating its practicality as a common framework for assessing collective quantum performance.
arXiv·2026-10-16·Tangyou Huang et al.
No generated summary available for this entry.
overview
Original abstract
Fault-tolerant quantum computing requires high-fidelity quantum gates that are resilient to control errors and device imperfections. Here, we develop energy-optimal control pulses for single-qubit gates that are simultaneously robust against frequency detuning and waveform inhomogeneities while also suppressing leakage outside the computational subspace. Combining the optimized pulse envelopes with an adaptive control scheme, we experimentally demonstrate optimal robust gates on a superconducting quantum processor. For a gate duration of 90ns, we achieve fidelities above 99.9% for the X gate and 99.6% for Hadamard-type gates. For the X gate, we maintain fidelities above 99.5% for simultaneous drive-amplitude variations up to 20% and qubit detuning up to 4 MHz. This robustness outperforms that of conventional Gaussian pulses by an order of magnitude, without much difference in peak gate fidelity. These results establish a route towards robust single-qubit control in large-scale quantum processors, advancing the development of fault-tolerant quantum computing.
arXiv·2026-10-16·Andrés Camilo Granda Arango et al.
No generated summary available for this entry.
overview
Original abstract
Benchmarking quantum processors is a central task in every roadmap aimed at quantum advantage. Here, we discuss a benchmarking protocol based on the violation of the Svetlichny inequality, which is designed to simulate genuine multipartite nonlocality. We compare it with Mermin's inequality, and present the results of applying this framework to two different quantum processing units -the superconducting system Garnet (from IQM) and the ion-trap system Marmot (from AQT), testing different families of quantum circuits for three to five qubits under identical experimental conditions. We also run simultaneous triplet tests across the full register, including a comparison between GHZ and linear cluster states, to probe how Svetlichny-inequality violations depend on qubit location and calibration. Our results demonstrate that tests based on genuine multipartite nonlocality provide a powerful tool to characterize the collective performance of quantum devices and to guide their calibration and optimization.
arXiv·2026-10-16·Sebastian Grieninger
No generated summary available for this entry.
overview
Original abstract
We define string breaking by the midpoint electric field falling to half a flux unit. In the massive Schwinger model, an energy balance between intact string and screened configuration predicts this separation using only vacuum observables and meson masses as input. We observe numerically that this half flux point corresponds to equal weights of the two configurations thus explaining the observed peak of the entanglement entropy as maximal uncertainty of the binary flux. The same binary uncertainty explains the entanglement peak at the vacuum transition. Near breaking, screening organizes part of the spatial entanglement between the string interior and exterior into a nearly maximally entangled bit. Within the selected flux sectors, this approximate encoded Bell pair records whether the flux is screened and nearly separates from the remaining correlations. The vacuum transition exhibits the same structure. The string and the $θ$-vacuum reveal a matching structure of the capacity of entanglement minimum at their transition point, linking their entanglement spectra. The transition rearranges degrees of freedom coherently as revealed by the entanglement asymmetry and Robustness of Magic of disjoint subregions. Finally, we construct the $θ$-vacuum and string wavefunctions with high fidelity using a restricted Boltzmann machine ansatz.
arXiv·2026-10-16·Brennan Dizdar et al.
No generated summary available for this entry.
overview
Original abstract
Integrating condensed noble gases with superconducting circuits offers new opportunities for operating hybrid quantum devices. In particular, electrons on solid neon have recently emerged as exceptionally coherent charge qubits, however the growth of the underlying neon films on patterned devices remains poorly controlled. We monitor neon films near the triple point using a multimode resonator fabricated from high-$T_c$ YBCO, which remains superconducting at temperatures where the liquid phase exists and whose geometry sets a thickness-sensing window near 1 $μ$m. In the liquid state we observe rich film dynamics: uniform wetting that saturates near 20 nm, drainage of thicker films, and spontaneous thickness oscillations, reflecting the extreme sensitivity of thick films in this regime. A galvanic connection to our sensing volume enables in-situ electrostatic tuning of the liquid film thickness. Statistics of freezing the neon across various liquid levels reveal variations of the solid film thickness by approximately an order of magnitude. We also observe a two-fold increase in the quality factor of the resonators at the level of $10^3$ with added neon and rule out dielectric loss as the limiting factor. Our results demonstrate that hermetic packaging facilitates the investigation of both rich non-equilibrium fluid dynamics and the impact of condensed noble gas films on microwave loss in superconducting circuits, but may not be the best modality for growing solid neon films with precisely controlled thickness.
arXiv·2026-10-16·Ansh Singal et al.
No generated summary available for this entry.
overview
Original abstract
We introduce Trajectree, a quantum trajectory-based quantum circuit simulator that uses a novel, state-saving partial execution of the quantum circuits to simulate broad and deep noisy quantum circuits efficiently. Trajectree can efficiently generate a large number of Monte Carlo samples by saving partially executed trajectories. We conduct extensive performance analysis of the Trajectree approach, proving the utility of the trajectory saving scheme for simulations of open quantum systems. Using this architecture, we show that Trajectree can simulate standard benchmark noisy circuits over five times faster than Google's QSim, a part of the Cirq package. We also analyze Trajectree's performance for simulating quantum optical systems relevant to communication and computing applications. We demonstrate applications of the optical backend to simulate three optical experiments: CHSH Bell test, entanglement swapping, and optical CNOT gate. This shows Trajectree's potential for simulating noisy qudit and optical systems efficiently.
arXiv·2026-10-16·Arash Fath Lipaei et al.
No generated summary available for this entry.
overview
Original abstract
Many simulations of partial differential equations require the repeated solution of linear systems whose matrix remains fixed while the righthand side changes. We present a hybrid offline online framework for this setting. The discretized operator is organized into small coupled blocks and reduced through block Schur complements. Instead of expressing the complete PDE solution as one large binary optimization problem, quadratic unconstrained binary optimization is used only to construct reusable local inverse factors. These factors are computed during an offline stage, decoded and stored, and then reused in an ordinary classical block solve for subsequent righthand sides. The optimizer facing problem size is governed by the local block size and chosen numerical precision, rather than by the dimension of the full spatial grid. We develop the mathematical formulation, analyze the accuracy and resource requirements of the binary representation, and examine the method on representative finite difference PDE problems, including execution of the local optimization stage on quantum optimization hardware. The resulting architecture provides a reusable interface between conventional numerical linear algebra and QUBO based quantum optimization.
arXiv·2026-10-16·Ruizhi Liu, Jinmin Yi
No generated summary available for this entry.
overview
Original abstract
We construct translation-invariant pure quasifree fermionic states on the one-dimensional lattice whose half-chain von Neumann algebras are hyperfinite factors of type $\mathrm{II}_\infty$ or $\mathrm{III}_λ$ for any $0<λ\leq 1$. Via the Jordan-Wigner-Araki transformation, these yield translation-invariant pure spin-chain states with the same half-chain factors, demonstrating that such factors need not be of type I or III. Each state is the unique ground state of a gapless, translation-invariant parent Hamiltonian with superpolynomially decaying interactions. For any fixed factor type, the interval entanglement entropy can exhibit widely varying growth rates, from arbitrarily slow divergence to nearly power-law growth, showing that entropy scaling does not determine the factor type. In contrast, we prove that gauge-invariant quadratic Hamiltonians with finitely many flavours and exponentially decaying hopping exhibit a dichotomy: their ground states either satisfy an area law with a type I half-chain factor, or have logarithmic entropy growth with a type $\mathrm{III}_1$ factor. The counterexample was discovered with AI assistance.
arXiv·2026-10-16·Noah Reich et al.
No generated summary available for this entry.
overview
Original abstract
Terahertz scanning near-field optical microscopy (THz-SNOM) enables spatially and spectrally resolved investigation of low-energy collective and topological states in quantum materials and nano-structured devices by exploiting the strongly localized near field generated by a polarized atomic force microscopy (AFM) tip. Because the THz near-field response is highly sensitive to tip geometry, understanding how geometric parameters control field confinement and decay is essential for selecting tip designs that provide the spatial resolution required for specific experiments. In this work, we develop a boundary element method (BEM) for modeling the electrostatic near-field of a conducting AFM tip in response to an external background field. The tip is represented by a simplified closed, blunt-cone geometry with its surface discretized into panels using increased mesh density near the apex. A modified Green's function is used to calculate interactions between surface panels, while an augmented linear system simultaneously enforces the equipotential boundary condition on the conducting surface and overall charge neutrality to determine the induced surface-charge distribution. We validate the BEM by comparing the resulting near-field decay with that obtained from a three-dimensional quasi-static COMSOL Multiphysics simulation. The BEM accurately reproduces the COMSOL field-decay behavior while requiring orders of magnitude fewer mesh elements and substantially reducing computational cost. These results demonstrate that the BEM provides an accurate and computationally efficient framework for systematically investigating the dependence of THz near-field confinement on AFM tip geometry. This framework can be extended to more complex and experimentally realistic tip geometries, providing a route toward rational tip selection and design for application-specific spatial-resolution requirements.
arXiv·2026-10-16·Dominic Leclerc et al.
No generated summary available for this entry.
overview
Original abstract
We report the cryogenic characterization of a 14-nm nMOS Forksheet transistor down to 10 mK. We demonstrate that the device retains transistor operation with improved characteristics at cryogenic temperatures, while also forming a gate-defined quantum dot that can be tuned to the single-electron regime. In the quantum-dot regime, we perform low-frequency charge-noise measurements across different charge occupations and observe an average charge-noise amplitude of $\langle S_0\rangle = 10\;μ\mathrm{eV}/\sqrt{\mathrm{Hz}}$ at 1 Hz, with a minimum measured value of $3.3\;μ\mathrm{eV}/\sqrt{\mathrm{Hz}}$. These results highlight the potential of Forksheet technology for the monolithic cointegration of quantum and classical CMOS functionalities in future quantum processors.
arXiv·2026-10-16·Kenneth Gregory et al.
No generated summary available for this entry.
overview
Original abstract
Quantum repeaters will be paramount to the success of the future quantum internet. Presently however, the losses incurred in fibre communications are unsustainable when fragile quantum states are transmitted over long distances. The most effective repeater nodes will require incorporation of a minimum of two quantum memory units (QMems) for successful operation. Therefore a network composed of numerous nodes will ideally require scalable repeaters that contain QMems that are portable, robust and do not require a high amount of overhead. Here we investigate the performance of a commercial QMem based on a warm vapour of Rb atoms. Specifically, we characterize the coherence time, absolute efficiency, signal to noise ratio and bit error ratio of this device over a range of vapour temperatures that are readily controllable. For our system, we place these performance metrics into the same conventions as those established for current optical communication protocols. Development of QMem systems meeting these benchmarks will be a vital step for seamless integration of QMems systems into present-day communication architectures.
arXiv·2026-10-16·Toshiaki Kaji et al.
No generated summary available for this entry.
overview
Original abstract
We present a quantum simulation of the SU(2) lattice gauge theory in 1+1 dimensions with one flavor of fermions, performed using the trapped-ion Quantinuum System Model H2. This work is based on the loop-string-hadron (LSH) formulation of the gauge theory, and is distinguished by using qubits to represent both bosonic-gauge and fermionic-matter degrees of freedom. Furthermore, we access the $j=1$ electric-flux sector beyond the $j_{\max}=1/2$ truncation commonly used in SU(2) quantum simulations. To that end, we digitize an electric-field degree of freedom using a multiqubit register for representing the bosonic quantum number. Our simulation therefore synthesizes several key ingredients relevant to quantum simulations in higher spatial dimensions, in particular explicit local gauge-field degrees of freedom represented here by a multiqubit bosonic register, while relying solely on circuit-construction optimizations that are expected to scale polynomially with lattice size. This work demonstrates that modern quantum hardware is increasingly able to accommodate the features of complicated but physically important lattice gauge theories while successfully reproducing the expected Trotterized dynamics.
arXiv·2026-10-16·Ali Lavasani et al.
No generated summary available for this entry.
overview
Original abstract
Quantum error correction enables scalable fault-tolerant quantum computation by suppressing logical errors exponentially with code distance once physical error rates fall below a critical threshold. Here we demonstrate below-threshold operation of triangular color codes with distances $d=3,5,$ and $7$ on Quantinuum's Helios trapped-ion quantum processor. Leveraging both circuit- and hardware- level leakage reduction schemes, we achieve logical error rates as low as $5_{-2}^{+4}\times 10^{-6}$, and demonstrate error suppression by over an order of magnitude, $Λ=12_{-2}^{+3}$, with each successive increase in code distance. Moreover, we demonstrate below threshold scaling of error rates for Clifford two-qubit randomized benchmarking circuits when encoded in $d=3,5$ color codes, achieving logical error rate of $7^{+3}_{-3}\times 10^{-5}$ per logical two-qubit Clifford at distance $5$ with a suppression factor of $Λ=9_{-3}^{+8}$. We compare logical performance for existing near-optimal algorithmic decoders, and both convolutional neural network and transformer-based neural network decoders capable of real-time decoding an order of magnitude faster than the syndrome extraction rate. These results approach the logical error rates required for megaquop-scale quantum computation and indicate that scaled trapped-ion processors could reach application-relevant performance with substantially smaller code blocks than indicated by previous results in other qubit modalities.
arXiv·2026-10-16·Jakub, Rog
No generated summary available for this entry.
overview
Original abstract
Georgiev's analysis of a freely precessing spin correctly emphasizes that the Mandelstam-Tamm quantity $ΔT=Δ\hat A/|d\langle\hat A\rangle/d t|$ is not the variance of a time operator. He concludes, however, that its divergence near the extrema of the clock signal is devoid of physical meaning and that $ΔT$ does not disclose how well the system measures the passage of time. For the same projective $\hatσ_x$ readout, we show that $ΔT$ equals the inverse square root of the classical Fisher information in one binary outcome at regular operating points. Its divergence at submaximal-coherence extrema therefore identifies a loss of local sensitivity in the selected readout, not an infinite variance of physical time; a complementary $\hatσ_y$ measurement remains informative. This interpretation also separates Georgiev's exactly known tick--tock period from the statistical precision with which a tick can be located. It preserves his warning against a time-operator interpretation while qualifying his stronger conclusion that the Mandelstam--Tamm scale lacks physical content.
arXiv·2026-10-16·Yuanxing Hao, Marin Bukov
No generated summary available for this entry.
overview
Original abstract
For given control channels, quantum control theory determines whether quantum gates can be realized, but not their resilience to errors. We address this problem by establishing existence criteria for robust gate implementation in $d$-level systems. Our criteria reveal that implementability of all gates is not enough: a universal family of robust gates exists if and only if the driven Hamiltonians share no common symmetry. When these criteria hold, we can make gates resilient to any combination of static perturbations, uniform Hamiltonian rescaling, perturbations at a finite set of selected frequencies, and perturbations with arbitrary selected waveforms. We can impose robustness conditions broadly with limited information about errors, e.g., against any static perturbations; we can also tailor these conditions to the platform, e.g., against environment-induced noise with dominant spectral peaks, requiring no spectral details beyond the peak frequencies. We numerically construct explicit protocols for robust gates, reducing average gate infidelity by approximately two to seven orders of magnitude under Hamiltonian perturbations and environment-induced noise. Together, our existence criteria and numerical constructions provide practical guidance for evaluating the potential of quantum platforms and designing robust quantum gates.
arXiv·2026-10-16·Shuwen Kan et al.
No generated summary available for this entry.
overview
Original abstract
Quantum error correction can suppress logical errors exponentially with code distance when physical noise is below threshold. Realizing this on hardware requires tight coordination among quantum gates, mid-circuit measurements, and qubit coherence. Device variation, noise asymmetry, and correlations across space and time complicate the translation of these capabilities into logical error suppression. Here, we study rotated surface-code memory on an IBM Nighthawk r2 processor. Performance varies across tested processor placements, which we attribute to differences in qubit quality. We optimize the code by combining short readout, fused measurement and reset, and an XX echo on data qubits during ancilla readout. Compared with standard readout without reset or echo, the optimized syndrome extraction circuit reduces the median per-round logical error rate by factors of 3.8 in the X basis and 1.4 in the Z basis. In memory experiments of up to 150 rounds, the distance advantage weakens, alongside long-lived correlations that may reflect a persistent error component. Under our optimization recipe, increasing the protected distance from 3 to 6 while holding the other distance fixed reduces the per-round logical error rate from 0.53% to 0.24% in Z memory and from 0.52% to 0.22% in X memory. The corresponding error-suppression factors under maximum-likelihood decoding are 1.68 and 1.85. These results connect circuit compilation and optimization to surface-code memory performance and limitations, and motivate QPU and QEC circuit codesign for fault-tolerant quantum computing primitives on current cloud hardware.
arXiv·2026-10-16·Felix Frohnert et al.
No generated summary available for this entry.
overview
Original abstract
Parameterized quantum circuits are widely investigated in quantum machine learning, yet how their architecture can provide task-aligned inductive biases remains poorly understood. We study data reuploading quantum circuits with two distinct inputs: a signal that varies between samples and a fixed, task-defined spectral query that specifies how the signal should be probed. We show that encoding the query can change the circuit's hypothesis class over the signal by modulating how its existing signal frequencies are combined, without introducing new sample-dependent information. This mechanism matches tasks built on nonuniform Fourier transforms, whose evaluation frequencies specify the query and whose sampling positions guide its encoding. We examine this connection in a classification task inspired by synthetic aperture radar, where acquisition geometry determines a query for classifying unfocused spectral patches before image formation. Across small-scale spectral and radar-like tasks, aligned queries improve learning from limited data over parameter-matched circuits with mismatched or absent queries. These results provide a route from known spectral task structure to the design and validation of inductive biases in parameterized quantum circuits.
arXiv·2026-10-16·Tanuj Khattar et al.
No generated summary available for this entry.
overview
Original abstract
We discuss an effective paradigm of utilizing AI agents to better compile quantum circuits when one can constrain bottleneck subroutines to have some form of classically verifiable structure. For example, when critical subroutines are composed exclusively of reversible classical logic, phasing operations, and measurement based uncomputation, one can efficiently simulate execution for classical inputs. This property facilitates efficient certification of approximate circuit synthesis via a form of fuzz testing, provided suitable assumptions on the input distribution. While this pattern was recently exploited to improve quantum cryptanalysis circuits, here we highlight the flexibility of the broader approach by discussing three important applications. (1) The computation of $1/\sqrt{x}$ that bottlenecks real space simulations of the Coulomb operator such as those important for modeling inertial confinement fusion reactors. (2) The decoding of Reed-Solomon codes which bottlenecks the decoded quantum interferometry algorithm when used to approximately solve the optimal polynomial intersection problem. And (3) the quantum look-up tables and controlled application of Givens rotations that bottleneck the most performant quantum algorithms for simulating chemistry in second quantization. We discuss reference implementations of these algorithms and how they can be constrained and verified in the interest of seeding a Kaggle competition designed to accelerate AI-based research into the optimization of their compilation.
arXiv·2026-10-16·Anis Bekri et al.
No generated summary available for this entry.
overview
Original abstract
Future quantum networks will rely on control-plane decisions such as routing, scheduling, entanglement provisioning, purification, and memory allocation. Each decision depends on a timely and reliable estimate of the quality of the entanglement that a candidate path can deliver, with end-to-end fidelity as a central metric. Inspired by the optical-networking experience with quality-of-transmission (QoT) estimation, this article asks when a quantum controller should compute fidelity analytically, simulate it, or learn a surrogate model. The optical analogy is useful but incomplete: optical QoT estimation often predicts a scalar transmission margin, whereas quantum QoT estimation must account for probabilistic entanglement generation, random memory waiting times, decoherence, state consumption, and measurement constraints that can make fidelity a stochastic target. We propose a compute/simulate/learn framework for quantum QoT estimation and illustrate it with a simulation-based proof of concept. Our study shows that analytical composition can be sufficient in simple regimes, that simulation becomes necessary when stochastic memory effects shape the delivered fidelity distribution, and that lightweight learned surrogates can approximate simulator labels at much lower runtime cost for online control. We close with open challenges for deployment, including stochastic targets, sim-to-real transfer, data-generation cost, physics-informed learning, and generalization beyond individual paths to full network topologies.
arXiv·2026-10-16·Andres Perez Fadon, Pok Man Tam, Leyna Shackleton
No generated summary available for this entry.
overview
Original abstract
The macroscopic behavior of a non-interacting gas of Abelian anyons has remained unsettled for many decades. Prior numerical methods employing exact diagonalization in the continuum and on the plane have been limited to small system sizes, at most $N = 4$ anyons. Using the rapidly developing technology of neural network wavefunctions, we develop variational ansatze appropriate for studying continuum models of the Abelian anyon gas. The neural network architecture, which we call "AnyNet", is capable of exactly enforcing the non-analytic short-distance behavior induced by the anyonic statistics. We demonstrate excellent agreement with exact diagonalization for $N=4$ anyons, obtain accurate results up to $N = 16$ for intermediate statistics, and study up to $N=20$ for almost-fermionic anyons, matching perturbative results within a 0.4% discrepancy. We use this methodology to study anyons in a harmonic trap, and anyonic atoms as a model for anyon binding to impurities. We study the structure of anyonic wavefunctions as the statistics parameter is varied. We focus on the single-particle density, the pair density, the angular momentum, and the scaling of the wavefunction as multiple anyons coalesce. This work opens doors to understanding the macroscopic behavior of anyons, for which rich phases have been predicted theoretically.
arXiv·2026-10-16·Nikita Klimovich et al.
No generated summary available for this entry.
overview
Original abstract
Superconducting travelling-wave parametric amplifiers (TWPAs) provide broadband gain, low added noise, and high dynamic range, making them attractive for applications requiring wide instantaneous bandwidth. This is crucial for amplifying multiplexed narrow band signals spread over a wide frequency range, such as qubit resonator arrays, or amplifying inherently wide band signals, such as in spectrometers or radiometers. In many cases, however, the useful bandwidth of a TWPA is limited by the production of the idler tone at an image frequency. For three-wave-mixing (3WM) TWPAs, for example, an input signal at $f_s$ is indistinguishable from one at $f_p - f_s$, which can produce spectral ambiguity when the input spectrum is broadband or not known in advance. We experimentally demonstrate a balanced architecture that doubles the instantaneous image-rejected bandwidth available to a 3WM TWPA by spatially separating the amplified signal from the output pump and generated idler, which resolves the sideband degeneracy. The architecture consists of two amplifiers connected between a pair of 180$^{\circ}$ hybrid couplers, with the signal and pump injected and output through the sum and difference ports, respectively. Using two kinetic-inductance TWPAs, we demonstrate approximately 20 dB of signal gain across nearly an octave of bandwidth, together with pump rejection below --20 dB and an average image rejection of approximately --15 dB over the operating band. These results establish balanced TWPAs as a practical approach to broadband parametric amplification, enabling improved contamination free bandwidth and eliminating the need for complex filtering.
arXiv·2026-10-16·Amir Nesturov, Attila Takács, Lenart Zadnik
No generated summary available for this entry.
overview
Original abstract
We investigate the effects of spatially localized conserved quantities on transport and thermalization in quantum and classical many-body systems. We consider several related models: the integrable quantum Volterra model, its nonintegrable classical limit, and two cellular automata derived from the latter. Although localized constraints are often associated with lattice gauge theories, our models do not admit such an interpretation. In systems with discrete degrees of freedom, these constraints induce uniform fragmentation of the Hilbert or configuration space. In the quantum Volterra model, we derive an exact mapping of the dynamics within each Hilbert-space fragment onto a quantum chiral Potts chain. We find that energy transport is ballistic, with identical transport coefficients across all fragments. In the nonintegrable classical limit, energy transport is diffusive, and we similarly find the diffusion constant to be independent of whether or not the constraints are fixed (resolved). Finally, in the cellular automata, we show that, despite leaving transport unaffected, localized constraints lead to a strong breakdown of local ergodicity.
arXiv·2026-10-16·Sing Lam Wong, Marcel Franz
No generated summary available for this entry.
overview
Original abstract
Altermagnets combine vanishing net magnetization with momentum-dependent, nonrelativistic spin splitting, offering functionalities attractive for spintronics and quantum devices. Their practical use, however, is constrained by the limited availability of materials that simultaneously possess the required altermagnetic symmetry, semiconducting electronic structure, and weak spin-orbit coupling. Here we show that these requirements can instead be separated between constituent materials through proximity engineering. We develop an analytical theory for a conventional semiconductor coupled to a gapped $d$-wave altermagnet and demonstrate that virtual tunneling transfers the altermagnetic spin splitting to the semiconductor. Crucially, the induced nonrelativistic and relativistic spin splittings exhibit qualitatively different dependences on band alignment. Virtual processes involving the valence and conduction bands of the altermagnet can reinforce the altermagnetic splitting while contributing with opposite signs to the interfacial Rashba coupling. Consequently, electrostatic tuning can access a regime in which the Rashba splitting vanishes while a sizable $d$-wave spin splitting persists. Exact diagonalization of the full heterostructure model confirms the analytical theory and establishes the robustness of this mechanism beyond the perturbative regime. Our results identify altermagnetic proximity as a route for engineering nonrelativistic spin-split electronic states in established semiconductor platforms, providing a general strategy for disentangling magnetic and relativistic spin interactions in quantum heterostructures.
arXiv·2026-10-16·Maksim Ulybyshev et al.
No generated summary available for this entry.
overview
Original abstract
The system-size scaling of bipartite entanglement can be used to detect phase transitions. We develop a related approach for strongly correlated electron models where large density matrices or large system size scaling are inaccessible. To this end, we demonstrate that phase transitions of various kinds are signaled by a sharp signature in the first- or second-order logarithmic derivatives of the negativity measuring entanglement between small clusters at varying distances. Crucially, we show how to mitigate the effect of quantum Monte Carlo noise at large distances when computing the negativity. Our focus is on the $t'$-$π$-flux Hubbard model using auxiliary-field quantum Monte Carlo simulations. It has the particular advantage of showing three distinct phase transitions in a single model: semimetal to band insulator, semimetal to antiferromagnetic Mott insulator, and a magnetic order-disorder transition belonging to the Gaussian, Gross-Neveu, and O(3) Wilson-Fisher universality classes, respectively.
arXiv·2026-10-16·Gabriel Mayor, Christina Psaroudaki
No generated summary available for this entry.
overview
Original abstract
The helicity of a magnetic skyrmion in a centrosymmetric frustrated magnet is a soft collective coordinate and a candidate variable for encoding quantum information. Its coherence is ultimately influenced by coupling to the magnon environment, which is commonly incorporated only phenomenologically. Here we combine a microscopic Keldysh treatment of the helicity--magnon coupling to resolve the contribution of individual magnon modes to the effective helicity dynamics. In the U(1)-symmetric model, the magnon bath generates, to leading order, a reactive helicity mass renormalization. When U(1) symmetry is broken, additional direct helicity--magnon couplings become allowed. In the presence of finite magnon lifetimes, these couplings generate an Ohmic contribution to the low-frequency helicity dynamics. The spatial symmetry of the perturbation determines which magnon sectors contribute to this damping, providing mode-resolved selection rules for the helicity--magnon coupling. Thus, we establish a microscopic connection between helicity dynamics and the excitation spectrum of frustrated skyrmions and identify the symmetry constraints governing dissipation of helicity-based quantum states.
arXiv·2026-10-16·Ryu Hayakawa
No generated summary available for this entry.
overview
Original abstract
We introduce Recursive Operator Localization (ROL), a framework for constructing hierarchies of local energy problems linked by linear maps between Hilbert spaces. To address spectral-gap problems, including those arising in quantum systems, we study a realization of ROL by nested subspaces indexed by a weighted simplicial complex. Using spectral gaps of auxiliary classical random walks on links, we propagate geometric estimates upward and use them to turn local spectral gaps at the bottom of the hierarchy into a spectral-gap bound for the global operator. For weighted scalar-valued functions on facets, the ROL decomposition becomes the law of total variance, recovering classical spectral-gap bounds from local link expansion (Alev and Lau, STOC 2020). Moreover, for positive binary spin distributions, conditional influence describes the overlap of the corresponding subspaces, yielding known heat-bath gap bounds from spectral independence (Anari, Liu, and Oveis Gharan, FOCS 2020). The framework also offers a route toward quantum Gibbs sampling, with applications requiring model-specific geometric estimates and energy comparisons.
arXiv·2026-10-16·Valeria Repetto, Stefano Melchionna, Romina D'Aurizio
No generated summary available for this entry.
overview
Original abstract
Quantum kernels are among the most promising methods in quantum machine learning, providing a natural way to embed data into high-dimensional Hilbert spaces via quantum circuits and capturing non-linear relationships in data. Their learning behaviour is governed by the function class they represent, which is formally characterized by the structure of the associated Reproducing Kernel Hilbert Space (RKHS). However, a theoretical characterization of this function class, and of how it depends on the choice of feature map and its hyperparameters, is still lacking. In this work, we focus on the Instantaneous Quantum Polynomial (IQP) feature map and derive a Fourier representation of the associated RKHS generators as finite sums of trigonometric functions evaluated on polynomially transformed input variables, with a finite set of accessible frequencies determined by the circuit construction and scaled by the bandwidth hyperparameter. This representation identifies three bandwidth regimes with qualitatively distinct expressive properties from localised, through multimodal, to periodic. Numerical experiments on synthetic datasets with controlled periodic and multimodal structure, across data dimensions and feature-map configurations, reproduce the three regimes in both supervised classification and unsupervised anomaly detection, benchmarked against a classical Gaussian kernel. These results make the relationship between expressivity and data structure explicit for IQP kernels: expressive power translates into a practical benefit only when the accessible frequencies match with the structure of the data, which provides a criterion for selecting the bandwidth when the periodic or multimodal structure of data is known.
arXiv·2026-10-16·Patrick Draper, Drishti Gupta
No generated summary available for this entry.
overview
Original abstract
Quantum simulations of lattice gauge theories with continuous gauge groups require a choice of basis (how states of the gauge theory map to the qubit computational basis) and truncation scheme (which of the infinitely many gauge theory basis states should be omitted in the map to the finite dimensional qubit Hilbert space.) The most common choices are adapted to an electric basis for the gauge theory, where the basis states for each link are associated with irreducible representations of the gauge group. Electric bases and truncations are generally advantageous for preserving gauge symmetries and simulating the strong coupling regime, but their effectiveness in the weak coupling regimes of physical interest are less well understood. In this work, we compute relative probabilities $p(R')/p(R)$ for finding a link in the irreps $R,R'$ in the ground state of SU(3) lattice gauge theory using Euclidean Monte Carlo methods and weak-coupling lattice perturbation theory. The observables that compute these relative probabilities are constructed by introducing seams into an anisotropic lattice, and by a similar construction we are also able to measure relative probabilities of different site singlets (ways that electric flux braids together into a gauge singlet) at each vertex. With these methods we can quantify, for example, the importance of higher electric flux states in the weak coupling ground state. These results directly inform what truncations are needed to accurately capture non-abelian gauge dynamics near the continuum limit.
arXiv·2026-10-16·Wenjun Fan, Zhenlin Zhao, Dawei Wang
No generated summary available for this entry.
overview
Original abstract
Low-resolution digital-to-analog conversion can simplify continuous-variable quantum key distribution (CVQKD) transmitters, but coarse quantization increases excess noise and can generate data-correlated spectral replicas. We demonstrate digital delta--sigma modulation (DSM) for low-resolution waveform generation in Gaussian-modulated CVQKD. In a 500-MBaud CVQKD system over 20~km of fiber, 3-bit second-order DSM achieves an estimated asymptotic secret key rate of 46.38~Mbps at an oversampling ratio of 12, whereas uniform quantization yields no positive rate. With 4-bit second-order DSM, the rate reaches 50.11~Mbps, approximately 97\% of the 12-bit reference. A noise model combining the DSM noise-transfer function with matched filtering guides the sampling-rate and signal-band design for effective noise suppression. We also identify a phase-conjugate spectral replica arising from third-order intermodulation between the pilot tone and quantum signal, and evaluate its key-rate penalty using a linear-replica security model. At 3-bit resolution and an oversampling ratio of 24, first-order DSM reduces the experimentally estimated leakage-mode strength by approximately four orders of magnitude. Together, our findings establish the security boundaries and operating conditions of DSM, providing design guidance for low-resolution CVQKD transmitters.
arXiv·2026-10-16·Andrey M. Pupasov-Maksimov
No generated summary available for this entry.
overview
Original abstract
Separation of variables in Schrödinger equation allows an infinite-dimensional family of physically distinct field configurations that are dynamically indistinguishable in one selected sector, labeled by a conserved quantum number, while differing in all others. We call such a symmetry a partial isophase symmetry. Two main examples are considered: axially symmetric magnetic backgrounds (a rigid spectral flow of the Fock--Darwin oscillator, purely magnetic isophase families, and a two-channel extension) and a Cartesian slab geometry (magnetic barriers in two-dimensional electron gases, treated in the Appendices). We further discuss the consequences of this symmetry for the inverse spectral problem and consider its quasiclassical counterpart.
arXiv·2026-10-16·M. Haider Akbar, Onur Pusuluk, Özgür E. Müstecaplıoğlu
No generated summary available for this entry.
overview
Original abstract
We study which input-output behaviours of several agents can be produced by a declared communication schedule, that is, a fixed sequence of senders, recipients, message alphabets, and output times, together with shared randomness. Since a schedule admits only finitely many deterministic protocols, membership is a linear program, and an infeasible target is excluded by a separating inequality. Under explicit operational assumptions, we prove that the affine hull of the achievable behaviours is described exactly by the equalities stating that each joint output statistic depends only on the inputs that can reach the agents involved, so that a violated equality identifies both the statistic and the missing input. One binary message per event already attains this affine hull, so message capacity restricts which behaviours are achievable without being visible to any equality. We apply the result to one-bit broadcast and relay hierarchies for two and three agents, and to low-order projections of the local polytope.
arXiv·2026-10-16·Anila Khan et al.
No generated summary available for this entry.
overview
Original abstract
We study how a second qubit can improve the estimation of spin-environment parameters when only one of the two qubits is measured. Both qubits are coupled to a common spin bath through the exactly solvable central-spin model, in which populations and coherences both evolve. Because the bath operator coupled to the qubits commutes with the bath Hamiltonian, the environment induces no effective interaction between the qubits. Without initial correlations or direct inter-qubit coupling, the two-qubit probe therefore performs exactly like a single qubit. When initial system-environment correlations are included, preparing the second qubit reshapes the environment statistics in a parameter-dependent way, and the measured qubit reads out this imprint. This improves the quantum Fisher information (QFI) for the coupling strength by factors of 3-4 relative to a correlated single-qubit probe, and by more than an order of magnitude relative to an uncorrelated one. For temperature estimation, the improvement reaches a factor of about 8. A direct Ising coupling does not help by itself, but the advantage persists in its presence. We also derive the classical Fisher information for arbitrary projective measurements and identify the measurement that saturates the QFI, which in general lies out of the equatorial plane of the Bloch sphere.
arXiv·2026-10-16·Zuo Wang, Liang He
No generated summary available for this entry.
overview
Original abstract
In parity-time (PT)-symmetric non-Hermitian systems, an exceptional point, where eigenvalues and eigenvectors coalesce, typically separates a real spectrum from complex-conjugate eigenvalues. In logarithmic conformal field theories (LCFTs), such an exceptional point appears in the spectrum of scaling dimensions. Holographic models of LCFTs, such as the dipole model, are built exactly at this point. Here, we deform the holographic dipole model so that its two coalescing scaling dimensions split into either two real ones or a complex-conjugate pair. We obtain the renormalized two-point functions in closed form. They change continuously from a linear combination of two power laws, through the logarithmic form of the LCFT at the exceptional point, to log-periodic oscillations. For any pair of scalar primary operators with real mixing under dilatations, the conformal Ward identities fix this form up to two normalization constants, which the holographic dictionary determines. In PT-symmetric theories with such a dilatation operator, real and complex-conjugate scaling dimensions correspond to the PT-unbroken and PT-broken phases. In the BTZ black hole at finite temperature, the difference between the quasinormal frequencies associated with the two scaling dimensions changes from purely imaginary to purely real across the real-to-complex spectral transition. Correspondingly, the linear response changes from overdamped to underdamped, with critical damping at the exceptional point.
arXiv·2026-10-16·Leonardo Ermann
No generated summary available for this entry.
overview
Original abstract
We open the quantum baker map with a position window of width $w$ and center $q_c$. Classical pruning tiles the $(q_c,w)$ plane into diamonds where the $T$ leading resonances form root-of-unity multiplets. At $w=1/2$ one periodic orbit survives for almost every $q_c$, and the multiplets are quantized without free parameters: their modulus $2^{-1/2}$ saturates the pressure bound and their phase is the orbit action. They form cycling multicomponent cat states, and the opening becomes one mid-circuit measurement, enabling spectroscopy with $\sim10^2$ shots on quantum processors.
arXiv·2026-10-16·Weikang Li
No generated summary available for this entry.
overview
Original abstract
We prove that a quantum walker cannot search a two-dimensional lattice in Grover's $O(\sqrt N)$ time, resolving the long-standing open question posed by Aaronson and Ambainis in 2003. A walker that hops between neighbouring sites of an $L\times L$ lattice, $N=L^2$, needs $Ω(\sqrt{N\log N})$ local steps at least to find a marked vertex, even with unlimited memory and free queries. Hence, Tulsi's algorithm is asymptotically optimal. Our proof rests on a surprising correspondence with classical electrostatics. We treat the marked vertex as a point charge and weight the overlap between the walker's states with and without the mark by the potential drop, which vanishes where queries act. Only local steps change this weighted overlap, at a rate limited by the field energy, so the lower bound is set by the self-potential of the charge. In the plane this self-potential grows logarithmically with system size, like the Coulomb potential, leading to the extra root-logarithmic factor. Several marked vertices turn the charge into a conductor, and the lower bound depends on their arrangement through its capacitance.
arXiv·2026-10-16·Kenny Gregory et al.
No generated summary available for this entry.
overview
Original abstract
The success of long-distance quantum communication will hinge on quantum repeater nodes equipped with robust and scalable quantum memories. Such memories must possess specific operating characteristics to make these nodes practical. An attractive option for these memory devices is an atomic warm vapor system operating under the conditions of electromagnetically induced transparency (EIT). These systems are easy to implement and require relatively low equipment overhead. A key metric in atomic-based quantum memory performance is optical depth, as it is closely tied to the strength of light-matter coupling. Here, we simulate and measure the optical depth-based performance of an EIT quantum memory using a warm atomic vapor cell. We then translate the simulated and measured optical depth and efficiency metrics into expected entanglement distribution rates. Our analysis evaluates the feasibility of these memories in optical quantum repeater nodes, which are essential for robust long-distance quantum communication.
arXiv·2026-10-16·Zijie Liu et al.
No generated summary available for this entry.
overview
Original abstract
Bayesian inference enables self-consistent plasma parameter inversion in tokamak integrated data analysis by fusing multi-source diagnostics. However, under nonlinear Gaussian likelihoods, finding the maximum a posteriori (MAP) estimate typically relies on sampling methods whose high computational overhead precludes real-time plasma control. To address this bottleneck, we propose a Bayesian inversion framework using a Coherent Ising Machine (CIM)-a quantum computing architecture based on coupled degenerate optical parametric oscillators (DOPOs). With native all-to-all connectivity, the CIM directly maps the negative log-posterior potential onto a spin Hamiltonian and leverages quantum vacuum fluctuations for rapid state-space search during pitchfork bifurcation. Validated on plasma current profile inversion for the EAST tokamak, this method achieves a single-run solution time of approximately 1 ms. Although current qubit limits necessitate a block-wise iterative scheme that prevents full real-time execution today, rapidly scaling quantum hardware offers a clear pathway toward real-time tokamak control.
arXiv·2026-10-16·Peter Iveson et al.
No generated summary available for this entry.
overview
Original abstract
We demonstrate a fully fibre-integrated source of broadband polarisation-entangled photon pairs at telecom wavelengths based on a commercially available Zn-indiffused MgO:PPLN ridge waveguide incorporated within a Sagnac interferometer. Operating across the full degenerate SPDC spectrum using pump-suppression filtering only, the source exhibits a measured bandwidth of approximately 67 nm. Strong non-classical correlations are observed, with an average two-photon interference visibility of 96.9 +/- 0.2 %, a fidelity to the Phi + Bell state of 78.1 %, and a CHSH Bell parameter of S = 2.501 +/- 0.005. We further explore the effect of increasing source brightness on Bell-state performance, revealing the limitations of accidental-corrected metrics in high-flux operating regimes.
arXiv·2026-10-16·Gianna M. Del Corso
No generated summary available for this entry.
overview
Original abstract
We study how to compute $f(A)b$ on a quantum computer, where $A$ is Hermitian. When $f$ is nonsmooth or has localized difficulty in the spectrum, classical numerical linear algebra approximates it with rational functions rather than polynomials. We propose the Cayley transform, parameterized by $σ\in \mathbb{R}$ and $γ> 0$, as an alternative to the standard quantum access model. The two parameters let one concentrate accuracy where $f$ is difficult, which standard models can achieve only by raising the polynomial degree globally. This transformation converts Hermitian matrices to unitaries, allowing generalized quantum signal processing to apply Laurent polynomials bounded on the unit circle. We compare three access models (block encoding, matrix exponential, and Cayley encoding) in terms of query complexity and of the cost of their circuit realization. When the difficulty of $f$ is localized in the spectrum, the Cayley encoding reduces the required degree by a factor of three to four, and it represents the shifted resolvent exactly at degree one. For spectral projectors, the standard models cannot reach the target accuracy at fixed degree, because their approximants cannot concentrate resolution near the discontinuity. Realizing the Cayley encoding from a block encoding requires solving a shifted linear system, whose cost offsets its query-complexity gain over the standard models. For structured matrices arising in practice, however, low-depth circuits for the encoding can be constructed directly, and the gain is preserved at the circuit level.
arXiv·2026-10-16·Saim Rehman, Muhammad Shafique
No generated summary available for this entry.
overview
Original abstract
Deploying quantum neural networks (QNNs) on sparse hardware requires preserving task accuracy while reducing compiler-induced two-qubit gates, SWAPs, and depth. We present ConQUESTA (\underline{C}onstrained \underline{Qu}antum \underline{E}ntangler \underline{S}election with \underline{T}opology \underline{A}wareness), a post training pruning framework that combines task saliency with compiler cost, screens candidate entanglers, and searches complete pruning masks under an explicit accuracy constraint. Unlike one-shot ranking, each mask is transpiled as a whole across multiple coupling topologies. Across 4-, 6-, and 8-qubit QNNs and eight model seeds at 55% pruning, ConQUESTA achieves mean resource reductions of 61.6% on Breast Cancer, 72.0% on Digits01, and 82.2% on Iris, exceeding the strongest matched simple baseline by 3.5, 1.7, and 8.9 percentage points, respectively. Fixed-mask recovery raises feasibility from 16/24 to 22/24 runs. In a fixed-k=4 scaling study on a scaling probe of 4 to 12-qubits, the raw mask space grew from 495 to 12.1M while the evaluated masks increase only from 189 to 305. Resource-weight changes alter depth/routing priorities with at most a 0.44-point mean validation shift.
arXiv·2026-10-16·Fong Yew Leong et al.
No generated summary available for this entry.
overview
Original abstract
High-dimensional Vlasov equations present promising use cases for quantum simulation, but their transport coefficients must be implemented coherently in order to preserve a compact quantum representation. We develop explicit Schrödingerised circuits for prescribed external field Vlasov dynamics without classical field updates. In 1D1V, velocity-dependent streaming is compiled directly from the encoded velocity register, while a non-linear cubic field is evaluated using reversible fixed-point arithmetic. For fixed polynomial degree, the field workspace scales linearly with the coordinate register width, while the field evaluation subroutine has polynomial depth. As a proof of concept, we simulate a minimal coupled 3D3V anharmonic Penning system and realise mixed electric-field terms and transverse magnetic coupling on a six-dimensional phase space in agreement with classical calculations. Resource analysis shows approximately linear growth with the number of time steps, while identifying the auxiliary register as the dominant depth bottleneck. Structured preparation and register recovery of the auxiliary state reveal an interplay between loading cost and readout. Together, our algorithm demonstrates a fully coherent quantum simulation of high-dimensional Vlasov dynamics with variable coefficients and identifies the practical resource costs that must be controlled for large-scale quantum implementation.
arXiv·2026-10-16·Ranjit Singh, Alexander E. Teretenkov
No generated summary available for this entry.
overview
Original abstract
We extend our previous study of squeezed two-component Schrödinger cat states to a phase-referenced single-mode family with an arbitrary number $N$ of coherent components and general relative phases. Within the established circular-state construction, we derive a closed complex overlap kernel for the ordered action of displacement, phase rotation, and squeezing, retaining exact finite-amplitude normalization. We distinguish finite-displacement orthogonality from local phase-estimation sensitivity quantified by quantum Fisher information (QFI). For equal-phase states, we compare $N=2,\ldots,9$ at a common mean photon number and include coherent-state and squeezed-vacuum benchmarks. A bound on the higher photon-number sectors establishes the fixed-energy asymptote $F_{Q,N}=4\bar n(N-\bar n)+o(1)$. Its leading term agrees with the known QFI of a vacuum--$N$-photon superposition. The resulting decrease of the ideal local quantum Cramér--Rao bound does not establish unlimited attainable precision: prior phase information, sample size, phase-reference resources, optical loss, state preparation, and measurement choice remain relevant.
arXiv·2026-10-16·Andrea Sacchetti
No generated summary available for this entry.
overview
Original abstract
Since the 1990s, experiments on double-well heterostructures have highlighted a key phenomenon: applying an external DC electric field induces pronounced wave packet oscillations at specific field strengths. \ To gain a deeper insight into this effect, a comprehensive quantitative analysis of the properties of quantum resonances near a crossing point is required. \ This approach lays the theoretical foundation for devising a quantum sensor capable of rapidly and efficiently determining whether the strength of an external DC electric field lies within a narrow target range.
arXiv·2026-10-16·Andreas Leitherer et al.
No generated summary available for this entry.
overview
Original abstract
Bell and contextuality scenarios are unified within the Acín-Fritz-Leverrier-Sainz hypergraph formalism, in which measurements are hyperedges. Multipartite measurements are obtained from product rules that combine independent contextuality scenarios into a single hypergraph. Several such rules exist: they are structurally distinct, yet yield the same classical, quantum, and boxworld correlations. Here, we show that this difference is not incidental, unveiling an unexpected connection. The measurements of composite Bell scenarios are exactly the process functions, the deterministic classical communication protocols that may be non-causal, i.e., lack a definite causal order without generating paradoxes. Validity of a hyperedge and logical consistency of a process function are thus one and the same condition. This allows us to characterize process functions by normalization and no-signaling alone, providing transformations that generate non-causal process functions from no-communication ones. The product rules, in turn, order process functions by causal structure, from no-communication to non-causality, which yields a graphical criterion for the latter: a process function is non-causal precisely when its hyperedge is generated by the disjunctive but not the maximal product. We thereby obtain the first joint hypergraph representation of (non-causal) process functions and (nonlocal-without-entanglement) measurements, recasting classical non-causality as a non-standard way of composing black boxes.
arXiv·2026-10-16·Michael V. Davidovich
No generated summary available for this entry.
overview
Original abstract
Based on the complex analysis theorem the principle of argument, a temperature-dependent formula for the Casimir-Lifshitz dispersion force of the interaction of two arbitrary plane-layered structures separated by either a vacuum gap of size d or a layer of size d consisting of an arbitrary dissipative dielectric with dispersion is derived. The formula consists of the temperature-dependent Lifshitz formula plus the temperature-dependent contour integral
arXiv·2026-10-16·Harold B. Meerwaldt et al.
No generated summary available for this entry.
overview
Original abstract
Quantum computers require software to control the states of the qubits. As the actions on qubits grow in complexity with circuit execution, calibration, and benchmarking, the complexity of the control software grows in tandem. Spin-qubit quantum computers are at a stage where experimentalists need low-level access for tuning and calibration, and quantum algorithm researchers want high-level circuit-level access. In this article, we present the software design of SpinControl. SpinControl integrates three architectural metrics: 1) customizability, to allow prototyping devices and measurement protocols, is achieved by separating data and behaviour; 2) modularity and extensibility are achieved by separating functionalities into different components; and 3) robustness, to reliably execute quantum circuits on many qubits, is achieved by CI pipelines and input validation. SpinControl allows different types of measurements while customizing the instruments used, the pulse or circuit program executed, and the data processing. It allows building standardized experiments from measurement and analysis building blocks and executing these for calibration in a custom and conditional order. SpinControl implements these functionalities alongside robust configuration and data management, a connection to the cloud, and calibration scheduling. Pulse and circuit compilation, virtual gate matrices, as well as spin-qubit-specific GUIs integrated by SpinControl, make heavy use of software packages developed by Delft University of Technology: pulse lib, core-tools (both open source), and QConstruct
arXiv·2026-10-16·Johannes Jakubik et al.
No generated summary available for this entry.
overview
Original abstract
The Quantum Approximate Optimization Algorithm (QAOA) and its variants are leading algorithms to help solve challenging combinatorial optimization problems. QAOA maps these problems to Ising Hamiltonians such that their ground state is the desired solution. Candidate solutions are then drawn from a variational quantum circuit. The performance of QAOA hinges on a set of variational angles. However, finding good angles is an instance-specific and computationally expensive non-convex classical optimization task. Here, we learn the mapping from the problem instance to high-quality QAOA angles. Our learned models replace the per-instance optimization, that we call the solver, with a single forward pass that is several orders of magnitude faster than the solver with a near identical quality. Our models further generalize to unseen topologies such as Barabási-Albert and 2D grid graphs. Experiments on quantum hardware confirm that QAOA samples with angles produced by our open-source models are indistinguishable from solver angles. Crucially, models sensitive to the topology of the problem instance increase the quality of the QAOA angles. Our work amortizes a major bottleneck in QAOA by an up-front data generation and training cost. Importantly, this cost can be amortized over time in settings where many similar problems are optimized on a regular basis, as is often the case in applications for industry.
arXiv·2026-10-16·Igor C. Oliveira
No generated summary available for this entry.
overview
Original abstract
We establish an unconditional super-polynomial separation between quantum and classical PAC learning of Boolean functions under the uniform distribution in the large error regime. For every advantage $λ(n) = n^{-ω(1)}$, we construct a concept class that a polynomial-time quantum learner learns to agreement $1/2+λ(n)$ with success probability at least $1-1/n^k$. The learner uses only quantum random examples and outputs a polynomial-size deterministic classical circuit. In contrast, no polynomial-time classical learner achieves agreement $1/2 + λ(n)/n^k$ with success probability greater than $1/n^k$, even with membership queries. To achieve this, we develop a nearly-optimal quantum learner that uses quantum random examples to produce a hypothesis achieving a prescribed correlation with an arbitrary Boolean function. The learner generalizes Fourier sampling from parity hypotheses to quadratic hypotheses. While standard Fourier sampling is insensitive to the sign of the correlation, we use interference to bias sampling toward positively correlated hypotheses. This is combined with a careful analysis of the resulting distribution to boost both the learner's success probability and its agreement with the target function. We believe that the resulting quantum learning algorithm might be of independent interest. Finally, although a robust quantum PAC learning advantage holds unconditionally in the large error regime, we note that an analogous separation between quantum and classical learning in the small error regime would imply that $\mathsf{NP} \nsubseteq \mathsf{BPP}$.
arXiv·2026-10-16·S. P. Sorella
No generated summary available for this entry.
overview
Original abstract
We give an explicit construction of a pair of anticommuting Weyl displacement operators for a harmonic oscillator and use bounded functional calculus to obtain exact dichotomic representatives of the Pauli algebra. Two independent oscillators provide commuting Pauli algebras for Alice and Bob. The standard singlet-sector projector, written entirely in terms of these bounded oscillator observables, is then applied to the two-oscillator vacuum. We show explicitly that the projected vacuum has nonzero norm, so its normalization is well defined, has the exact singlet correlations, and reaches the Tsirelson value $2\sqrt2$ for the usual Bell--CHSH settings. We also clarify that the construction generally realizes a singlet sector with multiplicity, rather than selecting a unique vector in the full oscillator Hilbert space, and we compare the construction with the older pseudospin approach to continuous-variable Bell tests.
arXiv·2026-10-16·E. J. W. Koh, Rongjie Zhang, Dzmitry Matsukevich
No generated summary available for this entry.
overview
Original abstract
The exponential-SWAP (eSWAP) gate generates a coherent superposition of identity and SWAP operations, with continuously tunable amplitudes. We experimentally implement this gate between two bosonic motional modes of trapped ions using spin-independent and spin-dependent beam splitter interactions. Measurements of selected slices of the joint characteristic function for distinct input states test the gate and demonstrate continuous control of the identity-SWAP superposition. This implementation provides a tunable interaction for hybrid qubit-bosonic quantum information processing.
arXiv·2026-10-16·Kota Watanabe et al.
No generated summary available for this entry.
overview
Original abstract
We theoretically study dc electric currents induced by rapid spin precession in noncentrosymmetric magnetic Weyl semimetals using the Floquet--Keldysh Green's-function formalism. The spin dynamics act as a time-dependent chiral gauge field and the geometric structure of electric currents is expressed in terms of the Berry curvature, the quantum metric, and the shift vector. For an isotropic Weyl cone, only an injection current is generated. This current scales quadratically with the driving frequency and linearly with the relaxation time associated with coupling to a fermionic bath. We further show that a finite Weyl-cone tilt modifies the available interband-transition phase space, smooths the frequency dependence of the current, and allows for a shift current and another type of injection current, both of which flow in directions determined by the tilt and the direction of the precession. A finite net current can remain after summing contributions from Weyl nodes of opposite chiralities when their transition phase spaces are inequivalent.
arXiv·2026-10-16·Noé Delorme, Simon Perdrix
No generated summary available for this entry.
overview
Original abstract
Control is a fundamental concept in quantum and reversible computational models. It enables the conditional application of a transformation to a system, depending on the state of another system. We introduce a general framework for diagrammatic reasoning featuring control as a constructor. To this end, we provide an elementary axiomatization of control functors, extending the standard formalism of PROPs to controlled PROPs. As an application, we show that controlled PROPs facilitate diagrammatic reasoning for quantum circuits. In particular, they admit a simple and complete axiomatization involving at most three qubits, whereas in the standard PROP setting, completeness necessarily requires axioms involving arbitrarily many qubits.
arXiv·2026-10-16·Byeongyong Park, Keunhong Jeong, Doyeol Ahn
No generated summary available for this entry.
overview
Original abstract
To solve linear systems $Ax=b$, we propose a sample-based quantum linear solver combining quantum Krylov-state sampling with classical variational diagonalization. Rather than simulating the cost Hamiltonian $H_b(A)=A^\dagger(I-|b\rangle\langle b|)A$, we measure quantum Krylov states $e^{-iAT}|b\rangle$ generated by the original Hermitian operator $A$ in the computational basis. We then classically diagonalize the projected cost Hamiltonian to reconstruct an approximate solution. Using a representation of $A^{-1}|b\rangle$ as a linear combination of quantum Krylov states, we derive lower bounds on computational-basis sampling probabilities from solution amplitudes. We establish support-discovery guarantees for finite nonnegative-time grid sampling and signed-time sampling, which permits both positive and negative evolution times. The former bounds the maximum evolution time, whereas the latter improves ideal shot complexity at the cost of occasional long evolutions. For a condition-number bound $κ$ on $A$, a lower bound $β_L$ on the solution probability weight of each of $L$ target basis states, and failure probability $δ$, signed-time sampling achieves $O(κ^2β_L^{-1}\log(L/δ))$ shots, matching a worst-case lower bound up to constants within an evolution-only observation model in a specified parameter regime. Finally, we analyze the effects of finite-length qDRIFT compilation and circuit reuse on sampling and derive an infidelity bound for the reconstructed solution.
arXiv·2026-10-16·Ying-Cheng Yang, Jhen-Dong Lin, Yueh-Nan Chen
No generated summary available for this entry.
overview
Original abstract
Non-invertible symmetries extend conventional symmetries beyond group-like transformations and play an important role in quantum field theory and many-body physics. However, a general framework of non-invertible symmetries in open quantum systems is still lacking. Here, we formulate a general Liouville-space duality framework that extends Hilbert-space non-invertible dualities to open quantum systems. The resulting defect relates Liouvillians with dual Hamiltonian and dissipative parameters and becomes an exact symmetry at self-duality. We apply this framework to the periodic transverse-field Ising chain with two collective Lindblad channels exchanged by Kramers--Wannier (KW) duality. A strong $\mathbb{Z}_2$ symmetry divides Liouville space into four parity sectors, while the defect acts nontrivially only in the even-even sector. At self-duality, the KW defect imposes a momentum-resolved selection rule on Liouvillian Jordan blocks. Modes with different Liouville momenta or KW-defect eigenvalues cannot form a common exceptional Jordan block. For a three-site chain, a global Rényi-2 KW asymmetry dynamically identifies the self-dual conditions. At the same time, the spectral structure exhibits both a semisimple degeneracy and a self-dual exceptional point with a perturbation-selective response. These results extend non-invertible dualities to Markovian quantum dynamics and establish a symmetry-based selection rule for Liouvillian Jordan structures.
arXiv·2026-10-16·Alexander Orlov et al.
No generated summary available for this entry.
overview
Original abstract
Predicting chemical reactions in biomolecules is challenging because reactive centers are embedded within complex environments that strongly influence their energetics and mechanisms. Here, we present a hybrid quantum-classical workflow that combines molecular dynamics, density functional theory, and correlated wavefunction methods, tightly integrating CPUs, GPUs, and quantum processing units (QPUs) to enable simulations across multiple length and accuracy scales. We apply this approach to ADGRG1 autoproteolysis, a maturation reaction in an adhesion G protein-coupled receptor that has not previously been studied using correlated electronic-structure methods. Our simulations treat a biologically realistic system containing more than one million atoms, including the full-length uncleaved receptor embedded in an endoplasmic-reticulum membrane, while incorporating a 54-qubit IQM quantum processor and up to 1,200 NVIDIA H100 GPUs. These results demonstrate how quantum computers can serve as accelerators within scalable scientific workflows, extending correlated electronic-structure methods to biologically relevant systems.
arXiv·2026-10-16·Klaus D. Jöns, Dorian A. Gangloff, Doris E. Reiter
No generated summary available for this entry.
overview
Original abstract
Photonic quantum technologies are based on controlled photon states. To generate these, quantum dots have emerged as excellent sources of single and entangled photons. In this Perspective, we briefly review the chronological development of quantum dots as photon sources, from their beginnings as quantum emitters in the early 2000s to the advanced photonic devices being developed today. We highlight the interplay between fundamental research and industrial aspects before discussing the photonic quantum technologies we expect to emerge in the near future.
arXiv·2026-10-16·Yuuya Chiba, Ryusuke Hamazaki
No generated summary available for this entry.
overview
Original abstract
We identify a class of nonintegrable quantum many-body systems composed of single Pauli strings that possess an extensive number of noncommuting local conserved quantities and exhibit partial ergodicity breaking due to exponentially degenerate energy spectra. We show that such systems exhibit a novel mechanism, Hilbert-subspace cloning, where the identical chaotic Hamiltonian acts on each of exponentially many disconnected Hilbert subspaces. Although the dynamics within each clone thermalizes, quantum coherence between clones remains protected and detectable by local observables. Consequently, the long-time behavior of local observables is described by a coherence-preserving partial Gibbs ensemble, where the hidden subsystem retains its initial quantum coherence.
arXiv·2026-10-16·Ritesh Kumar Palai et al.
No generated summary available for this entry.
overview
Original abstract
We investigate dynamical quantum phase transitions (DQPTs) in the extended Agassi model following sudden quenches of same level pairing ($Σ$), monopole-monopole ($χ$) and cross level pairing ($Λ$) strengths. Using exact diagonalization, we characterize the non-equilibrium dynamics through the Loschmidt echo and intensive return-rate function. Quenches across equilibrium phase boundaries produce cusp-like structures in the return rate that shows non-analyticities with increasing system size. Equilibrium finite size to large scaling identifies the $χ$-driven transition as a second order phase transition similar to mean-field, Dicke, and Lipkin-Meshkov-Glick (LMG) models critical behaviour with the exponent of the order parameter $β\simeq 1/2$, while the $Σ$- and $Λ$-driven transitions are first order. We further characterize the associated dynamical singularities through a local scaling exponent $α$, with $α_χ\simeq 2/3$, $α_Λ\simeq 1/3$, and $α_Σ\simeq 3/2$ of all three parameters. The distinct scaling behaviours across the parameter channels show that dynamical criticality is not determined solely by the equilibrium order of the transition, revealing multiple dynamical scaling regimes. These non-analyticities are associated with the Fisher zeros of the Loschmidt amplitude, which cross the real time axis at critical times and the time derivatives of the return-rate function to characterize the order of DQPTs within the extended Agassi model.
arXiv·2026-10-16·Harumichi Nishimura
No generated summary available for this entry.
overview
Original abstract
Private simultaneous quantum messages (PSQM) provide a minimal model of noninteractive secure multiparty quantum computation, yet their communication complexity for concrete functions remains poorly understood. We show that familiar total functions already exhibit both genuine quantum advantages and strong structural limitations. For three-party equality on $n$-bit inputs, which determines whether the players' $n$-bit strings are identical, we construct an entanglement-assisted protocol with asymptotic communication $(1.633\ldots)n$ qubits, whereas every perfectly correct protocol without prior entanglement requires at least $3n$ qubits. For three-bit majority, one shared GHZ state and one transmitted qubit per player suffice for perfect correctness and perfect privacy, reducing the communication from the optimal classical cost of six bits to three qubits. Three-bit AND behaves differently. No perfectly correct and perfectly private protocol exists when the players share an arbitrary three-qubit state, apply arbitrary local unitary encodings, and transmit one qubit each. However, increasing the local dimension overcomes this obstruction: one shared three-qutrit GHZ state and one transmitted qutrit per player yield a one-shot protocol with total communication $3\log_2 3$. Together with the six-bit classical lower bound, this gives a strict quantum communication advantage. More generally, for every $k\geq 3$, we construct a perfectly correct and perfectly private one-shot protocol for $k$-bit AND using one qudit of dimension at most $k$ per player, and hence at most $k\log_2 k$ qubits in total.
arXiv·2026-10-16·Emmanuel D. G. U, Roy D. Jara, Jayson G. Cosme
No generated summary available for this entry.
overview
Original abstract
We investigate the dynamics of coupled discrete time crystals (DTCs) in the coupled Dicke model or Dicke dimer (DD) with dissipation. By numerically simulating the mean-field dynamics of the system, we show that coupling two DTCs decreases their oscillation amplitude following a transient relaxation period. For sufficiently strong coupling, the coupled DTCs become unstable, resulting in the system relaxing towards the normal phase (NP). We demonstrate that the relaxation time diverges near the critical coupling strength, suggesting a continuous phase transition. Using the truncated Wigner approximation (TWA), we explore how the dynamics are affected by the introduction of quantum fluctuations. We also consider a scenario in which an NP is briefly coupled to a DTC, seeding the NP to transform into a DTC that is either synchronized or anti-synchronized relative to the DTC. We investigate the robustness of this phenomenon in the presence of noise. Using these results, we propose a scheme to perform NAND and NOR operations with three DTCs by sequentially coupling the input and output sites. We identify the parameter regimes in which the logic gate architecture remains valid, and investigate how the protocol is affected by the presence of quantum fluctuations.
arXiv·2026-10-16·Chengshen Gao, Zongxing Xiong, Lvzhou Li
No generated summary available for this entry.
overview
Original abstract
Estimating statistical properties of probability distributions is a fundamental problem in statistics and theoretical computer science. We develop quantum algorithms for estimating the $q$-Tsallis entropy $\mathrm{H}_q^{\mathrm{Tsa}}(P) =\frac{\sum_{i=1}^n p_i^q-1}{1-q}$ when $0<q<1$, given purified quantum query access to a distribution $P$ on $[n]$. When $0<q\leq \frac{1}{2}$, we provide a quantum algorithm with query complexity $\widetilde{O}\rbra{\left(\frac{n}{\varepsilon}\right)^{\frac{1}{2q}}}$, which is optimal up to polylogarithmic factors. When $\frac{1}{2}<q<1$, we introduce a two-stage simultaneous probability estimation procedure, yielding a quantum algorithm with query complexity $\widetilde{O}\left(\frac{n^{\frac12+\frac{1}{2q}}}{\varepsilon^{\frac{1}{2q}}}+\frac{n^{1-q}}{\varepsilon}\right)$, which improves the result given by Chen et al. (ICALP 2026) when $\varepsilon=O\rbra{n^{1-2q}}$.
arXiv·2026-10-16·Seng W. Loke
No generated summary available for this entry.
overview
Original abstract
An encoding choice specifies the quantum error-correcting code used to encode logical qubits at a given node. Different encoding choices may differ in the number of physical qubits, the number of encoded logical qubits, the code distance, and the available fault-tolerant operations. We study different encodings for a distributed transversal fanout operation and look at its implications on node architecture. Our experiments suggest that an encoding with higher distance, even if requiring more ebits, can yield a lower logical error rate for distributed operations, and that ``upgrading'' an encoding prior to distributed operations and having a cache, as part of node architecture, for qubits can be useful for distributed operations.
arXiv·2026-10-16·Jinhyeok Heo et al.
No generated summary available for this entry.
overview
Original abstract
We propose a hybrid quantum-classical framework for the unambiguous discrimination of pure states by combining the noisy intermediate-scale quantum semidefinite program solver (NSS) with the reciprocal-state representation. In NSS, a given semidefinite program (SDP) is represented within a subspace spanned by chosen ansatz states, with the required quantities estimated using quantum circuits, and the resulting optimization is performed classically. This makes NSS naturally applicable to discrimination problems involving circuit-prepared states, as finding a discrimination measurement can be formulated as an SDP. By choosing the discriminated states themselves as the ansatz and exploiting the reciprocal-state representation, the general matrix-variable NSS formulation is reduced to an optimization over N scalar variables, where N is the number of discriminated states. The resulting formulation reduces the number of optimization variables and positive-semidefinite constraints compared with the original NSS formulation. We further establish robustness guarantees against Gram matrix estimation errors, including a rescaling procedure that guarantees a valid positive operator-valued measure (POVM) under bounded perturbations. The resulting bounds quantify both the deviation in average success probability and violations of the no-error condition using only the estimated Gram matrix, its SDP solution, and a characterized perturbation bound, without access to the ideal Gram matrix. Numerical simulations validate the derived robustness bounds and characterize finite-shot scaling. We also perform experiments on IBM quantum hardware to estimate pairwise overlaps, and then evaluate the performance of the resulting POVMs.
arXiv·2026-10-16·Chandrachud Pati, Yogesh Simmhan
No generated summary available for this entry.
overview
Original abstract
Quantum processors are increasingly used as accelerators inside high-performance computing (HPC) workflows. A workflow runtime decides which quantum circuits to run, how to group them into provider jobs, and what to repeat after a failed attempt. Many search problems split into independent parts, but the runtime can use that structure only when the workflow exposes the parts and a validity check for each one. SemQBench measures what a runtime gains from this visibility. It compares seven execution policies for the same search problem, including two controls without amplitude amplification. The policies change one runtime choice at a time: whether to amplify, whether partial results may be combined across runs, whether the parts share one circuit, and what a retry keeps. We run them on the 20-qubit IQM Garnet processor using 106 distinct circuits in three jobs, and report circuit executions, active device time, and provider jobs separately before combining them in a cost model. Amplifying the problem as one whole circuit shows no statistically clear gain over random sampling and uses 6.7-104$\times$ more active device time. Exposing the parts and collecting valid partial results across a fixed batch of runs cuts the executions needed for 95% completion confidence by 2.20-4.00$\times$, and this policy is never worse than the other amplified policies in executions, device time, or jobs; it is selected in 99 of 108 overhead settings. Fewer executions do not always mean less device time: on one workload, executions fall from thirteen to four while active device time rises from 7.44 to 9.81 $μ$s. Exposing problem structure therefore gives the runtime a strong default policy and the measurements needed to decide when the simpler unamplified option is cheaper.
arXiv·2026-10-16·Edric Matwiejew et al.
No generated summary available for this entry.
overview
Original abstract
Two-stage stochastic combinatorial optimisation concerns discrete decisions made before all relevant information is known. An initial decision is made; once uncertainty is resolved, it can be adapted to the realised scenario, at a cost. The aim is to find the initial decision that minimises the upfront cost plus the expected cost of optimal adaptation. The first-stage decision problem is often NP-hard, and computing the expected minimum recourse cost can be $\#\mathrm{P}$-hard for a single first-stage candidate. We introduce Quantum Approximate Stochastic Combinatorial Optimisation (QASCO), a variational quantum-walk ansatz that coherently incorporates scenario-dependent recourse into its dynamics to search over first-stage decisions without explicitly evaluating expected minimum recourse costs. We demonstrate QASCO for MaxCut with stochastic edge weights, obtain a circuit with polynomial per-layer gate complexity, and study the ansatz via exact state-vector simulation. Across the instances considered, QASCO concentrates amplitude more effectively on stochastic-optimal first-stage decisions than a previously proposed two-stage QAOA construction. We further show that the ansatz can be calibrated using a depth-independent number of parameters and applied to unseen instances without further circuit-parameter optimisation, including joint decision--scenario--recourse spaces spanning more than $2^{32}$ configurations. Under a query-cost model, comparison with the tested classical heuristics using sample-average approximations of the expected minimum recourse cost shows that QASCO more reliably reaches globally optimal first-stage solutions while requiring fewer cut evaluations. These results show how to incorporate scenario-dependent recourse into the ansatz dynamics, providing a general framework for variational quantum walks in two-stage stochastic combinatorial optimisation.
arXiv·2026-10-16·Enbo Zhang et al.
No generated summary available for this entry.
overview
Original abstract
Spin waves carry their propagation direction in the handedness of their circularly polarized stray field, a property inaccessible to scalar magnetometers. In the Damon-Eshbach surface wave of an in-plane magnetized film, the dipolar field above the film rotates with a handedness fixed by the direction of travel. The nitrogen-vacancy (NV) centre in diamond is an intrinsic polarization analyser: a right-handed field about the NV axis drives one spin transition, and a left-handed field drives the other, in both the ground and the excited state. Here, we exploit the two excited-state transitions, which lie inside the spin-wave band of yttrium iron garnet (YIG), as a pair of chirality channels and image Damon-Eshbach waves in both directions. Because reflection from an etched boundary reverses the handedness, the incident and reflected waves appear as two lines in one spectrum and are imaged separately. In the ground state, the same rule applies, and the selected field drives Rabi oscillations, a route to chirality-selective control of the NV spin by magnons. Reading the two channels gives the direction of a spin wave at one point, without a phase reference. This advances chirality-resolved quantum sensing and provides insight into chiral spin-wave dynamics.
arXiv·2026-10-16·Will Cavendish
No generated summary available for this entry.
overview
Original abstract
The quantum foundations literature contains dozens of "no-signaling" arguments that rely on the Born rule or, more generally, the positive operator-valued measure (POVM) framework to show that the resources of non-relativistic quantum mechanics (NRQM) cannot be used to send superluminal signals. What these arguments typically establish, however, is not a prohibition on superluminal signaling per se, but the seemingly stronger claim that signaling at any speed between mutually isolated systems is forbidden. This paper gives a precise formulation of this claim, the no-signaling hypothesis, and investigates the following converse question: under what additional assumptions does it imply that all experimental outcome probabilities are described by POVMs? Surprisingly few are needed: given the standard NRQM representation of composite experiments and two textbook claims about marginal probabilities, the no-signaling hypothesis is equivalent to the universality of the POVM framework. More broadly, by formalizing the relevant concepts and deriving the logical relationships between them, the paper shows that the no-signaling hypothesis can be used to derive most, though not all, of the probability-generating fragment of NRQM. The resulting map of implications clarifies which common postulates of NRQM are logically interrelated and which can be modified independently.
arXiv·2026-10-16·Connor Kupchak et al.
No generated summary available for this entry.
overview
Original abstract
Silicon nitride has emerged as a key material for the advancement of future quantum communication and computational devices. However, challenges persist in establishing a comprehensive development process, spanning from fabrication to optical characterization, essential for advancing these devices to their next stage of potential. Maintaining control over the entire process, from start to finish, alongside device modeling, enables more efficient and timely iteration and optimization. Here we introduce a fabrication-to-benchtop process. We employ an in-house stoichiometric recipe for device fabrication and conduct comprehensive characterization of optical losses and material properties. Understanding and controlling the refractive index of the device are vital for predicting device geometries and group indices. Implementing the refractive indices of our fabricated devices, we simulate microring resonators and demonstrate their application in generating optical solitons.
arXiv·2026-10-16·Sumeng Wang, Xiaofen Huang
No generated summary available for this entry.
overview
Original abstract
We investigate genuine multipartite entanglement and genuine tripartite nonlocality of a noisy generalized GHZ state in Schwarzschild-de Sitter spacetime. The genuine multipartite concurrence and optimized Svetlichny parameter are employed to characterize these two quantum correlations. It is shown that the black hole and cosmological event horizons redistribute genuine multipartite entanglement differently among the physically accessible and inaccessible reduced states, while Svetlichny violation occurs only in the physically accessible state. We find that genuine multipartite entanglement can survive in the physically inaccessible states even when genuine tripartite nonlocality is absent. In addition, initial white noise suppresses both correlations, with Svetlichny nonlocality surviving over a narrower parameter region. Furthermore, in the Nariai limit, under the normalization adopted here, the correlations become concentrated in the physically accessible state. These results demonstrate the different robustness of genuine multipartite entanglement and genuine tripartite nonlocality under horizon effects and initial noise.
No generated summary available for this entry.
overview
Quantum Computing Report·2026-10-15·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Anderon, a quantum foundry operator, has released its first Superconducting Quantum Process Design Kit (PDK) for 300mm wafer fabrication. This PDK provides standardized design rules and building blocks for manufacturing superconducting quantum devices on their 300mm wafer line at the Albany NanoTech Complex. Anderon, backed by $2 billion in funding, offers various superconducting wafer types, including qubit, I/O signal, and amplifier/filter wafers. The post Anderon Releases First Superconducting Quantum PDK for 300mm Wafer Fabrication appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-15·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
FirstQFM AB has achieved a 33% reduction in single-qubit gate execution times on QuantWare’s 21-qubit Contralto-D21 superconducting quantum processor, without compromising gate fidelity. This was accomplished using their patented quantum foundation model technology, which integrates with Quantum Machines’ OPX control hardware and QUA calibration stack. The model, developed with NVIDIA’s accelerated computing infrastructure, also improved two-qubit Bell-state fidelities. The post FirstQFM Foundation Model Cuts Quantum Gate Times by 33% on QuantWare QPU via NVIDIA Computing appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-15·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Sweden is joining European Skills Academies for Quantum and AI, with Nordita supporting the Nordic-Baltic Quantum Academy and Swedish organizations contributing to AI skills development. The European Quantum Skills Academy (EQA) brings together 73 partners and more than 100 affiliates across 23 countries, with a €19.8 million budget over 48 months and 50% direct EU funding. The AI Skills Academy initiative in Sweden will focus on AI education for sectors including healthcare and social care, with an emphasis on user participation, democratic principles and responsible technology use. Photo from Pexels by Efrem Efre . PRESS RELEASE — As quantum technologies transition from the laboratory to the market, the demand for a highly skilled workforce has never been greater. To meet this challenge, EQA has officially launched to establish a comprehensive, pan-European ecosystem for quantum education and training. Nordita, the Nordic Institute for Theoretical Physics in Stockholm, will play a key role in this initiative supporting the leadership of the Nordic-Baltic Quantum Academy — one of the EQA’s six regional quantum academies. Supported by a total budget of €19.8 million over 48 months (with 50% of it directly financed by the European Union) the EQA is the largest community in quantum workforce development to date. The project unites 73 partners and over 100 affiliates spanning 23 European countries. Aligning with the EU Quantum Europe Strategy, the EQA is designed to overcome fragmentation and ensure that quantum technology benefits all of Europe equally, thus fostering Europe’s technological sovereignty. These efforts align as well with the newly published Swedish strategy for quantum technology, in which Nordic Quantum — a network coordinated from Nordita — is highlighted as an example of collaboration in the Nordic region. The fact that Sweden via Nordita and Stockholm University enters the newly established European Skills Academy is
Quantum Computing Report·2026-10-15·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
ORCA Computing has launched its PT-3 photonic quantum system in London, integrating it with NVIDIA GPU-accelerated computing infrastructure. This room-temperature system, consuming 6 kW, uses 64 photons across 128 qumodes to enhance classical machine learning models. The PT-3 is designed for generative AI in scientific research and large-scale industrial optimization, demonstrating improved protein designability and a 12x speedup in energy scheduling benchmarks. The post ORCA Computing Launches PT-3 Photonic Quantum System in London for Hybrid AI and Industrial Optimization appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-15·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief D-Wave has delivered its Advantage2 annealing quantum computer to Villa Saporiti in Como, Lombardy, Italy, with installation planned to provide European researchers, universities and businesses with access to the system. Funded by Swiss Quantum Technology SA (SQT) under a €10 million agreement, the system, named VoltaB1 within the Q-Alliance ecosystem, will be accessible through D-Wave ’s Leap quantum cloud service once operational. The Advantage2 system features more than 4,400 qubits and is intended to support applications in optimization, materials simulation and other industrial workloads. PRESS RELEASE — D-Wave Quantum Inc. (NASDAQ: QBTS) (“ D-Wave ” or the “Company”), the only dual-platform quantum computing company providing annealing and gate-model systems, software and services, today announced at Digital Innovation Forum 2026 that its Advantage2 TM annealing quantum computer has arrived in Lombardy, Italy, for installation at Villa Saporiti in Como. Funded by Swiss Quantum Technology SA (“SQT”), the system, referred to within the Q-Alliance ecosystem as the VoltaB1, will give European researchers, universities and businesses access to powerful, production-grade annealing quantum computing technology once installed. Its arrival marks an important step in Q-Alliance’s work to turn Italy’s quantum ambitions into research capabilities, practical applications and industrial opportunity. The VoltaB1 Advantage2 annealing quantum computer will be formally inaugurated at Q-Alliance’s “ Quantum per l’Italia ” event on October 16, at the historic Villa Saporiti. Held as part of the lead-up to the bicentennial of Alessandro Volta’s death, D-Wave CEO Dr. Alan Baratz will deliver remarks during the special ceremony, which includes representatives from research, industry and government. The ceremony follows D-Wave’s momentous signing of the Volta Declaration at the World Tech Conference in Milan in June 2026, which established a framework for cooperat
Nature: Quantum Information·2026-10-15
No generated summary available for this entry.
overview
Phys.org Quantum Physics·2026-10-15
No generated summary available for this entry.
overview
Original abstract
Einstein's theory of general relativity describes gravity as the bending of spacetime, a mathematical model that combines three-dimensional space and time into a single, four-dimensional continuum. The theory also predicts that a rotating object, such as Earth, slightly drags the surrounding spacetime as it rotates, a phenomenon known as frame-dragging.
The Quantum Insider·2026-10-15·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief EMode Photonix raised $1 million in pre-seed funding led by Ground State Ventures , with participation from Harlow Capital Management, to expand its photonics simulation software business. The company says its software simulates nonlinear photonic circuits 1,000 times faster, helping engineers design devices for frequency conversion and quantum light generation. The Boulder-based startup will use the funding to expand product development and sales as it prepares an enterprise offering for complete photonic integrated circuit design. PRESS RELEASE — EMode Photonix ( EMode , Inc.), a startup delivering powerful simulation tools to allow novel photonics technologies for quantum computers to be developed faster, has raised a $1 million pre-seed round. The round was led by Ground State Ventures , with participation from Harlow Capital Management. Integrated photonics is one of the fastest growing and most exciting areas of technology currently. Traditionally developed for telecommunications, it is finding increasing use in sensing, computing (see Nvidia investing billions in partnerships with photonics companies to replace copper wire), and especially quantum technologies. Traditionally photonics engineers could rely on existing simulations of linear photonics, which is sufficient for simple light routing circuits. However, the next generation of photonic devices exploit non-linear photonics, which not only allows one to bridge and generate different frequencies of light, but even enables the conversion of classical to quantum light. Up until now, there haven’t been any efficient tools for simulating non-linear photonics. EMode Photonix has developed a unique simulation stack, based on proprietary computational techniques, that speeds up the simulation of non-linear photonic circuits by 1,000x. The technology has the greatest potential in the emerging field of quantum computing, explains CEO Eric Stanton: “Nearly every quantum computing platform relie
The Quantum Insider·2026-10-15·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief SEALSQ reported preliminary nine-month 2026 revenue of $16.3 million, up 65% year over year, and reaffirmed its full-year revenue guidance of $27 million to $36 million. The company reported approximately $463 million in cash, cash equivalents and restricted cash at September 30, 2026, alongside a management-estimated pipeline exceeding $200 million through 2029, including more than $100 million in post-quantum projects. SEALSQ said 42 prospective customers and partners were evaluating its QS7001 and QVault TPM products, with additional certification milestones and broader post-quantum revenue contributions expected in 2027 and beyond. PRESS RELEASE — SEALSQ Corp (NASDAQ: LAES) (“SEALSQ” or “Company”), a company that focuses on developing and selling Semiconductors, PKI, and Post-Quantum technology hardware and software products, today announced its preliminary unaudited financial metrics for the nine-month period ended September 30, 2026 (“9M 2026”), provided an update on operational milestones, and reaffirmed its full-year 2026 revenue guidance. 9M 2026 Key Financial Metrics Revenue growth of 65%: Preliminary unaudited 9M 2026 revenue of $16.3 million, compared to $9.9 million in 9M 2025. Strong liquidity: Cash, cash equivalents and restricted cash of approximately $463.0 million at September 30, 2026. Post-quantum pipeline above $100 million: An active, evolving business pipeline of more than $200 million through 2029 as of October 15, 2026, including more than $100 million associated with Post-Quantum projects, including the QS7001 and QVault TPM. These figures represent management estimates and are subject to risks such as conversion risk, customer validation, technical integration and other commercial risks. Revenue Drivers The 9M 2026 increase was driven primarily by: Continued strong demand for SEALSQ ‘s Vault-IC secure-element family across industrial, smart-energy IoT and P25 Radio protocol appl
The Quantum Insider·2026-10-15·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief SEALSQ and its subsidiary IC’Alps will showcase post-quantum security products and custom chip design services at electronica 2026 in Munich, Germany, from November 10–13. The company plans to demonstrate the VaultIC409 secure element, QVault TPM and QASIC custom ASIC design offer for integrating post-quantum cryptography into connected and embedded systems. SEALSQ will also present live demonstrations across several industries, including a TLS 1.3 demonstration of VaultIC409, while engineering samples of the secure element are planned for the second quarter of 2027. PRESS RELEASE — SEALSQ Corp (NASDAQ: LAES) (“SEALSQ” or “Company”), a company that focuses on developing and selling Semiconductors, PKI, and Post-Quantum technology hardware and software products, today announced its participation in electronica 2026 , November 10 – 13, 2026 at Trade Fair Center Messe Munich, Germany. SEALSQ, together with its subsidiary IC’Alps, will exhibit in Hall C6, Booth 670. Electronica is the world’s leading trade fair for the electronics industry. Held in Munich every two years since 1964, the last edition drew more than 3,480 exhibitors from 58 countries and over 80,000 visitors from 113 countries. It is where component makers, device manufacturers and system designers come to decide what goes into the next generation of connected products. SEALSQ will take part in the electronica conference program. On Wednesday, November 11, from 4:30 to 5:15 p.m., the Company joins NXP and Infineon for the roundtable “Physical AI at the Edge for Industrial Security” at the IIoT Forum . On Friday, November 13, at 11:50 a.m., SEALSQ will give a keynote at the Embedded Systems World Forum, “Embedding certified secure hardware to simplify migration to post-quantum security standards.” Live interactive demonstrations The booth will run live demonstrations across automotive, medical, smart energy, smart home and access-control applications, showi
The Quantum Insider·2026-10-15·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Stony Brook University ‘s patented quantum memory technology, commercialized by Qunnect as Qu-MEM, has been named to TIME’s Best Inventions of 2026 list in the Experimental category. Qu-MEM is a room-temperature quantum memory designed to store and retrieve quantum information and operate with existing fiber-optic infrastructure for quantum networking. Developed from research led by Stony Brook physicist Eden Figueroa and his former graduate students, Qu-MEM systems are being deployed on quantum networking testbeds in New York and Europe. PRESS RELEASE — A quantum technology invented at the State University of New York (SUNY) at Stony Brook (Stony Brook University) is earning international recognition. Qunnect ’s Qu-MEM, a commercial room-temperature quantum memory device developed from Stony Brook-patented technology, has been named to TIME’s Best Inventions of 2026 in the Experimental category for concept inventions and prototypes showing future potential. This competition recognizes inventions that make the world better, smarter and more impactful. This recognition highlights Stony Brook’s role in advancing quantum technology and demonstrates how university research can move beyond the laboratory to help shape emerging industries. Qunnect ’s Qu-MEM grew out of research led by Professor Eden Figueroa, Stony Brook’s Endowed Presidential Professor of Physics and director of the Stony Brook University Quantum Institute alongside alumni/graduate students Mehdi Namazi, PhD ’18, and Mael Flament, MS ’19. Figueroa co-founded Qunnect with Namazi and Flament, who now serve as the company’s chief science officer and chief technology officer, respectively. Qu-MEM is the world’s first commercial room-temperature quantum memory device, currently expanding Stony Brook’s SCY-QNET, America’s largest quantum internet. It is an on-demand, warm-vapor, neutral-atom quantum memory that sits in a standard server rack. It is designed to work w
The Quantum Insider·2026-10-15·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Leaders from nine blockchain organizations have launched the Quantum Alliance , an open standards initiative to define and verify post-quantum readiness across blockchain networks, wallets and infrastructure. The Alliance plans to publish open testing criteria, benchmarks and migration guidance covering transaction signatures, key management, consensus, zero-knowledge proofs and peer-to-peer connections. Its initial work will focus on four areas: blockchain migration, post-quantum zero-knowledge systems, wallet security and cross-chain compatibility. PRESS RELEASE — CEOs, CTOs, and founders from nine blockchain organizations today launched the Quantum Alliance , an open standards body that will set the criteria for judging quantum-resistance claims in blockchain and create standards for compatibility between the networks as they migrate. The Alliance will define what post-quantum readiness means for blockchain networks, wallets, and infrastructure, and how to test and verify any claim of quantum resistance. Nearly every major blockchain secures its accounts with elliptic-curve signatures, and once an account signs a transaction (for some address types, from the moment it is created), its public key sits permanently on a public ledger. A sufficiently capable quantum computer running Shor’s algorithm could work backward from that public key to the private key and take control of the funds. The same signatures protect stablecoin minting keys, governance contracts, bridges, and oracle feeds, so one compromised privileged key could spread across many platforms at once. Almost all of the roughly $2.9 trillion crypto market still relies on classical signatures, with 6.04 million BTC, 30.2% of supply, counted as quantum-exposed at rest. A growing body of forecasts places the first practical attack around 2028, and several of the most closely watched appeared within the past two years. Since early 2025, the Quantum Doom Clock , a model b
Quantum Computing Report·2026-10-15·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Researchers from Google Quantum AI, Google DeepMind, and MIT have developed a modular quantum error correction (QEC) architecture that significantly reduces the physical qubit overhead required for quantum computing. This new approach, detailed in a technical manuscript on arXiv, utilizes modular hyperbolic codes to achieve over 30x savings in qubit overhead compared to standard 2D surface codes. The architecture allows for high encoding rates without complex on-chip wiring, demonstrating high tolerance to noise in simulations. The post Google Quantum AI & DeepMind Demonstrate Modular Hyperbolic Codes for Over 30x QEC Overhead Reduction appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-15·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Germany has released national guidelines for migrating to Post-Quantum Cryptography (PQC), aligning with the EU's roadmap. The strategy, driven by advancements in AI and threats to classical encryption, outlines a three-phase migration timeline, prioritizing high-risk systems by 2030 and aiming for full migration by 2035. This initiative mandates hybrid cryptographic mechanisms and PQC readiness in risk management for critical infrastructure. The post Germany Issues Joint Federal PQC Migration Guidelines to Align with EU Post-Quantum Roadmap appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-15·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
IBM Research has developed an AI agent factory to automate the design of QEC decoder chips, achieving up to 204x hardware speedup and 11.5x lower AI inference costs. This system utilizes autonomous multi-agent search and open-weight models, making QEC chip design more economically practical for fault-tolerant quantum systems. The agent factory explores architectural transformations to optimize decoding algorithms for high-rate qLDPC codes. The post IBM Research Automates QEC Decoder Chip Design Using Open AI Agent Factories at 11.5x Lower Inference Cost appeared first on Quantum Computing Report .
Phys.org Quantum Physics·2026-10-15
No generated summary available for this entry.
overview
Original abstract
When light hits a tiny defect embedded in a solid material like diamond or silicon carbide, it can kick the defect's electrons into an excited state. These spin defects have the potential to be used as stable, readable qubits for quantum technologies, for example, quantum sensing. But modeling the full physics of their energetics over time—a key step in developing spin defects into new technologies—is a challenging task.
Quantum Computing Report·2026-10-15·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Classiq has partnered with FreeYa Mind Campus to open a Quantum Applications Hub in Iași, Romania, which will serve as Classiq's regional headquarters. This hub integrates Classiq's quantum software platform with the campus's IBM Quantum System Two. The collaboration aims to drive quantum software development, education, and enterprise projects across Eastern Europe. The post Classiq Partners with FreeYa Mind Campus to Launch Quantum Applications Hub in Romania appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-15·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief ZeroTier has released Release Candidate 3 (RC3) of ZeroTier Quantum, a networking platform designed to provide post-quantum cryptographic protection across managed, sovereign, self-hosted and air-gapped deployments. The release adds Windows, macOS, Linux and Android client support, credential-based device enrollment, controlled software delivery and administrative security event generation. ZeroTier says RC3 has undergone protocol and code audits and is being tested with customers, as the company moves toward production deployment using ML-KEM-1024, ML-DSA-87 and AES-256-GCM. PRESS RELEASE — ZeroTier , one of the world’s top software-defined networking companies, today announced Release Candidate 3 (RC3) of ZeroTier Quantum, the world’s only software-defined end-to-end quantum-secure networking platform. The release marks the final production step towards full deployment, proving ZeroTier Quantum can deliver secure, quantum-safe connectivity regardless of customer’s deployment type, location, or desired privacy posture. RC3 moves ZeroTier Quantum closer to production readiness through expanded flexibility, broader client support, stronger administrative controls, and continued testing and platform hardening. Organizations can deploy the platform as a managed service or in sovereign, self-hosted, and air-gapped environments. When it comes to defense, government, finance, critical infrastructure, and enterprise environments, flexibility means deploying quantum-secure networking in a way that fits existing architecture, security requirements, and operational needs, without a rip-and-replace approach. “For security-sensitive organizations, like government, defense, and critical infrastructure management, where a network runs matters just as much as how it’s secured,” said Andrew Gault, ZeroTier ’s CEO. “With RC3, we’re proving that quantum-secure connectivity can adapt to the environments organizations actually operate in. We have significant experie
The Quantum Insider·2026-10-15·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief ORCA Computing launched its PT-3 photonic quantum computer at Digital Realty’s London innovation lab, pairing it with NVIDIA accelerated computing for scientific AI and industrial optimization. ORCA reported that a PT-3-assisted version of NVIDIA’s Proteína model improved the proportion of useful protein designs by 20% compared with the classical baseline. ORCA said the PT-3 completed a hybrid energy-scheduling workflow in about an hour, more than 12 times faster than its predecessor at the same solution quality. PRESS RELEASE — ORCA Computing , the company pioneering quantum-accelerated AI for science, today launches the PT-3, the newest generation of its photonic quantum computers, and the first built to deliver commercial quantum advantage. The first system is live in the Digital Realty Innovation Lab (DRIL) in London, where it runs alongside NVIDIA accelerated computing. Quantum and AI for science AI for science, harnessing AI to transform scientific discovery, is rapidly emerging as one of the most important new categories in computing and a major industry-wide focus, yet it is held back by limited training data. ORCA’s PT-3 works alongside GPUs to increase the expressivity of AI models (their ability to represent complex patterns and data distributions), helping them learn more from limited data and identify better, more novel candidates for new drugs and materials. Already delivering results The PT-3 has allowed ORCA to generate results from a hybrid quantum-classical extension of NVIDIA Proteína , the generative model for protein design. Trained on 32 NVIDIA Hopper GPUs working with a PT-3 using 64 photons in 128 qumodes, the hybrid model showed enhanced designability over the classical baseline, improving the ratio of useful proteins by 20%, and generated novel proteins with a different mix of secondary structures. This builds on earlier life sciences results from ORCA’s PT-2 system. Working with the Technical University of D
Phys.org Quantum Physics·2026-10-15
No generated summary available for this entry.
overview
Original abstract
Silicon spin qubits are a promising platform for building scalable quantum computers as they are compatible with the semiconductor manufacturing technologies used to produce today's computer chips. However, they have an important weakness: silicon spin qubits typically lose accuracy when several qubits are under parallel control. To be useful, quantum computers will need to operate many qubits simultaneously without compromising the accuracy of their operations.
The Quantum Insider·2026-10-15·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
By Zeynep Koruturk , Dr. Kris Naudts , and Donald Harmitt @ Firgun Ventures . Firgun Ventures is a VC firm investing in Series A/B quantum scale-ups globally. Demand for critical minerals is rising just as copper exploration is becoming harder. The IEA projects copper supply to fall around 25% short of primary requirements by 2035 , while the cobalt gap has widened to more than 25% following the DRC’s export quotas. Closing those gaps will require more primary supply, making new discoveries increasingly important. Yet many of the accessible targets have already been found, pushing exploration towards deeper, more complex targets. S&P Global estimates that average copper drilling depth has risen nearly 50% since 2010 to around 600 metres, which means every unsuccessful deep target can require substantially more drilling before miners learn that the ore is not there. That cost is what makes measurement before drilling worth paying for, and two instruments are being built for the job. Quantum gravimeters use clouds of laser-cooled atoms as a stable reference for small variations in gravity caused by underground density differences, while quantum magnetometers read subtle magnetic field changes that reveal particular rock formations. Neither technology produces a complete underground map or removes the need to drill. What they offer is a better-calibrated sense of where to drill and, just as usefully, where not to. Better subsurface information informs which targets get funded, and underscores the question of who controls a country’s geological picture. And a useful by-product of deploying quantum technologies in the mineral sector is meeting the increasing material needs of quantum itself. What quantum sensors add to the mineral exploration toolkit Mineral exploration requires assembling an incomplete picture from indirect signals, among them sampling, seismic surveys, gravity and magnetic data, and the machine learning models built on them. A gravity a
The Quantum Insider·2026-10-15·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Riverlane and NVIDIA are exploring how AI and GPU-accelerated computing can speed up decoder calibration for quantum error correction as quantum hardware behaviour changes. Using Riverlane ’s Local Clustering Decoder on an NVIDIA H100 GPU, the reported surface-code training cycle fell from three minutes on a single CPU core to 2.8 seconds. The H100 processed more than four million surface-code syndromes per second in the reported tests, compared with around 59,000 per second on a single CPU core, supporting more frequent decoder recalibration. PRESS RELEASE — Quantum computing has the potential to solve problems beyond the reach of today’s computers, from drug discovery to materials science and optimisation. But before that can happen, the industry must first overcome the errors that are created by quantum computing’s extreme sensitivity to noise. Quantum error correction (QEC) detects and corrects these errors. It’s essential for building reliable and useful quantum computers, but this also creates enormous demands for real-time data processing. Future systems may need to process terabytes of information every second, with near-perfect accuracy, to support error-free quantum computing. To explore how to meet these demands, Riverlane and NVIDIA are collaborating on the use of AI and NVIDIA accelerated computing for QEC, including how GPUs can make decoder calibration faster, and help quantum systems keep up with changes in hardware behaviour. Keeping up with Changing Quantum Hardware A decoder is the part of a QEC system that interprets the signals produced by a quantum processor. It works out which errors are most likely to have occurred and tells the system how to correct them. To do so accurately, the decoder needs a reliable picture of the errors that occur. It uses numerical settings, known as weights, to estimate how likely different types of errors are and decide which corrections to apply. These settings are based
The Quantum Insider·2026-10-15·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Dirac Labs has joined the Wisconsin Security Research Consortium as an industry affiliate to advance GPS-independent quantum navigation for autonomous maritime missions. The Madison-based company is developing diamond-based magnetic sensors and AI processing to determine position underwater, underground and where GPS is disrupted or unavailable. The affiliation connects Dirac Labs with Wisconsin’s defense research network and supports Area 52, a proposed Lake Michigan testing ground for autonomous maritime systems. PRESS RELEASE — Dirac Labs, a Madison-based quantum-enabled navigation company, today announced that it has joined the Wisconsin Security Research Consortium (WSRC) as an industry affiliate, providing resilient navigation alternatives to enable autonomous maritime missions. WSRC, led by the Wisconsin Technology Council, connects Wisconsin’s universities, technology manufacturers and government partners to advance defense research and economic development opportunities in the state. Dirac Labs’ affiliation builds on the Autonomous Heartland effort to position Wisconsin — with its shipyards, airspace, industrial base, workforce, and research anchors — at the center of America’s autonomous and maritime future. Along with the Sagamore Institute, the Midwest Defense Accelerator and TitletownTech, WSRC supports the growing Area 52 initiative. Area 52 was originally proposed by retired U.S. Navy captain Jerry Hendrix to serve as the Navy’s equivalent to the Air Force’s Area 51. Hendrix argued that the Navy needed a secure area to develop and test autonomous and unmanned platforms away from the adversary surveillance possible in international waters. Lake Michigan is a uniquely suitable option, as it is the only Great Lake entirely within U.S. territory that is large and deep enough for both surface and subsurface testing, and it has existing FAA-designated restricted military airspace overhead connected to assets like Volk Field.&
The Quantum Insider·2026-10-15·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief FirstQFM applied its quantum foundation model to a 21-qubit QuantWare superconducting processor at the Israeli Quantum Computing Center, reducing single-qubit gate execution time by 33% without reducing gate fidelity. The model generated custom pulse-level gate implementations from existing calibration data and identified five qubit pairs with improved Bell-state fidelity, with the improvements confirmed in independent hardware runs. The work used Quantum Machines’ control and calibration infrastructure alongside NVIDIA accelerated computing, and FirstQFM plans to expand its optimizations as QuantWare develops larger quantum processors. PRESS RELEASE — FirstQFM today announced results from applying FirstQFM’s quantum foundation model to a QuantWare superconducting quantum processor at the Israeli Quantum Computing Center (IQCC). FirstQFM ’s foundation model builds on top of Quantum Machines’ native calibration stack, and generated single-qubit gates that reduced execution time by 33% on a QuantWare Contralto-D21 QPU. Gates were validated directly on the QuantWare processor using randomized benchmarking with no loss of gate fidelity. The model generated custom pulse-level implementations of gates from calibration data produced by the Quantum Machines’ calibration stack with no additional quantum hardware measurements required. This shifts more of the gate optimization process from scarce QPU time to classical compute. The model also identified improvements to two-qubit gates, which are central to entanglement and typically more challenging to calibrate than single-qubit operations. Using existing calibration data together with a short hardware probe, the model identified five qubit pairs with higher Bell-state fidelity with each improvement confirmed in independent hardware runs. The QuantWare processor was operated at the IQCC using Quantum Machines’ OPX control hardware, QUA software, and automated calibration infrastructure. FirstQFM developed
The Quantum Insider·2026-10-15·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief IonQ and the University of Cambridge have opened the IonQ Quantum Innovation Centre at the Ray Dolby Centre, establishing the company’s first university-based centre of this kind. The centre’s nine initial research projects will cover quantum networking, sensing, hardware development and applications in fields including chemistry, materials science, finance, engineering and medicine. IonQ plans to deploy a 256-qubit Superion quantum computer and an on-campus quantum network, while Innovate UK will provide the National Quantum Computing Centre with access and computing time over three years. PRESS RELEASE — IonQ (NYSE: IONQ), the world’s leading full-stack quantum platform and foundry, and the University of Cambridge have announced the opening of the first-ever university-based IonQ Quantum Innovation Centre. The Centre is located at the Ray Dolby Centre, the new home of the University’s Cavendish Laboratory. This initiative brings the University’s largest corporate research partnership from agreement to a physical home at one of the world’s leading facilities for physics research. The IonQ Quantum Innovation Centre demonstrates the company’s commitment to quantum innovation and academic research within the United Kingdom. Research at the Centre includes co-development of new quantum network nodes and sensing capabilities with the university, and a strengthening of the existing Cambridge-to-Bristol quantum network. IonQ and the University of Cambridge first announced the partnership on March 11, 2026, supporting advanced research and workforce development for quantum technologies. “The opening of the IonQ Quantum Innovation Centre turns a landmark agreement into a working home for quantum research inside one of the world’s most storied physics laboratories,” said Niccolo de Masi, Chairman and CEO of IonQ. “By bringing quantum computing, networking, sensing, and security research together at Cambridge, we are acc
Quantum
·2026-10-15
·Carolyn Mayer et al.
·doi
No generated summary available for this entry.
overview
Original abstract
We describe a practical approach for accessing the logical failure rates of quantum error-correcting (QEC) circuits under low physical (component) failure rate regimes. Standard Monte Carlo is often the de facto approach for studying the failure rates of quantum circuits. However, in the study of fault-tolerant error-correcting circuits, the ability to extend this approach to low physical failure rates is limited. In particular, the use of Monte Carlo to access circuits that are relatively large or have high correcting power becomes more difficult as we lower the input failure rates of the individual components (gates) in the circuit. For these reasons, many simulations studying the circuit model go no lower than end-to-end logical failure rates in the 10 &#x2212; 6 regime.In this report, we outline an approach that borrows from earlier work by Bravyi and Vargo \cite{bv13} to the more complex circuit noise model. Earlier works studied both the capacity and phenomenological noise models \cite{bv13,Beverland2019,bonilla2021xzzx}, but the work is insufficient for generating similar simulations in the circuit-noise model. To the best of our knowledge, our team is the first to develop a full prescription of the rare event simulation by splitting technique for the circuit-based noise model. We have also generated promising results that are confirmed by standard Monte Carlo simulation under an accessible regime. This work shows that we can access noise in the circuit-model prescription of quantum error-correcting code to failure rates below 10 &#x2212; 20 regime.
PRX Quantum
·2026-10-15
·Yale Yauk, Lucas Hackl, Alexander Hahn
·doi
No generated summary available for this entry.
overview
PRX Quantum
·2026-10-15
·Chen-Xun Weng et al.
·doi
No generated summary available for this entry.
overview
PRX Quantum
·2026-10-15
·Zhenzhong Xing et al.
·doi
No generated summary available for this entry.
overview
Quantum Science and Technology
·2026-10-15
·Julen Larrucea, Marita Oliv, Jeanette Miriam Lorenz
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract Variational quantum eigensolver (VQE) calculations are widely used as reference workflows for assessing near-term quantum hardware, but practical guidance on their accuracy, runtime, and billed usage remains limited. Here, we present a hardware-validated reference dataset for variational ground-state energy calculations of the hydrogen molecule H 2 on several IBM Quantum processors available in 2025–2026. Using a standardized Qiskit Nature workflow, we benchmark the impact of shot count, backend choice, fermion-to-qubit mapping, optimizer behavior, resilience level, and execution mode on the achievable energy accuracy relative to exact diagonalization. For the H 2 /STO–3G configurations examined, circuit simplification through tapered mappings provides the most consistent accuracy gains, resilience level 1 improves accuracy at a substantial billed-usage premium, and session-based execution yields no systematic accuracy advantage over single-job execution despite markedly higher billed time. The dataset and analysis provide a transparent baseline for assessing current IBM Quantum hardware for quantum-chemistry applications and for estimating the runtime effort and billed usage that non-specialist users can expect from standard workflows.
arXiv·2026-10-15·Zhi-Wei Wang, Saurya Das, Samuel L. Braunstein
No generated summary available for this entry.
overview
Original abstract
The unification of quantum theory and general relativity suggests the existence of a minimal measurable length, leading to a generalized uncertainty principle (GUP) and an energy-dependent vacuum group velocity. Testing these effects with macroscopic objects typically encounters the ``soccer-ball problem,'' where applying Planck-scale deformations to the total momentum predicts observationally ruled-out velocity deviations. We adopt the QFT-natural prescription in which the GUP modifies single-mode commutators, and verify by explicit calculation that the macroscopic group velocity of a multimode coherent pulse reduces to the single-photon GUP velocity evaluated at the central wavelength, multiplied by the classical Gaussian-beam factor, with no dependence on the total pulse energy. The energy--momentum relation $E=pc$ itself is unmodified; the deformation enters through the velocity--momentum relation and is equivalent to a modified dispersion relation in the wave vector, with a quadratic coefficient that depends on which of the two variables is used. The soccer-ball problem $\,$---$\,$ which arises only when the GUP is applied to the center-of-mass momentum of a composite system $\,$---$\,$ is therefore absent for coherent light, and macroscopic petawatt pulses probe the same parameter space as single high-energy photons. Building on this framework, we propose a two-color vacuum chronoscopy experiment using a short-pulse petawatt laser and its high-harmonic generation. By systematically varying the macroscopic beam waist, our setup separates Planck-scale kinematic shifts from classical diffraction delays, establishing a controlled, source-independent terrestrial methodology whose sensitivity we assess against current astrophysical bounds and against the dominant waist-independent systematics that limit it, residual-gas dispersion and the harmonic birth-time offset.
arXiv·2026-10-15·Yijin Mao, Yuwen Zhang
No generated summary available for this entry.
overview
Original abstract
Implicit discretizations of transient heat conduction repeatedly generate sparse linear systems, making diffusion problems a natural test bed for quantum linear solvers. This study evaluates how accurately a variational quantum linear solver (VQLS) recovers the temperature field produced by one backward-Euler step of one-dimensional conduction on IBM quantum hardware. A pre-specified confirmatory experiment compares N=4 interior temperatures encoded on two qubits with N=8 temperatures encoded on three qubits using ten paired hardware blocks; a separately defined N=16, four-qubit extension is evaluated in five independently scheduled exploratory blocks. Local VQLS optimization reduces relative temperature-field error to approximately 10^{-8} for all three cases, establishing an essentially exact ideal reference at this scale. On hardware, mean relative L2 temperature-field error is 8.07% for N=4 and 20.14% for N=8, a paired increase of 12.06 percentage points (95% CI, 10.71-13.42; exact paired sign-flip p=0.001953). The exploratory N=16 mean is 24.75+/-1.84%. A pre-specified N=16 shot-count follow-up then evaluates the same locked circuit at 2,048, 8,192, and 32,768 shots in six independently scheduled blocks. Mean field error remains 23.64%, 24.57%, and 24.37%, respectively; the 32,768-minus-2,048-shot contrast is +0.74 percentage points (95% CI, -0.65 to 2.12; p=0.281). In contrast, ideal multinomial sampling predicts a reduction from 2.68% to 0.75%. Higher shot counts reduce block-to-block variability but do not recover the mean cold-side temperature field. The results show that full-field readout of a strongly nonuniform thermal state is limited by more than ordinary finite-shot sampling under the tested hardware conditions, motivating observable-focused quantum formulations for heat flux, stored energy, and selected temperatures.
arXiv·2026-10-15·Tomotaka Kuroda, Fumiya Sano, Yusuke Yamada
No generated summary available for this entry.
overview
Original abstract
Inflationary cosmology faces a fundamental gap between primordial quantum fluctuations and the classical cosmic history inferred from observations. Although the primordial quantum state is a superposition of field configurations, standard cosmology assumes one definite realization of curvature perturbations and uses classical perturbation theory to describe the resulting gravitational potentials, CMB anisotropies, and large-scale structure. Squeezing and decoherence of primordial fluctuations alone do not explain why this one-realization description is physically meaningful. We address this issue through Cosmological Classical Branches (CCBs), using the quantum-information-theoretic notion of physical records. In CCBs, distinct late-time matter components carry compatible records of the same primordial configuration. A record in one component makes that configuration readable, while a disjoint compatible record suppresses interference accessible to operations on the first. Each branch thus admits a common c-number primordial label at finite resolution, while the global quantum superposition persists. This Letter summarizes the framework developed in Ref.~\cite{Kuroda2026CCB}.
arXiv·2026-10-15·Kyoungho Cho et al.
No generated summary available for this entry.
overview
Original abstract
What separates quantum computation from classical computation when a classical model may retain every branch history and arbitrary causal memory? We study this question using history-resolved causal stochastic machines (HCSMs), which describe positive causal history laws. Probabilistic Turing machines (PTMs) embed in stochastic-ensemble models (SEnMs), which in turn embed in HCSMs. We prove that HCSM history laws coincide exactly with the fixed-basis, prefix-preserving diagonal sector of ideal quantum processes, denoted by $\mathsf{PTM}_{\rm proc}$ and distinguished here from algorithmic quantum Turing machines (QTMs). Coherent quantum processes extend strictly beyond this sector. The boundary is already visible in reversibility. Born-probability shadows of unitary gates preserve inverse composition exactly for basis permutations with phases. Outside this class, an exact positive stochastic simulation that supports universal quantum continuations must retain predictive information absent from visible probabilities. An inverse-recovery identity quantifies this phase ledger, and universal continuation forces the retained probability law to be tomographically sufficient for the quantum state. Under continuous full-state encoding assumptions, this requirement yields quantum-state dimension lower bounds. The familiar slogan $\mathsf{PTM}\subseteq\mathsf{QTM}$ is thereby sharpened into a precise classical boundary and a no-free-classicalization principle. Complete classical branching does not remove the predictive information needed to represent quantum coherence.
arXiv·2026-10-15·M. Javad Zakeri et al.
No generated summary available for this entry.
overview
Original abstract
Programmable preparation of entangled quantum states is a central requirement for scalable quantum information processing, quantum networking and photonic quantum computing. Topological photonic platforms offer an attractive route towards robust quantum-state generation by encoding information in symmetry- protected optical modes, yet the generated entangled states are typically dictated by the lattice geometry and therefore lack programmability. Here we demonstrate programmable preparation of topological entangled states by inverse engineering the nonlinear optical pump profile of an integrated photonic lattice. Our approach enables deterministic control over both the dimensionality and modal structure of the generated entangled state while preserving its topological character. We experimentally realize silicon photonic topological superlattices in which the nonlinear generation pathway itself becomes programmable via tailored excitations. The superlattices host a multiband manifold of co localized topological interface modes, while coherently controlled inputs synthesize pump superpositions within this protected basis. We showcase this principle by selectively addressing topological biphoton eigenstates, steering correlations to produce a desired target state in a high-dimensional Hilbert space, and inverse-designing pump states that generate targeted Schmidt dimensionalities. Site-resolved two-photon correlation measurements remain reproducible across nominally identical fabricated devices, demonstrating robustness to realistic nanofabrication-induced disorder. Programmable preparation of topological entangled states establishes a pathway towards exploiting topological photonic modes as application-specific quantum resources, enabling tailored input states for high-dimensional quantum communication, quantum networking and photonic quantum computing.
arXiv·2026-10-15·Felipe S. Escórcio, Hermano Velten
No generated summary available for this entry.
overview
Original abstract
By linearizing the hydrodynamic equations associated with the Madelung transformation in the context of Bohmian dynamics, we derive an effective metric for the phase perturbation around a background state. We show that the metric previously obtained previously by the same authors arises naturally as a particular case of a more general structure, in which the complete functional variation of the quantum potential is retained and external classical potentials can be incorporated. This generalization preserves the dependence of the quantum potential on the density and its spatial derivatives, generating additional terms that introduce dispersive corrections and act as sources in the effective Klein-Gordon equation. To organize these contributions, we introduce differential operators that separate the local sector responsible for the effective geometry from the corrections associated with the complete functional structure of the quantum potential. We identify the conditions under which these additional terms become negligible, recovering homogeneous propagation and the effective geometry for the Gaussian wave packet of a free particle.
arXiv·2026-10-15·Avijit Mandal, Mert Gökduman, Henry D. Pfister
No generated summary available for this entry.
overview
Original abstract
The extrinsic information transfer (EXIT) and generalized EXIT (GEXIT) area theorems provide fundamental conservation laws that connect the rate of classical codes to the performance of maximum-a-posteriori decoding on binary memoryless channels. In this work, we generalize these area theorems to quantum error correction. We first develop a coset-entropy formalism for nested linear codes, where the message specifies a coset and encoder randomization selects a codeword within that coset. The area under the resulting coset (G)EXIT function equals the normalized dimension of the quotient. For stabilizer codes, the measured syndrome restricts the Pauli error but does not always determine its logical effect, and the remaining uncertainty is an entropy over logical correction classes. We show that this entropy equals a classical coset entropy associated with the stabilizer group and the Pauli operators that commute with it. The resulting quantum GEXIT function has area equal to the number of encoded qubits per channel use for any stabilizer code, and this applies to the depolarizing channel through its joint four-valued Pauli-error distribution. For CSS codes on the quantum erasure channel and under independent bit- and phase-flip noise, the logical correction problem separates into two binary coset-decoding problems. On the quantum erasure channel, the duality between the stabilizer group and the Pauli operators that commute with it gives a folding identity at complementary erasure probabilities. Using this and the area theorem, we derive an upper bound on the rate of code families with vanishing logical error probability that matches the capacity of the quantum erasure channel. For the depolarizing channel, we also derive a rate-dependent converse, using a connection between correction-class entropy and coherent information to establish an inequality involving the complementary channel.
arXiv·2026-10-15·Rafael Florencio Díaz, Julio Guerrero García, Elvira Romera Gutiérrez
No generated summary available for this entry.
overview
Original abstract
Variational quantum algorithms have emerged as a promising approach for simulating open quantum systems, yet their expressive power and trainability remain poorly understood. We propose a variational framework for solving Lindblad master equations by minimizing a residual cost function using a compositional ansatz obtained by combining a classical neural network with a parameterized quantum circuit. The density matrix is represented through a purification on an enlarged Hilbert space, ensuring positivity, Hermiticity, and unit trace by construction, while all gradients are evaluated exactly via the parameter-shift rule. Beyond the algorithmic formulation, we derive an upper bound for the covering number of the proposed compositional model and compare it with that of purely quantum neural networks. Our analysis shows that the classical parametrization enlarges the effective hypothesis class while providing finer control over its complexity, thereby establishing a theoretical connection between expressivity, covering numbers, effective dimension, and the barren plateau phenomenon. Numerical experiments validate both the accuracy of the proposed method for representative Lindblad master equations and the theoretical predictions regarding gradient concentration. These results provide a unified variational and theoretical framework for the simulation of dissipative quantum dynamics using compositional quantum machine learning models.
arXiv·2026-10-15·Boris Tsvelikhovskiy
No generated summary available for this entry.
overview
Original abstract
The analysis of Hamiltonian Variational Ansätze centers on three fundamental questions: which states are exactly reachable from a given initial state, what native control depth suffices for local and global synthesis, and whether a bounded circuit extension can expose a direction of decreasing cost at a suboptimal output. We address these challenges by leveraging the dynamical Lie algebras (DLAs) associated with the circuits and the geometry of the initial state's orbit under the action of the corresponding dynamical Lie group $G$. We show that an initial state has a closed projective orbit whenever it is a nondegenerate eigenstate of a control Hamiltonian. Combined with asymptotic QAOA convergence, this guarantees exact, finite depth ground state preparation for architectures employing diagonal problem Hamiltonians and irreducible stoquastic mixers. We bound the number of native control exponentials required for local unitary synthesis and state preparation using DLA commutator filtration growth alongside reachable orbit dimensions. Complementing these local results, we construct global frameworks on invariant sectors equipped with full unitary or special unitary dynamical Lie algebras. These constructions yield explicit applications to Pauli-generated systems and constrained maximum independent set multi-angle QAOA circuits; specifically, we show that their native control costs are directly determined by commutator filtration depth and independent-set toggle-group geometry, respectively. Finally, if the dynamical Lie group is compact, the observable $H_P$ generates an admissible evolution ($iH_P \in \mathfrak{g}$, where $\mathfrak{g}$ is the DLA), and the projective orbit of the initial state contains a ground state ray of $H_P$, then a bounded depth, identity-initialized circuit extension exhibits either first-order descent or negative curvature at every suboptimal circuit output.
arXiv·2026-10-15·Kevin B. Xu, John L. Bohn, Reuben R. W. Wang
No generated summary available for this entry.
overview
Original abstract
Fermi statistics suppress the elastic collisions that rethermalize a Fermi gas during evaporative cooling, creating a fundamental low-temperature bottleneck for producing quantum degenerate gases. We show that, for shielded single-component ultracold dipolar molecular Fermi gases in the Wigner threshold regime, this bottleneck is governed by universal threshold laws fixed by the effective dimensionality of the gas. In this regime, Fermi suppression of rethermalization scales quadratically with temperature in 3D but only linearly in 2D. Consequently, the thermalization-to-loss ratio is more favorable in 2D than in 3D, and these results suggest that 2D geometries are better suited for reaching deep degeneracy. We also present ab initio close-coupling calculations that agree well with experimental measurements on Fermi degenerate gases of KRb molecules, supporting our conclusions.
arXiv·2026-10-15·Shelby Klomp et al.
No generated summary available for this entry.
overview
Original abstract
We describe the nanofabrication and loading of lithographically patterned, high aspect ratio $10$ $μ$m diameter silicon dioxide discs with thickness of $400$ nm into an optical standing wave trap in vacuum. We obtain motional spectra of the center of mass motion of the discs using a combination of interferometric and imaging methods. The method is capable of high-efficiency loading and optical trapping using small numbers of objects, of the order of a few particles, with customized geometries and sizes compatible with wafer scale nanofabrication methods. Disc-like particles in optical traps have been identified as promising candidates for detectors of high frequency gravitational waves or as sensitive accelerometers.
arXiv·2026-10-15·Shankar Balasubramanian et al.
No generated summary available for this entry.
overview
Original abstract
We show that the 2D classical spin model constructed in arXiv:2605.10943 hosts many metastable states at non-zero temperature which are stable to arbitrary Hamiltonian perturbations, providing the first such example. Our proof relies on a recursive application of the cluster expansion.
arXiv·2026-10-15·Tista Banerjee, K. Sengupta
No generated summary available for this entry.
overview
Original abstract
We study a Rydberg chain subjected to a two-tone periodic drive of the detuning $Δ(t)$ and Rabi frequency $Ω(t)$ at frequencies $ω_1$ and $ω_2=νω_1$ respectively with $ν\in \mathbf{Z}$. In the strong Rydberg blockade limit, such a system reduces to the PXP model and exhibits exact Floquet flat band. Here we determine, using a time-dependent Schrieffer-Wolff transformation, the domain of validity of such PXP dynamics once the blockade-violating processes are taken into account. We study the melting of such flat bands in the presence of strong, but finite, blockade strength. Using Floquet perturbation theory (FPT), we identify two mechanisms for such melting; the first occurs due to the presence of many-body resonances involving resonant production of nearest-neighbor Rydberg excitation pairs while the second involves virtual processes that access intermediate states with such pairs. Our analytical FPT results match with those obtained using exact diagonalization on a finite chain. We study the dynamics for $|{\rm vac}\rangle$ (Fock state with no Rydberg excitation), $|{\mathbb {Z}}_2\rangle$, and $|{\mathbb {Z}}_3\rangle$ (Fock states with Rydberg excitations on alternate and every third site respectively) initial states. We find that $|{\rm vac}\rangle$ shows exceptional stability against resonant pair formation while $|{\mathbb {Z}}_3\rangle$ exhibits flat band melting via virtual processes away from the direct resonances. We find oscillatory dynamics with large time period for the $|{\mathbb {Z}}_2\rangle$ initial state and the presence of Floquet scars that have large overlap with $|{\mathbb {Z}}_3\rangle$ state; these phenomena occur due to processes that are absent in the PXP limit. We propose measurement of nearest neighbor pair correlation functions using Rydberg atom quantum simulator platforms as an accessible experimental probe for these effects.
arXiv·2026-10-15·A. M. Silva
No generated summary available for this entry.
overview
Original abstract
Heavy quarks are often treated as Brownian probes of the quark-gluon plasma. We formulate the irreversible entropy balance of their momentum distribution and separate the production generated by collisions from the driving caused by an evolving medium. For linear dynamics the production splits into two positive contributions, from directed momentum and from the momentum width. A static bath obeys an exact H-theorem. A cooling bath adds an explicit driving term, and longitudinal Bjorken expansion enters as a separate kinematic drive rather than as collisional production. For a Bjorken temperature protocol we derive closed-form strong- and weak-coupling limits of the total production. At strong coupling it exceeds the initial relative entropy by a term linear in the relaxation time, whose quasistatic part has the thermodynamic-length form. At weak coupling it vanishes inversely with the relaxation time. A positive strong-coupling slope therefore guarantees maximal dissipation at intermediate coupling. The same structure holds for a relativistic Fokker-Planck equation with a Jüttner stationary state, solved numerically for charm and bottom quarks under the temperature protocol. Linear-response coefficients computed from the static generator reproduce both limits, and the numerical entropy balance is satisfied to high accuracy.
arXiv·2026-10-15·Yip Chun Wong, Asimpunya Mitra, Yong Baek Kim
No generated summary available for this entry.
overview
Original abstract
Weak localization in two-dimensional disordered electron systems originates from constructive interference between time-reversed scattering paths, giving rise to a logarithmically divergent quantum-interference correction to the dc conductivity. This behavior is generally suppressed when time-reversal symmetry (TRS) is broken. In this study, using a band-projected framework motivated by spin- and valley-polarized rhombohedral $N$-layer graphene (RNG), we show that nonuniform quantum geometry can qualitatively modify quantum-interference corrections to dc transport. In particular, continuously tuning the quantum geometry can change the sign of the conductivity correction, corresponding to a crossover between localization and antilocalization tendencies. Remarkably, at special values of the parameter controlling the quantum geometry, weak-localization (WL) or weak-antilocalization (WAL) can re-emerge despite broken microscopic TRS. At these special points, the orbital structure of the Bloch states gives rise to an emergent antiunitary symmetry that protects a gapless Cooperon mode and restores the logarithmically divergent quantum-interference correction characteristic of WL or WAL. Our results establish nonuniform quantum geometry as a mechanism for controlling quantum interference and electron localization in multiorbital electronic systems.
arXiv·2026-10-15·Kaumudibikash Goswami, Archana Barvar, Manabendra Nath Bera
No generated summary available for this entry.
overview
Original abstract
Quantum states over time were introduced, in part, to extend Bayesian probability to quantum theory and have since found applications across diverse areas, ranging from quantum causality and open-system dynamics to tests of macroscopic realism. While axiomatic characterizations of these states exist for Markovian dynamics, a general framework accommodating non-Markovian dynamics is still lacking. Moreover, extending this framework beyond quantum mechanics to general physical theories also remains elusive. In this work, we develop an axiomatic framework for multi-time states within a class of operational probabilistic theories (OPTs) that includes quantum mechanics as a special case. Based on three assumptions---compositionality, reconstructibility, and spatio-temporal marginal consistency---the framework accommodates both Markovian and non-Markovian dynamics, and provides sufficient conditions to certify signaling and temporal memory within OPT. As a concrete application of our OPT framework, we fully characterize the unique multi-time state in boxworld and develop a method for Bayesian retrodiction of physical transformations there. Our general framework is consistent with quantum theory, reproducing several existing results. In the non-Markovian quantum dynamics, we establish a correspondence between multi-time states and the process-matrix framework, and fully characterize the multi-time states compatible with general dynamics. This correspondence also lets us infer quantum causal models from multi-time states, and as a proof of principle, we propose a semidefinite program to infer causal order from quantum multi-time states. These results provide a unified framework for studying spatio-temporal states, causal relations, and Bayesian reasoning within OPTs, with implications for both fundamental and applied research.
arXiv·2026-10-15·Ruizhe Shen, Yin Zhong, Ching Hua Lee
No generated summary available for this entry.
overview
Original abstract
Direct continuous quantum phase transitions between phases that break distinct symmetries challenge the conventional Landau-Ginzburg-Wilson paradigm and provide a framework for deconfined quantum criticality. Here, we investigate a Landau-forbidden ferromagnetic-to-valence-bond-solid (FM-VBS) transition in a frustrated one-dimensional spin chain using superconducting quantum processors. Combining matrix-product-state-assisted circuit preparation with quantum-hardware measurements, we resolve the suppression of long-range ferromagnetic correlations and the redistribution of competing-order fluctuations across the transition. Distance-resolved correlations and finite-size analyses reveal signatures consistent with critical behavior. We further extend our investigation to nonequilibrium dynamics, directly preparing dimerized states and tracking the evolution of VBS order and joint FM-VBS fluctuations under local unitary interactions. Our results establish a versatile quantum-hardware framework for probing competing orders, critical correlations, and many-body dynamics beyond conventional Landau theory.
arXiv·2026-10-15·Joshuah T. Heath et al.
No generated summary available for this entry.
overview
Original abstract
The non-stabilizerness, or "magic", of a quantum state is a common metric for the hardness of simulation on a classical computer, and is often quantified by the stabilizer Rényi entropy (SRE). We show how random superpositions of classically simulable states saturate the SRE to the symmetry-restricted Haar-random maximum. For any large-$N$ random pure-state ensemble satisfying the conditions of Schur's lemma, the average SRE of the $m$-component superposition $\langle M_2(m)\rangle=N-\log_2[\langle W(m)\rangle]$ is governed by an average witness $\langle W(m)\rangle$ that universally decomposes into a Haar floor and an ensemble-specific excess. As the number of components $m$ increases, the excess is suppressed, resulting in a logarithmic scaling of the SRE before plateauing at the Haar-valued maximum. We derive a general closed form for $\langle W(m)\rangle$ in the thermodynamic limit, and numerically verify our result for random stabilizer states and random Gaussian states.
arXiv·2026-10-15·Soo-Jong Rey
No generated summary available for this entry.
overview
Original abstract
I determine the leading finite-radius correction to the two-boundary response of a charged axion wormhole near its BPS endpoint. With $δ=a_*^2$, exact radial matching in a product axion--dilaton/saxion system gives a boundary eigenvalue that vanishes as $O(δ)$ and an off-diagonal Hessian entry of order $O(δ^2)$. Their combination produces a cross-boundary covariance linear in $δ$, with a negative first sub-leading correction on the branch studied here. I determine the semiclassical range in which the quadratic approximation remains controlled and identify the first finite-radius angular resonance, $δ^2\log(δ/δ_0)$. Under a uniform rescaling of all active charges, the coefficient of the linear cross-boundary response scales as the inverse square of the charge scale. I then average the inverse response over the chiral Gaussian ensemble describing the BPS endpoint. Boundary reduction preserves the hard-edge index. Multiplication by the matched BPS sector weight converts the normalized response into the leading finite-radius two-source coefficient.
arXiv·2026-10-15·Andi Gu et al.
No generated summary available for this entry.
overview
Original abstract
Significant efforts are currently being directed toward the implementation of large-scale quantum information processors, but realizing useful quantum advantage also requires the development of efficient quantum algorithms. While for many practical problems the dominant resource costs are associated with a small set of computational primitives, optimizing them in the quantum setting presents unique challenges, including a reversibility constraint absent from ordinary classical computation. Here we introduce an evolutionary framework in which large language models (LLMs) propose circuit designs and an independent evaluator verifies and scores them. We apply this framework to tasks spanning numerical computation, chemistry, optimization, quantum simulation, and number theory. In seven of the eight tasks, the discovered circuits significantly reduce both Toffoli and qubit counts relative to the state of the art. In the eighth, the search discovers a new reversible architecture for prime-field modular inversion. By handling reversibility differently, the architecture makes divsteps -- a classical algorithm previously impractical for reversible integer arithmetic -- viable and substantially improves the Toffoli-qubit trade-off for modular inversion. These results open the door for evaluator-guided LLM co-design of new algorithmic structures for quantum computation.
arXiv·2026-10-15·Tai-Hsuan Yang et al.
No generated summary available for this entry.
overview
Original abstract
Quantum low-density parity-check (qLDPC) codes have a canonical mixed state---the normalized projector onto the code space---that lies at the intersection of quantum error correction and quantum many-body physics, yet the stability of its information-theoretic structure under local noise remains poorly understood. Recent progress on mixed-state phases of matter has identified the spatial decay of conditional mutual information (CMI) $I(A:C|B)$ as a key diagnostic of such stability, analogous to the role of the spectral gap for quantum ground states. We prove that, for the normalized code-projector state of a $\mathbb{Z}_d$ qLDPC stabilizer code under local Pauli noise, the CMI across a buffer $B$ separating $A$ from $C$ decays exponentially with the width of $B$ in two complementary noise regimes independent of system size. At weak noise, this holds for full-system tripartitions, where correlations between the two sides require an error cluster to cross the buffer, an exponentially unlikely event. At strong noise, exponential decay holds whenever the buffer supports no logical operator, since correlations can persist only along rare chains of buffer qudits that remain informative. Under an additional space-uniformity assumption, we establish the robustness of Levin--Wen topological entropy. On finite-dimensional lattices of size $n$, the weak-noise bound further implies a constant-layer quasi-local Petz recovery channel of range $O(\poly(\log n)/\varepsilon)$ that recovers the noiseless state within trace-distance error $\varepsilon$. Both CMI bounds apply to general qLDPC interaction graphs, including geometries where such constant-depth quasi-local recovery need not exist. Thus, the exponential decay of the noise-induced CMI provides a general criterion for mixed-state phase stability.
arXiv·2026-10-15·Steffen Bollmann et al.
No generated summary available for this entry.
overview
Original abstract
Motivated by recent experimental signatures of fractional Chern insulators in 2D quantum materials, we investigate the realization of $\mathbb Z_3$ parafermion zero modes (PZMs) on edges of spin-polarized $ν=2/3$ fractional quantum Hall states which are proximitized by superconductors. Unlike the spin-unpolarized Halperin state, the polarized $ν=2/3$ edge contains counterpropagating electron and fractional quasihole modes, giving rise to a plethora of competing tunneling and pairing processes. We focus on the vicinity of the fixed point where these modes reorganize into decoupled charge and neutral sectors, with the neutral sector describing an emergent dipole degree of freedom. Using bosonization and renormalization group analysis, we lay out the parameter space in which the interedge dipole interactions gap the neutral sector to stabilize one dominant tunneling and one dominant pairing channel resulting in a double sine-Gordon model in the charge sector which supports $\mathbb{Z}_3$ PZMs at domain walls. We discuss both clean and disordered systems. In clean systems this mechanism requires a certain degree of control of the interaction strength and range. In contrast, disorder can provide a more generic route: While short-ranged, edge-uncorrelated disorder % on the two edges suppresses the simultaneous pinning required for stable parafermion modes, when the disorder on the two edges is sufficiently correlated, as expected for smooth disorder potentials, the parameter regime hosting PZMs increases.
arXiv·2026-10-15·Sara Santos, Alessio Paviglianiti, Vincenzo Savona
No generated summary available for this entry.
overview
Original abstract
The quantum-trajectory description of a noisy quantum circuit is not unique: every Kraus representation of the noise channel defines a different unraveling, i.e., a different ensemble of pure states that averages to the same density matrix. While all unravelings share the same expectation values of observables, they generally differ in the amount of quantum resources carried by the individual trajectories. Here we study non-stabilizerness, or magic, quantified by the stabilizer Rényi entropy, in quantum-trajectory unravelings of Haar-random and $T$-doped random Clifford brickwork circuits subject to local dephasing noise of strength $p$. The canonical unraveling in terms of Pauli jumps is Clifford and leaves magic untouched, so that trajectories retain the Haar-random value of non-stabilizerness. Exploring the full two-parameter family of minimal unravelings, we find that the trajectory-averaged magic can be substantially reduced by a state-independent choice of Kraus operators, and that the optimal choice is not in general the projective-measurement unraveling, but a two-outcome generalized measurement in which the Kraus operators correspond to a weak measurement of the noisy qubit. The optimal unraveling reduces the extensive magic density of the trajectories by a $p$-dependent factor without altering its linear scaling with system size. At the same time, it produces a very broad distribution of magic over trajectories, with a sizable fraction of trajectories retaining Haar-random magic. Since the cost of stabilizer-based classical simulation grows exponentially with the magic of the state, these high-magic trajectories, rather than the average, control the simulation cost. Our results delineate the potential and the limitations of unraveling optimization as a route to the classical simulation of noisy quantum dynamics with stabilizer methods.
arXiv·2026-10-15·Yifei Wang, Yingfei Gu
No generated summary available for this entry.
overview
Original abstract
Classical simulation of magic state factories, including distillation, cultivation, and code switching, is challenging because of their substantial non-Clifford content. We introduce $\texttt{magna}$ (magic-state-factory assessment via global network algebra), a classical simulator that simulates such protocols as cheaply as Clifford circuits. $\texttt{magna}$ expresses the figures of merit of a protocol, namely the acceptance rate and the fidelity of the accepted states, as tensor networks, which it reduces globally by exploiting a structural correspondence with transversal gates on quantum codes. $\texttt{magna}$ further supports feedforward conditioned on arbitrary functions of mid-circuit measurement outcomes, including decoder outputs. We simulate Bravyi--Haah distillation with up to 100 output magic states at a cost that does not grow exponentially in the number of outputs, and achieve state-of-the-art sampling times for distance-5 magic state cultivation on both color codes and RP$^2$ surface codes. Finally, we validate nonlinear feedforward on a logical-level distillation protocol with 15 rounds of decoder-dependent feedforward. $\texttt{magna}$ aims to contribute to the key infrastructure for the large-scale evaluation and optimization of magic state factories.
arXiv·2026-10-15·Gerardo Adesso, Ludovico Lami, Vittorio Giovannetti
No generated summary available for this entry.
overview
Original abstract
The classical capacity of a noisy optical channel is the maximum rate at which information can be transmitted reliably, given a constraint on the mean input energy. For the ubiquitous bosonic Gaussian channels, which include standard models of loss and noise in fibre and free-space optical links, determining this rate requires addressing whether entanglement between channel uses or non-Gaussian signals can outperform Gaussian encodings. More precisely, the question is whether the energy-constrained Holevo information is additive across arbitrarily many channel uses and coincides with its Gaussian counterpart. We answer these fundamental questions in the affirmative for every single-mode bosonic Gaussian channel at every input energy. Namely, we prove that independently prepared Gaussian states with Gaussian-distributed random displacements achieve the capacity, including in the low-energy regime where squeezing the signals competes with encoding information in their displacement. Our proof connects an entanglement inequality to a sharp, additive lower bound on output entropy. We then characterise communication above capacity: under a strict total photon-number cutoff, the probability of correct decoding decreases exponentially with the number of channel uses, and we derive explicit bounds on the decay exponent. When only the mean photon number is constrained, a simple energy-rescaling formula determines exactly the entire asymptotic rate--error trade-off: the capacity at mean photon number $N$ and allowed average decoding error $ε$ equals the vanishing-error capacity at mean photon number $N/(1-ε)$. Together, these results identify the ultimate limits of classical communication for some of the most fundamental models of optical communication.
arXiv·2026-10-15·Yiyu Xia et al.
No generated summary available for this entry.
overview
Original abstract
Moiré semiconductors provide a physical realization of the Hubbard model. Bandwidth-tuned Mott transitions and complex phase diagrams mimicking those of high-temperature superconductors have been demonstrated near a weak Mott insulating state at half-band-filling. The platform also provides an opportunity to explore the physics of a partially filled Hubbard band at doping densities far away from the Mott insulator, a regime that has remained largely unexplored. Here we report the emergence of an extended strange metal (ESM), in both doping density and twist angle, in a partially filled Hubbard band of twisted bilayer WSe2. The ESM is in the clean limit, persists down to 100mK, and spans over multiple symmetry-breaking ground states; it also appears only at small twist angles, where electronic correlations are strong. These observations distinguish the state from the reported strange metals associated with quantum criticality and favor the viewpoint that it is an intrinsic state of matter. We also report the observation of a new superconducting dome being developed from the ESM but far away from both the Mott insulating state and the van Hove singularity of the material. Our work opens the door to exploring the new regime of partially filled Hubbard bands in the clean limit.
arXiv·2026-10-15·Florian Matz et al.
No generated summary available for this entry.
overview
Original abstract
Capturing static and dynamic electron correlation simultaneously at manageable computational cost remains a key challenge in electronic structure theory. Motivated by the recurring role of effective temperature in self-consistent field methods we extend the adiabatic connection mechanism from density functional theory to include a temperature dimension. This gives rise to thermally enhanced hybrid functionals, in which static correlation is captured via fractional occupations generated by an effective "correlation temperature" within thermal Hartree-Fock, while dynamic correlation is described by established density functional approximations. The framework formally unifies information-density matrix functional theory (i-DMFT) and thermally-assisted-occupation (TAO-)DFT as special cases, clarifying their theoretical basis and the respective prescriptions for the temperature parameter. We assess the performance of several thermally enhanced hybrids for different cases where i-DMFT was previously shown to fail. Furthermore, we discuss and test different schemes for determining the correlation temperature and investigate the accuracy of different such choices for a benchmark set derived from biphenyl. The results help to clarify the achievable balance of accuracy, generality, and efficiency, establishing thermally enhanced hybrids as a systematic route toward low-cost treatment of both correlation types.
arXiv·2026-10-15·Nicholas S. DiBrita, Jack Lange, Tirthak Patel
No generated summary available for this entry.
overview
Original abstract
Fault-tolerant quantum computing (FTQC) introduces substantial systems-level complexity through quantum error correction (QEC), making debugging FTQC programs challenging. Existing quantum debugging approaches primarily target logical-level circuits and do not naturally support debugging within realistic FTQC execution flows. We present SynDebug, the first systems-level debugging framework for FTQC programs. SynDebug introduces lightweight assertion-based debugging primitives that operate directly within encoded FTQC infrastructures while avoiding additional logical surface area and minimizing temporal overhead. We evaluate SynDebug across multiple QEC code families, code distances, and encoded workloads, including state preparation, entanglement validation, and Shor-style programs. Our results demonstrate that SynDebug enables practical FTQC debugging with an average 1.8% additional circuit depth overhead (0% in most cases) and no measurable increase in the logical error rate, showing that systems-level debugging for large-scale FTQC applications is both feasible and practical.
arXiv·2026-10-15·Weyner Ccuiro, Rosario Fazio, Alessandro Silva
No generated summary available for this entry.
overview
Original abstract
We investigate the fate of quantum many-body scars in the PXP model subject to Markovian dissipation. We show that when local jump operators respect the same symmetries of the Hamiltonian the full Liouvillian spectrum displays a tower of states with properties analogous to standard quantum scars: large overlaps with Néel states and equally spaced gaps in the imaginary part of the eigenvalues, set by a single frequency. Whether the long-time dynamics is dominated by scars is determined by the real parts of the eigenvalues, which are set by the ratio between the two relaxation rates $γ_{\pm}$ describing spin flips down-to-up or up-to-down respectively. For asymmetric dissipation ($γ_+ > γ_-$) the scarred eigenvalues have the smallest real parts: the resulting enhanced fidelity oscillations are further stabilized by staggered jump operators. In contrast, replacing the full projection operator in the dissipators with a partial one breaks the symmetries of the problem and is seen to destroy dissipative scars altogether.
arXiv·2026-10-15·Angus Crookes, Ben Yuen, Angela Demetriadou
No generated summary available for this entry.
overview
Original abstract
Fault tolerant quantum computers greatly benefit from having both high fidelity entangling gates and a non-local qubit connectivity. However, most entangling gates for neutral atoms are local, requiring separated atoms to be moved using optical tweezers to yield entanglement between them. Here, we design a high fidelity Mølmer Sørensen-like entangling gate between neutral atoms coupled to a photonic cavity, enabling a programmable all-to-all connectivity through the shared cavity coupling. The gate is both robust to changes in cavity photon number, and enables selective entanglement between any subset of separated atoms through local laser addressing. This eliminates the need to physically move atoms to perform the gate, and therefore motional errors and erasure are suppressed. Using experimentally realistic parameters we demonstrate gate fidelities exceeding $F > 0.99$, with higher fidelities achievable through optimal control of the pump amplitudes.
arXiv·2026-10-15·Manish Chaudhary, Tim Byrnes
No generated summary available for this entry.
overview
Original abstract
We develop a technique to perform efficient unitary time evolution of a general spin Hamiltonian based on the system with identical qubits, as naturally realized by permutation symmetric atomic ensembles. We employ Cartan decomposition method to the associated Hamiltonian Lie algebra and construct the symmetry adapted generators to implement unitary operator of the ensemble Hamiltonian. This enables the compact circuit representations of the system dynamics in terms of experimentally accessible collective spin operations and exploits the Dicke basis structure of the ensembles as an effective qudit representation. We benchmark Cartan based evolution against both exact time evolution and the Suzuki Trotter product formula. Our results show that the Cartan protocol accurately reproduces the operator dynamics, spin expectation values, and fluctuation observables with zero error that are substantially smaller than those obtained through Trotterization while maintaining an optimized circuit structure. In addition, scaling analysis with the ensemble size demonstrates that the Cartan error remains independent of the atom number while the corresponding Trotter error increases with the system size, highlighting the improved efficiency of the Cartan approach for a larger system size.
arXiv·2026-10-15·Eduardo Dueñez, José Iovino
No generated summary available for this entry.
overview
Original abstract
The paradigm of a simple unstable theory in the sense of Shelah is the theory of the random graph, the Fraïssé limit of the finite graphs. Quantum error correction has a paradigm of its own, and we show that it is the counterpart of the random graph: the Pauli group on countably many qubits, taken modulo phases and with commutation as its relation, is the Fraïssé limit of the finite alternating spaces over the two-element field, and its form computes the syndromes of stabilizer codes. Seen through this correspondence, simplicity theory turns out to be a theory of error correction. Clifford encoding circuits implement the homogeneity of the Pauli group, forking recognizes the logical errors, and the independence theorem of Kim and Pillay is the gluing of syndromes. The two paradigms look alike as first-order structures, and they part company only when observables enter. Each defines a bipartite observable, and we prove that, once preparations are mixed, both acquire the tree property of the second kind in real-valued logic. They reach it by different roads, however, and we show that the probes decide which. The probes of the Pauli observable are the Pauli channels; for them the indicator of each syndrome sector is the difference of the responses of two uniform mixtures, and actual mixtures already witness the tree. The probes of the Rado observable see only marginals; conditions given by actual mixtures remain compatible on disjoint blocks, and the tree must be sought among idealized preparations.
arXiv·2026-10-15·João Santos et al.
No generated summary available for this entry.
overview
Original abstract
Semiconductor spin qubits offer a promising route to compact and scalable quantum computers, combining long coherence times in isotopically purified silicon with compatibility with semiconductor manufacturing. Beyond computational speedup, their energy efficiency is an important consideration for future large-scale systems. We evaluate the power and energy requirements of a Loss-DiVincenzo spin-qubit quantum computer by analyzing the Quantum Fourier Transform (QFT) and benchmarking it against the classical Fast Fourier Transform (FFT). We develop a detailed energy budget, identifying cryogenic cooling as the dominant baseline contribution before quantum error correction (QEC). The comparison between the QFT and the classical FFT reveals that, for any quantum workload operating under a polynomially bounded sampling regime, the crossover in energy consumption occurs at smaller problem sizes than the crossover in execution time. Thus, quantum computing can become energetically competitive before achieving a speedup in execution time. We then incorporate surface-code QEC and analyze the energy costs of QEC cycles, gate synthesis, and decoding. At scale, instrumentation and decoding become dominant contributions, while cryogenic cooling imposes a constraint on scalability. We show that optimizing the control-signal demultiplexing ratio can reduce the overall energy cost by approximately two orders of magnitude. For a system with about one million physical qubits, we estimate a power consumption of approximately 100 kW, at least one order of magnitude below that of today's highest-performance classical computing systems.
arXiv·2026-10-15·L. Sunil Chandran, Rishikesh Gajjala
No generated summary available for this entry.
overview
Original abstract
Greenberger-Horne-Zeilinger (GHZ) states are multipartite entangled quantum states that play a central role in quantum information theory, with applications in quantum communication, cryptography, and distributed quantum computing. A major experimental goal is to create high-dimensional GHZ states using multiple entangled parties. Krenn, Gu and Zeilinger discovered a surprising bridge between these quantum-optical experiments and graph theory: certain photonic experiments can be represented by edge-coloured, edge-weighted graphs, and the dimension of the produced GHZ state equals the number of feasible monochromatic inherited vertex colourings. This led Krenn and Gu to conjecture that every GHZ graph with more than four vertices has dimension at most $2$. A counterexample would give a new high-dimensional multipartite GHZ construction, while a proof would clarify fundamental resource limitations in quantum optics. It is known that the conjecture holds for graphs of vertex connectivity at most $2$ [MFCS 2024], and that simple GHZ graphs with $n>4$ vertices have dimension less than $n/\sqrt{2}$ [Quantum 2024]. However, no general upper bound depending only on vertex connectivity was known. We prove that every simple connected GHZ graph $G$ with at least four vertices has dimension at most $2^{κ(G)-1}+\binom{κ(G)}{2}$, where $κ(G)$ is the vertex connectivity of $G$. We also prove new bounds in terms of edge connectivity and maximum degree.
arXiv·2026-10-15·Ciro Salcedo et al.
No generated summary available for this entry.
overview
Original abstract
Assuming only the solubility of Kirchhoff's laws, the conservation of energy, and the form of the constitutive relations, we present a flux-charge symmetric Hamiltonian formalism that always admits a symplectic reduction for nonsingular, well-posed circuits involving gyrators, inductors, and capacitors (LCG circuits) with arbitrary non-linearity. The formalism introduces a notion of circuit duality on non-linear non-reciprocal circuits and a family of point transformations that inserts, removes, and moves reciprocal elements across gyrators while preserving the Hamiltonian spectrum. With these transformations, we extend Tellegen's classic result that gyrators make reciprocal elements behave as their dual to non-linear reciprocal elements such as the Josephson junction and quantum phase slip. Furthermore, we present conditions under which non-reciprocal circuits can be transformed to dynamically equivalent reciprocal circuits.
arXiv·2026-10-15·Paul G. Graf et al.
No generated summary available for this entry.
overview
Original abstract
It is common wisdom that a better understanding of how to quantify electron correlation should lead to more efficient treatments of the correlation problem. Here, we not only substantiate this view but turn it into a concrete, systematic framework for ground states. Since prominent correlation measures such as the nonfreeness depend only on the one-particle reduced density matrix, modeling the correlation energy as a function of such a measure naturally places the framework within reduced density matrix functional theory, while keeping the cost at mean-field level. Strikingly, the variable conjugate to the measure emerges as a ``correlation temperature'', thereby connecting correlation measures, functional theory, and effective temperatures. The framework rationalizes methods such as i-DMFT, and we illustrate its key concepts analytically for the Hubbard dimer and numerically for small molecular systems. This brings a fundamental question within reach: how much of the correlation problem can be solved at mean-field cost?
arXiv·2026-10-15·Christopher Chamberland et al.
No generated summary available for this entry.
overview
Original abstract
We introduce patchwork, a lattice-surgery compiler for arbitrary multi-qubit Pauli measurements on a prescribed narrow-corridor two-dimensional surface-code layout. Systematic geometric rules simplify stabilizer placement and gate scheduling, including for logical $Y$ measurements implemented using twist defects. We introduce measurement circuits and schedules that, together with protruding lobes of $Y$-extension patches, preserve the full effective code distance for all numerically tested code distances. To support parallel decoding, we develop a wavefront algorithm that partitions merged lattice-surgery patches into space-time commit, buffer, and cleanup regions. Simulations of three sequential multi-qubit Pauli measurements acting on ten logical qubits show that staged decoding achieves total failure probabilities close to those of monolithic decoding over the parameters tested. These methods provide an automated framework for fault-tolerant lattice surgery and a route toward scalable, real-time decoding.
arXiv·2026-10-15·Atta ur Rahman et al.
No generated summary available for this entry.
overview
Original abstract
Tests of gravity-mediated entanglement aim to determine whether two massive objects in spatial superposition can become entangled through their mutual gravitational interaction. In an ideal model, the two objects are often treated as pointlike branches, but real wave packets have a finite width and are also exposed to dephasing and residual non-gravitational forces. We study these effects in a two-branch gravitational cat-state model with Gaussian wave packets. The Newtonian interaction is averaged over the finite wave-packet width, and spatially correlated dephasing is included phenomenologically. We then ask a practical question: when does the generated state remain useful rather than merely entangled? To answer this, we examine Bell violation, teleportation fidelity, coherent information, Fisher information, and state distinguishability. We find finite parameter windows where the same state is Bell-nonlocal and teleportation-useful, but these windows shrink as the wave packets become broader or the dephasing becomes stronger. We also show that a residual electrostatic branch interaction can coherently cancel the gravitational nonlocal phase and strongly suppress the operational signal. The results identify finite-width and electrostatic tolerance boundaries that should be considered in future tests of gravity-mediated entanglement.
arXiv·2026-10-15·Yuichiro Minato
No generated summary available for this entry.
overview
Original abstract
On a chain of exchange-coupled quantum dots a Heisenberg exchange pulse of area pi is a SWAP, so the parallel bubble-sort SWAP network of superconducting chains is native to exchange-only (EO) spin qubits, and any other pulse area fuses routing with an entangling interaction. We build a variational "bubble-sort exchange network" (odd-even transposition, one parameter per pulse) and study it as a Born machine read out by Pauli spin blockade. Exchange conserves total spin, so the reachable readout distributions are fixed by the total-spin content of the initial product state. For the two-spin singlet-triplet encoding we derive a selection rule -- outcomes with k triplet pairs are bounded by the initial weight in sectors S <= k (S = 0 excluded for k = 1) -- and prove by a transportation argument that it is also sufficient: the reachable distributions form the polytope cut out by the rule, and its total-variation floor is attained. Products of singlets and T0's forbid whole outcome classes; the Neel state forbids none; the three-spin EO code has no floor. We then distil, in noise-free simulation, next-token distributions of GPT-2 over restricted vocabularies into the network, with matrix-product-state (MPS) Born machines as classical control. At six logical qubits the three-spin chain reaches KL = 0.011 nat at depth N and 0.004 at 2N, below the bond-dimension-4 MPS; the two-spin chain from the Neel state reaches 0.014 at 2N and 0.004 at 3N, against 0.28-1.5 from singlet/triplet products for the first teacher. Final states lie largely outside the code space: leakage is a resource, not an error. No arrangement of disjoint pulses meets every pair in fewer than N-1 rounds, and at depth 2N the chain distils as well as a 2D array or non-local couplings. Sector-restricted simulation extends this to 10-14 logical qubits (up to 30 dots).
arXiv·2026-10-15·Federico Tomás B. Pérez et al.
No generated summary available for this entry.
overview
Original abstract
Classical simulation of quantum many-body dynamics is challenged by the rapid growth of operator complexity, particularly in higher dimensions where tensor-network methods become increasingly demanding. We develop state-adapted Pauli-weight propagation based on generalized $m$-body mean-field projections, which compress many-body observables into optimal low-body representations in a covariance geometry induced by the initial state. Combined with adaptive Krylov-like restricted Heisenberg dynamics, this provides an alternative to conventional Hilbert--Schmidt Pauli-weight truncation. We derive necessary and conditional sufficient bounds on low-body approximation accuracy using standard operator complexity measures and characterize possible dynamical failure mechanisms of the state-adapted method. Numerical benchmarks demonstrate substantial state-dependent accuracy gains, while identifying regimes of reduced accuracy or violations of Pauli spectral bounds. For a three-dimensional system of $80$ interacting spins, our method achieves strong body-order convergence, close agreement with independently converging tensor-network simulations, and substantially smaller sparse Pauli representations. These results establish state-adapted Pauli propagation as a promising approach to classical simulation of higher-dimensional coherent many-body dynamics.
arXiv·2026-10-15·Sankar Das Sarma, Yang-Zhi Chou
No generated summary available for this entry.
overview
Original abstract
We study interlayer exciton superfluidity versus layer separation in two-dimensional electron-hole bilayers at zero magnetic field and quantum Hall bilayers at total filling $ν_T=1$. Unscreened Hartree-Fock theory predicts coherence at every finite separation, with an energy scale decaying inversely with separation at large distances. We examine how screening, correlations, and spatial instabilities modify this prediction. At zero field, we solve the linearized gap equation with the full momentum and frequency dependence of the interaction screened within the random-phase approximation, without an imposed cutoff. The apparent plasmon enhancement of pairing in the ladder approximation is largely cancelled by the second-order crossed-rung correction. Static screening determines the leading pairing exponent in the controlled high-density limit at fixed separation. At large separation, the pairing scale falls exponentially with squared separation while the instability persists. Extending this result to fixed density assumes Fermi-liquid layers and higher-order dynamical corrections subleading to the static pairing interaction. At high field, we obtain an analytic uniform Hartree-Fock saddle point in the lowest Landau level, coherent at every finite separation. Within Hartree-Fock theory, its finite-wave-vector collective-mode instability favors an excitonic supersolid, distinguishing loss of spatial uniformity from loss of coherence. We conjecture that the quantum Hall bilayer evolves continuously toward weak pairing of composite fermions, with a scale far below the mean-field prediction at large separation. This suppression could produce an apparent critical separation at finite temperature without a ground-state quantum phase transition. The comparison separates the existence, energy scale, and spatial stability of interlayer coherence.
arXiv·2026-10-15·Dara Murphy et al.
No generated summary available for this entry.
overview
Original abstract
We examine how a finite many-body system can function as an effective charger for a single-qubit quantum battery, using the Lipkin-Meshkov-Glick model as a paradigmatic setting. As our figure of merit, we consider the battery ergotropy while explicitly resolving the energetic flows across the composite system. In the absence of intra-charger interactions, we show that the generation of non-zero ergotropy is controlled by the competition between collective coupling and spectral mismatch. We further demonstrate that even passive positive-temperature charger states can generate finite battery ergotropy, provided the charger is sufficiently large and sufficiently hot. Intra-charger interactions restructure the charger spectrum and qualitatively modify the available energetic pathways. While they can enhance the amount of energy accessible for charging, they can simultaneously divert energy into internal many-body and battery-charger interaction channels, producing an energetic impedance to direct charger-to-battery transfer. Consequently, battery ergotropy alone is insufficient to characterize an effective many-body charger: the useful work generated and its energetic provenance must be assessed together.
arXiv·2026-10-15·Julián Defant et al.
No generated summary available for this entry.
overview
Original abstract
In this work we study the application of two-photon correlated quantum states for high-precision time estimation. To achieve this, photon pairs were fed into a Hong-Ou-Mandel polarization interferometer to generate N00N entangled states with $N = 2$. Two- and four-detector schemes were considered, and the achievable time estimation precision of each was studied, with particular emphasis on the system's Fisher information in each case. Our results reveal that using a four-detector scheme, enabling the measurement of both coincidence and photon-bunching terms, achieves the maximum precision given by the quantum Fisher information, without the need of characterizing system losses. We also show that correlations between repetitions arise due to systematic errors, limiting the precision enhancement that can be obtained by increasing the number of repetitions. Taking these correlations into account, we show that the four-detector scheme outperforms the two-detector scheme in the precision of time-delay estimation. With the experimentally determined calibration uncertainties, the four-detector scheme improves the dispersion by a factor of 2 for the repetitions performed, reaching up to a factor of 4 as both schemes approach their systematic floors.
arXiv·2026-10-15·Kirtpreet Singh, Arvind
No generated summary available for this entry.
overview
Original abstract
Realistic non-Gaussian operations, which can be implemented by mixing a nonclassical Gaussian state with a Fock state at a beam splitter and then heralding on a photon-number-resolving detector, are known to improve phase estimation in a Mach-Zehnder interferometer. The existing studies have considered the single-mode squeezed vacuum for difference-intensity and parity detection, and the two-mode squeezed thermal state for parity detection alone as the initial Gaussian resources. However, a real squeezer in the lab actually produces single-mode squeezed thermal light, which has not been studied in a coherent-plus-resource interferometer. We take up this case and using the phase space Wigner picture, we obtain the heralded state produced by photon subtraction, addition and catalysis on a single-mode squeezed thermal resource, and evaluate the corresponding phase sensitivities. Single-photon catalysis, which is useless on squeezed vacuum, becomes a useful operation for any thermal occupation above $\nth\simeq0.2$, and since it heralds with a probability near one-half, it turns out to be the best success-weighted operation over the whole thermal range. In the vacuum limit our results reproduce the known hierarchy, where two-photon catalysis is the best operation. The quantum Fisher information computations confirms that thermal noise enhances the phase information encoded in the catalyzed state, demonstrating that difference-intensity detection closely approaches the ultimate precision bound across most operational regimes, and, together with a loss analysis, verifies the robustness of the effect.
arXiv·2026-10-15·Dennis Herb et al.
No generated summary available for this entry.
overview
Original abstract
The use of reinforcement learning (RL) in the design of quantum control strategies for pulse level control of NISQ era quantum devices is attracting growing interest. Model-free RL, not requiring preexisting knowledge of the physical system, acts as a black-box optimization tool well suited for noisy devices. In this work, we provide a simulation-based analysis of the performance of model-free RL for state preparation and qubit gate design in a challenging setup: indirect control of NV nuclear spins in a spin-bath. In particular, the spin-bath is modeled via the generalized cluster correlation expansion accounting for magnetic impurities and intra-bath interactions. We analyze the performance of the RL agents by performing simulations with minimally observable environments and noisy, sparse rewards as introduced in (Phys. Rev. X 12, 011059), and compare them to other state-of-the-art black-box optimization tools.
arXiv·2026-10-15·Koushik Bhakta, Bikash Bhattacharjya
No generated summary available for this entry.
overview
Original abstract
We completely classify connected Cayley graphs over finite abelian groups that exhibit perfect state transfer in Grover walks. First, we show that a Cayley graph over any finite group exhibiting perfect state transfer has valency $1$, $2$, or $4$. For valency $4$, we prove that an abelian Cayley graph $\operatorname{Cay}(Γ,S)$ exhibits perfect state transfer if and only if $S=\{a,-a,a+h,-a+h\}$, where $h$ has order $2$, and $4\nmid |Γ|/2$. Combining this characterization with the valency-one and valency-two cases, we explicitly determine all pairs $(Γ,S)$ for which $\operatorname{Cay}(Γ,S)$ exhibits perfect state transfer. Our results extend the classification of circulant graphs of valency at most four obtained by Kubota and Yoshino [Circulant graphs with valency up to 4 that admit perfect state transfer in Grover walks, \emph{J. Comb. Theory Ser. A.}, 216 (2025) 106064] to Cayley graphs over arbitrary finite abelian groups and to all valencies.
arXiv·2026-10-15·Xiaolin Wang et al.
No generated summary available for this entry.
overview
Original abstract
Quantum computing offers a promising approach to non-perturbative simulations of quantum field theories, particularly for real-time dynamics and systems affected by the sign problem. Yet translating continuum field theories into quantum computations remains a challenging interdisciplinary task. Here we introduce \texttt{Jianmu-Q}, a multi-agent framework that transforms natural-language descriptions of quantum field theories into quantum simulation workflows. Specialized agents handle theoretical formulation, lattice discretization, qubit mapping, and circuit design, while physical consistency checks and independent numerical calculations provide validation throughout the workflow. We benchmark the framework on three field theories of increasing complexity: the $(1+1)$-dimensional Nambu--Jona-Lasinio and Schwinger models, and a $(2+1)$-dimensional $\mathbb{Z}_2$ gauge theory. Across these systems, noiseless quantum-circuit simulations converge toward independent exact-diagonalization and tensor-network results, while selected circuits are executed on IBM quantum hardware, demonstrating an end-to-end, validation-guided approach to quantum simulation of field theories.
arXiv·2026-10-15·Akinori Machino et al.
No generated summary available for this entry.
overview
Original abstract
Far-detuned frequency allocations in fixed-frequency superconducting processors mitigate spectral crowding but constrain cross-resonance interactions at practical drive amplitudes. Here, we demonstrate that a single strong drive induces a large $XX-YY$ interaction in the far-detuned regime, while a weak second tone tunes the accompanying $ZZ$ phase. The interaction realizes a 150-ns $\sqrt{\mathrm{bSWAP}}$ gate, which can directly prepare a maximally entangled state from the ground state. For the implementations on the same qubit pair at matched drive strengths, cross resonance gives a shorter CNOT operation, while $\sqrt{\mathrm{bSWAP}}$ gives a 33% shorter SWAP operation with a higher IRB fidelity. The multilevel theory further predicts a regime where stronger driving can yield a speed advantage for CNOT as well, a possibility absent in the two-level model. As an application of the $XX-YY$ interaction, we also demonstrate two-spin squeezing beyond the standard quantum limit through two-axis countertwisting. The interaction realized here complements cross resonance and offers a route to efficient gate synthesis and quantum simulation of interacting spin systems.
arXiv·2026-10-15·Si-Yu Zhang et al.
No generated summary available for this entry.
overview
Original abstract
Protecting quantum batteries from environmental noise remains a challenge. Using exact Burshtein-Kubo equations, we study a two-spin quantum battery with Dzyaloshinskii-Moriya (DM) coupling under indepen dent local longitudinal random telegraph noise (RTN). At a fixed effective noise scale, the DM-assisted slow switching protocol yields a superadditive transient ergotropy gain and near-maximal ergotropy during the initial charging stage, while the no-DM slow-switching control reaches comparable ergotropy only in a later revival. A finite superadditive region persists at fixed RTN amplitude, with protocol-dependent location and gain. In the Ising model, the enhancement is nonmonotonic in DM strength, with intermediate coupling giving near-optimal performance. Dressed-channel analysis associates this enhancement with changes in transition frequencies and longitudinal-noise matrix elements that reduce slow-RTN spectral weight. Superadditivity also persists in the tested anisotropic XY model.
arXiv·2026-10-15·Leonid Chaichenets et al.
No generated summary available for this entry.
overview
Original abstract
The quantum Buridan's ass problem concerns a network of interconnected nodes in which transitions between the nodes are governed by the laws of quantum mechanics. In such situations interference between probability amplitudes plays a key role in determining whether the probability of leaving the initial node is large or small and also the speed at which the associated transitions occur. In this paper we extend this idea to consider transitions between one given set of coupled nodes and the remainder of the network. We have in mind a quantum analogy to changing an opinion, in which the initially occupied set of nodes is one opinion bubble, with the remaining parts of the network corresponding to a different opinion. We find that quantum interference again plays a crucial role in the dynamics. A further key component is the role of symmetry between the nodes and their interconnections, as it is symmetry that lies at the heart of the Buridan's ass puzzle. In the classical Buridan's ass paradox it is symmetry between competing alternatives that freezes the ass into indecision. In the quantum case, however, interference results in a far richer dynamics.
arXiv·2026-10-15·Sabine Häussler et al.
No generated summary available for this entry.
overview
Original abstract
Hong-Ou-Mandel interference underpins many photonic quantum information protocols and is commonly characterized by a single visibility parameter. This quantity is typically obtained by averaging over a fixed coincidence window, thereby discarding details of the underlying temporal structure that are critical in continuous-wave processes. Four-photon interference with continuous-wave sources furthermore requires photon pairs with long coherence times, which we generate in microring resonators and measure with ultrafast time-resolved detection. Here, we model and resolve their interference and temporal structure by recording all four photon arrival times and mapping their relative delays onto a three-dimensional coincidence histogram relative to a trigger detection. The resulting structure preserves relative arrival-time correlations that are usually discarded and enables post-processed optimization of coincidence windows to trade off visibility against count rate. This method provides a general benchmark for continuous-wave sources in interference-based quantum network protocols.
arXiv·2026-10-15·Maria-Andreea Filip, George H. Booth
No generated summary available for this entry.
overview
Original abstract
Selected configuration interaction (SCI) obtains accurate many-body solutions by variationally diagonalising the Hamiltonian in a sparse, iteratively selected set of configurations, but can lose compactness when the target state has broad configurational support. We introduce selected stabilizer interaction (SSI), a fully classical, SCI-inspired method that instead iteratively constructs a nonorthogonal subspace spanned by a systematically enlargeable set of selected stabilizer states. A single stabilizer, generated by Clifford operations, can encode a structured superposition of (possibly exponentially) many configurations, shifting the relevant compression from configurational to stabilizer sparsity. We benchmark ground-state energies, fidelities, superposition degrees and required expansion lengths against exact diagonalization and equivalent SCI schemes for the transverse-field Ising, XXZ Heisenberg, and Hubbard models, finding particularly strong compression from the stabilizer representation in the spin models, and increasing advantage with system size for these systems. The results establish a proof of principle for heuristic selected stabilizer diagonalization, while also identifying particular challenges in symmetry handling and effective exploration of the stabilizer space.
arXiv·2026-10-15·Silvie Illésová, Vojtěch Novák
No generated summary available for this entry.
overview
Original abstract
Emergency-priority traffic signal control requires reducing emergency-vehicle delay while limiting disruption to ordinary traffic. This work investigates a finite-horizon QUBO formulation and compares Exact QUBO optimization, QAOA, CVaR-QAOA, a quantum machine-learning policy, fixed-time control, and max-pressure control in a three-intersection corridor. The study evaluates three traffic-demand regimes, examines the effect of the emergency-priority weight, and compares quantum solutions with the exact QUBO optimum. The optimization-based controllers achieved reliable emergency progression across all tested demand regimes, while max-pressure produced lower ordinary-traffic delay. Increasing emergency priority reduced emergency travel time but increased congestion, with diminishing improvements at larger weights. CVaR-QAOA reproduced the exact QUBO solution more accurately than standard QAOA, although the resulting differences in closed-loop traffic performance were comparatively small.
arXiv·2026-10-15·Shiroman Prakash, K. L. Ramya
No generated summary available for this entry.
overview
Original abstract
Together with a right-handed neutrino, the fermions of one generation of the Standard Model are labelled by five bits, a combinatorial structure tied to anomaly cancellation. We make this precise. Anomaly cancellation is the vanishing of a cubic form, the defining property of triorthogonal codes, the quantum error-correcting codes behind magic state distillation. Removing the right-handed neutrino gives a $[[15,1,3]]_p$ code for every prime $p$, including the Bravyi-Kitaev code for $p = 2$. For qutrits it is the unique shortest distance-three triorthogonal code.
arXiv·2026-10-15·A. Solodovnyk et al.
No generated summary available for this entry.
overview
Original abstract
We probe the conductivity of the lowest Landau level of a moiré-aligned monolayer graphene device by broadband microwave transmission through a coplanar waveguide ($\sim$50 mK, 15.4--18 T), isolating the longitudinal channel through a low-minus-high frequency band difference $D(ν)$. We resolve a series of minima in $D(ν)$ that drift with field along lines of fixed carrier density rather than fixed Landau filling, the hallmark of moiré-commensurate electron crystals. The strongest minimum is present at every field and matches no fractional quantum Hall or integer Hofstadter state. It lies at band filling $s=1/3$, one electron for every three moiré cells---the generalized Wigner crystal that DaSilva, Jung, and MacDonald predict as the most favorable fixed-density ($t=0$) commensuration. The weaker minima fall near neighboring commensurate fillings.
arXiv·2026-10-15·Mathieu Féchant et al.
No generated summary available for this entry.
overview
Original abstract
Understanding the microscopic environment of superconducting qubits is a central challenge for quantum technologies. Parasitic two-level systems (TLSs) of various microscopic origins are ubiquitous and limit qubit performance through decoherence, frequency drifts, and leakage. Recently, long-lived TLSs with lifetimes exceeding those of state-of-the-art qubits have been shown to induce correlated qubit dynamics, with direct implications for quantum error correction. Here, we perform wide-band quantum-jump correlation spectroscopy on flux-tunable transmon qubits and identify microscopic degrees of freedom that outlive the qubit by orders of magnitude. Pump-probe measurements at varying detunings from these objects reveal intrinsic lifetimes exceeding one second. Their weak coupling to the qubit, in the kilohertz range, is consistent with positional defects described by the standard tunneling model, without excluding other microscopic origins such as magnetic spin impurities or trapped quasiparticles. More broadly, these results establish superconducting qubits as a sensitive probe of exceptionally long-lived microscopic degrees of freedom and open a route toward their controlled access and functionalization.
arXiv·2026-10-15·Ya Li et al.
No generated summary available for this entry.
overview
Original abstract
Cold-atom quantum memories require a near-zero magnetic environment (residual field <1 microtesla) to mitigate Zeeman decoherence. Conventional three-axis active compensation suffers from inter-coil crosstalk and geomagnetic drift, which degrade the uniformity and long-term stability of the zero-field region. To address this, we propose a spatiotemporally cooperative feedback-controlled suppression architecture for magnetic interference. An integrally printed three-dimensional orthogonal coil frame mechanically suppresses inter-axis flux leakage. A spatial feedforward inverse matrix is introduced to algorithmically eliminate first-order cross-coupling. A dual-threshold hysteresis incremental-PI controller filters magnetometer quantization fluctuations and avoids frequent small jitter adjustments of coil driving currents. Hardware ablation experiments, long-duration stability tests and spatial magnetic-field mapping were conducted. Experimental results show that during a 714.4 s continuous steady-hold stage, the mean and maximum residual fields at the central point reach 0.112 microtesla and 0.224 microtesla, respectively. The overlapping Allan deviations of all three components remain below 5 nT for averaging times of 1.9-178.2 s. Based on differential-ferrofluid lattice-scan measurements combined with centre-constrained quadratic vector reconstruction and soft Maxwell regularization, a weak-field spatial distribution with an RMS variation of 5.65 microtesla is fitted within a spherical region of interest of radius 5 mm, where 67.5% of the model volume meets the sub-5 microtesla coverage criterion. For a prolate ellipsoidal region matching the atomic-cloud distribution with full axis lengths of 10, 5, and 5 mm, the upper field bound within 93.7% of the volume is 2.68 microtesla.
arXiv·2026-10-15·Yixin Zhao
No generated summary available for this entry.
overview
Original abstract
We determine the finite-horizon identification limits of a \(d\)-dimensional memory when the control interface is restricted to four shared, time-homogeneous generators. A writer encodes a message by applying a prefix word to a common root state. The verifier then applies a candidate-dependent query word followed by a shared terminal binary test, with each word of length at most \(T\). For fixed error tolerances \(λ_2>0\) and \(λ_1+λ_2<1\), the optimal identification sizes satisfy \(\ln N_{\mathsf Q,4}=Θ_{λ_1,λ_2}(\min\{d^2,T\})\) for arbitrary CPTP generators and \(\ln N_{\mathsf S,4}=Θ_{λ_1,λ_2}(\min\{d,T\})\) for stochastic maps. Four unitary letters and four permutation letters attain these respective bounds, showing that a four-letter reversible alphabet reaches the static code-size orders in optimal quadratic and linear word length. In the fully dimension-limited regime, this yields \(\ln N_{\mathsf Q,4}=Θ(d^2)\) versus \(\ln N_{\mathsf S,4}=Θ(d)\), establishing a quadratic quantum--classical separation in logarithmic code size. Low-overlap Grassmann and agreement-code packings supply the orbit endpoints, while exact inverse query words match each encoded state to its designated test. At the sharp boundary \(λ_2=0\), \(0\leqλ_1<1\), all four model classes satisfy \(\ln N=Θ(\min\{\ln d,T\})\). Thus any fixed positive false-acceptance tolerance activates the metric-packing regime, whereas zero false acceptance imposes an exclusive-witness constraint and yields the logarithmic-dimension boundary.
arXiv·2026-10-15·Andres Arcia-Lopez et al.
No generated summary available for this entry.
overview
Original abstract
Riemannian optimization provides a natural geometric framework for designing quantum algorithms for ground-state preparation, most notably through quantum imaginary-time evolution. However, existing geometry-aware approaches primarily employ steepest-descent updates, leaving more advanced methods from classical Riemannian optimization largely unexplored. In this work, we introduce quantum conjugate gradient descent (QCGD), a quantum-compatible implementation of Riemannian conjugate gradient that combines the steepest descent direction with information retained from previous search directions. In our numerical experiments, the proposed approach achieves faster convergence per iteration than the baseline double-bracket quantum imaginary-time evolution (DB-QITE) algorithm, and we quantify the associated circuit cost with gate counts produced by Qrisp. This improvement, however, comes at the cost of increased circuit depth for each update step, revealing a trade-off between convergence rate and implementation complexity. Nevertheless, since the circuit depth for those algorithms grows exponentially with the number of iterations, the proposed method may offer practical advantages, particularly in the early fault-tolerant regime.
arXiv·2026-10-15·Michael Poppel et al.
No generated summary available for this entry.
overview
Original abstract
Angle-encoded variational quantum circuits implement truncated Fourier series. For one-dimensional inputs, a single-qubit re-uploading (serial) circuit represents every function that a multi-qubit circuit with the same encoding budget $E$ can; we find that this exchange of width for depth is not free in first-order training. Because its state lives on the Bloch sphere, all parameters of the serial circuit move the state, at each input, along one complex direction, which we call \emph{phase-locking}. We prove that this costs no Fourier direction but leaves no direction to spare: however many parameters it has, the serial circuit has at most $2E+2$ tangent directions, one more than its $2E+1$ Fourier coefficients need, while a two-qubit control with the same encoding budget and model class generically has at least $6E+6$. The cost in training is measured against this control, as the number of runs out of 100 that reach the optimum within a fixed step budget. On an exact loss with flat-spectrum targets the gap grows with $E$; at $E=32$ the serial circuit converges in 3, 53 and 83 runs under gradient descent, Adam and Levenberg--Marquardt, the control in 99, 100 and 100. On three real-world series, at matched parameter counts, the serial circuit reaches the least-squares optimum in at most 9 runs under Adam and in 32 to 93 under Levenberg--Marquardt, the control in at least 98 and in all 100; its held-out error is up to about $1.5$ times that of the control under Adam, but no larger in the typical run under Levenberg--Marquardt.
arXiv·2026-10-15·Dhananjoy Ghosh, Nandana J, Jaskaran Singh
No generated summary available for this entry.
overview
Original abstract
Finite rate randomness expansion (RE) which is secure against quantum adversaries is a crucial information processing task which is well studied in the case of two non-communicating parties sharing Bell non-local correlations in a device independent manner. In this paper we show that contextual correlations with only a single localized party are sufficient for RE in a semi-device independent (SDI) manner. We propose a template SDI-RE protocol which is applicable for arbitrary $N$-cycle non-contextuality (NC) inequalities and derive its RE rate under finite statistics. As a special case, we also highlight the advantages of the situation when RE is constrained by Clauser-Horne-Shimony-Holt (CHSH) inequality but with characterized measurements implemented by only a single party. Our template protocol also incorporates non-ideal statistics which may not satisfy perfect commutativity and perfect repeatability, both of which are necessary in a loophole-free test of NC inequalities. As such, several recent experimental implementations of significantly loophole-free tests of NC inequalities can be modified for secure RE following our approach.
arXiv·2026-10-15·Mrinal Kanti Giri, Pinaki Sengupta
No generated summary available for this entry.
overview
Original abstract
A deconfined quantum critical point (DQCP) is a continuous transition between ordered phases with unrelated broken symmetries, beyond the Landau-Ginzburg-Wilson paradigm. In one dimension, such a transition between a $z$-polarized ferromagnet (zFM) and a valence-bond solid (VBS) is well established numerically in a frustrated spin-$1/2$ chain. Here we ask whether a superconducting quantum processor can resolve this transition and its signatures despite finite-size effects and device noise. The ground states are prepared by ancilla-projected quantum imaginary-time evolution (QITE), whose exact target states are compressed by tensor-network optimization into shallow depth quantum circuits. The hardware data distinguish the phases through their order parameters, spin and dimer correlations, structure factors, correlation ratios, and snapshot distributions. The crossing of the order parameters locates the transition, and its finite-size extrapolation lies close to the thermodynamic-limit value obtained from large-scale numerics. A noise model based on the device calibration accounts quantitatively for the reduced amplitudes measured on hardware. Our findings demonstrate that a Landau-forbidden transition between competing orders can be resolved on current quantum processors.
arXiv·2026-10-15·Haruki Aoki et al.
No generated summary available for this entry.
overview
Original abstract
Distributing entanglement directly between error-corrected logical qubits is an important capability for scalable quantum networks. We propose a heralded protocol for generating remote entanglement between Gottesman--Kitaev--Preskill qubits encoded in the motional modes of spatially separated trapped ions, using the internal electronic states to interface the motional qubits with emitted photons. We derive the protocol for single-rail and polarization photonic encodings and evaluate the effects of finite GKP squeezing, photon loss, photon recoil, motional heating, and motional dephasing on the decoded logical state. Moreover, we numerically analysed the fidelity of distributed logical Bell-pair fidelity. We find that one can achieve more than 95% of fidelity in the realistic situation. The protocol combines motional-control and photonic-networking operations that have already been demonstrated in trapped-ion experiments.
arXiv·2026-10-15·Rostyslav O. Serha et al.
No generated summary available for this entry.
overview
Original abstract
The rapid development of quantum magnonics over the past decade has created a demand for magnetic materials that keep their magnon losses low at millikelvin temperatures and add functionality beyond that of the established iron garnets and ferromagnetic metals. The europium chalcogenides are natural candidates $-$ they are magnetic semiconductors whose moment of $7\,μ_{\mathrm{B}}$ per Eu$^{2+}$ ion stems from a half-filled $4f$ shell with zero orbital momentum, so that spin-orbit coupling and intrinsic damping are expected to be weak. Here we characterize an epitaxial film of the metamagnet EuSe on diamagnetic BaF$_2$ by magnetometry and broadband ferromagnetic resonance from 10 K down to 30 mK. EuSe combines a saturation magnetization of 1100 kA/m with antiferromagnetic, ferrimagnetic and ferromagnetic phases that are reached with fields below 0.25 T. In contrast to a Gilbert-damped ferromagnet, the linewidth of the field-aligned film decreases with increasing frequency and field, and below 750 mK it no longer depends on temperature. At 30 mK, 68 GHz and 1.8 T, it reaches 5.5 mT, close to the values of bulk single crystals, which corresponds to a magnon lifetime of 2 ns and to an upper bound of $1.1\times10^{-3}$ for the Gilbert damping parameter. These properties make EuSe and the europium chalcogenides promising materials for hybrid quantum systems and quantum magnonics.
arXiv·2026-10-15·Pablo Bayona-Pena, Elena Gramellini, Lorenzo Piroli
No generated summary available for this entry.
overview
Original abstract
We study the von Neumann operator-space entanglement entropy (OSEE) of initial product operators evolved under random gaussian dynamics, as modeled by a Brownian SYK$_2$ model. By exploiting a mapping to a domain-wall melting problem, we derive an exact expression for the time-dependent bipartite OSEE in the thermodynamic limit, and obtain an analytic characterization of the corresponding gaussian Page curve emerging at late times. Our results build on recent work on the entanglement dynamics in the all-to-all quantum simple exclusion process, leveraging tools from RMT, including the Coulomb-gas approach and a mapping to the free Jacobi process. Finally, based on our results, we discuss the possibility of relating the OSEE with non-gaussianity measures in the Heisenberg picture.
arXiv·2026-10-15·Jouni Peltonen, Vlad Stirbu, Tommi Mikkonen
No generated summary available for this entry.
overview
Original abstract
Quantum programs pass through compilers, transpilers and vendor services before execution. However, the distance between what was written and what runs is rarely measured. We call this distance realization divergence: the observable difference in how an identical source circuit is realized and behaves across quantum software stacks. We report a hardware study across three vendors and four devices, combining pre-registered predictions with explicitly identified exploratory analyses and amendments. In a compilation experiment with assigned placement policies, embedding radius correlates with two-qubit overhead at Spearman 0.805, against 0.492 for circuit size. Under a fixed lowest-index policy, an eight-qubit Bernstein-Vazirani circuit exhibits greater execution divergence than a twelve-qubit circuit on IQM Emerald. The opposite ordering occurs on IQM Garnet. Both comparisons replicate across two repetitions with disjoint confidence intervals. These results support a placement-dependent explanation, without isolating individual hardware noise mechanisms. The same ordering inversion is absent on the all-to-all IonQ control. On Rigetti Cepheus, a follow-up using topology-aware native placement found no consistent advantage in correct-answer probability for either submission track, but did not establish equivalence between the tracks. Structural comparisons depend on metric weighting, placement and device generation. Provider interfaces also limit observability: Rigetti's supported-operation list remained unchanged across a device generation that replaced the native entangler. We classify silent interface failures in composed toolchains and identify checks at toolchain boundaries, connecting valid cross-provider comparisons with concrete software-quality practices.
arXiv·2026-10-15·Yifan Kang et al.
No generated summary available for this entry.
overview
Original abstract
High-order harmonic generation from molecules is highly sensitive to molecular geometry and strong-field electron dynamics, providing a powerful route for probing and controlling ultrafast processes in extended systems. In this work, we systematically investigate the influence of molecular chain length on HHG from linear carbon-chain molecules C$_2$H$_2$, C$_6$H$_2$, and C$_{10}$H$_2$ driven by an 800 nm linearly polarized laser field. To isolate the molecular-size effect from the influence of different ionization potentials, the laser intensities are adjusted to maintain the same Keldysh parameter for different molecules. Real-time time-dependent density functional theory simulations are performed with the molecular axis aligned parallel to the laser polarization direction. The results show that increasing the molecular chain length significantly enhances the harmonic yield and tends to extend the cutoff region. In particular, C$_{10}$H$_2$ exhibits much stronger plateau harmonics than C$_2$H$_2$, while the intermediate molecule C$_6$H$_2$ shows harmonic intensities between those of C$_2$H$_2$ and C$_{10}$H$_2$. Time-frequency analysis and charge-density evolution reveal that the enhanced HHG emission in longer chains originates from the enlarged electron acceleration distance and increased probability of multi-center recollision, especially near the terminal carbon atoms. These findings demonstrate that molecular-size engineering offers an effective strategy for controlling harmonic emission and optimizing attosecond light sources in extended molecular systems.
arXiv·2026-10-15·Eduardo Suárez et al.
No generated summary available for this entry.
overview
Original abstract
Previous studies on the vibrational structure of carbon dioxide isotopologues have revealed a correlation between the strength of Fermi interactions and a recently defined normal-mode parameter. In this contribution, we investigate how the Raman intensities of the most intense bands evolve across the complete series of carbon dioxide isotopologues at room temperature. To this end, we introduce a general scheme for simulating Raman intensities in linear triatomic molecules, based on the computation of the mean polarizability surface up to cubic terms for all twelve stable species. For the first time, we establish correlations between the degree of normality and the Raman transition intensities, mean polarizability derivatives, and variational Raman shift errors across the CO$_2$ isotopologue series. The observed trends are further analyzed by considering rotational contributions, which may partially account for the deviations observed in the correlations. Our study is supported by experimental Raman spectra of isotopically enriched samples and theoretical simulations. Although this study focuses on carbon dioxide, similar behavior is expected for other series of isotopologues.
arXiv·2026-10-15·Maciej Chudak, Massimiliano Esposito, Krzysztof Ptaszynski
No generated summary available for this entry.
overview
Original abstract
Driven-dissipative collective spin systems can host several long-lived metastable states; rare switching between them governs slow relaxation and first-order dissipative phase transitions associated with changes in the dominant stationary state. In the companion Letter [arXiv:2604.15091], we introduced a quantum instanton framework based on exact quasiprobability dynamics to describe this switching and illustrated it with a minimal model possessing a simplifying symmetry. Here we develop its numerical implementation, combining collocation and shooting methods, and apply it to two microscopically motivated systems: the Lipkin-Meshkov-Glick model with purely collective dissipation and the cooperative resonance fluorescence with collective and local dissipation. By determining the leading exponential scaling of switching rates between metastable attractors, we predict the stationary magnetization, the first-order dissipative phase-transition point, and the exponential scaling of slow relaxation rates. These predictions agree with quantum master-equation calculations and an exact analytical result for the second model without dephasing. We also examine how the choice of quasiprobability representation affects numerical convergence and find that the alternative semiclassical Wigner approach, based on Gaussian truncation, has varying accuracy across models and parameter regimes. These results substantiate the framework's applicability to experimentally relevant collective spin systems with both collective and local dissipation.
arXiv·2026-10-15·Akinori Tanaka et al.
No generated summary available for this entry.
overview
Original abstract
Diffusion language models generate text by reversing a classical diffusion process over token sequences. We show that their continuous-time forward and reverse dynamics can be embedded in the framework of open quantum systems, which describes quantum systems interacting with their environment. This connection provides a basis for extending diffusion sampling to superpositions of sentence states and for modifying the underlying generation dynamics. We construct a $τ$-leaping unraveling scheme that simulates stochastic trajectories of these states while updating multiple token positions at each step. This enables generation conditioned on superposed prompts or thoughts, which we call Superposition of Prompts (SoP) and Superposition of Thoughts (SoT). The same formulation yields Quantum-Inspired Remasking (QIR): perturbing the masked-diffusion dynamics produces a confidence-based rule for revising previously generated tokens. Experiments with pretrained diffusion language models show that superposition-based generation can retain information from conditioning components not selected at the final measurement, while QIR improves LLM-assessed text quality when applied at an appropriate stage of generation.
arXiv·2026-10-15·Galina L. Klimchitskaya et al.
No generated summary available for this entry.
overview
Original abstract
We present the theoretical description of a resistive nanoswitch designated for a change-over between the two operation modes by calculating the electri elastic, dispersion (van der Waals and Casimir), and also exchange repulsive forces in its configuration with an account of surface roughness. The dispersion forces are described by means of the Lifshitz theory and, at the shortest separations between the interacting bodies, where this theory is inapplicable, by the method of additive summation of the interatomic potentials corrected for the role of the effects of nonadditivity. The exchange repulsion is also found by a summation of the interatomic potentials and using the proximity force approximation. It is shown that the nanoswitch possesses the equilibrium closest separation between a cantilever tip and a ground plate calculated as a function of the actuation voltage and operates in a cyclic manner with no pull-in when this voltage is switched on and off. We have found the tunnel current between a cantilever tip and a plate and investigated distortions appearing in the signal transmitted through a nanoswitch. According to our results, the amplitude distortions arising in the low-frequency information signal can be made sufficiently small by increasing a difference between the amplitudes of the carrier and information signals. Possible applications of the obtained results are discussed.
arXiv·2026-10-15·Ishita Modak, Vatsana Tiwari, Soumya Bera
No generated summary available for this entry.
overview
Original abstract
The quantum random energy model (QREM) is a paradigmatic model for studying delocalization-localization transitions at finite energy density in Fock space. In the computational basis, its diagonal energies are independent Gaussian random variables, in contrast to the correlated energies of local interacting models such as the disordered XXZ chain. In this work, we construct a potential energy shell associated with a basis state, defined through its energy variance, and investigate its connectivity on the Fock-space hypercube. As the transverse field is varied, this energy-selected subgraph undergoes a finite-size geometric crossover between fully connected and fragmented regimes. Furthermore, we observe a correlation between the shell connectivity and the finite-size fractal dimension of the eigenstates, as extracted from the participation entropy. For the QREM, the statistical independence of the diagonal energies allows the shell connectivity to be analyzed as an effective independent site percolation problem on the hypercube, with its crossover scale estimated within a one-hop approximation. At finite energy density, this estimate gives a nonmonotonic dependence of the crossover scale on system size $L$: increasing $L$ initially favors connectivity, while beyond an energy-dependent scale $L^*(\varepsilon)$ the trend reverses towards fragmentation.
arXiv·2026-10-15·D. J. Hoare et al.
No generated summary available for this entry.
overview
Original abstract
Assembling defect-free arrays of neutral atoms requires real-time rearrangement of stochastically loaded optical tweezers. Conventional rearrangement methods shuttle atoms sequentially, whereas high-speed spatial light modulators (SLMs) can move all atoms in parallel, which scales more favorably as the array size grows. For fast parallel rearrangement, the sequence of holograms displayed on the SLM should be computed more rapidly than the SLM refresh rate, and there should be phase continuity between successive holograms to minimize transient intensity fluctuations. We calculate holograms analytically by adding together the complex fields needed to produce each individual trap, and we ramp the phase of each trap linearly as it moves to its target location. Trap positions enter as continuous variables, rather than tied to points on a grid, so the method provides high positioning accuracy. Using a single GPU, we compute each intermediate hologram in 0.284 ms, considerably faster than the SLM refresh time of 0.696 ms, so the rearrangement speed is hardware-limited. In each step, we use the free processing time to iteratively optimize the holograms for equal intensity across the traps, decreasing trap non-uniformity to 1.24% during rearrangement at no cost in total time. Starting from an array of 256 sites loaded stochastically with $^{87}$Rb atoms, we assemble a 100-atom array in under 20 ms with a rearrangement survival probability of 99.31(12)% per atom. This rearrangement increases the temperature of the atoms by 9(3) $μ$K, which is small compared to the trap depth of 480 $μ$K. Our method can also move individual atoms axially, enabling transport in different planes. We demonstrate this capability with a rearrangement protocol where one set of atoms leapfrogs over another.
arXiv·2026-10-15·B. Militello, A. Napoli
No generated summary available for this entry.
overview
Original abstract
It is known that under particular hypotheses anomalous thermalization processes can occur, such as the Mpemba effect, consisting in a faster cooling down when the system is prepared in a hotter initial condition, thus making convenient to warm up the system before the freezing process in order to make it freeze in a shorter time. It is shown here that the action of a Markovian classical noise during the freezing process can accelerate the approach to the zero-temperature thermal state. This prediction is counterintuitive, especially after observing that a classical noise can be considered equivalent to the action of an infinite-temperature reservoir, since both drive the system toward the same state. These facts lead to the statement that warming up the system during the contact with a low-temperature reservoir can accelerate the cooling process.
arXiv·2026-10-15·Ahmed Aman et al.
No generated summary available for this entry.
overview
Original abstract
Reliable characterization of quantum states and quantum processes is central to the development of scalable quantum computing. Standard characterization techniques such as full quantum state tomography become rapidly impractical as system size increases. In this work we present two software-oriented fidelity estimation protocols that avoid full tomographic reconstruction while remaining experimentally relevant for noisy intermediate-scale quantum devices. The first protocol is direct fidelity estimation (DFE), where the fidelity between a target state and an experimentally prepared state is estimated from importance-sampled Pauli measurements. The second protocol is a survival-probability-based method that reconstructs fidelity from experimentally accessible moments of a noisy evolution and its approximate inverse, and is intrinsically robust against state-preparation-and-measurement (SPAM) errors. We discuss the theoretical basis of both approaches, analyze their noise sensitivity, and present numerical evidence on representative multiqubit states under depolarizing, dephasing, and amplitude-damping channels. For DFE we show that attenuation-aware correction improves robustness against measurement noise. For the survival-probability approach we show that an $L_2$-optimized expansion substantially outperforms naive Taylor truncation in high-noise regimes.
arXiv·2026-10-15·Llorenç Balada Gaggioli
No generated summary available for this entry.
overview
Original abstract
Robust quantum control usually assumes one of two extremes: the error is of a known form and only its strength is unknown, or nothing at all is known about it. In practice one often sits in between. The size of a static error is unknown, but its class is known, for example, it only shifts energy levels, or it acts on each subsystem separately. We ask how fast a control can cancel, to first order, every error in such a class. A time-independent Hamiltonian can do this if and only if all errors in the class have zero diagonal in a common basis. In that case an equally spaced energy ladder in this basis does it after one period. A lower bound that holds for any time-dependent control with bounded drive power shows that this simple constant control is optimal for several natural classes, including unknown level shifts and unknown local errors on two subsystems. Completely unknown errors need a time-dependent control, and there, knowing the error class shortens the minimum time by a factor $\sqrt{d^2+1}$. So partial knowledge of the error changes not only how long an optimal robust control takes, but also its form.
arXiv·2026-10-15·Marco Pennazio et al.
No generated summary available for this entry.
overview
Original abstract
Preparing quantum states in bosonic qudits with SNAP--Displacement sequences requires both optimizing the gate parameters and deciding which Fock levels should be controlled by each SNAP gate. A fully parameterized ansatz assigns an independent phase to every Fock level in every gate, leading to a number of phases that grows steeply. This constitutes a problem for short to medium term systems as controlling many phases requires complex control pulses which are subject to increased control errors. Previous work reduced this cost by restricting the trainable phases to predefined sparse patterns, such as a diagonal or a grid, which however may not be optimal for a specific target state. In this work, we address this limitation by introducing a method that learns which phases are needed together with their values, using a differentiable mask. A sparsity penalty encourages the removal of unnecessary phases, while temperature annealing gradually turns the masks into binary decisions. We compare the proposed method with fully parameterized and predefined sparse ansatzes on Fourier and Haar-random target states. The evaluation considers both the minimum number of phases required to reach different infidelity thresholds and the overall trade-off between fidelity and phases required, measured through Pareto frontiers and hypervolume. The results show that learning the location of the phases together with their values provides competitive or improved fidelity--resource trade-offs, although the advantage depends on the target state and qudit dimension.
arXiv·2026-10-15·Razmik G. Unanyan, Michael Fleischhauer, Nikolay V. Vitanov
No generated summary available for this entry.
overview
Original abstract
We consider the quantum Rabi model, a fundamental model of quantum optics describing a two-level system coupled to a bosonic mode, including counter-rotating terms. In the limit of large separation between the two-level transition frequency and the bosonic mode frequency, the model exhibits a quantum phase transition at a critical coupling strength. Although the model is exactly solvable, simple analytic expressions for important physical quantities are generally unavailable. We derive rigorous upper and lower bounds for the ground-state energy and boson occupation number across the quantum phase transition at finite frequency ratios. Our results characterize the subcritical, critical, and supercritical regimes and establish the scaling behavior of the boson occupation near the critical point. Exact numerical diagonalization demonstrates the tightness of the derived bounds, while the resulting finite-frequency inequalities provide experimentally testable predictions for trapped-ion quantum simulators.
arXiv·2026-10-15·Toyohiro Tsurumaru
No generated summary available for this entry.
overview
Original abstract
Two-way classical communication improves the noise tolerance of quantum key distribution, but the limits of adaptive parity processing remain unclear. For the six-state protocol with equal three-basis error rate $p\in[p_*,1/2]$, where $p_*=(5-\sqrt5)/10\simeq27.64\%$, we construct a single compatible collective attack that defeats a broad class of linear postprocessing. Each public message may be an affine function of the sender's raw key, chosen adaptively from the public history. For every finite input length and every accepted transcript of positive probability, Eve's optimal probability of recovering any affine function of Alice's raw key is at least Bob's. Consequently, reliable agreement on a linear final key is incompatible with secrecy. The same conclusion holds for arbitrary publicly seeded privacy amplification after reliable recovery of a linear candidate. The proof conditions on the complete transcript, which restricts the two raw keys to affine subspaces. A local degradation of Eve's state, a known Rényi-entropy comparison, and a coset-probability inequality then give the recovery comparison. Both inequalities are proved in self-contained appendices. The result allows block splitting, regrouping, nonzero-syndrome selection, and adaptive linear reconciliation.
arXiv·2026-10-15·Xuan Chen et al.
No generated summary available for this entry.
overview
Original abstract
Quantum measurements not only extract information but also reshape quantum evolution through measurement backaction. Here, we investigate periodic conditional measurements, in which coherent evolution is repeatedly interrupted by local measurements. We show that the bright and dark modes of the conditional evolution operator provide a unified spectral description of both the post-selected final state along no-detection trajectories and the statistics of detection events. Using a three-dimensional photonic chip, we demonstrate on-demand state engineering through dark-mode preservation and bright-mode selection, enabling the protection of topological corner states and excited-state shelving. We further observe the predicted transition of the total detection probability on an effectively infinite one-dimensional lattice and identify its microscopic origin in Floquet near-dark modes. These results establish periodic conditional measurements as a general framework for engineering conditional quantum states and manipulating event-detection statistics in monitored quantum dynamics.
arXiv·2026-10-15·Tze Ue Ngai et al.
No generated summary available for this entry.
overview
Original abstract
We investigate the Casimir force on thin suspended dielectric layers covered with graphene, both theoretically and experimentally. Thermal effects of the Casimir force on graphene occur at separations significantly smaller compared to ordinary metals and dielectrics. At such small separations, the Casimir force is sufficiently strong to be measured experimentally. However, the presence of substrates to support the graphene significantly reduces the enhancement. We show theoretically that replacing the solid substrate beneath graphene with a thin dielectric membrane partially restores this strong thermal dependence. One of the interacting objects is a solid gold plate. The other object is a suspended dielectric membrane made of either 15 nm of silicon oxide or 13 nm silicon nitride, covered with graphene. At a separation of $\sim$500 nm, theoretical predictions yield changes in the Casimir pressure of up to 54 % and 40 % for silicon oxide and silicon nitride, respectively, when the temperature is increased from 10 K to 294 K. Measurements were performed for graphene on a suspended silicon nitride membrane at room temperature, using a gold-coated sphere attached to a cantilever as the force sensor. The measured force gradient is consistent with the theoretical prediction, although the thermal dependence could not be resolved, in part because of uncertainties in the optical properties of silicon nitride. Replacing a bulk substrate with a thin dielectric membrane covered with graphene provides a substantial reduction of the Casimir force, which may facilitate the stable operation of neutral nanomechanical elements at small separations.
arXiv·2026-10-15·L. Richard et al.
No generated summary available for this entry.
overview
Original abstract
Flip-chip 3D integration is a key enabling technology for overcoming the routing and layout constraints of planar superconducting quantum processors, but it requires accurate and uniform control of the inter-chip spacing while preserving qubit coherence. In conventional processes, thick indium bumps are deposited symmetrically on both chips, while dedicated spacers are introduced to limit the residual tilt. Here, we present a flip-chip bonding process based on an asymmetric indium architecture, combining $20\,μ\mathrm{m}$ thick indium bumps on the control chip with $200\,\mathrm{nm}$ thin indium pads on the qubit chip. Using electrical and microwave measurements, we demonstrate low resistance and low loss indium interconnects, and show that transmon qubits integrated with this process reach relaxation and coherence times of $T_1=(159\pm14)\,μ\mathrm{s}$ and $T_{\mathrm{2,echo}}=(294\pm42)\,μ\mathrm{s}$, respectively, comparable to planar devices. Combined with a multi angle compression procedure that suppresses systematic tilt, this approach reduces the average post bonding tilt to $(20\pm12)\,μ\mathrm{rad}$. These results establish an asymmetric indium architecture combined with multi angle compression as a robust, coherence preserving route toward 3D integrated superconducting quantum processors.
arXiv·2026-10-15·Zi-Qi Zeng et al.
No generated summary available for this entry.
overview
Original abstract
We theoretically investigate photonic entanglement generated by homodyning resonance fluorescence from a two-level emitter with a phase-locked laser field. Under weak excitation, increasing the relative laser-field amplitude produces crossovers from time-bin to energy--time and back to time-bin entanglement. The intermediate energy--time regime occurs near amplitude matching, where destructive interference suppresses the single-photon component, allowing the two-photon contributions to dominate the coincidence signal. We evaluate the resulting photon statistics and first-order coherence and characterize the entanglement through violations of the CHSH Bell inequality in a Franson interferometer. This scheme provides a route to controlling photonic entanglement through linear optics and coherent interference.
arXiv·2026-10-15·Shashank Shekhar, David Elkouss, Siddhartha Santra
No generated summary available for this entry.
overview
Original abstract
Long-range, genuine multipartite entanglement (GME) between distant parties in a quantum network is a crucial resource for distributed quantum information processing. Through controlled manipulation of short-range GME states in the network via stochastic local operations aided by classical communication (SLOCC), long-range GME can be established between selected target nodes on demand. Optimizing such multipartite entanglement distribution protocols under constraints imposed by the network architecture, target-node set, and available resource budget is a key challenge in resource-efficient manipulation of GME. We present a general operational framework for manipulating GME in quantum networks by classifying the relevant networking operations into three broad primitives-inflation, deflation, and purification-reflecting their effect on the proliferation of GME through general bounds and illustrative examples. We show how these primitives can be combined to construct a broad class of multipartite quantum repeater protocols, enabling their systematic optimization, and demonstrate the framework with a simple example. Applying our approach to networks of Dür-Cirac-Tarrach states reveals a rich landscape of achievable end-to-end GME and accessible entanglement classes. More generally, our framework provides a systematic approach to the construction and optimization of multipartite quantum repeater protocols for scalable and resource-efficient GME distribution in quantum networks.
arXiv·2026-10-15·Rahul Jain
No generated summary available for this entry.
overview
Original abstract
We give a proof of the cubic parallel-repetition bound for finite two-player entangled games using quantum conditional relative entropy. For a game with entangled value $1-\varepsilon<1$ and answer alphabets $\mathcal A,\mathcal B$, its $n$-fold repeated value is at most \[ \exp[-Ω(\varepsilon^3n/L)],\qquad L:=\max\{1,\log(|\mathcal A||\mathcal B|)\}, \] for every $n\ge1$. This recovers Song's cubic rate. We also prove a threshold bound: the probability of winning a fraction at least $1-\varepsilon+δ$ is at most $\exp[-Ω(δ^5n/(\varepsilon^2L))]$ for $0<δ\le\varepsilon$. Our information charge is the decrease in relative entropy when a question reference is discarded. Our comparison states preserve the original conditional question law. A chain rule bounds the coordinate charges using the cost of conditioning on checked wins and retaining checked answers. Our main lemma converts small charges into nearby pure-state descriptions and local corrections, each depending only on one player's question. Together with Song's sampler, these enable approximate local preparation of the conditioned workspace.
arXiv·2026-10-15·Azadeh Alavi et al.
No generated summary available for this entry.
overview
Original abstract
Recent studies have reported promising results from quantum machine learning in drug discovery, healthcare, materials science and cybersecurity. Research includes comparisons with classical machine learning algorithms and the development of sequential hybrid pipelines. We propose that fusion can improve prediction when classical and quantum representations capture complementary predictive relationships. Our classical-quantum multi-view framework preserves the full classical input alongside simulated quantum features. Concatenation and attention combine the views; single-view comparisons, replacement and masking controls assess both views' contributions. Controlled angular-polynomial experiments distinguish targets adequately represented by a single view from those that depend on complementary angular and polynomial relationships. For these mixed targets, fusion improves prediction by combining the relevant feature sets, while matched classical representations recover the same benefit, linking the improvement to their complementary predictive content. Controlled classification tests further show that gains depend on alignment between the chosen representation and the target, and on a suitable fusion rule. Benchmark validation shows improved mean predictive performance over classical baselines on Wine, Wisconsin Diagnostic Breast Cancer, three-class Fashion-MNIST and Steel Plates Faults within the evaluated protocols. Classical replacement and masking controls remain competitive, classical baselines lead on Digits and Covertype, and outcomes with missing or corrupted views depend on the available inputs. These findings support evaluating quantum representations for their complementary predictive contribution and matching the representation and fusion strategy to the target relationships.
arXiv·2026-10-15·Mohamed A. Shalby et al.
No generated summary available for this entry.
overview
Original abstract
We present a fault-tolerant quantum-memory architecture that concatenates four distance-t rotated surface-code patches with the [[4,2,2]] outer code, encoding two logical qubits at code distance d = 2t in a physical footprint of N < 2(2t+1)^2 qubits on a square lattice with nearest-neighbor connectivity. The outer-code stabilizer generators XXXX and ZZZZ, each of physical weight 4t, are measured in situ via verified Greenberger-Horne-Zeilinger (GHZ) ancillae distributed through narrow corridors between adjacent patches, without lattice surgery or long-range gates. The outer-code gadgets introduce hyperedge fault mechanisms, but by design each decomposes into graphlike components, so the complete syndrome is decoded by a single minimum-weight-perfect-matching pass. Circuit-level simulations show logical error rates that scale as p^t, consistent with distance-2t protection. Finally, we implement the construction experimentally on a 105-qubit Willow superconducting processor in both the ZZ and XX memory bases. With the correlated-matching decoder, increasing the code distance from d = 4 to d = 6 reduces the block logical error rate by a factor of 1.52. The construction thus provides a near-term testbed for concatenated architectures beyond the standard surface code.
arXiv·2026-10-15·Qiang Gao, Taige Wang
No generated summary available for this entry.
overview
Original abstract
Strongly interacting ground states are usually computed in finite systems and then extrapolated to the thermodynamic limit (TDL). Here we develop a quantum many-body bootstrap that solves fractional quantum Hall ground states directly in the TDL. The method gives rigorous and quantitatively tight lower bounds on the ground-state energy and identifies the ground-state structure and topological order. For Laughlin and Pfaffian parent Hamiltonians, it reproduces exact pair-correlation functions and low-lying orbital entanglement spectrum (OES) nearly level by level. For Coulomb interactions, the rigorous TDL energy bounds closely match thermodynamic estimates from exact diagonalization and density-matrix renormalization group (DMRG) extrapolations, and the local diagnostics recover established Laughlin and Moore--Read OES counting and Friedel oscillations of the composite Fermi liquid. Beyond these benchmarks, the bootstrap resolves the thermodynamic ground states at $ν=1/4$ and $ν=12/5$, identifying a composite Fermi liquid and $\overline{\mathrm{RR}}_3$ topological order, respectively. The same framework applies equally well to Abelian and non-Abelian, gapped and gapless quantum Hall states. The TDL bootstrap therefore provides a general ground-state solver that determines both the energy and the state directly in the TDL.
arXiv·2026-10-15·Yen-Huan Li, Wei-Fu Tseng
No generated summary available for this entry.
overview
Original abstract
We study the problem of online learning of quantum states with logarithmic loss, which is a quantum generalization of online portfolio selection and has applications to quantum state tomography, the task of estimating an unknown quantum state from measurement outcomes. We first establish a regret lower bound, showing that the regret rates of Exponential Weights and the algorithm of Tseng et al. (2025) have optimal polynomial dependence on the dimension. Our analysis leads to two further results. First, our lower-bound proof leads to a quantum state tomography algorithm that is sample optimal up to polylogarithmic factors in the sample size. Second, we develop an algorithm for constructing confidence sequences for the mean of a matrix-valued random variable. A numerical experiment shows that the latter algorithm is competitive with existing methods.
arXiv·2026-10-15·Kyoka Tsunoda, Kazuki Yamamoto, Shimpei Endo
No generated summary available for this entry.
overview
Original abstract
We study the non-Hermitian Schrödinger equation with a complex $1/r^{2}$ potential, which bridges Hermitian few-body and non-Hermitian many-body physics: a real attractive potential describes Efimov bound states, whereas a purely imaginary one describes the medium-induced interaction between two heavy polarons at large separations. We solve this equation analytically, obtaining both the localized and continuum states, and compare the solutions with numerical and WKB results. As the imaginary part of the potential is increased, the energies of the Efimov bound states acquire imaginary parts and rotate counterclockwise in the complex plane. On approaching the purely imaginary potential, the excited states disappear sequentially, while the Efimov ground state is smoothly connected to a bipolaron state localized at short distance. Such a bipolaron is localized solely by the medium-induced imaginary interaction, without any attractive real potential. Solving the equation by finite differences, we find that each bipolaron state is necessarily accompanied by another localized state that oscillates on the scale of the mesh size and hence has no counterpart in the continuum limit. Each such pair coalesces at an exceptional point as the strength of the purely imaginary potential is varied, whereas the coalescence is lifted once a finite real part is introduced. We show that this behavior originates from a symmetry of the discretized Schrödinger equation that holds for any purely imaginary potential.
arXiv·2026-10-15·Haorong Wu, Xilong Fan, Lixiang Chen
No generated summary available for this entry.
overview
Original abstract
Gravitational waves (GWs) induce quantum transitions between photon orbital-angular-momentum (OAM) states with amplitudes $α_{\pm}$. Exploiting this effect, we present a displacement-noise-free detection framework that extracts GW information from the OAM Hilbert space. Parametrized quantum state tomography of the GW-induced OAM sidebands enables a single V-shaped detector to resolve all seven wave parameters: the frequency, propagation direction, two polarization amplitudes, and initial phase of each polarization. Direct detection of the sidebands yields a weak signal of approximately $10^{-15}\,\mathrm{W}$. We therefore introduce a stronger reference state $r |0>_{\mathrm{P}}$, with $r=0.01$, to enhance the detected signal. For an arm length of $L=4\,\mathrm{m}$, $N=160$ round trips, a paraxial parameter of $γ=0.1$, an incident light power of $P_{\mathrm{BS}}=10\,\mathrm{kW}$, a wavelength of $λ_{\mathrm{opt}}=1064\,\mathrm{nm}$, and GW amplitudes of $A=10^{-18}$, we estimate sideband transition amplitudes of $|α_{\pm}|\sim10^{-10}$ and signal powers of order $1\,\mathrm{nW}$, scaling as $P_{\mathrm{BS}}α_{\pm}\propto P_{\mathrm{BS}}ANLγ/λ_{\mathrm{opt}}$. The shot-noise-limited sensitivity floor is $S^{1/2}_n=1.6\times10^{-20}\,\mathrm{Hz}^{-1/2}$. Because the scheme measures OAM transition amplitudes rather than differential arm lengths, it is intrinsically free from displacement noise and provides a broadband probe of GWs, specifically bridging the $0.1$--$10\,\mathrm{Hz}$ mid-frequency gap.
arXiv·2026-10-15·Jesse DiCenso, Henryk Laqua, Martin Head-Gordon
No generated summary available for this entry.
overview
Original abstract
We present a seminumerical exchange algorithm (SNK) based on the sn-LinK method [Laqua et al., J. Chem. Theory Comput. 16, 1456 (2020)], optimized for modern multi-core central processing units with single instruction multiple data vector instructions and report its implementation into the Q-Chem quantum chemistry program. Vectorization and memory management strategies for the Boys function and 3-center-1-electron (3c1e) integral kernels are given. Several new considerations are made in the computation of the 3c1e integrals: the Head-Gordon Pople horizontal recurrence relations, same-center optimizations, and multishell optimizations, all implemented symbolically employing the SymPy symbolic algebra library and exported as optimized C++ code leveraging common-sub-expression elimination (CSE) optimization techniques. A general scheme for choosing optimal integral kernels is developed through rigorous timing benchmarks. The resulting implementation is tested against traditional 4c2e exchange for several systems and basis sets, showing 1-2 orders of magnitude speedups for systems of practically relevant sizes (100-500 atoms, 2000-10000 basis functions). For smaller molecules, comparisons are also made against the more efficient occ-RI-K method showing a break-even point around 50-100 atoms beyond which SNK dramatically outperforms due to its superior sub-quadratic (between linear and quadratic) time complexity as well as its effectively negligible memory demand.
arXiv·2026-10-15·Xin Li, Yinan Li
No generated summary available for this entry.
overview
Original abstract
We study zero-error communication and exact simulation of quantum channels assisted by quantum no-signalling correlations. For a channel with Kraus operator space $K$, we introduce a semidefinite programming parameter $Γ(K)$ that is exactly multiplicative under tensor products and upper-bounds $Θ_{\rm NS}(K)$, where $\log_2Θ_{\rm NS}(K)=C_{0,\rm NS}(K)$ and $C_{0,\rm NS}(K)$ denotes the asymptotic quantum no-signalling-assisted zero-error capacity. Among known upper bounds on $Θ_{\rm NS}$ given by semidefinite programs, $Γ$ is the tightest. We also prove that the previously introduced simulation lower bound $Σ^{-}(K)$ is exactly multiplicative and satisfies $Θ_{\rm NS}(K)\leqΓ(K)\leqΣ^{-}(K)\leqΓ(K)^2$. Using this multiplicativity, we show that neither $S_{0,\rm NS}(K)=\log_2Σ^{-}(K)$ nor its regularized extension $S_{0,\rm NS}(K)=\lim\nolimits_{n\to\infty}n^{-1}\log_2Σ^{-}(K^{\otimes n})$ holds in general. This answers an open question about the asymptotic simulation cost $S_{0,\rm NS}(K)$. For classical-quantum channels, we obtain sharp bounds. If $r$ is the effective output dimension, then $Θ_{\rm NS}\leqΓ\leq(1+r^{1/2})Θ_{\rm NS}/2$ and $Γ\leqΣ^{-}\leq(1+r^{1/2})Γ/2$. If $k$ is the minimum rank of the output support projections, then $Σ^{-}/Θ_{\rm NS}\leq[(1+r^{1/2})/(1+k^{1/2})]^2$, and this bound is sharp for every $1\leq k\leq r$. Thus, we obtain the sharp bound $S_{0,\rm NS}-C_{0,\rm NS}\leq2\log_2[(1+r^{1/2})/(1+k^{1/2})]$.
arXiv·2026-10-15·Shi-Yao Hou et al.
No generated summary available for this entry.
overview
Original abstract
Progress in quantum hardware requires a growing volume of experiments across diverse devices, straining the capacity of human experts. Automation remains challenging because device differences and drift can render workflows developed on one processor unsuitable for another. Here we present an agent-assisted experimental strategy for conducting experiments across three-qubit nuclear magnetic resonance processors. Developed on one processor and applied sequentially to four others, the strategy uses an agent to assess experimental evidence, select subsequent measurements and adapt procedures, with operators providing instrument preparation and physical intervention. Using three-qubit Grover state preparation as a common task, each deployment combined device-specific calibration, control-pulse optimization and measurement. The experimental strategy was refined through sequential deployment, and all four processors ultimately produced outputs dominated by their respective marked states. The marked-state populations of the reconstructed dominant eigenstates ranged from \(0.910\) to \(0.959\), with relative deviations below \(3.8\%\) from the ideal value of 0.945. These results demonstrate that an agent-assisted experimental strategy can be reused and refined across processors to realize a common quantum task, providing a basis for scaling experimental practice beyond individual devices.
arXiv·2026-10-15·Hidetsugu Sakaguchi, Boris Malomed
No generated summary available for this entry.
overview
Original abstract
Quantum collapse (QC) occurs under the action of the inverse-power potential U(r)=-U_{0}/(2r^{n}) in the framework of the Schroedinger equation. The corresponding stationary wave functions feature an infinite number of spatial oscillations at $r\rightarrow 0$. The ground state (GS) is missing in the presence of the QC, but the available bound states at finite energies may be physically relevant, as they are normalizable. This work aims to produce singular stationary wave functions. The analytical findings represent an asymptotic form of the stationary wave functions at $r\rightarrow 0$, which fill a continuous spectrum, and some exact solutions for the wave functions, obtained under appropriate conditions. As a regularized version, we also consider the potential truncated at a finite difference from the center. The regularized wave functions feature a finite number of spatial oscillations, the missing GS reappears, and the spectrum of the bound states is discrete.
Quantum Computing Report·2026-10-14·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
New York City and NYU are partnering to launch the $284 million Quantum Fabrication Facility (QFab) at 770 Broadway, set to open in 2030. The facility will focus on quantum chip development and aims to foster startups, provide fabrication services, and support workforce development through CUNY and NYC Public Schools. This initiative features a unique public-equity model, granting NYC a 15% share in IP generated with city-funded equipment and seats on the QFab Executive Advisory Board. The post New York City and NYU Partner to Launch $284 Million Quantum Fabrication Facility appeared first on Quantum Computing Report .
Phys.org Quantum Physics·2026-10-14
No generated summary available for this entry.
overview
Original abstract
Quantum networks are systems that connect different users or devices using principles of quantum mechanics. In the future, these networks could help improve the security of communications.
The Quantum Insider·2026-10-14·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief SEALSQ presented peer-reviewed research at LightSec 2026 on a side-channel attack targeting the encoding step of ML-KEM key generation, along with countermeasures to reduce implementation vulnerabilities. The research combines profiling-based techniques with lattice reduction to recover sensitive information from side-channel leakage under realistic conditions. The work examines implementation risks in NIST-standardized post-quantum cryptography and complements SEALSQ ’s hardware security development, including its QS7001 secure element, which is undergoing Common Criteria EAL5+ certification. PRESS RELEASE — SEALSQ Corp (NASDAQ: LAES) (“SEALSQ” or “Company”), a company that focuses on developing and selling Semiconductors, PKI, and Post-Quantum technology hardware and software products, today announced that its research team presented a peer-reviewed technical article on a novel side-channel attack targeting the encoding step of ML-KEM (Module-Lattice-Based Key Encapsulation Mechanism, formerly CRYSTALS-Kyber) key generation at LightSec 2026. LightSec 2026, the 7 th International Workshop on Lightweight Cryptography for Security & Privacy, took place on October 11, 2026, in Antalya, Turkey, as an official affiliated event of CHES 2026 (Conference on Cryptographic Hardware and Embedded Systems), the premier venue for research on the design and analysis of cryptographic hardware and embedded systems. The broader CHES program runs from October 11–15, 2026. The paper, titled “Cross-information lattice attack on ML-KEM,” demonstrates how the encoding step during ML-KEM key generation is vulnerable to side-channel attacks under realistic conditions. The work introduces a novel attack method that combines profiling-based techniques with lattice reduction. This hybrid approach enables efficient exploitation of side-channel leakage, recovering sensitive information more effectively than prior methods alone. The researchers als
Quantum Computing Report·2026-10-14·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Alice & Bob has demonstrated the GPU decoding of their LDPC-cat quantum error correction architecture using NVIDIA GPUs and the NVQLink system. This allows for microsecond-scale communication between quantum control systems and classical GPU supercomputers, enabling real-time error correction. The LDPC-cat architecture utilizes cat qubits and 2D LDPC codes to achieve low logical error rates for quantum computing. The post Alice & Bob Demonstrates GPU Decoding for LDPC-Cat Codes via NVIDIA NVQLink appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-14·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Riverlane and NVIDIA have demonstrated significant acceleration in quantum error correction (QEC) decoder recalibration using NVIDIA's H100 GPU. By adapting Riverlane's Local Clustering Decoder for GPU processing, they achieved up to 71x raw throughput gain and reduced training epochs from minutes to seconds. This advancement allows for more frequent and efficient recalibration, improving the accuracy of QEC systems and highlighting the growing role of GPUs in quantum computing. The post Riverlane and NVIDIA Demonstrate Accelerated QEC Decoder Calibration Using GPU Processing appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-14·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Silicon Quantum Computing (SQC) has detailed a 25-year roadmap in Nature Nanotechnology for developing atomic-scale processors. The article traces the evolution of phosphorus-in-silicon quantum processors from single-atom transistor demonstrations to commercial atomic-scale products. Key milestones include the development of automated atomic-precision fabrication, achievement of high single-qubit gate fidelities and coherence times, and the deployment of commercial analog simulators. The post Silicon Quantum Computing Traces 25-Year Roadmap to Atomic-Precision Manufacturing in Nature Nanotechnology appeared first on Quantum Computing Report .
Phys.org Quantum Physics·2026-10-14
No generated summary available for this entry.
overview
Original abstract
A major software advance could aid the creation of bigger, more reliable quantum computers, a study suggests. Researchers have developed an algorithm that enables off-the-shelf computers to run quantum simulations previously only possible using the world's most powerful supercomputers.
The Quantum Insider·2026-10-14·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief SAXON Q reported that its room-temperature diamond quantum computer achieved 77.3% success in a three-qubit Grover search, close to the cited superconducting benchmark of 78%. The system achieved 87% success when searching for two targets among eight items, with both tests exceeding the classical success limits cited in the paper. Researchers conducted the benchmark at Fraunhofer IWU in Dresden using a previous-generation system that consumes roughly 600 watts and requires no cryogenic cooling or vacuum equipment. PRESS RELEASE — — SAXON Q , a leader in NV-center quantum computing, today released a paper showing that its room-temperature diamond-based system can perform on par with superconducting quantum computers cooled to near absolute zero. Running Grover’s search algorithm, a standard benchmark test for quantum performance, a SAXON Q system identified a single target state 77.3% of the time using three qubits, rivaling the best published superconducting result of 78%, which required a temperature roughly 15,000 times colder. “The assumption in quantum computing has been that you trade performance for convenience. These results show that tradeoff isn’t necessary,” said Marius Grundmann, co-founder and CEO of SAXON Q . “Our system ran a complete quantum algorithm in an ordinary room at a customer site, and the results were similar to those of machines that require extensive infrastructure to cool them to near absolute zero.” Grover’s algorithm — also known as the “quantum search algorithm” — has been used for years to benchmark quantum computers. It finds a marked item in an unsorted list, using fewer steps than any classical computing method can, and it is a building block for how quantum applications will approach optimization work, financial analysis, cryptography and more. It uses a sequence that includes the qubits, single and multi-qubit gates, repeated operations and a final readout, all of which work together. That means that it can me
Phys.org Quantum Physics·2026-10-14
No generated summary available for this entry.
overview
Original abstract
Quantum information systems could one day shape everyday life through faster computing, sharper sensing and more secure communication. A new result from the U.S. Department of Energy's (DOE) Argonne National Laboratory and the University of Illinois Urbana-Champaign (U. of I.) marks an important step toward enabling magnetic spins—a quantum property of matter that can be used to store and manipulate information—to play a role in the future of quantum information processing.
Quantum Computing Report·2026-10-14·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
SAXON Q and Fraunhofer IWU have achieved a record-breaking 3-qubit Grover search on a commercial room-temperature quantum computer, outperforming previous room-temperature quantum searches and nearing cryogenic superconducting processors' benchmarks. The experiment, detailed in a pre-print paper, utilized a nitrogen-vacancy center diamond quantum computer operating at ambient conditions, showcasing a significant advancement in quantum computing hardware. The post SAXON Q and Fraunhofer IWU Demonstrate Record 3-Qubit Grover Search on Commercial Room-Temperature Quantum Computer appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-14·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Qilimanjaro Quantum Tech completed a €19.6 million –about $22 million USD — first close of its Series A round, with €10 million from Indra Group through IndraMind and €9.6 million from Spain’s SETT . The funding will support scaling and industrializing its quantum computers, developing new chips and expanding manufacturing and deployment capacity. The Barcelona-based company has deployed eight quantum systems, including three integrated with the Barcelona Supercomputing Center, and expects to complete the funding round in the fourth quarter. PRESS RELEASE — Qilimanjaro Quantum Tech has completed a €19.6 million — about $22 million USD — first close of its Series A funding round, led by Indra Group through IndraMind with a €10 million investment. The Spanish Society for Technological Transformation (SETT) , under the Ministry for Digital Transformation and Public Administration, is also renewing its commitment to the company with a new €9.6 million investment. The company expects to complete the round during the fourth quarter of the year, with the participation of Avançsa and other existing investors. Indra Group is investing in Qilimanjaro through an instrument that will convert upon the closing of the round, while SETT is reinforcing its support for the company after having participated in its previous funding round. The new capital will enable Qilimanjaro to scale and industrialize its quantum computers, advance the development of new generations of chips, and increase its manufacturing and deployment capacity, strengthening a technological capability developed in Spain and contributing to greater European technological autonomy in quantum computing. “SETT’s renewed commitment and Indra ’s investment bring sovereign and industrial capital together to protect, while also accelerating, national technological autonomy. Together, we are joining forces to bring quantum computing closer to strategic industrial sectors and to
The Quantum Insider·2026-10-14·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief QFX, an Oxford University spinout, has secured a £6.8 million Innovate UK contract to develop atomic and vacuum hardware for data centre timing and space applications. The SrROCK Phase II programme will build a compact, low-power strontium optical-clock package, demonstrate its timing performance and conduct testing relevant to future satellite missions. The programme aims to establish UK manufacturing capacity and intellectual property for advanced atomic and vacuum systems while supporting QFX’s development of distributed quantum computing and networking hardware. PRESS RELEASE — QFX (Quantum Fabrix Ltd), an Oxford University spinout developing hardware infrastructure for distributed quantum computing and quantum networking, has been awarded a £6.8 million contract by Innovate UK to deliver Phase II of its SrROCK development programme. Building on a successful first phase, SrROCK will advance QFX’s atomic source and vacuum technologies into robust, integrated hardware for data centre and space applications. QFX’s technology platform combines atomic sources, ultra-high-vacuum systems and quantum interfaces in a modular architecture for demanding data centre and space applications. This approach gives QFX access to near-term opportunities in timing and navigation while building towards fault-tolerant distributed quantum computing. “SrROCK gives QFX the opportunity to prove that its core atomic and vacuum technologies can be manufactured and qualified for demanding real-world applications. That capability is essential to scaling our quantum-computing platform and creates a clear route into the strategically important timing market, supporting sovereign UK supply of advanced timing technology.” Dr Timothy Ballance , CEO, QFX In Phase II, QFX will engineer and integrate a compact, low-power strontium optical-clock physics package for timing infrastructure in data centres and future satellite missions. The programme will demonstrate timing performanc
The Quantum Insider·2026-10-14·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief New York City will award NYU $29.2 million to establish a quantum fabrication facility, backed by an additional $255 million from the university and expected to open in 2030. The city will receive three advisory board seats and 15% of NYU Central Administration’s proceeds from intellectual property created using city-funded equipment. QFab will provide quantum device manufacturing and testing, startup support and workforce training, with plans to reach more than 35,000 New Yorkers during its first decade. Image: QFab will provide students, faculty, researchers, startups and companies with a place to explore quantum mechanics and new prototypes. (NYU) PRESS RELEASE — Mayor Zohran Kwame Mamdani, Deputy Mayor for Economic Justice Julie Su and New York City Economic Development Corporation (NYCEDC) President and CEO Anthony Shorris announced the city will award $29.2 million to New York University to establish a cutting-edge Quantum Fabrication Facility (QFab), putting New York City at the front of the emerging quantum technology field. As part of the Mamdani administration’s investment, the city will receive board seats at QFab as well as a stake in new technologies that emerge from QFab, a first-of-its-kind agreement that will allow the City to help shape this emerging technology for the public good. QFab — which is backed by an additional $255 million investment from NYU spanning construction and 10 years of operations — will give researchers, students, start-ups and established companies access to specialized equipment for building and testing new quantum devices. It is expected to support more than 100 companies and reach 35,000 New Yorkers in its first 10 years of operation. Additionally, to grow the number of New York City jobs in the quantum field, NYU will provide students at the City University of New York (CUNY) and New York City Public Schools (NYCPS) with access to state-of-the-art labs, training, new certificate programs and summer work
Quantum Computing Report·2026-10-14·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
D-Wave Quantum Inc. and SkyWater Technology have extended their quantum manufacturing partnership through a multi-year agreement. This collaboration ensures SkyWater's continued support for D-Wave's quantum hardware development, including the production of its Advantage2 processors and future quantum annealing and gate-model quantum computers. Additionally, D-Wave's quantum annealing algorithms have been applied to optimize SkyWater's operational workflows, reducing fab maintenance lot delays by up to 30%. The post SkyWater and D-Wave Extend Quantum Manufacturing Partnership Through Multi-Year Agreement appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-14·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
IonQ announced a $2.0 billion equity offering purchased by Heights Capital Management, consisting of common stock and pre-funded warrants priced at a 15% premium. The deal also includes seven-year warrants for additional shares at a 100% premium. IonQ plans to use the capital to accelerate the commercialization and deployment of its quantum platform. The post IonQ Announces Pricing of $2.0 Billion Equity Offering Purchased by Heights Capital Management appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-14·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief EigenOrbit has released eigenkit 1.0, a free, open-source Python library designed to run quantum algorithms across multiple simulators and quantum hardware platforms without rewriting the algorithm for each backend. The library supports tools including Qiskit, PennyLane, NVIDIA CUDA-Q and Amazon Braket, alongside hardware from IBM and IQM, and includes algorithms for quantum machine learning, optimization, chemistry and finance. Released under the Apache 2.0 license, eigenkit includes quantum-versus-classical benchmarking and cost warnings before paid hardware jobs, with packages available through PyPI and source code on GitHub. PRESS RELEASE — EigenOrbit has released eigenkit, a free open-source Python library for quantum computing. With eigenkit, a quantum algorithm is written once and runs on a simulator on an ordinary laptop or on real quantum computers from IBM, IQM and the vendors available through Amazon Braket. Moving from one machine to another takes a single setting, and the rest of the code stays as it was. Quantum teams today often pick a simulator or a hardware vendor first and then write code against that vendor’s SDK. Switching later means a rewrite. Yet no single backend suits every workload. Simulators differ in speed depending on qubit count, circuit structure, entanglement and batch size. Quantum processors differ in qubit count, connectivity, native gates, error rates, price and queue times, so the best device can change from one circuit to the next. eigenkit separates the definition of an algorithm from the machine that executes it, which makes trying several backends a routine step. What eigenkit does Many machines, one codebase. eigenkit runs on its own built-in simulator and on PennyLane, Qiskit, Qiskit Aer, Qulacs, qsim, TensorCircuit, NVIDIA CUDA-Q and Amazon Braket simulators. On hardware it supports IBM quantum computers, IQM quantum computers and the processors available on Amazon Braket. Photonic circuits run t
The Quantum Insider·2026-10-14·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Quminex raised CAD $1.5 million in pre-seed financing to develop its mineral exploration technology, with Quantacet leading the round alongside QAI Ventures and angel investors. The funding will support growth and development of the Quminex Discovery Platform, which uses machine learning to turn geological data into testable mineral exploration targets. Quminex completed commercial projects with a Canadian mid-tier mining company and Tech-X Resources, providing field applications to help validate and refine its technology. Photo by omid roshan on Unsplash PRESS RELEASE — – Quminex, an early-stage Canadian mineral exploration technology company focused on discovering Canada’s next major critical mineral deposits, today announces that it has secured $1.5 Million CAD of venture capital financing. The investment was led by Quantacet, joined by QAI Ventures, and angel investors. Quminex accelerates mineral exploration through advanced computational techniques. By reducing geological uncertainty, the technology increases success rates and speeds up the discovery of critical mineral deposits. Quminex transforms complex datasets into explainable and testable mineral system models using proprietary machine learning workflows, enabling smarter capital allocation. Built on transparency, sustainability, and credibility, Quminex is committed to helping secure a stable, responsible supply of critical metals. The financing will be used to accelerate growth and advance technological development of the Quminex Discovery Platform TM , an end-to-end exploration stack. It is built on rigorous data preparation, feature engineering and feature selection tools, paired with powerful computational techniques and machine learning models. “This $1.5 million pre-seed investment is a critical milestone, accelerating the development of the Quminex Discovery Platform,” said Marc Fassbender, CEO and Co-Founder of Quminex. “By transforming early-stage exploration int
Quantum Computing Report·2026-10-14·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Bloq Quantum has launched Bloq Maya, an agentic AI assistant that streamlines enterprise quantum algorithm development. It automates circuit design, algorithm formulation, and code generation, converting high-level requirements into executable quantum code and models. Bloq Maya aims to reduce development timelines for corporate R&D across various industries. The post Bloq Quantum Launches Bloq Maya AI Agent to Streamline Enterprise Quantum Algorithm Development appeared first on Quantum Computing Report .
Phys.org Quantum Physics·2026-10-14
No generated summary available for this entry.
overview
Original abstract
Every time a computer stores or erases information, it uses energy. The amount is tiny for a single operation, but those operations happen billions of times every second. For decades, scientists have wondered just how little energy a memory device could use before reaching the fundamental theoretical limit set by the laws of physics. Now, researchers have shown that it is possible to come close.
Quantum Computing Report·2026-10-14·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Infleqtion has secured a £9 million Innovate UK award to advance its Quantum Radio Frequency (QRF) direction-finding system, Quantum Spectrum-DF. This funding, part of the Quantum Missions Primer program, supports the transition of the Rydberg-atom-based system from prototype to operational deployment. Developed with Leonardo, the technology uses optical techniques for broadband, passive direction finding, offering a compact alternative to traditional antenna arrays for defense and infrastructure security. The post Infleqtion Secures £9 Million ($12 Million USD) Innovate UK Award to Transition Rydberg Quantum RF Sensing to Operational Deployment appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-14·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
EigenOrbit has released eigenkit 1.0, an open-source Python library. It allows quantum algorithms to be written once and executed across multiple simulators and hardware backends without code modification. The library integrates with various classical simulators and QPU hardware access points, including machine learning and cost tools. The post EigenOrbit Releases Open-Source eigenkit 1.0 for Multi-Backend Quantum Execution appeared first on Quantum Computing Report .
Phys.org Quantum Physics·2026-10-14
No generated summary available for this entry.
overview
Original abstract
Understanding and controlling phase transitions are fundamental to physics and central to many technological revolutions. There is currently strong interest in materials with coupled structural and electronic phase transitions, where controlling the transition plasticity naturally yields built-in memory—a key step in emulating neurons and synapses for "neuromorphic" or brain-like computing technologies.
Quantum Computing Report·2026-10-14·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Qilimanjaro Quantum Tech secured €19.6 million in Series A funding from Indra Group and SETT to industrialize multimodal fluxonium quantum systems. This investment will accelerate manufacturing, chip fabrication, and commercial deployment of their quantum platforms, which utilize fluxonium superconducting qubits for improved performance. The funding also highlights growing European defense interest in quantum-accelerated AI and secure communications. The post Qilimanjaro Secures €19.6 Million ($21.9 Million USD) Series A First Close to Industrialize Multimodal Fluxonium Systems appeared first on Quantum Computing Report .
Phys.org Quantum Physics·2026-10-14
No generated summary available for this entry.
overview
Original abstract
Organizations are unprepared for the risks posed by quantum computing, IBM's Europe and Africa vice president Alessandro Curioni told AFP Wednesday, referring to the high-speed technology that could crack security encryptions and enable large-scale cyberattacks.
The Quantum Insider·2026-10-14·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief IonQ priced a $2 billion equity offering comprising 20.5 million common shares at $40 each, pre-funded warrants for 29.5 million shares at $40 each, and seven-year warrants for 100 million additional shares. The offering will be purchased by an entity managed by Heights Capital Management, with J.P. Morgan serving as the sole underwriter. IonQ said the proceeds will support commercialization of its quantum computing, networking, sensing and security businesses, while the offering includes warrants exercisable at $69.46 per share. PRESS RELEASE — IonQ (NYSE: IONQ), a leading full-stack quantum platform and foundry, today announced the pricing of a $2.0 billion equity offering. “This investment will accelerate the commercialization of our full-stack quantum platform and is a tremendous vote of confidence in the trailblazing innovation that has defined IonQ ,” said Niccolo de Masi, Chairman and CEO of IonQ. “The significance of this raise goes beyond its size — giving IonQ additional strategic flexibility as the best-capitalized pure-play quantum company. Our advancement to Stage C of DARPA’s Quantum Benchmarking Initiative and NVIDIA partnership are both significant votes of confidence in our near-term technology roadmap.” De Masi continued, “With Q-Day quickly approaching, we are investing to advance the long-term path to profitability of our full-stack quantum computing, networking, sensing and security platform. IonQ is positioned to create strong value for shareholders by helping customers protect themselves today as we lead the way to manufacturing and deploying utility-scale quantum computing.” The offering consists of 20,500,000 shares of IonQ ’s common stock, each at $40.00 per share, and pre-funded warrants to purchase 29,500,000 shares of IonQ’s common stock, each at $40.00 per pre-funded warrant, each representing a premium of approximately 15% to IonQ’s closing stock price on October 13, 2026, as well as seven-year warrants to purchase
The Quantum Insider·2026-10-14·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief TAIYI Quantum said its cumulative funding exceeded RMB 1 billion, approximately $140 million, less than a year after its January 2026 founding to support ytterbium-based neutral-atom quantum computing. The company is designing its hardware, control systems and software around quantum error correction and fault tolerance, with funding supporting engineering development and system integration. TAIYI Quantum reported integrating its first prototype within six months, developing real-time feedback with latency in the tens of microseconds and releasing LUOSHU, an open-source compiler for neutral-atom hardware. PRESS RELEASE — TAIYI Quantum, a quantum computing company developing ytterbium (Yb) neutral-atom technology, announced that its cumulative funding has exceeded RMB 1 billion (approximately US$140 million) following its latest financing round, less than a year after its founding in January 2026. The latest round attracted participation from venture capital firms, strategic investors, and institutional funds, bringing the company’s cumulative financing to more than RMB 1 billion. The funding will support the company’s development of scalable neutral-atom quantum computing systems, with a particular focus on quantum error correction, fault-tolerant architectures, real-time control, and hardware–software integration. “Quantum computing is fundamentally a long-term systems engineering challenge,” said Zhenghao Fang, Co-founder and CEO of TAIYI Quantum. “Our priority is to translate investment into engineering capabilities, bring together exceptional talent, and build the technological foundations for practical quantum computing.” Building a Quantum Computing Architecture Around Fault Tolerance TAIYI Quantum is pursuing an ytterbium-based neutral-atom architecture designed with fault-tolerant quantum computing as its long-term objective. While neutral-atom platforms offer promising scalability and flexible qubit connectivity, translating physical qub
Nature: Quantum Information·2026-10-14
No generated summary available for this entry.
overview
Quantum
·2026-10-14
·Matt Hoogsteder-Riera, John Calsamiglia, Andreas Winter
·doi
No generated summary available for this entry.
overview
Original abstract
We approach the problem of constructing a quantum analogue of the immensely fruitful classical transport cost theory of Monge from a new angle. Going back to the original motivations, by which the transport is a bilinear function of a mass distribution (without loss of generality a probability density) and a transport plan (a stochastic kernel), we explore the quantum version where the mass distribution is generalised to a density matrix, and the transport plan to a completely positive and trace preserving map. These two data are naturally integrated into their Jordan product, which is called state over time (“stote&apos;&apos;), and the transport cost is postulated to be a linear function of it. We explore the properties of this transport cost, as well as the optimal transport cost between two given states (simply the minimum cost over all suitable transport plans). After that, we analyse in considerable detail the case of unitary invariant cost, for which we can calculate many costs analytically. These findings suggest that our quantum transport cost is qualitatively different from Monge&apos;s classical transport.
Quantum Science and Technology
·2026-10-14
·Lamarana Jallow, Majid I Khan
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract Future quantum networks will have to support different applications on shared infrastructure, like fidelity-critical Quantum Key Distribution (QKD) and latency-sensitive Distributed Quantum Computing (DQC). The existing approaches for entanglement routing either optimise for a single application, or rely on sequential resource allocation, which results in inefficient resource utilisation, unfairness and degraded performance when multiple applications compete for shared network resources. In this paper, we propose AMARQ, a multi-objective Deep Q-Network (DQN) based routing framework to jointly serve heterogeneous QKD and DQC traffic on shared quantum infrastructure. The agent makes adaptive and application-aware routing decisions to dynamically balance the rigid fidelity and latency requirements of QKD and the high-throughput and elastic rate requirements of DQC. The reward function combines a successful-routing throughput term with a per-edge fidelity penalty and an end-of-episode failure penalty; per-flow latency is enforced as a QoS constraint, and inter-application fairness is enforced by a dedicated admission-control loop that reserves a dynamic QKD qubit pool. We assess the performance of AMARQ on grid topologies with 25 to 625 nodes. AMARQ attains a request success ratio above 85\%, which is up to 32 percentage points higher than ESDI and 39 percentage points higher than Cicconetti, while keeping the end-to-end fidelity above 0.80 and the inference latency below 90~ms for all configurations.
npj Quantum Information
·2026-10-14
·Oliver F. Wolff et al.
·doi
No generated summary available for this entry.
overview
No generated summary available for this entry.
overview
Original abstract
Abstract Randomness is a key feature of quantum physics. Heisenberg’s uncertainty principle reveals the existence of an intrinsic noise, usually explored through Gaussian squeezed states. Due to their insufficiency for quantum advantage, the focus is currently shifting towards genuinely quantum non-Gaussian states. However, while genuine quantum behavior comes naturally to discrete variable systems, its preparation and verification are difficult in continuous ones. Simultaneously, a unifying theoretical framework based on the continuous nature is missing. Here, we introduce nonlinear squeezing as a general framework to describe and verify genuine quantumness in the noise of continuous quantum states. Using this approach, we certify the non-Gaussianity of experimentally prepared multi-photon-added coherent states of light for the first time. Chiefly, we demonstrated the nonlinear squeezing corresponding to third- and fifth-order quantum nonlinearities, going significantly beyond the current state-of-the-art in quantum technology. This framework enables uncovering intricate quantum properties in cutting-edge experiments and provides an efficient tool for further development of quantum technologies.
arXiv·2026-10-14·August Burg
No generated summary available for this entry.
overview
Original abstract
In this Master's thesis, we give a pedagogical introduction to the semiclassical analysis of wave dynamics in single-band and multi-band systems. We show how the semiclassical evolutions of Wigner functions can approximate the dynamics of wave packet centers and wave packet deformations. Three systems of increasing complexity are considered: the quantum harmonic oscillator and the quantum anharmonic oscillator as single-band systems, and the Dirac oscillator as a two-band system. We explain the origins of the first-order semiclassical corrections (Moyal, Littlejohn-Flynn, and Berry) in the equations of motion and examine their effects on predictive accuracy. Another focus is set on the conditions for validity of the semiclassical analysis. For both the quantum anharmonic and the Dirac oscillators, a dimensionless parameter controlling the accuracy of the approximation is identified. In multi-band systems, the formalism applies only to states within a single adiabatic subspace, which, for the Dirac oscillator, corresponds to an energy branch. This motivates the construction of single-branch almost coherent states: approximately Gaussian wave packets formed by superpositions of states from a single energy branch. Their centers undergo oscillations with an aperiodic envelope. These states enable comparison between semiclassical Wigner function evolution and the commonly used Sundaram-Niu formalism. We show that semiclassical Wigner function evolution captures deformation-related dynamics, including the initial decay of oscillations, which the Sundaram-Niu formalism cannot describe by construction. Additionally, exact quantum evolution reveals partial relocalization of these single-branch almost coherent states, a phenomenon that cannot be captured by the semiclassical evolution.
arXiv·2026-10-14·Silvie Illésová, Vojtěch Novák, Martin Beseda
No generated summary available for this entry.
overview
Original abstract
Drone-delivery planning combines routing decisions with operational constraints such as payload capacity and limited onboard energy, resulting in combinatorial optimization problems that can become costly to encode directly in binary form. This work investigates a hybrid quantum--classical approach in which candidate drone missions are generated and evaluated classically before constructing a quadratic unconstrained binary optimization (QUBO) model for mission selection. Payload- and energy-infeasible missions are removed during preprocessing, while the reduced QUBO is solved using exact enumeration, simulated annealing (SA), and the Quantum Approximate Optimization Algorithm (QAOA), with mixed-integer linear programming (MILP) used as a classical reference. Experiments on controlled synthetic delivery instances evaluate solution quality, the effect of preprocessing, and computational scaling. Exact QUBO optimization reproduces the MILP optimum on the evaluated small instances, while SA achieves $100\%$ feasibility with a median optimality gap of $0\%$. Combined payload-and-energy preprocessing reduces the mean number of QUBO variables by $29.60\%$ and quadratic interactions by $49.20\%$, while reducing mean SA runtime by $31.26\%$. In contrast, the evaluated shallow statevector-based QAOA configuration achieves lower feasibility and is restricted to small QUBO instances. These results indicate that, in the considered setting, the main practical benefit of the hybrid architecture comes from classical feasibility preprocessing that reduces the binary search space before QUBO-based optimization.
arXiv·2026-10-14·Aaron Miller
No generated summary available for this entry.
overview
Original abstract
We introduce monoprop, an open-source, massively parallel operator-propagation framework for fermion and qubit bases. For $N$ qubits or modes, existing codes represent each of the $K$ tracked operator terms (Pauli strings or products of Majorana operators) as a $2N$-bit string, testing each for anticommutation with the gate at $O(KN)$ cost per gate. Here, we introduce the anticommutation index which rapidly looks up the terms anticommuting with a gate. A local gate changes only the terms that touch its sites, and when terms are truncated to act on few sites, only a fraction $\sim1/N$ touch any given qubit or mode, and we use this to prove the time per gate scales as $O(K/N)$. This counterintuitive result tells us that for a fixed number of terms, increasing the number of sites can make things faster. We demonstrate this numerically, and show monoprop scales almost ideally to 8192 cores, tracking $9.5\times10^{10}$ terms. Beyond propagation, we present memory-efficient surrogate graphs, which record one propagation and replay it at new angles, for fast energy re-estimation and parameter gradients, and an efficient method for finding energy-minimising gates and optimal angles for simulating adaptive quantum-chemistry circuits.
arXiv·2026-10-14·Federico Petrovich, R. Rossignoli, M. Cerezo
No generated summary available for this entry.
overview
Original abstract
Determining whether quantum states can be interconverted by a prescribed set of transformations is a fundamental problem in quantum information. Here we develop a general classification framework based on conserved operators (COs), i.e., not necessarily hermitian matrices having the state of interest as an eigenstate. We first show that COs belonging to the algebra generating the allowed transformations can be obtained from the kernel of a quantum covariance matrix. Their number determines the dimension of the accessible orbit, while their algebraic structure and eigenvalues provide further constraints on state convertibility. We establish general bounds on the number of COs and prove that highest-weight states, like separable states in the case of $n$ qudits, attain the maximum. We also show how these operators generate parent Hamiltonians having the characterized state as an exact ground state. We then also consider positive zero-eigenvalue COs, which encode forbidden directions of reduced density matrices and incorporate rank-based constraints into the same framework. Applying this approach to multiqubit SLOCC, we obtain complementary classifications from algebraic and rank COs. While for $n\leq 3$ qubits both lead to the usual classes, for $n=4$ qubits they distinguish 17 and 20 types separately, and 29 when combined. The combined classification yields 287 fixed types and $4$ continuous families for $n=5$ qubits, and 4926 fixed types and 147 continuous families for $n=6$ qubits, providing, to our knowledge, the most refined exhaustive classification of SLOCC-convertibility classes based on such data.
arXiv·2026-10-14·Nitin Jha, Prateek Paudel, Abhishek Parakh
No generated summary available for this entry.
overview
Original abstract
In a quantum augmented network, sharing optical fiber with classical traffic requires quantum wavelength selection to balance logical fidelity, block acceptance, and classical data reception. Here we develop a wavelength-selection framework for an error-corrected three-stage quantum communication protocol. Under a thermal-background model with independent errors, an ideal one-photon receiver, and ideal recovery, we derive an accepted qubit channel and a key-independent lower bound on logical entanglement fidelity. Combining this bound with block acceptance gives an entanglement-fidelity yield bound, which we maximize over evaluated wavelengths subject to fidelity and classical link-budget requirements. For the Steane [[7,1,3]] code at 5 km per traversal and -10 dBm per classical channel, the largest fidelity certificate occurs near 1537 nm, whereas the largest yield bound occurs near 1551 nm. Along the 1.25 Gb/s classical link budget with 0.2% base error, the optimized yield bound falls below 10^-6 near 10 km per traversal, while fidelity remains certified at 0.99 or higher at longer spans. These results distinguish fidelity and yield constraints and identify certified operating regions for quantum-augmented networks sharing optical fiber.
arXiv·2026-10-14·Fabrizio Canfora, Pablo Pais, Luigi Rosa
No generated summary available for this entry.
overview
Original abstract
We study the zero-temperature Casimir effect of a three-dimensional Bose fluid with finite-range corrections to its Bogoliubov spectrum. Beyond the universal acoustic contribution scaling as $L^{-3}$, the long-distance expansion contains a nonuniversal $L^{-5}$ correction that can compete with the phononic term. We derive this crossover analytically within a minimal isotropic finite-range model and test the asymptotic result against the full dispersion. A regulator-independent Poisson-resummed calculation confirms that sign reversals of the Casimir energy are possible, while showing that the apparent low-coupling zero inferred by balancing only the $L^{-3}$ and $L^{-5}$ terms is not quantitatively controlled. Robust sign changes instead occur in the stable regime close to roton softening, where the Casimir energy acquires an oscillatory finite-momentum contribution. Strongly dipolar atomic gases provide a natural motivation for microscopic interaction lengths in the nanometric regime. We further discuss how the resulting nonlinear force law could be probed through the frequency response of a driven nanomechanical resonator.
arXiv·2026-10-14·Tai Xiang et al.
No generated summary available for this entry.
overview
Original abstract
Integrating Rydberg-state control of atom-atom interactions with cavity control of atom-light interactions enables the combination of local entangling operations with photon-mediated long-range coupling, measurement, and communication. Such integration is challenging because electric fields generated by charges on cavity optics and by cavity-stabilizing actuators may disturb Rydberg-state coherence. Here, we couple a Rydberg tweezer array to a high-cooperativity optical cavity, suppressing the electric fields produced by cavity length actuation so that the residual field variation of about $3~\mathrm{mV/cm}$ rms does not limit Rydberg coherence. We demonstrate two capabilities that neither system provides alone. First, we use Purcell-enhanced fluorescence to read out atoms directly in the ground-Rydberg basis within $7.5~μ\mathrm{s}$, well within the Rydberg-state lifetime, with ground- and Rydberg-state detection infidelities of $3\%$ and $5\%$, respectively, and with low atom loss. Second, we use Rydberg-Rydberg interactions to control collective light-atom scattering into the cavity mode. Specifically, we drive blockaded Rabi oscillations between a state with two ground-state atoms, which scatter collectively with a superradiant or subradiant rate controlled by the atomic positions, and an entangled state with a single Rydberg excitation, which scatters like a single atom. These capabilities open routes toward networked Rydberg processors, mid-circuit measurements in analog quantum simulators, and many-body quantum optics with entangled emitters coupled collectively to light.
arXiv·2026-10-14·Karl P. Horn, Christiane P. Koch
No generated summary available for this entry.
overview
Original abstract
Collisions between atoms and molecules govern how energy is exchanged and redistributed in the gas phase, underpinning phenomena from spectral line broadening and interstellar molecular excitation to the cooling and trapping of molecules. A quantitative account of these collisions requires connecting the theoretical description of the interaction between the collision partners to measurable quantities such as cross sections. However, scattering theory as presented in quantum mechanics textbooks does not readily translate into numerical methods. Here, we formulate the scattering problem in Dirac notation, as customary in present-day quantum mechanics courses, and show how to build a practical numerical framework from it. We derive the "coupled channel" representation of the scattering problem with correct asymptotic behaviour and introduce Numerov's method to obtain time-independent wavefunctions, from which we calculate cross sections, the observables measured in scattering experiments. Starting from single channel scattering, we build up to the realistic collision of a ground-state atom with a diatomic molecule.
arXiv·2026-10-14·Priscilla Awuah, Krystal Guo
No generated summary available for this entry.
overview
Original abstract
We run continuous-time quantum walks with perfect and peak state transfer on a present-day superconducting quantum processor, IBM Quantum's $156$-qubit Heron device ibm_kingston, deliberately without error correction or error mitigation. Perfect state transfer and its relaxations have been studied extensively in algebraic graph theory, where one can prove exactly which graphs move a quantum state from one vertex to another with probability one (or with the largest probability the graph allows, in the case of peak state transfer), and at what time. Our experiments cover perfect state transfer on the hypercubes $Q_2 = C_4$ and $Q_3$, and on the Hamming-weighted paths $\mathrm{HP}_n$, the equitable-partition quotients of the hypercubes $Q_n$, for $n$ up to $20$; peak state transfer on the $X_n$ family for $n$ up to $11$; and, for comparison, moving the state along a path of qubits by a sequence of SWAP gates.
arXiv·2026-10-14·Konstantin Antipin, Richik Sengupta
No generated summary available for this entry.
overview
Original abstract
Exact zero-energy eigenstates built from entangled dimers have recently been found in a large class of spin Hamiltonians. While the individual states have a simple structure, their superpositions can have very different entanglement properties. In this work, we study these superpositions for geometrically local spin-1/2 chains with periodic boundary conditions. Using stabilizer theory and polynomial methods, we characterize the subspace they span and find the minimum entanglement entropy between two halves of the chain. For Hamiltonians generated by a single local Pauli interaction with noncommuting translates, this minimum obeys a volume law at fixed interaction range. The structure of the least-entangled superpositions also suggests further exact eigenstate constructions, including zero-energy states separable between the two halves of the chain and states at nonzero energies.
arXiv·2026-10-14·Han Zheng et al.
No generated summary available for this entry.
overview
Original abstract
Readout errors in superconducting qubits include incorrect state assignment, bit flips within the computational subspace, and leakage to non-computational states. These errors require different mitigation strategies, yet conventional measurement fidelity and repeatability metrics do not resolve their individual contributions. Previous repeated-readout studies have shown that temporal correlations reveal additional information about readout errors. Here we introduce the Readout Error Decoder (RED), which converts repeated thresholded binary records into a channel-resolved error budget. Controlled error injections validate the channel-specific response of the decoder. We demonstrate RED on both fluxonium and transmon qubits and across distinct leakage-lifetime regimes. RED identifies the error channels limiting readout performance without requiring dedicated discrimination of non-computational states, providing a basis for targeted readout optimization across different qubit modalities.
arXiv·2026-10-14·Romuald A. Janik et al.
No generated summary available for this entry.
overview
Original abstract
How coherent confining strings reorganize into hadronic matter is a central open problem in nonequilibrium gauge dynamics. Using real-time tensor-network simulations of the massive Schwinger model, we identify a collective organization underlying string fragmentation. For intermediate masses, the dynamics simplifies and more than $99\%$ of the temporal evolution of the electric-field probability distribution is governed by a single collective mode whose decay tracks the survival probability of the parent string. The extracted survival law exhibits the same Gaussian dependence implied by the Lund world-sheet area law, providing microscopic support for its characteristic area law dependence without assuming the Lund fragmentation mechanism. The same mode controls the transition from the coherent string to the produced mesons, explains the universal non-thermal effective fluid equation of state, and essentially controls the growth of bipartite entanglement through the causal propagation of massive pairs. These results identify collective fragmentation as an organizing principle of coherent string breaking and provide a microscopic perspective on the dynamical origin of a central ingredient of Lund hadronization.
arXiv·2026-10-14·Rafael Gómez-Lurbe et al.
No generated summary available for this entry.
overview
Original abstract
Quantum imaginary-time evolution (QITE) provides a systematic route to ground-state preparation, but its cost grows rapidly with the locality $D$ of the unitary approximation, for which the local Pauli basis scales as $4^D$. We introduce Sparse-QITE, a regularized formulation that promotes compact generators, reducing the number of quantum operations and yielding circuits with fewer gates and lower depth. We derive rigorous bounds on the sparsification error and benchmark the method in one-dimensional transverse-field Ising and antiferromagnetic Heisenberg models. Sparse-QITE exhibits a controllable sparsity--accuracy trade-off while retaining strong compression even in the high-accuracy regime. In scalability experiments with respect to $D$, the active support grows much more slowly than in standard QITE and, in several regimes, approximately saturates over the domain sizes studied. After circuit construction and transpilation, some of the largest-domain cases require only about $1\%$ of the standard-QITE gate count while maintaining high accuracy. We further introduce adaptive and active-discovery variants: the former selects the regularization strength dynamically during the evolution, while the latter reduces the number of Pauli expectation values that need to be evaluated and, consequently, the measurement requirements. These results establish sparsity-promoting regularization as a route toward more resource-efficient QITE. More broadly, these results suggest that sparsity-promoting regularization may also benefit variational quantum algorithms.
arXiv·2026-10-14·Leo Shaposhnik et al.
No generated summary available for this entry.
overview
Original abstract
Which features of a quantum state are needed for a relativistic quantum field theory to emerge from a lattice system? We address this question by establishing a quantitative relationship between the type classification of hyperfinite von Neumann algebras and the quantum-information-theoretic resource of nonstabilizerness, also called magic. Our results establish two complementary parts of this relationship. First, we prove that any stabilizer system on a lattice defines a canonical GNS Hilbert space in which local von Neumann algebras do not contain type III factors in their central decomposition. As an explicit example, we prove that for stabilizer systems with short-range order, the local algebras are isomorphic to tensor products of hyperfinite factors of type I or type II. This demonstrates that the absence of magic is accompanied by the absence of type III factors in the local algebras, therefore prohibiting the appearance of a quantum field theory. Second, for the hyperfinite factors of Araki, Woods and Powers, we prove a quantitative equivalence: The limiting factor is of type III if and only if the locally optimized min-relative entropy of magic diverges. This divergence is necessary to generate the continuous spectrum associated to a type III factor. Thus, in this setting, the emergence of a type III factor requires not merely the presence of magic, but an infinite amount of it. These results provide a rigorous setting supporting the proposal that infinite magic is a necessary structural ingredient for the emergence of a relativistic continuum from lattice systems.
arXiv·2026-10-14·Nidhal Mghirbi, Seth Douglas
No generated summary available for this entry.
overview
Original abstract
Li and Zuiddam's entanglement-assisted asymptotic spectrum of graphs consists of the normalized graph parameters that are additive under disjoint unions, multiplicative under strong products and monotone under entanglement-assisted cohomomorphisms; the entanglement-assisted Shannon capacity is their pointwise minimum. To our knowledge, the Lovász number $\vartheta$ was its only known element. We find a continuum of others. Three quantities of Duan and Winter, $\log_2\vartheta$, the minimal Holevo capacity $C_{\min}$ and the logarithm of the no-signalling simulation cost $Σ$, are the smallest information radii of classical-quantum channels compatible with a graph, measured with Petz-Rényi divergences of orders $0$, $1$ and $2$. At order zero this is due to Schrijver (as credited by Dalai) and to Duan and Winter; at order one it is the min-max formula for the Holevo capacity. Interpolating in the order gives a family $\vartheta_α$, $0\leα\le2$, and we prove that every member lies in the spectrum. The main step, multiplicativity under strong products for channels that need not factor, follows from an exact nesting identity for compressions. Sandwiched Rényi radii of order $β\in[1/2,\infty]$ give the same family, at $α=2-1/β$. On the five-cycle the family takes every value in $[\sqrt5,5/2]$. A Hilbert-Schmidt inequality for the pentagon gives $C_{\min}(C_5)=\log_2(5/2)$, proving a conjecture of Duan and Winter. We also settle the two open links of their inequality chain: the graph-level no-signalling simulation rate always equals its single-letter value $\log_2Σ(G)$, and a 32-vertex graph from the Mermin-Peres magic square has $C_{\min}<\log_2Σ$, certified in exact rational arithmetic. Finally, $Σ$ never exceeds the projective rank of the complement; a rank inequality for the same square makes this strict on a 1440-vertex graph.
arXiv·2026-10-14·Jakob J. Minar et al.
No generated summary available for this entry.
overview
Original abstract
We show that the emergence of a ``magic barrier'', characterized by a transient maximum of nonstabilizerness during rapid entanglement growth, is a universal feature of thermalization within quantum ergodic theories, which is intimately connected to random matrix spectral properties. Starting from a pure product state, we analytically determine the time evolution of entanglement entropy, antiflatness, capacity of entanglement, and nonlocal trace distance magic under unitary dynamics generated by random matrix Hamiltonians drawn from all three Gaussian ensembles. We find that the transient maxima of antiflatness, capacity of entanglement, and nonlocal magic occur on the same characteristic timescale as the maximum rate of entanglement growth. These results establish that the magic barrier is a universal feature of RMT thermalization, suggesting universality across quantum chaotic systems. We conclude that quantitative simulations of thermalization in ergodic quantum theories inherently require quantum computation.
arXiv·2026-10-14·Joaquín Peñuela-Parra, Juan José Mendoza-Arenas
No generated summary available for this entry.
overview
Original abstract
Developing mechanisms to control transport in correlated quantum systems is essential for advancing quantum circuit technologies. In this work, we establish a rectification mechanism for both particle and energy flow in a fermionic system coupled to external baths, in the presence of a tilted potential modulated locally by a time-periodic drive. The drive generates particle and energy currents even in the absence of chemical or thermal bias between the baths. These drive-induced currents are enhanced at resonant frequencies at which avoided crossings occur in the Floquet quasienergy spectrum, reflecting the role of the Floquet states as intermediate channels for transport. Once a bias between the baths is introduced, the drive-induced current contribution can reinforce, compete with, or even cancel the bias-induced contribution. These effects enable rectification in the non-interacting regime, which we quantify via the rectification coefficient $\mathcal{R}$. This coefficient measures the asymmetry between transport up the tilt (forward bias) and down the tilt (reverse bias). In addition to standard rectification, where transport is reduced under reverse bias, we identify a regime of bipolar rectification, in which the current flows only up the tilt regardless of the bias polarity. At the boundary between standard and bipolar regimes, the system achieves perfect rectification, corresponding to complete suppression of the reverse-bias current. In the presence of interactions between particles, the parameter region that supports bipolar rectification is enlarged and $\mathcal{R}$ can be enhanced by many orders of magnitude. Our results establish a rectification mechanism for particle and energy transport that can be experimentally realized in condensed matter and cold atom systems.
arXiv·2026-10-14·Flavio Del Santo
No generated summary available for this entry.
overview
Original abstract
In the mid-1940s, the question of whether quantum mechanics could be supplemented by deterministic hidden variables resurfaced in a debate in ^textit{Nature}. I show that Erwin Schrödinger drafted a hitherto unpublished response to this controversy. In it, Schrödinger provided an explicit hidden-variable model, thereby showing that such models could not be ruled out. I reconstruct the historical context of this forgotten manuscript and publish here the first transcription and analysis. Importantly, Schrödinger's proposal should be understood as a proof of principle rather than as evidence of his commitment to determinism.
arXiv·2026-10-14·Nicholas C. Rubin, A. Eugene DePrince
No generated summary available for this entry.
overview
Original abstract
We present a solution to the fermionic quantum marginal problem by constructing the complete family of two-body witnesses at each level of a weighted sum-of-squares hierarchy. Our construction combines positive-semidefinite Gram matrices with explicit linear nullspace constraints that exactly cancel all higher-body contributions, replacing the search for individual representability conditions with a systematic algebraic procedure. Beyond the completeness proof, we demonstrate the construction numerically by solving the associated semidefinite program and recovering the exact ground-state energy of a Richardson Hamiltonian in the three-fermion sector. We further prove that higher-degree particle-number multipliers are unnecessary when the full sum-of-squares generating algebra is used. These results establish a unified constructive framework for verifying the physicality of a candidate two-particle reduced density matrix through a complete characterization of all two-body witnesses.
arXiv·2026-10-14·Johanna Conrad, Fabian Steinlechner, René Sondenheimer
No generated summary available for this entry.
overview
Original abstract
Schrödinger cat states are important non-Gaussian resources for quantum information processing and quantum-enhanced metrology. Although photon subtraction from squeezed vacuum states has proven useful for generating such states in the optical domain, scaling to large amplitudes while maintaining high fidelity and heralding probability remains challenging. To address these obstacles, we analyze alternating squeezing and photon-number-subtraction operations. Rather than optimizing for a single heralding outcome, we formulate cat-state generation as a fidelity-constrained multibranch problem, jointly optimizing the total probability of all photon-number outcomes satisfying a prescribed fidelity threshold at one common experimental setting. Already for plain photon subtraction, this provides a more operational measure of the usable generation probability and can favor parameter configurations that differ from single-branch optima. Considering experimental constraints on available squeezing and photon-number-resolving capability, we demonstrate improvements in fidelity and success probability compared with plain photon subtraction, without necessarily increasing the required squeezing resources. Without restrictions on photon-number resolution, we find that the optimal architecture of the alternating scheme reduces to one of two single-subtraction endpoint configurations, depending on the available squeezing resources. When photon-number resolution is additionally limited, genuinely alternating branches can become advantageous. We derive analytical expressions for the conditional states, cat-state fidelities, and heralding probabilities, enabling efficient multibranch optimization and a systematic analysis of resource trade-offs, sensitivity to experimental parameter deviations, and heralding loss. Together, these results identify the architecture best suited to a given resource budget.
arXiv·2026-10-14·A. de Oliveira Junior et al.
No generated summary available for this entry.
overview
Original abstract
Prepare-and-measure scenarios are among the simplest and most widely used settings for quantum communication. A sender prepares a physical system in one of several possible states, which a receiver then measures. Despite this simple structure, these scenarios offer a rich framework for exploring the differences between classical and quantum communication, revealing quantum advantages, and developing protocols for quantum cryptography and device certification. In this tutorial, we give a ground-up introduction to prepare-and-measure scenarios and the methods used to study them. We introduce different frameworks for constraining and characterising communication, with an emphasis on semi-device-independent approaches to quantum information. We also cover modern convex-optimisation techniques for characterising the correlations achievable in these scenarios and illustrate how these tools can be applied in practice. Our aim is to give newcomers the conceptual and technical foundations needed to approach the current literature and apply prepare-and-measure methods in their own research. We conclude with a discussion of open problems and directions for future work.
arXiv·2026-10-14·Sarang Gopalakrishnan, Romain Vasseur
No generated summary available for this entry.
overview
Original abstract
Local coherences between distinct charge sectors--measured by the single-particle Green's function or the transverse spin autocorrelation function--do not overlap with hydrodynamic modes. At finite temperature, therefore, they decay faster than any power law in generic chaotic systems. We present a mechanism by which these coherences can persist anomalously long, for integrable and chaotic spin chains (including the XXZ and Fredkin spin chains) that obey a quantum group symmetry. We show--using a Mazur bound derived from the quantum-group symmetry, together with locality and a "non-undershoot" assumption--that the transverse spin autocorrelation function $C(t) \equiv \langle σ^-_x(t) σ^+_x(0)\rangle$ can decay at most algebraically: $C(t) \gtrsim 1/t^2$. This bound is not tight: in the large-anisotropy limit of the XXZ spin chain, at infinite temperature, we explicitly compute $C(t) \sim \sqrt{3}/(18 \sqrt{t})$. We also compute this decay rate in the XXZ spin chain for general easy-axis anisotropy, and estimate it to scale as $C(t) \sim t^{-2/z}$ (for transport exponent $z$) in the chaotic models.
arXiv·2026-10-14·Marco Rigobello et al.
No generated summary available for this entry.
overview
Original abstract
We study geometric defects in square-lattice Rydberg-atom arrays induced by lattice-size parity in the striated density-wave phase. While odd-sized lattices select a single striated domain, even-sized lattices seed incompatible domains at the four corners, resulting in a π/2-rotation invariant state with a geometrical defect emanating from the lattice center. At larger detunings, we instead identify a π-rotation-invariant state with two domains nucleated by opposite corners and separated by a one-dimensional diagonal defect. We probe the state-preparation protocol on the Aquila atomic quantum processor and benchmark it with equilibrium and real-time dynamics tensor-network simulations. Our results assess the role of boundaries and lattice size in determining the global ordering in programmable quantum matter.
arXiv·2026-10-14·C. M. Wilson, R. Ganesh, K. V. Samokhin
No generated summary available for this entry.
overview
Original abstract
Multilayer graphene exhibits rich possibilities for stacking. While natural bulk graphite predominantly occurs in the Bernal structure, where layers are stacked in an $-ABAB-$ pattern, rhombohedral stacking has sprung to prominence recently. It is well known that Bernal graphite exhibits anisotropic transport, with high resistance to currents along the stacking axis. Careful experiments using pillar geometries have measured out-of-plane resistance, attributing it to stacking faults where planes slip out of the nominal $ABAB$ sequence. The observed resistance shows anomalously large, non-Gaussian, sample-to-sample variations. In this article, we build a theoretical framework to calculate $c$-axis resistance of graphene stacks with an arbitrary stacking arrangement. Our approach builds on the idea that, regardless of stacking sequence, we have in-plane translational symmetry. With in-plane momentum as a good quantum number, $c$-axis transport reduces to an effectively one-dimensional problem that can be addressed using the Landauer paradigm. We calculate the resistances of a variety of simple stacking faults in both Bernal and rhombohedral systems. We also calculate the resistance of a rhombohedral 'slab' embedded between Bernal leads. Remarkably, despite both Bernal and rhombohedral graphite being metallic, the system exhibits insulating behaviour. We attribute this to Fermi surface mismatch. We next calculate the resistance of a multilayer sample with stacking disorder. Resistance is non-self-averaging, akin to a one-dimensional wire where disorder has a strong localizing effect. The median resistance grows exponentially with stack size, indicating insulating character driven by localization. Our results demonstrate that transport measurements on mesoscopic graphitic pillars serve as signatures of stacking faults, and in particular, probe localization-driven physics.
arXiv·2026-10-14·Murtaza Ali Mir, Teemu Ojanen, Ali G. Moghaddam
No generated summary available for this entry.
overview
Original abstract
We study how readout errors affect dynamics in monitored quantum circuits. Such errors make postselection effectively incomplete, conditioning trajectories on imperfect rather than true records. Focusing on U(1)-symmetric circuits, we find that the charge-sharpening transition survives at a finite error rate, with the sharp phase's vanishing fluctuations replaced by a finite steady-state plateau. The charge fluctuations show a shallow minimum near the ideal transition point as a function of measurement rate, signaling the competition between measurement-induced purification and noise-induced mixing. By decomposing the fluctuations into quantum and classical contributions, we show the minimum marks where incomplete postselection still retains enough trajectory memory to attenuate noise-induced mixing, leaving a detectable signature of the transition even in a noisy setting. Mid-circuit measurements are far harder to mitigate against readout errors than standard end-of-circuit ones, because the errors corrupt the postselection itself; the decomposition therefore offers a minimal mitigation framework and a route to locate the transition directly from experimental data. Our results show that charge sharpening survives readout errors in a quantitative and experimentally accessible way.
arXiv·2026-10-14·Sergio E. Aguilar-Gutierrez
No generated summary available for this entry.
overview
Original abstract
We develop a finite-cutoff holographic description of the double-scaled SYK (DSSYK) model. We construct microscopic deformations of Kourkoulou-Maldacena and thermofield-double SYK states whose double-scaling limits reproduce a lower-dimensional analogue of $\text{T}\overline{\text{T}}$ and $\text{T}\overline{\text{T}}+Λ_2$ deformations, which we denote $T^2$ and $T^2+Λ_1$, respectively. The ensemble-averaged theory describes wormhole states in finite-cutoff sine dilaton gravity, and finite-cutoff anti-de Sitter and de Sitter geometries in the low- and high-energy regimes, respectively. The analysis includes both perturbative and non-perturbative solutions to the energy spectrum flow equation, and the regions behind and beyond the respective horizons. Only the perturbative branch admits physical quantum states. We study how to incorporate end-of-the-world (ETW) branes in the finite cutoff holographic dictionary. The ETW brane leads to an additional boundary theory deformation, which leads to black hole or eternal traversable wormhole geometries depending on the existence of normalizable bound states. We extend the finite cutoff length evaluations for constant mean curvature (CMC) slices, and interpret them as complexity in the boundary theory. We discuss possible extensions with matter. Our results provide a microscopic framework for studying the finite-cutoff boundaries, CMC slices and branes in the holographic dictionary of DSSYK.
arXiv·2026-10-14·Alexander Nico-Katz
No generated summary available for this entry.
overview
Original abstract
The partial information decomposition (PID) framework is an extension of classical information theory that enables a systematic analysis of the structure of information in multipartite systems. We advance a simple extension of this framework enabling the construction of multipartite quantum PIDs (QPIDs); generalizing recent, exclusively bipartite, extensions. We construct two QPIDs of the Holevo quantity. First a naive QPID based on the classical minimum mutual information. Second a sophisticated QPID enabled by our development of an operational partial order on quantum ensembles in terms of ensemble (inter-)convertability. Finally, as a concrete example of how QPIDs can be applied, we investigate objectivity scenarios; using our Holevo QPIDs to directly quantify objective information in extended graph states. These findings ultimately establish a foundation upon which generic multipartite QPIDs can be systematically constructed, introduce an operational partial order on ensembles, advance QPIDs as interesting objects of study in their own right, and demonstrate their immediate applicability to problems in quantum information.
arXiv·2026-10-14·Yi-Zhou Bu et al.
No generated summary available for this entry.
overview
Original abstract
Continuous-variable quantum information processing with mechanical oscillators requires a uni- versal gate set, including a genuine non-Gaussian evolution. While circuit quantum acoustodynamics (cQAD) experiments have realized bilinear and quartic (four-wave mixing) operations by coupling mechanical modes to transmon qubits, the intrinsic Kerr nonlinearity of these devices precludes access to odd-order effective Hamiltonians such as trisqueezing. Here we propose a cQAD architec- ture in which a mechanical mode, hosted in a high-overtone bulk acoustic-wave resonator (HBAR), is coupled to a superconducting nonlinear asymmetric inductive element (SNAIL). By combining the cubic nonlinearity of the SNAIL with parametric flux driving, we engineer a three-wave mixing interaction that generates trisqueezed mechanical states, producing the characteristic triangular, star-shaped Wigner function with negative regions indicative of non-Gaussianity. We derive the effective trisqueezing Hamiltonian from the full circuit model, identify the drive frequencies and flux modulation required to isolate the desired interaction from competing terms, and quantify the achievable coupling strengths for parameters compatible with current fabrication capabilities. Our results establish a hardware-efficient route to non-Gaussian resource generation in mechanical quantum systems, extending the toolbox of cQAD toward universal continuous-variable quantum computation and enhanced quantum-limited sensing.
arXiv·2026-10-14·Shuwen Sun et al.
No generated summary available for this entry.
overview
Original abstract
Unconventional superconductivity can emerge in various forms in strongly correlated systems. Historically, the most extensively studied examples include nodal and triplet pairing, which were experimentally detected in cuprates and superfluid helium-3, respectively. Beyond these canonical cases, there are also nematic superconductors, in which the rotational symmetry of the lattice is broken in the superconducting state. While there are several examples of nematic superconductors whose pairing emerges inside a preexisting nematic normal state, experimental evidence for superconducting states that intrinsically break rotational symmetry on their own has been exceedingly scarce. Here, we report the experimental realization and identification of an intrinsic multi-component nodal nematic superconducting state in magic-angle twisted trilayer graphene (MATTG). By integrating tunneling spectroscopy with quantum transport measurements, we directly probe the symmetry of low-energy superconducting quasiparticles. Deep inside the superconducting state, we observe a pronounced two-fold anisotropy in the zero-bias tunneling conductance under an in-plane magnetic field, which is strongly suppressed together with superconductivity as the temperature or perpendicular magnetic field is increased. Remarkably, the major axis of anisotropy rotates by up to $90^{\circ}$ across the superconducting dome, indicating an intrinsic, field- and density-tunable symmetry of the low-energy excitations. These behaviors imply a nodal superconducting state in MATTG that spontaneously breaks the six-fold rotational symmetry of the moiré superlattice. Our results establish moiré graphene as a versatile platform for realizing and interrogating nodal nematic superconductivity, opening a new avenue for exploring unconventional symmetry-breaking superconducting states in two-dimensional materials.
arXiv·2026-10-14·Luisa Madail, Joaquín Fernández-Rossier
No generated summary available for this entry.
overview
Original abstract
We present the theory of the Landau levels of $C_3$ high-fold fermions in honeycomb lattices. These fermions arise as a generalization of the tight-binding model in a honeycomb lattice with one orbital per site, known to describe graphene, to a family of models with several orbitals per site transforming according to representations of $C_3$, relevant for triangulene two-dimensional crystals. The models are defined by the number of orbitals $n_a$ and $n_b$ at the $a$ and $b$ sites of the unit cell. They feature energy bands that combine flat bands and Dirac cones, that are isomorphic to those of graphene, the Lieb, $p_{xy}$ honeycomb, and the Kagome tight-binding models. Combining tight-binding and $k\cdot p$ methods, here we compute the Landau levels of the $(1,1)$, $(1,2)$, $(2,2)$ and $(3,3)$ models, we compare them to those of the reference models, and we explore the similarities and differences with the Landau levels in graphene. Our findings reveal that the nature of $C_3$ high-fold fermions combine Dirac-type Landau quantization, originating from the linear crossings and associated relativistic band dispersion, with anomalous Landau quantization rooted in the quantum geometry of the singular flat bands.
arXiv·2026-10-14·Yuta Hirasaki, Jong Yeon Lee
No generated summary available for this entry.
overview
Original abstract
Logical CCZ states enable Toffoli gates, a central building block of fault-tolerant quantum arithmetic. We introduce an end-to-end protocol for direct CCZ-state preparation on bivariate tricycle and bicycle (BT/BB) codes. Our factory combines the cup-product CCZ gates native to BT codes with two novel ingredients, both enabled by engineering the logical coupling between BT and BB codes through projection-preserving lifts. Index-2 lifted BB ancillas enable selective $Z$-basis initialization, allowing the native cup-product gates to directly prepare two disjoint logical CCZ states. The prepared CCZ states are faithfully transferred to index-3 lifted BB memories with high code distance. We use decoder-based postselection to obtain high-fidelity output states with low overhead. We perform exact simulations of our factory under a circuit-level noise model motivated by neutral-atom hardware, obtaining joint infidelities of $1.84\times10^{-5}$ at $21.94\%$ acceptance and $4.10\times10^{-7}$ at $8.89\%$ acceptance for single-qubit, CZ, and CCZ error rates of $0.01\%$, $0.1\%$, and $0.5\%$, respectively. At the output-infidelity target of our smallest factory, its estimated spacetime cost per CCZ state is lower than that of $T$-state cultivation followed by CCZ conversion, providing an efficient route to logical CCZ states for fault-tolerant quantum computation.
arXiv·2026-10-14·Yevgen Kotukh
No generated summary available for this entry.
overview
Original abstract
Side-channel attacks on block ciphers rarely recover the key outright: they leave a residual key space ordered by subkey posteriors, and evaluation laboratories report the key rank of the true key against thresholds near 2^48 and 2^60. No evaluation framework models an adversary who collects traces classically and finishes the search on a quantum computer, although quantum search with advice provides exactly that. We give such an adversary a cost model and a metric. For a device whose key has rank r, any quantum algorithm with classical access to the posteriors needs Omega(sqrt(r)) cipher evaluations, and block search achieves O(sqrt(r)); the per-instance advantage is exactly quadratic, and the super-quadratic exponents reported for search with advice are averages over the prior that apply to no single device. Under the NIST MAXDEPTH budget D and a Grover iteration of g gates and depth d, the quadratic advantage holds only for ranks up to (4D/(pi d))^2 and collapses to a constant factor beyond; with the best published AES-128 oracle and D = 2^40 the window closes near rank 2^58.6. We define the quantum-aware key rank, the classical rank of equal cost, computable from the rank estimators laboratories already run, and derive the classical rank a device must retain to keep a given threshold against each depth budget. Block search and amplitude amplification from the product-form posterior state are within a factor of two to four of each other on Hamming-weight posteriors, so the cost of coherent indexing decides between them. Experiments on simulated leakage and a toy cipher confirm the predicted window: at SNR 0.125 a depth-limited quantum adversary is worth about 22 traces to a classical one, however large its gate budget.
arXiv·2026-10-14·Kai Liu, Deguang Han
No generated summary available for this entry.
overview
Original abstract
A quantum memory can preserve a subsystem perfectly while discarding information needed by a later operation. We study the total intermediate dimension required for channel synthesis when the first stage protects a $b$-dimensional subsystem and has a prescribed noncommutative graph imposing full confusability on an $a$-dimensional control register. For a finite family of classically controlled branches, exact synthesis is possible if and only if the target graph contains the prescribed graph of the first stage. For every feasible family, we construct a single processor that implements all branches exactly. The processor uses pairwise nonorthogonal pure program states in a register of dimension at most $a$. A target graph may be realizable with a carrier of dimension $b$, while synthesizing a channel with that graph can require dimension $ab$. We also characterize the closure of the attainable channels, distinguishing exact synthesis from arbitrarily accurate approximation. Finally, for a family built from the trine communication task, a four-dimensional carrier permits exact synthesis with quantum programs under output depolarization. At the same total carrier dimension and without free shared randomness, classical programs have optimal normalized diamond error $(1-η)/4$, where $0\leqη\leq1$ is the depolarization strength. For $η<1$, the gap persists under sufficiently small perturbations of the target branches.
arXiv·2026-10-14·Akira Sone et al.
No generated summary available for this entry.
overview
Original abstract
We demonstrate that the one-time measurement scheme is more consistent than the standard two-time measurement scheme with respect to the fundamental symmetry of entanglement, namely entanglement-assisted invariance (envariance). In particular, the work statistics obtained from the one-time measurement scheme arise naturally as a direct consequence of envariance for any driving unitary, without involving an explicit measurement postulate, whereas the analogous identification for the two-time measurement scheme is possible only for a Haar-measure-zero set of unitaries. This envariance-based formulation eliminates the ambiguity in work statistics related to the energetic cost of measurement.
arXiv·2026-10-14·Hanzhang Zhao, Shenglong Xu
No generated summary available for this entry.
overview
Original abstract
The Petz recovery map provides a near optimal decoder for approximate quantum error correction, but its inverse square-root normalization complicates circuit implementation. We use the polar structure of the Petz recovery isometry to implement recovery through a single quantum singular value transformation (QSVT). We give explicit block-encoding circuits and an extended recovery isometry that yields approximate Petz recovery without postselection. We bound the diamond distance between the approximate and ideal Petz encoding-recovery channels in terms of a spectrum-weighted loss, which provides a channel specific objective for optimizing the QSVT angles. Uniform polynomial approximation yields an asymptotic error bound that decays exponentially with the number of QSVT iterations, at a rate controlled by the smallest nonzero scaled singular value. Applications to Haar-random encoding and the Hayden-Preskill protocol illustrate the tradeoff between circuit depth and recovery accuracy and place existing scrambling decoders within a common Petz recovery framework.
arXiv·2026-10-14·Sara Alfaro et al.
No generated summary available for this entry.
overview
Original abstract
Trapped-ion devices are being investigated for transportable applications, including the transfer of exotic charged particles between laboratories and the development of portable quantum technologies. To date, ion transport has been demonstrated only in magnetic (Penning) traps, whereas radiofrequency (Paul) traps are the predominant platform in quantum science. Here, we report the first transport of a few thousand ions confined in a linear Paul trap over distances of several kilometers, with transport durations of 15 and 45 min. These results establish a foundation for mobile trapped-ion quantum devices capable of operating while in motion and may enable the transport of exotic ions in Paul traps between experimental facilities.
arXiv·2026-10-14·Lingwei Zhang, Zhiyan Ding
No generated summary available for this entry.
overview
Original abstract
We study quantum spectrum and eigenstate property estimation using multiple initial states and generalized Hadamard tests. Building on the QFAMES (quantum filtering and analysis of multiplicities in eigenvalue spectra) framework, we introduce a new method that samples evolution times independently for each initial-state pair. Under the stated assumptions, when statistical error determines the sampling cost, the total Hamiltonian simulation cost required for fixed-accuracy eigenvalue and observable estimation is independent of the number of initial states, up to logarithmic factors. This improves scalability when many initial states are needed to explore the target eigenspaces. The method also reduces the cost of multiplicity recovery and retains Heisenberg-limited scaling for eigenvalue estimation. Numerical experiments support the predicted statistical error scalings.
arXiv·2026-10-14·Washington F. dos Santos et al.
No generated summary available for this entry.
overview
Original abstract
We show that graphene nanoflakes realize a previously unexplored form of orbitronics in which orbital currents emerge in the absence of intrinsic angular momentum of the constituent atoms. Starting with a hexagonal graphene nanoflake, we demonstrate the presence of energy-degenerate eigenstates with opposite non-zero expectation values of the angular momentum. Placing electrodes in an appropriate configuration on the flake couples the reservoirs more strongly to one of the two opposite-angular-momentum states, yielding a chiral current that carries a net orbital angular momentum. The resulting circulating orbital currents generate magnetic fringe fields that are experimentally accessible with spin centers or superconducting quantum interference magnetometers, providing avenues for their experimental realization. Finally, our work establishes a new platform for exploring and studying orbitronics in zero-dimensional systems.
arXiv·2026-10-14·Silas R. Beane, Roland C. Farrell, Cameron P. Shotwell
No generated summary available for this entry.
overview
Original abstract
At zero temperature, a dilute Fermi gas with an attractive contact interaction forms a superfluid with gapped fermionic excitations. We show that the gap at weak coupling can be organized as a trans-series expansion in the interaction strength and the asymptotic Gor'kov-Melik-Barkhudarov gap. Low-energy virtual quasiparticles generate corrections that are linear in the gap with a leading coefficient nearly 25$\times$ larger than the other known coefficients. This substantially increases the gap at intermediate densities, highlighting that systematic corrections are crucial for quantitative predictions.
arXiv·2026-10-14·Sanjaye Ramgoolam, Michał Studziński
No generated summary available for this entry.
overview
Original abstract
Kemp and Ramgoolam proposed a basis of monomials for a commutative semisimple algebra with generators \(C_1,\ldots, C_L\), constructed from a degeneracy graph which records how the eigenspaces of \( C_1\) are successively split by \( C_2,\ldots, C_L\). They showed that the basis property is equivalent to the non-vanishing of the determinant of the matrix of values of these monomials on the projector basis, and conjectured a factorised formula for this determinant, as a product of powers of eigenvalue differences. We prove this formula for any number of generators. The proof uses graph analogues of Newton polynomials. Their evaluation matrix is not triangular in general, but expanding the rows of the children of each node of the penultimate layer in a Newton basis of their eigenvalues makes it block triangular, with diagonal blocks given by smaller degeneracy graphs in which the final layer is removed. The formula then follows by induction on the number of layers. We show that the exponents in the determinant are overlap volumes of higher-dimensional Young diagrams attached to the nodes of the graph: intervals, ordinary Young diagrams, plane partitions and their higher analogues. Finally, the block triangular structure gives an explicit recursive inversion of the evaluation matrix, expressing the projectors in the monomial basis.
arXiv·2026-10-14·Nadine Diesel, Charlotte Bäcker, Walter T. Strunz
No generated summary available for this entry.
overview
Original abstract
A well established approach to describe open quantum system dynamics is the celebrated Gorini-Kossakowski-Sudarshan-Lindblad (GKSL) master equation. In this article we aim to shed light on semigroup dynamics that are not of this form. Such dynamics may appear in real physical systems describing asymptotic long-time dynamics. Thus, they correspond to semigroup dynamics applicable to a restricted set of initial states only. As a way of motivating our studies, first we review known results about the single-mode Gaussian Quantum Brownian motion channel and corresponding master equations. Next we discuss a conceptually simpler family of qubit semigroup generators and identify parameter regions of completely positive, merely positive, and non-positive dynamics. We then focus on the latter case to which we will refer to as restricted-positive, as the semigroup generator may well be physically meaningful when applied to a restricted set of admissible initial states.
arXiv·2026-10-14·Zi-Qi Zeng et al.
No generated summary available for this entry.
overview
Original abstract
Hong-Ou-Mandel (HOM) interference offers robustness in high-noise environments due to its phase-insensitive nature, while N00N-state interference provides enhanced phase sensitivity for precision measurements in low-noise settings. However, their realizations have typically required separate experimental platforms. Here, we report a single hybrid quantum interferometer that can dynamically transition between HOM and N00N-state interference by adjusting two time delays, $τ_1$ and $τ_2$. This tunability enables operation in phase-insensitive, phase-sensitive, or hybrid modes within a unified setup, as confirmed by theoretical analysis and experimental demonstration. Our system offers a versatile platform with potential for quantum sensing applications, paving the way for integrated quantum technologies capable of adapting to diverse noise conditions.
arXiv·2026-10-14·Linlin Ye et al.
No generated summary available for this entry.
overview
Original abstract
Solving linear systems of equations is a fundamental task in machine learning and optimization. In this work, we extend the original WZP algorithm from real symmetric linear systems to complex Hermitian linear systems. We then study the success probability of the modified WZP algorithm from a resource-theoretic perspective. By expressing the postselection success probability as the expectation value of a positive operator, we derive upper and lower bounds of the maximal success probability over separable, incoherent, and real pure states. These bounds further establish connections between the maximal success probability and geometric entanglement, coherence, and imaginarity. We further show that, under permutation averaging, the averaged success probability is an affine function of the coherence fraction, with its dependence determined by the alignment between the success operator and the equal-superposition state. We also investigate the preprocessed WZP algorithm under subgroup-constrained preprocessing. For the two-level family, the optimal success probability is determined by the maximal projection weight onto the orbit of the target projector. Our results provide a unified perspective on the WZP success probability under different operational constraints.
arXiv·2026-10-14·Atsuo Kuniba, Souta Oikawa
No generated summary available for this entry.
overview
Original abstract
A recent graph-theoretic criterion for a Hamiltonian to exhibit a free-parafermion spectrum is that its frustration graph be an indifference graph. We show that an arbitrary finite indifference graph can be realized as a frustration graph of the quantized six-vertex model at odd roots of unity, by a suitable choice of the defining wiring diagram and parameters. This provides a concrete realization of the criterion through the quantum Frobenius property of the quantized six-vertex model, recently established from its three-dimensional integrable structure.
arXiv·2026-10-14·Tunde Joseph Osunmusanmi, Berihu Teklu
No generated summary available for this entry.
overview
Original abstract
We revisit the effective radial Schrödinger equation for a charged spinless particle in collinear static electric and magnetic fields that was formulated in our earlier work within the tridiagonal representation approach (TRA). In that model the angular factor of the electric coupling is replaced by the orientation parameter $C=\cosθ$, the linear Zeeman term is diagonal in the azimuthal quantum number, and the effective field-modified central potential takes the form $V(r)=\Vt(r)+qECr$. Here we show that the same equation can be solved exactly without the TRA, by the Nikiforov--Uvarov (NU) method, once the potential component $\Vt(r)$ is prescribed. Three examples are worked out in closed form: a Kratzer-type component, which yields a linear-plus-Coulomb-plus-inverse-square central potential; a pseudoharmonic-type component, which yields a linear-plus-harmonic-plus-inverse-square potential; and a Hulthén-type component with a repulsive core (Manning--Rosen form), which yields a screened confining potential with a finite number of $s$-wave bound states. For each case we obtain the energy spectrum, the normalized eigenfunctions in terms of Laguerre or Jacobi polynomials, the location of the potential minimum, and closed-form radial moments. The spectra are independent of the orientation $θ$ and of the electric field, in agreement with the structure found by the TRA, while the field enters through the shape of $V(r)$, the radial moments, and the expectation value $\langle V\rangle_k$. All analytical results are confirmed by an independent finite-difference diagonalization.
arXiv·2026-10-14·Fartash Chalangari et al.
No generated summary available for this entry.
overview
Original abstract
We demonstrate that a single repulsive impurity enhances directional confinement of a high-energy wavepacket in a finite two-dimensional lattice of quantum wells. At energies far above the interwell barriers, the impurity suppresses transverse dynamical tunneling while preserving propagation along a principal lattice axis, even as the corresponding classical regular region shrinks. Confinement is strongest at impurity amplitudes comparable to the barrier height and weakens for stronger perturbations. Spectral analysis links this nonmonotonic pinning to the wavepacket's overlap with eigenstates concentrated along the launch direction, consistent with impurity-induced variational scarring. These results show that a single local defect can control quantum propagation over distances far exceeding its own spatial extent.
arXiv·2026-10-14·Shu-Min Wu, Rui-Yang Xu, Zhihong Liu
No generated summary available for this entry.
overview
Original abstract
We investigate directional quantum steering harvesting by two uniformly accelerated non-identical Unruh-DeWitt detectors coupled to a massless scalar field in the Minkowski vacuum. We show that the Unruh effect does not simply degrade harvested steering, but can reshape its directionality in a strongly parameter-dependent manner. At low detector energy scales, acceleration predominantly suppresses steering, whereas at higher energy scales, moderate acceleration can enhance steering and even activate an initially absent steering direction. Most strikingly, within a finite acceleration window, the Unruh effect enhances steering in one direction while simultaneously suppressing it in the opposite direction, revealing an intrinsically directional influence of relativistic acceleration. Detector non-identicality provides an additional control mechanism: a moderate energy-gap mismatch can enhance or activate one steering direction while suppressing the reverse one, whereas sufficiently large energy-gap mismatch suppresses the harvested steering. Moreover, the maximal steering asymmetry approximately marks the transition from two-way to one-way steering. Our results establish relativistic acceleration and detector non-identicality as means of controlling the strength and directionality of vacuum-harvested quantum correlations.
arXiv·2026-10-14·Yu-Chun Yin, Ching-Yi Lai, Alexei Ashikhmin
No generated summary available for this entry.
overview
Original abstract
We propose a loss-tolerant measurement-device-independent quantum key distribution (MDI-QKD) protocol using time-bin-multiplexed single photons entangled with local qubits stored in nitrogen-vacancy (NV) centers. In each round, Alice and Bob each send a single multiplexed photon to an untrusted intermediary, Charlie. Each photon first becomes entangled with Charlie's NV-center qubits; Charlie then performs entanglement swapping between his NV qubits to establish EPR pairs between Alice's and Bob's local qubits. With $d$ time bins per photon, $\log_2 d + 1$ EPR pairs can be generated per transmitted photon, substantially increasing the probability of EPR-pair creation under limited channel bandwidth. To further mitigate the effects of prolonged memory storage, the protocol employs a memory-insensitive (MI) architecture, where multiple banks of qubits and multiplexed photon routing reduce the effective memory lifetime requirements. This approach enhances loss tolerance, enabling higher secret key rates and secure key distribution over longer distances compared to conventional single-photon protocols. Using the Lo-Chau EPR-QKD framework and Shor-Preskill reduction, we prove that the protocol is secure without trusting intermediate nodes, making it suitable for quantum networks with untrusted repeaters.
arXiv·2026-10-14·Tengiz Ibrayev et al.
No generated summary available for this entry.
overview
Original abstract
Ionizing radiation produces correlated errors in superconducting qubits, posing some challenges to quantum error correction. In addition, it causes background events in other superconducting cryogenic devices, such as kinetic inductance detectors and superconducting nanowire single-photon detectors. Cosmic muons are a component of this background that can only be partly shielded against at ground level, but can be tagged by an independent detector inside the cryostat, so that the affected data can be vetoed, or the muon tags incorporated into error correction. We present a low-cost, compact muon detector consisting of two plastic scintillator modules, each read out by a silicon photomultiplier (SiPM), operated in coincidence. We characterize the SiPMs from room temperature down to 10 mK, including the breakdown and upper-limit voltages that define the operating bias range. Operated as a muon counter, the detector measures a coincidence rate that, as expected, is independent of temperature within uncertainties and agrees with analytical and Monte Carlo predictions. Below approximately 8 K, each muon event produces two pulses, one narrow and one broad, an effect that, to our knowledge, has not been reported before. Coincidences with an independent muon detector outside the cryostat confirm that muons are still counted reliably in this regime. By studying the appearance of double pulses as a function of temperature and magnetic field up to 4.5 T, we find a behavior consistent with the phase diagram of a type-II superconductor. This links the double pulses to a superconducting material in the SiPM, likely an adhesion layer or diffusion barrier introduced during manufacturing. The mechanism by which the superconducting state produces the second pulse is not yet understood.
arXiv·2026-10-14·Yi Liang
No generated summary available for this entry.
overview
Original abstract
We classify strong subadditivity for the canonical topological Rényi functional at finite positive orders on an unpunctured torus in the topological quantum field theory of any finite unitary modular tensor category. Universal validity means validity for all pure ground states and all regular region pairs with transverse or disjoint boundaries and compatible corner rounding. At von Neumann order one, the inequality holds universally. For each fixed order strictly between zero and one, universal validity is equivalent to pointedness, meaning that every simple anyon type has quantum dimension one. For every nonpointed category and each finite positive order other than one, we construct a violating pure state and an allowed pair. For a fixed pointed category and fixed order above one, universal validity is equivalent to a same-order modular Fourier entropy bound for every pure state. Global homological constraints on actual unions and intersections and established weighted modular uncertainty prove the order-one theorem. For parallel annuli at fixed flux distribution, the order-one functional is affine in their positive count. At other orders, unequal quantum dimensions on the occupied support induce strict curvature that suitable overlapping regions convert into negative deficits. Under the boundary-charge cutting prescription, the von Neumann theorem extends to arbitrary logical density matrices in the same ground space.
arXiv·2026-10-14·Ziheng Zhu, Yu Chen
No generated summary available for this entry.
overview
Original abstract
We study the extended Dicke model obtained from the scalar--vector--tensor polarizability of open-shell atoms coupled to a shared cavity mode. For a single electric-dipole channel, rotational symmetry fixes the tensor to vector ratio; we use $^{168}\mathrm{Er}$ with $J=6$ as a product-state example. A circular pump produces a chiral Raman vertex whose tensor-dependent matrix elements select the occupied Zeeman sector. The resulting first-order transition occurs before the empty-cavity branch loses local stability, and the ordered state is read out through $\langle\hat J_z\rangle$. A linear pump instead produces an empty-cavity $\pm x$ cat and a continuous transition into an even-$m$ cat-like state with order parameter $\langle\hat J_z^2\rangle$. With cavity loss alone, the circular trajectory emits a photon burst and approaches a Raman-dark Zeeman pole rather than a finite-field condensate. In the linear geometry, cavity-bright modes are damped toward the cat-like branch while a dark spin mode remains undamped. These are phenomena of that model; the vector-only controls show that they depend on the channel-fixed tensor coupling.
arXiv·2026-10-14·Baijun Li et al.
No generated summary available for this entry.
overview
Original abstract
Cavity optomechanics represents a frontier research direction in quantum science and technology, centered on the control and exploration of interactions between electromagnetic fields and mechanical motion. Rooted in quantum mechanics, this field realizes efficient coupling and precise manipulation of optical fields and mechanical vibrations through the structural design and precise regulation of optical microcavities and mechanical oscillators, thereby revealing and harnessing novel quantum phenomena. In recent years, cavity optomechanics has evolved into an interdisciplinary frontier integrating quantum optics, condensed matter physics, and quantum precision measurement, exhibiting profound application in both fundamental physics research and quantum information science. With advancements in technologies such as nanomanufacturing and laser cooling, optomechanical interactions have been successfully demonstrated in various experimental systems. Among these platforms, cavity cold-atom systems stand out as one of the ideal platforms for implementing quantum optomechanics. Featuring exceptional environmental isolation, long quantum coherence times, and strong light-matter interaction, these systems provide a crucial testbed for exploring strong and even ultrastrong optomechanical coupling effects as well as rich nonlinear quantum phenomena. This paper reviews the recent progress in optomechanical control and manipulation based on cavity cold-atom systems. We first outline the fundamental principles of standard cavity optomechanical systems. Then, we describe the experimental realization of linear and nonlinear optomechanical couplings in cold-atom systems. After that, we focus on the representative applications of this platform in high-precision quantum sensing, quantum memory, and the preparation of macroscopic nonclassical states. Finally, we give an outlook and challenges in this field.
arXiv·2026-10-14·Xu-Yang Hou, Jia-Chen Tang, Hao Guo
No generated summary available for this entry.
overview
Original abstract
In quasi-Hermitian mixed-state quenches, the initial and final Hamiltonians generally possess different positive-definite metrics, so post-quench evolution is not quasi-unitary in the initial physical space. Choosing the preparation/measurement space as reference, we derive from first principles a normalized mixed-state Loschmidt amplitude using metric-compatible purifications. The resulting biorthogonal trace representation contains a normalization factor given by the norm of the evolved purification in the initial metric; this factor is essential for comparing states from different physical Hilbert spaces and directly encodes the metric mismatch. We prove that this normalization function is strictly positive on the real-time axis, so real-time criticality arises solely from destructive interference in the dynamical overlap. In complex time, zeros of the normalization factor generate branch singularities distinct from Fisher zeros. For a general two-level system, we derive analytic expressions for the Fisher and normalization zeros and analyze exceptional-point scaling together with the temperature- and quasi-Hermiticity-dependent DQPT critical times in two solvable quench protocols. In contrast to metric-stationary quenches, where non-Hermitian effects may be absorbed into an equivalent Hermitian description, the metric mismatch here produces genuine non-Hermitian dynamics: a time-dependent normalization factor and complex-time branch structure that cannot be removed by any global similarity transformation.
arXiv·2026-10-14·Alireza Behtash, Syo Kamata
No generated summary available for this entry.
overview
Original abstract
We study the relation between the exact-WKB Delabaere--Dillinger--Pham Stokes jumps and the multi-instanton expansion of a one-dimensional potential with $N$ equal-depth minima. For a single barrier this relation is the Bogomolny--Zinn-Justin cancellation between the instanton--anti-instanton ambiguity and the Borel ambiguity of perturbation theory, and we extend it to every consecutive barrier interval and to the integration contours themselves. In the dilute large-$T$ regime at fixed nonperturbative grade, we derive the quasi-zero mode integral over the instanton separations from the Euclidean path integral and reduce it to Gamma and Hankel periods. With the local Weber level function of each well and one normalization per well fixed by the local Weber connection matrix, these periods reproduce the two lateral connected exact-WKB coefficients. The two lateral contours of each instanton--anti-instanton separation differ by exactly one Hankel cycle, and this linear Picard--Lefschetz relation reproduces the Stokes jump of the connected coefficient. A numerical solution of the Schrödinger equation for a symmetric triple well confirms the resulting two-barrier level splitting. At higher fixed grade, the map from ordered event sequences to normalized scalar coefficient products is not one-to-one. At leading dilute order the scalar weight of a closed event sequence depends only on the numbers of barrier crossings, $\mathcal I\bar{\mathcal I}$ pairs, and $\mathcal I\mathcal I$/$\bar{\mathcal I}\bar{\mathcal I}$ pairs. We construct two inequivalent grade-six triple-well event sequences with the same product of local Weber amplitudes, which embed in every potential with $N\ge3$ wells. Our results hold within the regular dilute, one-loop, local Weber approximation.
arXiv·2026-10-14·Murilo H. Magiotto et al.
No generated summary available for this entry.
overview
Original abstract
We characterize a source of photon pairs simultaneously entangled in polarization and in the transverse spatial degree of freedom, with the spatial measurements performed in intermediate planes of the fractional Fourier transform. The source consists of two crossed type-I crystals in a non-collinear geometry, such that the transverse variables carry information about the crystal of origin. Detection in the crystal plane reveals this information completely and destroys the polarization entanglement, so that a scheme using the near and far fields as conjugate spatial bases cannot support a parallel polarization channel. In intermediate planes both spatial bases combine position and momentum, such that the which-crystal information is partially erased, and the polarization entanglement survives in all four combinations of spatial bases. Applying Bell and Einstein-Podolsky-Rosen criteria to the same photon pairs certifies both degrees of freedom simultaneously. We evaluate quantum bit error rates and asymptotic secret key rates in each degree of freedom, and find that the source delivers two simultaneously usable channels per photon pair.
arXiv·2026-10-14·Arturo Mena et al.
No generated summary available for this entry.
overview
Original abstract
Preserving the underlying statistical properties of light during frequency transduction is essential for interfacing spectrally disparate quantum systems. To do this successfully, the process needs to be highly efficient, broadband and noiseless. Despite significant progress in this field, satisfying all these conditions remains challenging. Recently, molecular modulation-based transduction in hollow-core fibers has emerged as a promising approach, where biphoton correlations were proven to be preserved during frequency up-conversion. However, beyond this previous demonstration of correlation-maintaining conversion, whether molecular modulation can preserve more general statistical properties of light remains experimentally unexplored. Here, we demonstrate the conservation of photon-number statistics during selective frequency transduction by Raman molecular modulation in a hydrogen-filled hollow-core fiber. As a proof of concept, weak 585-nm signals are selectively converted to 773 nm in the near-infrared and to 471 nm in the blue spectral region with near-unity efficiencies. Phase matching between the generated coherence waves and the transitions of interest is achieved through the effective dispersion of the system, enabling independent selection of the frequency up- and down-conversion processes. The preservation of the photon-number statistics of the shifted signals, along with the large frequency shifts, broad tunability and compatibility with quantum-optical fields, provides a versatile fiber-based platform for quantum frequency transduction. In particular, the demonstrated interfacing between visible and near-infrared wavelengths using low pump energies and low gas pressures offers a route towards connecting spectrally distinct quantum systems, including quantum emitters, sensors and atomic quantum memories, within hybrid quantum networks.
arXiv·2026-10-14·Samuel Beasley, Ashley Montanaro
No generated summary available for this entry.
overview
Original abstract
The graph isomorphism problem asks whether two graphs are equivalent up to a permutation of their vertices. Its precise computational complexity remains unresolved, and it is still unknown whether a polynomial-time algorithm exists. We investigate whether simple graph-dependent Instantaneous Quantum Polynomial-time (IQP) and Quantum Approximate Optimisation Algorithm (QAOA) circuits can distinguish non-isomorphic graphs. We first show that suitable IQP and QAOA constructions allow the underlying graph to be reconstructed using a polynomial number of samples. Building on previous work using the QAOA energy, we show that Hamming weight distributions can distinguish graph pairs at circuit depths for which the numerically computed energy gap is zero. We then apply graph invariants to the matrix of ZZ correlators on the output distribution. For the specific case of the graph spectrum, at QAOA depth $p=2$, this invariant numerically distinguishes all $10{,}486$ cospectral regular graph pairs tested on up to 18 vertices. For IQP circuits, we introduce a finer invariant based on probability multiplicities within Hamming weight sectors, which distinguishes every non-isomorphic graph pair tested numerically. Finally, we derive exact graph-theoretic characterisations of the IQP output distribution at $θ=π/2$ and $θ=π/4$. These results show that simple graph-dependent quantum circuits encode substantial structural information, while leaving open whether this information can be extracted efficiently for general graph isomorphism.
arXiv·2026-10-14·Johann Zöllner et al.
No generated summary available for this entry.
overview
Original abstract
The analysis of charge fluctuations in a mesoscopic device can shed light on the fundamental question of whether or not a single-particle picture of electron transport is appropriate, even in the presence of Coulomb interaction. It has been shown on general grounds that mapping the interacting system onto a fermionic single-particle description is subject to strict constraints on the charge-transfer statistics. These constraints can be formulated in terms of a sign rule for the factorial cumulants of the full counting statistics. We report here on the experimental observation of a sign-rule violation in a most elementary model system, i.e. a single-level quantum dot, and provide theoretical modeling that can quantitatively reproduce the experimental data. This reveals the presence of correlations introduced by electron-electron interaction.
arXiv·2026-10-14·Zhiming Huang
No generated summary available for this entry.
overview
Original abstract
The Unruh response thermalizes accelerated detectors, but the entanglement remaining in a register does not by itself specify what distributed measurements can recover. We study this distinction for a four-qubit cluster state whose two assisting nodes independently undergo generalized amplitude damping, while the target nodes remain isolated and the environments are inaccessible. We derive the exact joint-assisted concurrence and the exact one-way value for arbitrary local measurements. The joint optimum equals the bipartition negativity, and computational-basis measurements attain the one-way optimum. A polar-decomposition argument, together with compactness, establishes a necessary and sufficient condition for separable measurements to attain the joint optimum and proves a strict gap whenever this condition fails. For assisting detectors at equal Unruh temperature with relaxation-rate ratio $r>1$, joint advantage exists precisely when the thermal excitation factor satisfies $q<1/r$. At finite positive temperature it ends at a unique finite time, while the remaining entanglement is nonzero. For $r=2$, both the transition time and remaining resource have closed expressions. These results identify when joint assistance is necessary within the independent weak-coupling thermalization model.
arXiv·2026-10-14·Zongxing Xiong, Chengshen Gao, Lvzhou Li
No generated summary available for this entry.
overview
Original abstract
Entropy estimation of discrete probability distributions is a fundamental problem in statistical inference and quantum property estimation. In this paper, we study the problem of estimating Rényi entropy $H_α(\mathbf{p})$ for any distribution $\mathbf{p} = (p_i)_{i=1}^n$ given its purified quantum query-access. For non-integer $α> 1$, our algorithm estimates $H_α(\mathbf{p})$ to within additive error $ε$ using only $\widetilde{\mathcal{O}}\big(n^{\max\{1/2,1-1/α\}}/ε\big)$ queries, which improves the best known upper bound for dependence on both $n$ and $1/ε$. For $0<α<1$, our algorithm has query complexity $\widetilde{\mathcal{O}}\big(n^{1/(2α)}/ε^{\max\{1,1/(2α)\}}\big)$, which improves the dependence on $1/ε$ of the current best upper bound without incresing its $n$ dependence. Our approach adapts the multi-level estimation framework to relative approximation of the power sums and leverage binary search to remove the requirement of prior knowledge of them. We also strengthen the precision-dependent lower bound to $Ω\big(1/ε^{\max\{1,1/(2α)\}}\big)$ for $0<α<1$, which identifies the optimal precision dependence of our algorithm.
arXiv·2026-10-14·Hashir Kuniyil, Asad Ali, Saif Al-Kuwari
No generated summary available for this entry.
overview
Original abstract
Spatial sectioning of the far-field noncollinear field from spontaneous parametric down-conversion (SPDC) is a promising approach for multiparty quantum communication. Although demonstrations with six pairs of users have been reported, the fundamental limits remain unknown. These include the maximum number of channels, the required degree of channel optimization, and the dependence on input parameters. In this paper, we provide a practical framework that answers these questions by connecting input parameters and invoking a design theorem. For a representative configuration, we realize 12 user-pair channels with routing consistency exceeding $0.9999$ at a $12\%$ reduction in photon flux. We further show that sectioning improves the accidental-coincidence budget linearly with the number of channels $N$, allowing the aggregate key rate to scale with the user count. These results provide a design strategy for spatial-division multiplexing of entangled photons analogous to the channel-spacing standards used in wavelength-division networks.
arXiv·2026-10-14·Yan Li et al.
No generated summary available for this entry.
overview
Original abstract
Entanglement in multiphoton graph states is an important resource with various applications, such as measurement-based quantum computing and memory-less quantum repeaters. While some primitive instances have been successfully prepared, scalable generation of large-scale graph states with programmable connections remains an outstanding challenge. Fusion provides a promising "divide-and-conquer" approach by linking smaller resource states into larger, more complex graphs. However, its practical scalability has been limited by the probabilistic nature of conventional fusion protocols, which necessitates extensive hardware overhead and feed-forward resources to achieve deterministic outcomes. Here, we introduce and experimentally demonstrate a deterministic fusion operation with built-in error mitigation, capable of connecting small time-bin-encoded cluster states--originally generated on-demand from a quantum emitter--into larger, reconfigurable photonic graph states of increased sizes. The fusion operation is realized by nondestructively projecting pairs of flying microwave photonic qubits into Bell states using superconducting circuits with in-situ programmability. Crucially, the protocol features active reset and reuse of matter qubits during graph state generation, thereby circumventing the coherence constraints of the quantum emitter and enabling the generation of genuine multipartite entanglement across 13 photonic qubits. Our results establish a scalable framework for photonic graph-state synthesis, paving the way for fault-tolerant measurement-based quantum computation and distributed quantum networks.
arXiv·2026-10-14·Hyesung Choi, Antonio Mandarino, Mahn-Soo Choi
No generated summary available for this entry.
overview
Original abstract
Recent progress in programmable quantum simulators motivates exact benchmarks for nonequilibrium dynamics in topological quantum matter. We study the Kitaev honeycomb model driven through its critical regions by a linear ramp of the bond coupling $J_z$ over a ramp time $τ$, comparing zigzag and armchair ribbons with fully periodic tubes. The production of excitations exhibits a geometry-dependent finite-size crossover controlled by $N_2/\sqrtτ$, the ratio of the ribbon width to the Kibble--Zurek length. Periodic tubes obey the expected critical-line Kibble--Zurek scaling and serve as the boundary-free benchmark. Zigzag ribbons follow the same scaling until defect production is exponentially suppressed by a finite-width algebraic gap floor associated with the formation of Majorana edge modes, whose occupation is pinned by inversion parity. Armchair ribbons instead support transient Majorana edge modes with exponentially small gaps, producing width-parity-dependent defect plateaus: exactly one defect per unit length for odd widths and an approximate, transient plateau near one half for even widths. The quench-generated entanglement entropy and fermionic logarithmic negativity inherit the same geometry-dependent structure, and the negativity further distinguishes the coherence-borne entanglement of the Kibble--Zurek regime from the population-borne entanglement of the edge-mode plateaus. These results identify boundary Majorana modes as the mechanism controlling departures from ideal Kibble--Zurek dynamics and provide geometry-resolved benchmarks for programmable simulations of topological matter.
arXiv·2026-10-14·Seung Park et al.
No generated summary available for this entry.
overview
Original abstract
Quantum subspace diagonalization (QSD) with a Krylov space spanned by Chebyshev polynomials of the Hamiltonian is a natural ground-state method for fault-tolerant quantum computers, but every guarantee it offers---convergence rate, noise floor, and the cost of turning its classical output back into a physical state---is controlled by the overlap of the reference state with the true ground state, which decays exponentially with system size for any product state and non-trivial Hamiltonian. We propose quantum folding: for a system governed by a local Hamiltonian, seed the QSD with the product of the ground states of its subsystems, which differs from the target only through the interface terms. We prove a nonasymptotic error bound for the Chebyshev QSD that is linear in the measurement noise, by transplanting Kirby's effective-Hamiltonian analysis to the Chebyshev--Krylov basis, and identify the block-encoding rescaling of the Hamiltonian as a parameter of the guarantee. Exact simulations of antiferromagnetic Heisenberg chains show that the folded reference state reduces the Krylov dimension for a given accuracy severalfold and lowers the error under noise by two to five orders of magnitude relative to the Néel state. We show how the Ritz vector is prepared as a physical state and that the ground-state generation probability obeys a tight ceiling set by the overlap, so that recursive folding prepares ground states at polynomial cost. Taken together, these results allow for a scalable QSD framework that avoids the exponentially small ground-state overlaps associated with conventional product-state initialization. Finally we compute the fold fidelity itself: a slow power law for the gapless spin-1/2 chain, a size-independent constant for the gapped spin-$1$ chain, and an exact closed form converging to 1/4 for the AKLT chain.
arXiv·2026-10-14·Gurvir Singh, Manik Banik
No generated summary available for this entry.
overview
Original abstract
Bound-entangled states with positive partial transpose (PPT) can exhibit quantum steering and Bell nonlocality, disproving the long-standing Peres conjecture and its stronger steering counterpart. These counterexamples, obtained through explicit constructions or numerical searches, raise the question of whether they share a common structural origin. We address this question in the low-rank regime by asking whether known counterexamples can be obtained, up to invertible local filtering, from the complement of an unextendible product basis (UPB). We find that the answer depends crucially on the local dimension. In $3\otimes3$, the rank-four structure of PPT entangled states implies that both the steerable PPT state of Moroder \textit{et al.} and the Bell-nonlocal PPT state of Vértesi and Brunner can be obtained from UPB-complement states under invertible local filtering. For three qubits, in contrast, rank-four states that are PPT across every bipartition are separable across each cut. Moreover, comparison of the product-vector structure of the relevant kernels shows that the known three-qubit Bell-nonlocal PPT states cannot be obtained by invertible local filtering from the complement of any three-qubit UPB. Going beyond rank four, we further show that a known rank-eight three-qutrit state, supported on the complement of a UPB and PPT across every bipartition, is genuinely multipartite entangled. These results show that UPBs provide a unifying structural origin for important low-rank PPT entangled states in $3\otimes3$, but that nonlocal bound entanglement is not, in general, a UPB phenomenon.
arXiv·2026-10-14·Rohitashwa Chattopadhyay, Vinayak Pendse, Shamik Gupta
No generated summary available for this entry.
overview
Original abstract
We study quantum van der Pol oscillator in which single-photon pumping competes with a nonlinear two-photon dissipative channel to produce a quantum limit cycle, and the question of how two such oscillators with non-identical intrinsic frequencies synchronize in the sense of phase locking when coupled dissipatively to one another. For a single oscillator, starting from a Lindblad description of the dynamics, we derive the exact Wigner-function evolution equation, and show that its Fokker--Planck approximation admits in the appropriate regime an equivalent classical Itô stochastic description that reproduces remarkably well the full Lindblad dynamics. Notably, the stochastic approach provides an efficient means of capturing system dynamics in the semiclassical regime, where a large number of energy eigenstates contribute and direct numerical simulations become computationally demanding. Restricting to the three lowest Fock states and using a parity symmetry, we obtain in closed form the stationary-state density matrix and its Wigner-function representation that displays pronounced nonclassical features. For two non-identical oscillators, we study the full Lindblad dynamics numerically and characterize synchronization through the stationary-state order parameter as a function of frequency mismatch and dissipative coupling. We find that increasing the effective nonlinear dissipative strength suppresses the synchronized region. Restricting the two oscillators to the three-level qutrit subspace, a parity symmetry reduces the stationary-state problem to an exact $41$-dimensional linear system, allowing to compute the synchronization order parameter. In this reduced description, results in the limit of large dissipation agree closely with those from the full dynamics, while exhibiting in the limit of small dissipation a double-peak synchronization structure accompanied by a phase reversal.
arXiv·2026-10-14·Shuyang Meng, Valerio Scarani
No generated summary available for this entry.
overview
Original abstract
Energy is arguably the main resource in classical physics; coherence is the prototypical quantum resource. In this paper, we study the interplay between these two resources in the task of optimal mode discrimination. This task, motivated by cryptography and metrology, consists of finding in which mode a signal has been encoded, for a given finite set of possible modes. After recalling that the task can be cast as a semi-definite program, we solve completely the case of two-mode discrimination under a hard energy constraint $n\leq N$. Specifically, we identify the region of modes overlap, for which the maximal energy state (the Fock state with N excitations) is the best choice for discrimination. For other overlaps, having access to coherence leads to better discrimination.
arXiv·2026-10-14·Farhang Loran, Ali Mostafazadeh
No generated summary available for this entry.
overview
Original abstract
Scattering of sound waves propagating in a compressible fluid is linked to the quantum dynamics generated by a class of non-Hermitian Hamiltonian operators. The scattering amplitude is expressed in terms of the corresponding evolution operator. This is used to provide a new proof of the reciprocity theorem in acoustic scattering, conduct analytic low-frequency acoustic scattering calculations, and study the scattering of sound waves by a finite planar array of delta-function point scatters embedded in an infinite acoustic slab. A detailed discussion of acoustic scattering properties of a homogeneous acoustic slab including a pair of delta-function point scatters on one of its faces is provided.
arXiv·2026-10-14·Chris F. D. Wattjes et al.
No generated summary available for this entry.
overview
Original abstract
Resonantly driven nonlinear systems, from superconducting circuits to nanomechanical resonators, are often described in a rotating frame, where amplitude and phase evolve slowly within a fixed landscape of stable and unstable states. How such systems behave when this landscape moves on their intrinsic timescale remains to be understood. Here, we exploit the strong tension sensitivity of a graphene drum's resonance frequency to reshape the rotating-frame phase space of a bistable mechanical mode in real time, combining an MHz-frequency resonant drive with kHz-frequency tension modulation. When the modulation rate becomes comparable to the mechanical relaxation rate, adiabatic tracking of the fixed points breaks down. Instead, parametric instabilities emerge in the slow dynamics at frequencies set by libration around these points rather than by the mechanical resonance; stronger modulation drives period doubling and chaos. A slow-variable theory predicts where the instabilities occur, and Melnikov analysis captures the onset of chaos. These results show that the rotating frame itself can be parametrically driven, offering a general route to controlling nonadiabatic dynamics in systems ranging from Josephson bifurcation amplifiers to cold atoms.
arXiv·2026-10-14·Long Huang
No generated summary available for this entry.
overview
Original abstract
Coherent noise poses a fundamentally greater challenge to quantum error correction than independent s- tochastic Pauli errors, because unitary errors preserve interference between error paths, can accumulate over multiple quantum error correction rounds, and leave the encoded logical channel with a residual coherent com- ponent. If the parameters of such coherent noise can be accurately determined, this knowledge can be exploited to inject correlated priors into the decoding graph, and to perform maximum-likelihood decoding under poly- nomially tractable structures, significantly improving the accuracy of syndrome-based decoding. In this work, we introduce one protocol to determine the model and parameters of coherent noise, and reduce the complexity of the experiment from 16nto O(16), which is of great significance for correcting coherent noise in quantum error correction.
arXiv·2026-10-14·Romain Dalidet et al.
No generated summary available for this entry.
overview
Original abstract
Fiber-optic sensors enable high-sensitivity measurements of various physical parameters. Here, we demonstrate a quantum-enhanced interrogation of an all-fiber-optic Fabry-Perot resonator, employing entangled two-photon interference to probe directly strain-induced optical phase shifts. The resonator is interrogated by a narrow-linewidth laser that is frequency-locked to its resonance mode, thereby exploiting the cavity's inherent sensitivity to variations in the fiber length. To access the phase fluctuations transferred to the interrogation field due to external perturbations on the sensor, we implement an in-fiber Mach-Zehnder interferometer readout. This configuration allows the sensor to operate both with classical coherent light and with entangled photon pairs generated via spontaneous parametric down-conversion. Harnessing two-photon entangled states corresponding to an N = 2 NOON state, we experimentally demonstrate a reduction of the measurement noise below the standard quantum limit. These results provide clear evidence of the quantum advantage in enhancing fiber-optic sensors under practical constraints on optical power.
arXiv·2026-10-14·Aoying Wang et al.
No generated summary available for this entry.
overview
Original abstract
We present a quantum-enhanced search for the Galactic dark-photon background (GDPB), a relativistic and anisotropic vector field that can be produced by dark-matter decay or annihilation in the Milky Way halo. We reinterpret an existing quantum-enhanced dark-photon dataset obtained with a superconducting circuit QED platform originally developed for wave-like dark-photon dark-matter searches, consisting of a high-$Q$ niobium cavity in the $\mathrm{TM}_{010}$ mode dispersively coupled to a transmon qubit. By preparing four-component cat states and performing repeated quantum non-demolition parity measurements, analyzed with a hidden Markov model, we extract photon-transition probabilities for multiple cat amplitudes and integration times. The coupling to the GDPB is governed by a polarization- and angle-dependent cavity overlap function, which predicts a distinctive diurnal modulation of the excitation rate for both longitudinal and transverse polarizations. From the absence of such modulation, we set 90\% confidence-level bounds on the kinetic-mixing parameter $ε$ for two benchmark production mechanisms (parametric and cascade decay) over the relativistic mass range $m_X \ll ω_c$.
arXiv·2026-10-14·Eike Iseke et al.
No generated summary available for this entry.
overview
Original abstract
Through-substrate interconnects are a key technology for scaling surface-electrode ion traps (SEITs) toward large electrode counts and complex architectures. Dielectric substrates such as fused silica offer superior RF performance compared to silicon, but the reliable fabrication of void-free through-glass vias (TGVs) remains challenging. In this work, we demonstrate a SEIT fabricated on a fused silica substrate incorporating TGVs. The via-holes are formed using Selective Laser-Induced Etching and subsequently metallized with gold by electroplating. A patent-pending geometry-assisted bottom-up plating approach enables void-free filling using constant-current electroplating without electrolyte additives or pulsed deposition schemes. Electrical characterization across multiple wafers confirms a TGV-level yield above 98.8 %, demonstrating the robustness and reproducibility of the developed TGV technology. The TGVs are combined with multilayer SEIT fabrication, enabling vertical signal routing to all electrodes while maintaining an unaffected trapping surface without wire bonds. To interface the trap with external control electronics, a glass interposer providing signal fan-out to a larger pitch is designed and fabricated. The trap chip and the interposer are integrated using thermocompression bonding, forming a compact chip-to-chip assembly. The presented technology demonstrates the first fully integrated multilayer SEIT on fused silica incorporating void-free TGVs.
arXiv·2026-10-14·Ghasem Asadi Cordshooli
No generated summary available for this entry.
overview
Original abstract
Inserting a resolution of the identity between two operators turns a matrix element of their product into a phase-space integral. For unbounded operators the product need not exist on the vector at hand, while the integral may still converge. We follow this gap through the chain $e^{μa^2}e^{λa^{\dagger2}}$ of two-photon exponentials, where it can be traced completely. Five regions of parameter space appear: where the Bochner conditions of the strong formulation hold, where the product exists as a vector, where it exists as a sesquilinear form, where the coherent-state integral converges, and where the Fock-space series converges. The first three are strictly nested inside the intersection of the last two, and these two overlap without either containing the other. A single Hermite-type function agrees with the matrix element where it exists and with the integral and the series wherever they converge, so the integral carries the analytic continuation of the matrix element beyond the domain of the product and beyond the convergence of its Fock series. On the real slice of parameter space, an iterated form of the integral also reaches every point where the series converges. The analysis rests on a weak composition lemma whose hypotheses concern only the bra, the ket and the resolving family. For bounded chains the same identity is unconditional, and worked examples of that kind are given in a companion paper.
arXiv·2026-10-14·Arjen Vaartjes et al.
No generated summary available for this entry.
overview
Original abstract
Encoding quantum information in $d$-dimensional systems (qudits) with $d>2$ offers appealing new directions for resource-efficient quantum computing. However, protecting the coherence of nonclassical qudit resource states remains an open challenge. Dynamical decoupling (DD) is a well-established technique for extending coherence, but its application to qudits is hindered by the quadratic scaling of the decoupling sequence overhead with the dimension $d$. As a result, demonstrations of qudit DD have so far been limited to low-dimensional qudits. Here, we show that noise-biased qudits enable a nontrivial reduction of this overhead, for example, from quadratic to linear. We perform qudit DD on a model $d=8$ qudit, the nuclear spin of an antimony donor in silicon. We benchmark DD performance on highly nonclassical states such as uniform superpositions, cat states, and Haar random states and measure coherence improvements up to a factor $5$ to $10$. For a spin-cat error correction code, continuous DD extends the coherence time of the logical superposition $|+\rangle_L$ to $225$~ms, compared to $19$~ms under free evolution and $85$~ms with a Hahn echo. This improvement shows that DD sequences tailored to a system's noise bias can significantly enhance the lifetime of encoded logical qubits.
arXiv·2026-10-14·Avadhut V. Purohit, Harshit Sharma, Udaysinh T. Bhosale
No generated summary available for this entry.
overview
Original abstract
Strong eigenstate thermalization (ETH) in operationally mean-ergodic, non-chaotic systems provides an opportunity to investigate whether Floquet eigenstates retain information about classical transport beyond their leading thermodynamic behavior. We address this question using the double kicked top (DKT), which exhibits nonmixing transport and dynamics consistent with weak mixing transport under variation of its control parameters. We show that the coefficient $m$ of the leading finite-size correction to the normalized eigenstate entanglement entropy (EE) $s$ tracks the restructuring between these transport regimes even when the thermodynamic-limit entropy $c$ becomes nearly insensitive to them. This coefficient $m$ is positive for nonmixing transport and negative when dynamics consistent with weak mixing transport dominate. The coefficient's sign reversal in the coexistence regime remains stable as the semiclassical resolution increases. Our results demonstrate that finite-size eigenstate structure can encode signatures of classical transport that are invisible in the thermodynamic-limit entropy, providing an eigenstate-based diagnostic of dynamical organization beyond the leading thermodynamic behavior associated with strong ETH.
arXiv·2026-10-14·Rutian Huang et al.
No generated summary available for this entry.
overview
Original abstract
This paper proposes a scheme and design of cryogenic multiplexing control chip (MCC) which enables one microwave cable to control many superconducting qubits. Designed based on adjustable inductor, MCC is a non-reciprocal device which generates microwave signals between 4 and 8 GHz and constructs XY control circuit to operate qubits. The effects of filters, isolators, power splitters, qubits and load impedance on MCC are analyzed in the frequency-domain simulation. And in time-domain simulation, the response time, Gaussian pulses, single-sideband, amplitude and frequency compensation of MCC are examined. The MCC can be integrated with the superconducting qubits on the same package at 20 mK temperature stage, and output specific microwave pulses used to drive the superconducting qubits without crosstalks. The MCC can greatly reduce the number of microwave control lines and is beneficial to the development of large-scale superconducting quantum processor.
arXiv·2026-10-14·Kim Myung-Whun
No generated summary available for this entry.
overview
Original abstract
This paper reconstructs the Michelson interference phenomenon based solely on the binary (on-off) statistics of a single-photon counter and macroscopic path-difference data, without the a priori assumptions of complex wave superposition or prior spectral information. In contrast to the conventional approach that assumes light as a continuous complex wave function and considers interference between them, this study focuses on the algebraic properties inherent in discrete detection statistics. We verify that the discrete response data collected across various path differences form a positive semi-definite matrix, and apply Herglotz's theorem to this result. Consequently, we show that the harmonic form of the interference fringe is not a consequence of adopting a wave model as an axiom, but rather it is uniquely decomposed into a cosine average of wavenumbers dictated by testable algebraic constraints satisfied by the statistical data. Through this approach, the logical basis of the interference phenomenon can be described by the characteristics of the binary data itself, perfectly aligning with the modern optical experimental environment that relies entirely on discrete event statistics.
arXiv·2026-10-14·Achraf Boussahi
No generated summary available for this entry.
overview
Original abstract
Pauli correlation encoding (PCE) encodes $m$ binary variables in the signs of $k$-body Pauli correlators of $n=O(m^{1/k})$ qubits, and trains a parameterized circuit on a relaxed loss of sharpness $α$. The strongest published schedules sharpen this loss aggressively and are benchmarked with exact expectation values, whereas a quantum computer estimates correlators from a finite number of shots. We show that the sharpness is a hidden shot budget. Since the expected sign of a correlator estimated from $S$ shots, $\mathrm{erf}(c\sqrt{S/2})$, agrees with $\tanh(0.851\sqrt{S}\,c)$ to within $0.019$, the edge term of the relaxed loss at $α=0.851\sqrt{S}$ approximately equals, up to a constant, minus twice the cut expected from decoding $S$ shots. This explains why schedules tuned with exact expectation values lose their advantage at realistic budgets, and yields a shot-aware schedule whose final sharpness is set by the shot budget. On five G-set graphs with $800$ variables on $13$ qubits, this schedule outperforms every published schedule at its target budget in all $150$ paired comparisons of the decoded circuit output, owing to the sharpness at $1.6\times10^4$ shots and mostly to switching off the regularization at $10^3$; after a classical bit-swap search, it remains the best on average at $1.6\times10^4$ shots. Device noise damps the correlators by a factor $s$, which amounts to a smaller shot budget $s^2S$. On the IBM Heron processor ibm_fez, an all-to-all ansatz of the type used for the best published G-set results compiles to $835$ CZ gates and decodes to a random cut, while our $96$-CZ hardware-native circuit, trained in simulation and sharpened to $α\simeq0.65\,s\sqrt{S}$, retains up to $0.919$ of the best-known cut. For new circuits, a damping and an offset calibrated on other circuits of the same graph predicted the decoded cuts at $10^3$ shots to within $0.002$.
arXiv·2026-10-14·Chen Qing et al.
No generated summary available for this entry.
overview
Original abstract
Magneto-optical traps (MOTs), indispensable to cold-atom-based quantum computing and quantum precision measurement, are increasingly desired in compact and stable form. Particularly, the six-beam 3D-MOT, distinguished by symmetric geometry and superior trapping performance, finds particularly broad applications. Conventional implementations, however, rely on complex and bulky free-space optics, hindering miniaturization, practical assembly, and long-term stability. Here, we demonstrate a compact six-beam 3D-MOT system that employs two multifunctional optical metasurface chips to implement the optical-field functionalities required for cooling and trapping atoms. By combining two metasurface chips and a vacuum cell, a photonic-integrated cell module (PICM) is implemented as the core assembly and the volume is only" 73*73*107 mm^3" . In success, 1.3 * 10^3 Rb atoms are trapped and cooled to the temperature of ~183 μK. It should be noticed that the laser beam is guided to the metasurface through optical fiber, thus such fully fiber-coupled architecture enables straightforward and stable operations. We believe that this work would pave a practical route toward compact and portable 3D-MOT.
arXiv·2026-10-14·Enze Li et al.
No generated summary available for this entry.
overview
Original abstract
Frequency inhomogeneity can obscure the metrological advantage of squeezed spin states, making the choice of readout crucial. We study interacting spin-1/2 ensembles with static local frequency disorder and optimize a common collective readout over independent disorder realizations. Using Bayesian optimization of the full measurement-outcome distribution, we identify observables combining dipole and quadrupole operators that yield greater classical Fisher information than the optimized dipole readout considered here. For ensembles of up to 17 spins, their disorder-averaged CFI surpasses the standard quantum limit at both disorder strengths studied, including a regime where the dipole readout remains below it. For the larger ensembles studied, fixing the encoding axis to the direction that maximizes the disorder-averaged quantum Fisher information retains nearly the same performance. These results identify a route to extracting metrological information from frequency-disordered spin ensembles through the choice of collective observable.
arXiv·2026-10-14·Vahid Nourozi, Roxana Smarandache, David G. M. Mitchell
No generated summary available for this entry.
overview
Original abstract
We construct quantum codes from codewords of a cyclic code and the minors of a polynomial matrix. The construction uses a two-row, three-column matrix whose minors yield a second matrix satisfying the CSS orthogonality condition. We derive the code dimension from the greatest common divisors of the entries and minors, with a simplified formula for odd lifting factors. A residue characterization identifies additional common factors of the minors and leads to a method for controlling the dimension through polynomial selection. We also give a condition for changing the minor generator without changing the code. Explicit polynomial constructions yield 13 quantum codes with verified minimum distances, including a $[[255,80,12]]$ code of rate $80/255$.
arXiv·2026-10-14·Moises Gomez Solis
No generated summary available for this entry.
overview
Original abstract
We show that limit-periodic Jacobi matrices in the weak exponential class $EC(η)$ have purely absolutely continuous spectral type when $η$ is sufficiently large, depending only on the $R$-boundedness constant. The proof first establishes homogeneity of the spectrum from the weak exponential approximation rate. A closure theorem for reflectionless Jacobi matrices then transfers reflectionlessness from the periodic approximants to the limit, and a theorem of Poltoratski and Remling rules out singular spectrum on a homogeneous set.
The Quantum Insider·2026-10-13·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief QuDef and Singapore-based The Thought Projects signed a memorandum of understanding to bring QuDef’s SQOUT quantum security assessment platform to Singapore and the broader Asia-Pacific market. The collaboration combines SQOUT’s threat intelligence and risk assessment tools with TTP’s laboratory testing to identify and evaluate vulnerabilities in quantum key distribution systems. The companies aim to help governments, infrastructure operators and enterprises validate the security of deployed quantum communication systems beyond their theoretical security claims. PRESS RELEASE — QuDef, a Netherlands-based leader in quantum technology security, and The Thought Projects (TTP), a Singapore-based innovation leader in future-proof data security and Quantum Key Distribution (QKD) security evaluation, today announced a strategic collaboration. The two companies have signed a Memorandum of Understanding (MOU) under which TTP will bring QuDef’s flagship SQOUT ® platform to Singapore and the broader Asia-Pacific market. The collaboration aims to strengthen the security assurance ecosystem for quantum communication technologies and support the adoption of trusted quantum-safe solutions across the region. As governments, critical infrastructure operators, telecommunications providers, and enterprises deploy QKD alongside post-quantum cryptography (PQC), the security of the deployed systems, not only of the underlying protocols, has become a strategic priority. QKD security proofs rest on assumptions about the physical devices, and real implementations can deviate from them, as published attacks on commercial systems have shown. Organizations therefore need a structured method to understand vulnerabilities, assess risks, and validate security claims throughout the system lifecycle. Bringing European quantum security expertise to Asia-Pacific SQOUT ® is QuDef’s threat intelligence and knowledge platform which is used for systematic threat and risk a
Nature: Quantum Information·2026-10-13
No generated summary available for this entry.
overview
The Quantum Insider·2026-10-13·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Link Alice & Bob demonstrated GPU decoding of its LDPC-cat error-correction codes using NVIDIA NVQLink and synthetic data, a step toward scalable error correction for cat-qubit quantum computers. The proof of concept used Quantum Machines’ control hardware and showed improved decoding efficiency when processing multiple sets of error measurements in parallel. The demonstration did not achieve real-time decoding, and Alice & Bob plans to optimize data transfer and processing to keep pace with its quantum computers. PRESS RELEASE — Alice & Bob , a leader in fault-tolerant quantum computing, today shared results from implementing GPUs to decode its LDPC-cat architecture using NVIDIA NVQLink . The proof of concept using synthetic data is the first time LDPC-cat codes have been decoded on GPUs via the low-latency, high throughput NVQLink architecture, and moves the company a step closer to fast, scalable error correction for its cat-qubit quantum computers. NVQLink is NVIDIA ‘s open system architecture for tightly coupling the performance of GPU supercomputing with quantum processors (QPUs) to build accelerated quantum supercomputers. NVQLink specifically supports tasks that require fast communication between quantum and classical hardware, such as error-correction decoding, calibration, and hybrid quantum-classical applications across any qubit modality. Alice & Bob assessed the feasibility of GPU decoding for LDPC-cat codes using an NVQLink connection with Quantum Machines’ OPX1000 and Open Acceleration Stack, a modular framework that couples the controller directly to GPUs and other classical processors with microsecond-scale roundtrip latency. In particular, researchers assessed whether measurement data could be transferred from the control electronics to the GPU. LDPC-cat codes were developed by Alice & Bob for its cat-qubit architecture and first introduced in the paper “ LDPC-cat codes for low-overhead quantum co
The Quantum Insider·2026-10-13·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Quantum XChange CEO Eddy Zervigon will moderate a panel on post-quantum cryptography implementation at the ACT-IAC 2026 Cyber Summit on October 14 in Reston, Virginia. The discussion will cover crypto-agility, encryption lifecycle management, quantum-safe network deployment, and the risk of “harvest now, decrypt later” attacks across enterprise and government systems. The panel follows Quantum XChange ’s reported deployment of its Phio TX-EM solution at a federal agency and the company’s recent partnerships to expand access to its quantum-safe security products. PRESS RELEASE — Quantum XChange ® , a leader in quantum-safe network security, today announced that CEO Eddy Zervigon will moderate a panel discussion on post-quantum cryptography at the ACT-IAC 2026 Cyber Summit on October 14 in Reston, Virginia. The discussion will focus on the practical challenges of implementing post-quantum cryptography (PQC) across enterprise and government networks. The panel, titled “ Implementing Enterprise Security for Post-Quantum Cryptography (PQC) ,” comes just days after the U.S. Government Accountability Office (GAO) released a report highlighting challenges federal agencies face in preparing for the transition to post-quantum cryptography. The discussion will examine real-world implementation challenges, lessons learned, and best practices for managing encryption lifecycles, achieving crypto-agility, and deploying quantum-safe security across complex enterprise environments. The panel will also address the growing threat of “Harvest Now, Decrypt Later” attacks, in which adversaries collect encrypted data today for potential decryption by future quantum computers. “Transitioning to post-quantum cryptography is a complex undertaking, particularly across large government networks with critical systems and infrastructure,” said Zervigon. “The GAO report highlights some of these challenges, but we’re also seeing meaningful progress firsthand. Quantu
Phys.org Quantum Physics·2026-10-13
No generated summary available for this entry.
overview
Original abstract
A faster way of finding the best diamond-based materials for quantum computers has been developed by a researcher at the U.S. Department of Energy's (DOE) Princeton Plasma Physics Laboratory (PPPL). The new approach has already identified promising materials for practical quantum sensors and computers that could one day transform scientific research as a whole. The research was recently published in the journal ACS Central Science and has already garnered attention from other experts in the field.
The Quantum Insider·2026-10-13·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief The UK government announced £78 million to support businesses developing quantum sensing, navigation and communication technologies and expand workforce training. A £50 million competition will support projects including a railway fault monitoring system, handheld eye scanner and a mobile radio system. UKRI is investing £20 million in quantum networking capabilities and £8 million to expand a programme aiming to equip 150 engineering apprentices with quantum skills by 2030. Photo by Mohammed Al-Emran on Unsplash PRESS RELEASE — British businesses developing quantum technologies are being backed to keep our railways running, reduce eye scan waits, and keep our military connected – improving lives for people across the country. Quantum technologies use the behaviour of tiny particles including atoms to do things that are difficult or impossible with today’s technology. This includes quantum sensors, which can make extremely precise measurements to help with everything from healthcare and transport to infrastructure and national security. Businesses turning this new science into real-world solutions are being backed with a share of £50 million, as part of a new government package to unleash the potential of one of the defining technologies of our generation. Delivered through UK Research and Innovation ’s ( UKRI ) Sensing and Positioning, Navigation and Timing competition, it will directly support companies building next-generation systems that could outperform today’s technology in critical areas. The funding will help companies build on early testing and turn their innovations into products that make a difference in the real world. Winning projects include a quantum monitoring system, led by West Midlands-based MoniRail , which could pinpoint the precise location of faults in railway tracks and signalling equipment where GPS is unable to reach. That means track staff being able to deal with problems as soon as they arise, which will spare co
The Quantum Insider·2026-10-13·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Infleqtion has received £9 million from Innovate UK to develop Quantum Spectrum-DF, a deployable quantum radio frequency direction-finding system under the second phase of the QuDiFi project. The system uses Rydberg atoms and optical techniques to detect and locate radio signals, with the aim of reducing reliance on large antenna arrays. Developed in collaboration with Leonardo, the technology is intended for defence and civilian applications, including spectrum monitoring, passive radar, and resilient navigation. PRESS RELEASE — Infleqtion (NYSE: INFQ), a global leader in quantum computing and quantum sensing powered by neutral-atom technology, has been awarded £9 million (~$12M) by Innovate UK, part of UK Research and Innovation (UKRI), to continue development of a deployable quantum radio frequency (QRF) direction finding (DF) system as part of the Quantum Missions Primer programme. Infleqtion is developing a Quantum Spectrum-DF product within the second phase of the Quantum Direction Finding (QuDiFi) project, designed to accurately detect and locate signals in environments where existing technologies are limited. “By advancing quantum sensing from laboratory research to practical deployment, this project will help establish the United Kingdom as a leader in next generation radio frequency sensing technologies,” said Colin Sullivan, Managing Director, UK at Infleqtion . “The technology also lays the groundwork for future applications such as spectrum surveillance, passive radar and resilient navigation, enabling new capabilities that are not achievable with existing systems.” Radio signals are essential to modern communications, navigation, and monitoring systems. The ability to determine where these signals originate is critical for applications ranging from defence and security to emergency response and protection of infrastructure. However, current direction-finding systems often rely on large antenna arrays, especially at lower frequencies
The Quantum Insider·2026-10-13·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Swinburne University of Technology and IQM Quantum Computers have formed a partnership to advance quantum research, technology development, education, and workforce training across Australia, Europe, and the Indo-Pacific. The collaboration will include joint training programs, internships, research projects, technology development, workshops, and exchanges for students, researchers, and staff. The partnership builds on complementary expertise in quantum theory, experimentation, and superconducting quantum computers, with Swinburne representatives visiting IQM ’s production facility in Espoo, Finland. PRESS RELEASE — Swinburne University of Technology and IQM Quantum Computers , the global leader in superconducting quantum computers, are partnering to advance quantum science, technology, innovation and workforce development capability. This new partnership will include collaborating in education, training, research engagement and technology development across Australia, Europe and the Indo-Pacific. “Quantum technologies have the potential to transform industries and address some of the world’s most complex challenges,” says Swinburne ’s Deputy Vice-Chancellor, Research, Professor Karen Hapgood . “This partnership with IQM reflects our shared commitment to strengthen quantum expertise, expand learning opportunities and support the growth of a skilled workforce.” The development of quantum technologies is a key priority for both Australia and Finland, and this partnership helps to foster the international pathway for collaboration. Swinburne ‘s quantum expertise in theory and experimentation along with IQM ‘s reputation in producing working quantum computers, will not only enable technology uplift, but will also advance quantum talent in both countries. “Australia and Finland are both building real quantum capability, not just talking about it,” said IQM ‘s Chief Global Affairs Officer and co-founder, Juha Vartiai
Phys.org Quantum Physics·2026-10-13
No generated summary available for this entry.
overview
Original abstract
Researchers have fashioned a layered topological material into a scanning tunneling microscope (STM) tip that senses spin-related electronic states at atomic resolution.
Phys.org Quantum Physics·2026-10-13
No generated summary available for this entry.
overview
Original abstract
Researchers at Friedrich Schiller University Jena and the University of Regensburg have developed a method for determining, using light, a quantum property of electrons that has hitherto been difficult to access. The focus is on what is known as Berry curvature—a quantity that describes certain geometric properties of the quantum mechanical states of electrons. The researchers measured it in a layer of the semiconductor tungsten diselenide, just one atomic layer thick, using ultrashort laser pulses. The results have been published in the latest issue of the journal Nature Photonics.
The Quantum Insider·2026-10-13·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief SkyWater Technology and D-Wave Quantum have signed a multi-year agreement to continue specialized semiconductor process development and manufacturing for D-Wave ’s superconducting quantum systems. The agreement extends a collaboration spanning more than a decade, including manufacturing D-Wave ’s Advantage2 processors at SkyWater ’s Minnesota facility. In a separate project, D-Wave ’s quantum annealing technology helped optimize maintenance scheduling at SkyWater ’s fab, reducing lot delays by up to 30%. PRESS RELEASE — SkyWater Technology (“SkyWater”), the first quantum foundry in the U.S., and D-Wave Quantum Inc. (Nasdaq: QBTS) (“D-Wave”), the only dual-platform quantum computing company providing both annealing and gate-model systems, software and services, today announced a multi-year agreement. This collaboration extends the long-established partnership between both companies, to continue specialized semiconductor process development and manufacturing in support of D-Wave’s quantum technology roadmap. D-Wave ‘s work with the process integration and manufacturing team at SkyWater ’s Minnesota fab spans more than a decade, creating a deep base of process knowledge around its superconducting quantum technologies. The two companies are working together and bring different strengths. D-Wave knows how to engineer superconducting processes and how to design quantum systems and processors. SkyWater is skilled at combining manufacturing steps into one process, engineering materials, making very thin layers of material, and manufacturing semiconductors. That technical collaboration has supported multiple generations of D-Wave technology, including fabrication of Advantage2 processors. A D-Wave Advantage2 system, fabricated at SkyWater , was used in research published in Science in 2025 demonstrating performance beyond classical approaches on a useful quantum simulation problem. Under the new agreement, D-Wave will continue its
Phys.org Quantum Physics·2026-10-13
No generated summary available for this entry.
overview
Original abstract
For decades, physicists have sought a practical two-dimensional topological insulator: an ultrathin material whose interior blocks electricity but whose edges conduct it. In ordinary wires, electrons constantly bounce off imperfections, losing energy. But along the edges of a 2D topological insulator, electrons with opposite spins travel in opposite directions, like cars in one-way lanes, so they rarely scatter and lose energy.
The Quantum Insider·2026-10-13·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Dr. Chunyu Guo, a research group leader at the Max Planck Institute for the Structure and Dynamics of Matter, has received the 2026 Nicholas Kurti Science Prize for his research on quantum materials. Guo’s work examines quantum behaviour in kagome metals, including many-body quantum interference, long-range coherent charge transport, and electronic order under extreme conditions. The prize, awarded by Quantum Design Oxford , includes €15,000 and support to attend a global physics conference. PRESS RELEASE — Quantum Design Oxford today announces that Dr Chunyu Guo , W2 Research Group Leader at the Max Planck Institute for the Structure and Dynamics of Matter , Hamburg, Germany has been awarded the 2026 Nicholas Kurti Science Prize . The Award recognises Dr Guo’s contributions to understanding the quantum behaviour of kagome metals and his discovery of many-body quantum interference and long-range coherent charge transport in strain-minimised microstructures under high magnetic fields. Dr Guo’s research has advanced understanding of correlated topological matter and of the emergence and control of electronic order in kagome lattice systems[1]. He is also recognised for his contributions to understanding the behaviour of unconventional superconductors[2] under extreme conditions. “I am truly honored to receive the Nicholas Kurti Science Prize and to join its distinguished group of past recipients. This recognition is especially meaningful to me because it highlights the importance of low temperatures and high magnetic fields – conditions central to my scientific career. I am deeply grateful to my friends and colleagues, Professor Philip J. W. Moll and Dr Carsten Putzke, for their guidance and support. We have worked together for more than eight years, and it has been a fantastic journey for me in Europe. I would also like to thank my PhD supervisor, Professor Huiqiu Yuan, and all my colleagues and collaborators for their invaluable contr
Quantum Computing Report·2026-10-13·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
A University of Pennsylvania-led team has successfully demonstrated the on-chip transfer of photonic quantum skyrmions, topological light structures, from single photons to entangled states. This was achieved using integrated nanophotonic chips and established a noise-resilient quantum state transfer mechanism. The research, published in Nature Physics, shows that the skyrmion number, a robust quantum observable, remains intact even when entanglement vanishes, offering a new approach for noise-tolerant quantum optical interconnects. The post University of Pennsylvania Team Demonstrates On-Chip Photonic Quantum Skyrmion Transfer in Nature Physics appeared first on Quantum Computing Report .
Phys.org Quantum Physics·2026-10-13
No generated summary available for this entry.
overview
Original abstract
A concept from the field of quantum mechanics, spin is a property of particles that has no direct counterpart in everyday experience. Since the early 20th century, researchers have learned to manipulate it deliberately by means of precisely shaped electromagnetic pulses. This has resulted in two technologies that are widespread today: magnetic resonance imaging (MRI) is commonplace in hospitals, and nuclear magnetic resonance spectroscopy (NMR) is used to determine the structures of proteins and to develop new drugs. The mathematical framework of optimal control theory can be used to improve these technologies.
Quantum Computing Report·2026-10-13·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Google Quantum AI has developed Virtual Error Cancellation (VEC), a classical post-processing technique that significantly reduces logical errors in fault-tolerant quantum circuits. VEC uses a dual-decoder approach, combining a fast real-time decoder with a high-accuracy offline decoder, to reweight experimental outcomes and suppress logical error rates by over 1,600-fold. This method offers a more efficient alternative to previous error mitigation techniques, with a significantly lower sampling overhead. The post Google Quantum AI Introduces Virtual Error Cancellation for Universal Logical Circuits appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-13·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Swinburne University of Technology and IQM Quantum Computers have partnered to advance quantum science and technology across Australia, Europe, and the Indo-Pacific. This collaboration will focus on workforce development through joint training and internships, technology translation via co-development of quantum applications, and international exchange programs for researchers and students. The partnership aims to bridge Swinburne's research with IQM's commercial expertise in superconducting quantum systems. The post Swinburne University and IQM Partner to Advance Quantum Ecosystem in Australia and Europe appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-13·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Google Quantum AI researchers developed a method that uses saved error-correction records to reduce distortion in quantum results after a calculation, achieving more than 1,000-fold suppression in simulations. The method compares a fast decoder with a more accurate offline decoder and adjusts how much each measurement counts toward the answer, avoiding separate calibration experiments or changes to quantum circuits. The results rely on simplified noise simulations, and the method requires additional measurements and further testing under realistic conditions and on quantum hardware. Errors can survive even a quantum computer’s built-in correction system, leaving researchers with results that look reliable but remain slightly off. Now, Google Quantum AI researchers report on a “measure now, mitigate later” approach in a preprint study on arXiv that uses error records saved during the calculation as a way to reduce that remaining distortion by more than 1,000-fold in simulations. Their method, called virtual error cancellation, moves part of the work to a conventional computer after the quantum calculation ends. It uses information the quantum system already collects to adjust how individual measurement results contribute to the final answer. According to the study, the approach avoids separate experiments to measure noise and does not require changes to the quantum circuits running the calculation. It still carries a cost, however. Researchers must repeat measurements to produce a precise answer, and the gains have yet to be demonstrated on quantum hardware. The findings point to a possible way to get more accurate estimates from early fault-tolerant quantum computers. These machines are designed to keep operating despite errors, but their protection will remain imperfect, especially while the number of available qubits is limited. Double Check Quantum computers are unusually sensitive to disturbances, or “noise,” as those distur
The Quantum Insider·2026-10-13·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Coinbase urged early preparation for Bitcoin’s transition to quantum-resistant security, citing the years needed to update network rules and migrate funds. The company called for evaluating signature systems that balance security, transaction costs, wallet usability and institutional custody requirements. Coinbase said debates over dormant or inaccessible coins should proceed alongside technical work so they do not delay quantum-resistant protections. Image: Photo by PiggyBank on Unsplash Coinbase says Bitcoin should begin preparing for quantum computing threats before a machine capable of breaking its cryptography is announced. In a blog post outlining its technical priorities , the cryptocurrency exchange and custodian said protecting Bitcoin will require more than selecting a new digital signature system. The transition must also work for ordinary wallets and institutional custody, limit demands on the network and address funds whose owners cannot or will not move them. Coinbase described the migration as a complex, multiyear undertaking. Changes to Bitcoin’s shared rules and the movement of funds across its ecosystem can take years making advance preparation important even before the threat becomes certain, according to the post. The company said it holds about 5% of all bitcoin in existence, giving it a substantial stake in how the network approaches the problem. It is preparing its own systems, holding discussions with Bitcoin developers and researchers, and supporting open-source work through engineering resources and participation in the Bitcoin Security Consortium. The post is an input to an open discussion rather than a final Coinbase position, the company said, ading that it does not establish a migration deadline or announce an agreed Bitcoin upgrade. Coinbase’s main recommendation is to keep technical preparations moving while the community debates what should happen to abandoned or inaccessible coins. Company leaders write: “S
The Quantum Insider·2026-10-13·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Bloq Quantum has launched Bloq Maya, an AI agent designed to help enterprise quantum teams develop, test, and implement quantum computing use cases. The platform offers more than 15 pre-built algorithms, a visual quantum circuit builder, an experiments module, and execution across cloud simulators and quantum hardware providers. Bloq Quantum says Bloq Maya can help teams develop quantum use cases up to 10 times faster, targeting applications such as financial risk modeling, portfolio optimization, and complex simulations. PRESS RELEASE — Bloq Quantum today announced the launch of Bloq Maya, its flagship AI Agent designed to simplify and accelerate quantum computing for enterprises. It’s built to solve a very specific problem: making quantum computing actually usable for enterprise quantum teams. The launch of Bloq Maya addresses a critical bottleneck in the industry: translating complex theoretical quantum concepts into production-ready business solutions. Bloq Maya functions as an intelligent AI partner. Through a simple conversational interface, you can ask Maya to generate custom quantum circuits, build QUBOs, review algorithms, or generate optimized quantum code. “Translating complex quantum workflows into production-ready enterprise applications remains a massive bottleneck for enterprises,” said Sreekuttan L S, Co-Founder and CEO of Bloq Quantum. “Bloq Maya removes the friction so teams can go from an idea to a tested quantum use case up to 10x faster.” The platform integrates this agentic AI seamlessly into Bloq ‘s unified workspace, offering several key features: Low-Code Algorithm Library: Access to over 15 pre-built, advanced research-grade algorithms, including QKAN, PQK, QEMCMC, and QSVM. Visual Circuit Studio: An intuitive visual builder for designing parameterized quantum circuits (PQCs), feature maps, and complex gate compositions without deep quantum coding. Experiments Module: A streamlined environment for testing use cases
Quantum
·2026-10-13
·Gabriel Almeida et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Rydberg atoms provide a highly promising platform for quantum computation, leveraging their strong tunable interactions to encode and manipulate information in the electronic states of individual atoms. Key advantages of Rydberg atoms include scalability, reconfigurable connectivity, and native multi-qubit gates, making them particularly well-suited for addressing complex network problems. These problems can often be framed as graph-based tasks, which can be efficiently addressed using quantum walks. In this work, we propose a general implementation of staggered quantum walks with Rydberg atoms, with a particular focus on spatial networks. We also present an efficient algorithm for constructing the tessellations required for the staggered quantum walk. Finally, we demonstrate that our proposal achieves performance consistent with a quadratic speedup in spatial search algorithms.
Quantum
·2026-10-13
·Ugo Nzongani et al.
·doi
No generated summary available for this entry.
overview
Original abstract
We introduce SamBa-GQW, a novel quantum algorithm for solving binary combinatorial optimization problems of arbitrary degree with no use of any classical optimizer. The algorithm is based on a continuous-time quantum walk on the solution space represented as a graph. The walker explores the solution space to find its way to vertices that minimize the cost function of the optimization problem. The key novelty of our algorithm is an offline classical sampling protocol that gives information about the spectrum of the problem Hamiltonian. Then, the extracted information is used to guide the walker to high quality solutions via a quantum walk with a time-dependent hopping rate. We investigate the performance of SamBa-GQW on several quadratic problems, namely MaxCut, maximum independent set, portfolio optimization, and higher-order polynomial problems such as LABS, MAX- k -SAT and a quartic reformulation of the travelling salesperson problem. We empirically demonstrate that SamBa-GQW finds high quality approximate solutions on problems up to a size of n = 30 qubits by only sampling poly( n ) states among 2 n possible decisions. Furthermore, SamBa-GQW compares in par with classically optimized variational approaches, such as the variational guided quantum walk and QAOA (the latter when run on deep circuits). This places Samba-GQW as a promising heuristic to tackle combinatorial problems beyond the NISQ regime.
PRX Quantum
·2026-10-13
·J. Wilson Staples, Winston Fu, Jeff D. Thompson
·doi
No generated summary available for this entry.
overview
PRX Quantum
·2026-10-13
·Alexander N. Craddock et al.
·doi
No generated summary available for this entry.
overview
Quantum Science and Technology
·2026-10-13
·Blas Manuel Rodriguez-Lara et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract We study the no-jump evolution of ideal grid states in a lossy bosonic dimer with differential decay. The effective non-Hermitian quadratic dynamics induces a complex symplectic flow in phase space that deforms both the primitive lattice vectors and the origin seed. The average decay rate controls common-mode attenuation, while coherent hopping and differential decay control the reduced dimer deformation. For resonant modes, the reduced displacement flow is oscillatory in the elliptic regime, linear at the exceptional point, and exponentially separating in the hyperbolic regime. Although projected lattice areas can change, the deformation comes from a determinant-one complex symplectic flow on the complexified phase space. For a Gaussian regularization of the origin seed in the resonant dimer, we derive the associated complex width matrix and show that the seed remains square-integrable and Gaussian for every positive initial width, all non-negative times, and all physical loss rates. For an initial two-mode qunaught product state, the lossless limit recovers the standard beam-splitter generation of a square GKP+ Bell pair, while the no-jump dynamics produces its non-Hermitian deformation. The full no-jump probability for a normalized finite-energy input sets the postselection cost and depends on its excitation-number distribution and the reduced dimer dynamics.
Quantum Science and Technology
·2026-10-13
·Peyman Najafi, Aaron Villanueva, H J Kappen
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract The Path integral Quantum Control (PiQC) algorithm was recently introduced as a new approach&#xD;for computing optimal controls in continuous-time open and closed quantum systems. In this work,&#xD;we adapt the PiQC algorithm to optimize parametrized quantum circuits and refer to this version&#xD;of PiQC as the Gate-Based PiQC (GB-PiQC) algorithm. We apply GB-PiQC and the original&#xD;continuous-time version of PiQC for ground state preparation of electronic structure problems, and&#xD;benchmark them against the Variational Quantum Eigensolver (VQE), optimized using the stan-&#xD;dard Simultaneous Perturbation Stochastic Approximation (SPSA) optimizer, on a set of standard&#xD;benchmark molecular Hamiltonians. For a fair comparison, we optimize the hyperparameters of the&#xD;algorithms for each molecule. We find that both PiQC algorithms exhibit greater robustness than&#xD;SPSA to variations in the target Hamiltonian induced by changes in interatomic distance, when&#xD;hyperparameters for both methods are fixed at values tuned near equilibrium. Furthermore, PiQC&#xD;algorithms also achieve superior performance compared to SPSA in most instances under this fixed-&#xD;hyperparameter setting, particularly at stretched interatomic distances, where the Hartree–Fock&#xD;(HF) solution becomes less accurate and its error grows relative to equilibrium
Quantum Science and Technology
·2026-10-13
·Paul Over et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract An efficient implementation of quantum algorithms is often hindered by the lack of efficient primitives for operators and state preparation. &#xD;This limits both the ability of near-term quantum hardware to simulate complex problems and the potential of fault-tolerant algorithms to achieve practical quantum advantage. &#xD;To address this, we propose a framework that maps discrete operators onto compact, structured quantum circuits.&#xD;The resulting variational circuits can be tailored to the connectivity and long-range interaction of the target hardware. &#xD;The learning process employs backpropagation together with a cost function that efficiently optimizes unitary operators and non-unitary --dense or sparse-- operators using only a single ancilla qubit for block encoding.&#xD;Additionally, we introduce a regularization term that reduces the approximation error.&#xD;The approach is validated for both quantum mechanical and engineering applications. &#xD;In the former case, we learn propagators that arise in native quantum problems --such as quantum simulation and quantum chemistry-- and achieve improved resource scaling in comparison to standard Suzuki--Trotter expansions.&#xD;In the latter case, we demonstrate the approach's ability to implement the second-order central finite difference approximation of the Laplace operator --relevant for solving partial differential equations-- while improving upon current error metrics.&#xD;The final example deals with learning a dense, non-unitary operator that arises in the analysis of inviscid potential flow around an airfoil. &#xD;These results motivate the extension of the framework to a broader class of operator-synthesis problems beyond the prototypical engineering and quantum applications considered here.
Quantum Science and Technology
·2026-10-13
·Rafael Gómez-Lurbe et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract We study a variational quantum algorithm (VQA) approach for improving the implementation of the Quantum Fourier Transform (QFT) under realistic noise conditions. We employ a training strategy based on mutually unbiased bases (MUBs), which probes the action of the noisy variational circuit over a global set of input states and promotes generalization beyond the training ensemble. We numerically study two- and three-qubit QFT implementations under noise models combining incoherent errors with coherent crosstalk, using calibration parameters derived from a quantum device. For the 2-qubit QFT, the optimized variational circuit consistently outperforms the corresponding noisy QFT in scenarios containing coherent noise and exhibits highly reproducible optimization across independent parameter initializations. The variational advantage persists in the direct 3-qubit optimization, although with a stronger dependence on initialization. We further show that reduced MUB training sets can retain most of the performance of the complete set while substantially reducing the number of training states, whereas training only on computational-basis states leads to markedly poorer generalization and a stronger dependence on parameter initialization. Finally, exploiting the recursive structure of the QFT, we demonstrate that an optimized 2-qubit variational block can be embedded into a 3-qubit QFT and improve its noisy implementation without retraining the complete circuit. These results highlight the potential of combining global state-space training with device-specific noise-aware variational optimization to improve small noisy quantum circuits and to explore the transfer of variationally learned noise resilience to larger constructions.
Quantum Science and Technology
·2026-10-13
·Xiao-Yu Chi et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract We investigate non-Markovianity and its effects on thermodynamic principles and quantum battery performance within a structured nonequilibrium environment consisting of a three-level memory unit and two thermal reservoirs. We demonstrate that temperature imbalance, average temperature, and memory structure serve as effective control parameters for modulating non-Markovianity, exhibiting distinct behaviors for bosonic and fermionic reservoirs. An improved Landauer's bound applicable to non-Markovian processes is derived, overcoming the limitations of its conventional counterpart. By treating the central system as a quantum battery and the environment as a charger, we show that steady-state ergotropy can be achieved and tuned via thermodynamic parameters. Furthermore, non-Markovian dynamics significantly delay the discharge of the battery. Our study provides a pathway for constructing non-Markovian thermodynamic environments and harnessing non-Markovian effects to enhance the performance of quantum thermal devices.
Quantum Science and Technology
·2026-10-13
·Yi Yuan, Yuanchen Zhao, Liu Dong
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract Probabilistic error cancellation (PEC) is unbiased but suffers exponential sampling overhead set by noise-weighted circuit volume, whereas quantum error-detecting codes (QEDCs) remove many physical faults by stabilizer post-selection but leave an undetectable logical residue. We exploit this complementarity by using post-selection to map physical noise to a weaker accepted logical channel, and then applying PEC only to the residual channel. The resulting feedback-free QED+PEC scheme interleaves Clifford logical blocks, stabilizer measurements, post-selection, and probabilistic cancellation on accepted trajectories, without real-time decoding or active recovery. A key complication is that post-selection correlates accepted fault branches through stabilizer-commutation constraints, so the sparse Pauli-Lindblad factorization underlying bare PEC no longer applies directly. We therefore construct the inverse channel perturbatively: for fixed order $K$, only accepted fault branches up to order $K$ are retained, reducing preprocessing from $2^m$ branches to $O(m^K)$ per block. The order-$K$ protocol cancels the normalized post-selected channel through degree $K$, leaving a per-block error $O(W^{K+1})$ that accumulates at most linearly. For logical GHZ-state preparation with the $[[n,n-2,2]]$ Iceberg code under circuit-level depolarizing noise and ideal stabilizer measurements, first-order QED+PEC reaches $n=200$ physical qubits and lowers sampling overhead by three to four orders of magnitude relative to standard PEC while maintaining $F\simeq0.956$. Syndrome-noise tests show that readout-only flips mainly increase post-selection cost, whereas noisy GHZ-assisted global stabilizer extraction can remove the advantage. This identifies a discrete-Zeno trade-off: cheap detection reshapes the effective channel PEC must invert, rather than simply adding overhead.
Quantum Science and Technology
·2026-10-13
·Longshan Xu et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract Multi-quantum processing unit (multi-QPU) architectures have emerged as a promising route for scaling up quantum computing. However, quantum circuit execution across QPUs introduces remote operations, which have lower fidelity than local operations and require additional communication resources. Circuit mapping, which determines where quantum information and operations are placed, critically affects the number of required remote operations and, consequently, the reliability and efficiency of distributed execution. Here, we introduce NAVI, a communication- and noise-aware circuit mapping framework for multi-QPU systems. NAVI addresses three mapping decisions in a staged compiler workflow: how to partition qubits according to evolving interaction patterns, which communication mode should be used for remote operations, and which physical QPUs should host the resulting qubit partitions under heterogeneous noise. Across a diverse set of benchmark circuits, NAVI reduces cumulative execution error by 40% to 55% and communication resource consumption by 60% to 72% on average compared with existing methods.
Quantum Science and Technology
·2026-10-13
·Vincenzo Varrica et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract We investigate the solid-state implementation of a Dicke-like quantum battery consisting of a two-dimensional material-based Josephson junction inductively coupled to a resonator, using graphene as a representative example. &#xD;In this configuration, Andreev bound states naturally act as non-interacting, energetically non-degenerate two-level systems, and the setup allows for both single-photon and two-photon resonant processes.&#xD;The coupling between the LC‑circuit flux and the supercurrent through the junction gives rise to peculiar longitudinal interaction terms that have no counterpart in the conventional Dicke model. We demonstrate that these additional couplings can enhance energy storage for a proper range of parameters. &#xD;The proposed architecture also enables an alternative, but comparable, charging protocol that relies on tuning the superconducting phase difference across the junction.
Quantum Science and Technology
·2026-10-13
·María-Luisa Pérez-Delgado, Roberto Casado
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract Variational quantum circuits are a central paradigm of quantum machine learning and near-term quantum computing, yet their practical optimization is often limited by strongly suppressed parameter gradients. Dynamical Lie algebras provide a rigorous description of the infinitesimal directions accessible to a variational architecture, but dynamical accessibility alone does not determine the gradient signal exposed by an actual circuit parametrization. In this work, we develop a Lie-theoretic description of parameter-gradient structure that separates four successive mechanisms: dynamical accessibility, observable visibility, state-dependent activation, and local parameter realization. The optimization observable determines which accessible directions can influence the objective and how strongly they couple to it, while the quantum state selects which of these response modes are locally activated. This information is then pulled back through the circuit parametrization to recover the actual parameter gradients. The resulting construction yields an exact modal decomposition of the accessible gradient signal, a hierarchy of structural bounds, and a natural description of state averaging. An analytical single-qubit example and controlled numerical experiments validate the successive levels of the hierarchy and show that accessible Lie dimension alone is insufficient to characterize the parameter-gradient scale. The results support a mechanism-based view of variational trainability in which parameter gradients emerge from the interaction between accessible dynamics, observable coupling, quantum-state activation, and circuit parametrization.
Quantum Science and Technology
·2026-10-13
·Fionnuala Curran
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract The unpredictability of quantum physics gives rise to intrinsic randomness. In an adversarial scenario, any additional degrees of freedom must be attributed to an eavesdropper with correlations to the measurement set-up. The true randomness is then quantified by the probability that she correctly guesses the measurement outcomes, optimised over all possible strategies.&#xD;Extremal measurements are appealing here, since they do not allow information to leak to such an eavesdropper. Beyond projective measurements, however, a simple question remains open: how much intrinsic randomness can be generated by a given extremal measurement? In a step towards solving it, we characterise the randomness generated by any unbiased extremal rank-one measurement acting on any state, solving the problem explicitly in dimension two. Four-outcome qubit measurements of this type are tomographic, so these results hold for fully source-device-dependent randomness too. The tetrahedral symmetric informationally complete (SIC) measurement, we find, has the least intrinsic randomness within this class. We also present the skewed SIC family of measurements, and use them to partially solve an open problem: we prove that 2 log d bits of randomness, the maximal amount, can be generated device-dependently (or source-device-independently) in any dimension in which there exists a SIC measurement.
Quantum Science and Technology
·2026-10-13
·Roson Nongthombam, Amarendra Kumar Sarma
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract We investigate the role of continuous measurement and postselection in the dynamics and en&#xD;tanglement of a transmon-cavity-transmon coupled system. In the dispersive regime, characterized&#xD;by a large detuning between the transmons and the cavity, the two transmons interact via virtual&#xD;excitation of the cavity, giving rise to an effective transmon-transmon coupling. In addition to this&#xD;coherent interaction, each transmon undergoes spontaneous emission, which is continuously mon&#xD;itored through independent detection channels. By incorporating realistic detector inefficiencies,&#xD;we analyze both efficient and imperfect monitoring scenarios and demonstrate that postselection&#xD;significantly slows down the decay of entanglement compared to the unmonitored case. We formu&#xD;late the stochastic master equation for the coupled system, derive the corresponding postselected&#xD;master equation, and investigate the dynamics through the Liouvillian superoperator spectrum.&#xD;In the interaction frame, we identify the emergence of an exceptional point and characterize the&#xD;associated broken and unbroken PT-symmetric phases. We show how these phases influence the&#xD;system dynamics and the corresponding entanglement behavior. Our results provide insight into&#xD;how continuous measurement and postselection affect entanglement in dissipative quantum systems,&#xD;with potential applications in quantum information processing.
Quantum Science and Technology
·2026-10-13
·Kubra Yeter-Aydeniz, Nora Bauer
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract We present a method for calculating the ground state energy of the Fermi-Hubbard model leveraging Rydberg atom processors and sample-based quantum diagonalization (SQD). By exploiting the perturbative relationship between the Fermi-Hubbard and Heisenberg models, the procedure samples from the Heisenberg model as prepared on the Rydberg atom processor, and uses the samples to diagonalize the Fermi-Hubbard model for large U . We include anisotropy and next-nearest-neighbor interactions and discuss the relevant regime for quasi-superconductivity in the 1-dimensional Fermi-Hubbard model. Numerical and experimental results on the Aquila quantum processor are presented for ground state energy calculations as well as the chemical potential. We find that the Heisenberg model sampling in the studied regime is sufficient to converge near to the ground state for up to 56 qubits, and we see a clear advantage of Rydberg atom sampling as opposed to random sampling even with 10 times more samples for diagonalization. We also present a gate-based implementation of the gate-based SQD algorithm on IBM Quantum hardware for 56-qubit Hubbard model as a benchmark. Finally, we provide a gap analysis for studying emergent superconductivity using this method.
npj Quantum Information
·2026-10-13
·Shota Kanasugi et al.
·doi
No generated summary available for this entry.
overview
arXiv·2026-10-13·Chengxi Li et al.
No generated summary available for this entry.
overview
Original abstract
Directional quantum amplifiers enable weak-signal readout while protecting the source, but reservoir noise limits sensitivity. Finite-band suppression must reconcile frequency-dependent responses with fixed local couplings and finite rates. We construct adjacent-site loss channels attaining the known single-frequency minimum under local compatibility conditions, as an uncapped benchmark. For specified uniform and dimerized chains, we compare fixed reservoirs at matched drift, ports, high-gain band and complete gain/loss rate caps. At the representative cap $R=8$ and halfwidth $Ω=0.05$, nearest-neighbor arithmetic band average noise exceeds the unrestricted optimum by more than $1.01265$ quanta in the uniform chain for every finite $N\ge64$. Boundary-response bounds give necessary rates and targets requiring range two. At $N=64$, finite-auxiliary calculations retain a noise advantage under matched total coupling budgets; response bounds quantify noise-resolution tolerances. These theoretical results guide reservoir design and noise calibration for a proposed cryogenic microwave array with a $100$ kHz design band.
arXiv·2026-10-13·Shawn Geller et al.
No generated summary available for this entry.
overview
Original abstract
A common problem with physical qubits is that the state can leak outside the computational subspace. To characterize the problem, it is desirable to measure both the leakage probability and the fidelity of gates inside the computational subspace. Randomized benchmarking is a readily accessible method for estimating average gate fidelities and can be modified to account for leakage. However, in the presence of state preparation and measurement errors (SPAM) there are parameter degeneracies, and fidelities and leakage become underdetermined. We study the example of qudits with any number of leakage levels under the assumption of gate-independent noise. We show that randomized benchmarking sequences with leakage level decoherence can be analyzed as a Markov process with noisy classical preparations and measurements. This result generalizes to randomized benchmarking with random gates from an arbitrary group that contains a phase-decohering subgroup. We characterize the parameter degeneracy in inferring the Markov process, preparations and measurements. Based on this characterization we develop a measurement and inference method taking advantage of known conservative bounds on SPAM to constrain fidelity, leakage and other parameters of the Markov process, state preparations and measurements. As part of our study, we experimentally implemented the measurement method for a qubit defined on the one-excitation subspace of two transmons, for which there are two leakage levels. We determined confidence intervals accounting for parameter degeneracy for a number of performance parameters of the system. For leakage and fidelity, we compare these intervals to those obtained for several conventional methods for leakage benchmarking.
arXiv·2026-10-13·Maxwell Poster et al.
No generated summary available for this entry.
overview
Original abstract
Magic $|T\rangle$-state preparation dominates the cost of fault-tolerant quantum computation on surface codes, yet cultivation and distillation are typically provisioned statically, leaving much of the program's error budget unused. We present Gap-Priced $|T\rangle$ States (GP$|T\rangle$-S), a lattice surgery scheduler and factory allocator that co-optimizes both methods under a total $T$-error budget. GP$|T\rangle$-S uses the complementary gap of each cultivated state as a fidelity estimate and dynamically adjusts the cultivation gap cutoff, converting budget slack into speed by giving the scheduler control over the cultivation post-selection. GP$|T\rangle$-S also characterizes distillation factories by size, $|T\rangle$-state production rate, and budget slack, and introduces cultivating factories that embed cultivation within routing channels, achieving fidelities otherwise requiring two-level distillation at a single-level footprint. GP$|T\rangle$-S organizes these characterizations into a factory catalog, and performs distillation factory allocation over this catalog in tandem with the gap cutoff using dynamic-programming to achieve one of i) minimum spacetime volume, ii) minimum execution time, or iii) minimum space overhead, all within a user-provided $T$-error budget. Across sixteen benchmarks under high and low $T$-error budgets of $10^{-3}$ and $10^{-5}$ respectively, GP$|T\rangle$-S consistently outperforms cultivation-only and single-factory baselines without exceeding the budget, achieving a 5.5$\times$ geometric mean speedup in logical cycle count and a 3.4$\times$ geometric mean reduction in space-time volume.
arXiv·2026-10-13·Israel Klich, Ravisankar Rajagopal, Diana Vaman
No generated summary available for this entry.
overview
Original abstract
The mutual information of measurement of a local operator between two spatial regions characterizes the reduction in the uncertainty of measurement outcomes in one region given the outcome in the other. We study the Rényi-Shannon mutual information of measurement in conformal field theories (CFTs). Explicit calculations for scalar primaries and descendants in large $N$ CFTs are performed in the two extreme limits of the intervals being adjacent or largely separated. The results depend on only the cross ratio and the scaling dimension $Δ$ of the operator being measured, with striking similarities to the mutual information of entanglement. We find a surprising quadratic dependence as $(Δ-1/2)^2$ for adjacent intervals. This dependence superficially seems to violate the information processing inequality, which we discuss and resolve. We also offer a holographic interpretation of the mutual information of measurement.
arXiv·2026-10-13·Hadi Zadeh-Haghighi, Christoph Simon
No generated summary available for this entry.
overview
Original abstract
Choosing which information to use as the context changes is a basic cognitive operation. We introduce a new task of this kind for quantum reservoir computing (QRC): a binary cue indicates which of two simultaneous input streams the reservoir must reproduce. In simulated spin reservoirs with a trained linear readout, infinitely many measurements (exact expectation values) let the reservoir reproduce the cued stream accurately. At a finite number of measurements \(N_M\), the score exceeds that of a linear readout of the raw inputs only at large \(N_M\) because of sampling noise. Performance increases with both entanglement and coherence in the computational basis, and then saturates. These results show that QRC can select and reproduce a cued stream, and they are a starting point for harder cognitive tasks.
arXiv·2026-10-13·Mykhailo Hontarenko et al.
No generated summary available for this entry.
overview
Original abstract
Generators of continuous-time quantum Markovian evolution, known as Lindblad operators, play a key role in the theory of open quantum systems. The question of how to define and characterize random Lindblad operators has attracted considerable attention in recent years. Purely dissipative random Lindbladians have been extensively studied using toolboxes of free probability and non-Hermitian random matrix theories, which helped, among other results, to uncover a characteristic lemon-like spectral support. In this work, we focus on random Lindbladians with a Hamiltonian component. We analyze three ensembles of increasing complexity, designed to illustrate the joint effects of dissipative and Hamiltonian dynamics. While the first two ensembles allow for an exact analytic treatment with standard probabilistic and free-probability methods, the generic case of independently random Hamiltonian and dissipative components requires a novel framework that combines operator-valued free probability with sequential noise averaging. For this ensemble, our approach preserves the underlying tensor-product structure of the Lindblad operator and derives a general equation for the spectral boundary. We characterize the effect of Hamiltonian-induced spectral squeezing and explain how the spectral support changes with the relative Hamiltonian strength and the rank of the dissipative component.
arXiv·2026-10-13·Diogo Ramos, Duarte Magano
No generated summary available for this entry.
overview
Original abstract
Quantum-walk algorithms can quadratically reduce the dependence of spatial search on the classical hitting time $\mathrm{HT}$. Realising this speedup using standard quantum-walk algorithms, however, requires deep coherent circuits, limiting their applicability on near-term and early fault-tolerant quantum devices. We derive a parameterised family of hybrid quantum-classical spatial search algorithms that continuously interpolates between the classical and fully coherent quantum regimes, trading off circuit depth for total query complexity. For any $γ\in[0,1]$, our algorithms use circuits of depth $\widetilde{O}(\mathrm{HT}^{γ/2})$ and find a marked vertex with constant success probability at total cost $\widetilde{O}(\mathrm{HT}^{1-γ}\mathsf{S} + \mathrm{HT}^{1-γ/2}(\mathsf{U} + \mathsf{C}))$, where $\mathsf{S}$, $\mathsf{U}$, and $\mathsf{C}$ denote the setup, update, and checking costs, respectively. We also derive an optimal continuous depth-query trade-off for fixed-point amplitude amplification, providing a potential building block for other hybrid designs.
arXiv·2026-10-13·Connie Miao et al.
No generated summary available for this entry.
overview
Original abstract
We realize the mesoscopic Bose-Hubbard model at unit-filling on a two-dimensional array of transmon qubits and selectively excite collective modes associated with amplitude or phase fluctuations of the superfluid order parameter. We identify these modes respectively as the Higgs and Goldstone modes using complementary local observables, extracted from measuring the number of particles on each site. Modulation of the coupling between sites excites the Higgs mode, which we detect via the density of doubly occupied sites. In contrast, modulation of the local chemical potential with an appropriately chosen spatial profile excites the lowest-frequency Goldstone mode, which we detect via changes in the local density. The two modes have different symmetries and do not couple to one another. By varying the system geometry, we characterize the impact of finite system size on the evolution of both modes. In the thermodynamic limit, decay into a continuum of lower-energy excitations can obscure the Higgs response. In our mesoscopic system, however, the finite system size leads to spectral gaps and allows us to detect the Higgs mode as a coherent, long-lived excitation. Our work demonstrates how finite quantum simulators can isolate and probe physical phenomena that become difficult to resolve in the thermodynamic, large-scale limit.
arXiv·2026-10-13·Tristan Lorriaux et al.
No generated summary available for this entry.
overview
Original abstract
Dynamic nuclear polarisation transfers polarisation from electron to nuclear spins by relying on a dissipative channel. Here we introduce a cavity-based DNP mechanism which uses the radiative relaxation of the electronic spin through the Purcell effect to bring about the nuclear spin polarisation. We implement this protocol on an ensemble of bismuth donor spins (I=9/2, S=1/2) in isotopically purified silicon coupled to a superconducting resonator. A single cycle, combining adiabatic microwave and radio-frequency pulses with Purcell relaxation, increases a target ground state's population by a factor of $1.79\pm0.04$; a cumulative enhancement of $4.6\pm0.2$ is reached with additional cycles, to be compared with the theoretical limit of ninefold set by the degeneracy of the ground manifold. We explain this difference by the competition between Purcell and intrinsic relaxation on the one hand and a collective effect that slows down the electronic spin radiative decay as the nuclear spin population grows on the other hand. Our results place radiative DNP as an available mechanism at millikelvin temperatures where phonon-mediated relaxation is frozen.
arXiv·2026-10-13·Sergey S. Krishtopenko
No generated summary available for this entry.
overview
Original abstract
Tracing my scientific path from many-body physics in semiconductor nanostructures to topological quantum matter, this Habilitation à diriger des recherches (HDR) memoir presents only part of my research since defending two PhD theses in Toulouse and Nizhny Novgorod in 2011. Focusing on pseudo-relativistic fermions and topological states in zinc-blende semiconductors and their heterostructures, it highlights my independent research program: identifying physical problems, developing predictive theories, and initiating new directions with experimentalists. The first part addresses Kane fermions in bulk HgCdTe: temperature-driven band inversion, domain-wall states, the collapse of Landau levels in crossed electric and magnetic fields, and disorder-induced topological transitions. The second examines pressure-, temperature-, and disorder-driven phase transitions in single and double HgTe quantum wells (QWs), including bilayer-graphene-like semimetals and a two-dimensional higher-order topological insulator (2D HOTI) phase beyond the minimal BHZ model. The third develops three-layer InAs/Ga(In)Sb QWs as a III-V platform for massless Dirac fermions, large-gap quantum spin Hall insulators, 2D HOTI phases, and semimetals with quadratic band touching, and discusses InAs$_{x}$Sb$_{1-x}$/InAs$_{y}$Sb$_{1-y}$ heterostructures as a promising alternative. Several of these predictions are supported by experimental observations, including quantized helical edge transport up to 60 K and the unconventional quantum Hall effect. Defended on March 25, 2026, at the University of Montpellier. Jury: Michel GOIRAN (chair and rapporteur, LNCMI-CNRS, Toulouse); Alexey KAVOKIN (rapporteur, Westlake University, Hangzhou); Robson FERREIRA (rapporteur, LPENS-CNRS, Paris); Alexei BARANOV (member, IES-CNRS, Montpellier); Benoit JOUAULT and Frédéric TEPPE (members, L2C-CNRS, Montpellier).
arXiv·2026-10-13·Prince Frederick Kwao et al.
No generated summary available for this entry.
overview
Original abstract
Circuit depth and measurement count are the main limitations for chemical applications of the leading variational quantum algorithms on quantum computers. We show that both resource requirements can be reduced by augmenting adaptive variational quantum algorithms with post-optimization corrective techniques. We focus on two such techniques---Hamiltonian-moment Krylov subspace diagonalization and the identity-augmented quantum self-consistent equation of motion (q-sc-EOM)---applied to optimized ADAPT-VQE states without further ansatz growth or nonlinear optimization. Across molecular systems studied with up to 20 qubits, first-order Krylov correction reduces the optimized iterations (and the corresponding number of adaptive layers) needed to reach the $1.6~\mathrm{m}E_h$ threshold by up to approximately sixfold, with a general trend toward larger reductions at higher determinant Rényi entropy. We also find measurement-cost reductions of up to approximately fortyfold using a suitable resource-cost model. Identity-augmented q-sc-EOM improves molecular potential-energy curves obtained from truncated ADAPT-VQE ansätze with limited expressivity and recovers accuracy from states produced by sampled operator ranking without additional gradient-based operator selection, providing an advantage when small pool gradients make selection measurement intensive. Together, these post-optimization corrections offer routes to improve energy accuracy and reduce adaptive circuit growth in quantum algorithms as quantum hardware advances.
arXiv·2026-10-13·Hussain Gohar
No generated summary available for this entry.
overview
Original abstract
Gravity from entropy (GfE) identifies its Lagrangian with the geometric quantum relative entropy (GQRE) between the spacetime metric and a metric induced by matter and curvature, treating the metric itself as a quantum operator. We extend this construction to the Tsallis, Rényi, and Sharma-Mittal families, which we call gravity from generalized entropy (GfGE), and determine their common Einstein limit, weak-field spectra, auxiliary-field formulation, and horizon entropy. The entropy choice controls the leading higher-curvature terms and additional modes. We confirm that the linearized GfE spectrum contains a healthy scalar and a Planck-scale tachyonic spin-2 ghost. We identify the conditions that remove this ghost: curvature must enter through its scalar trace, or the entropy generator must be flat to quadratic order at the identity. The latter gives exact general relativity for Tsallis at $q=0$ and ghost-free $f(R,L_m)$ theories for Rényi and Sharma-Mittal. On shell, the auxiliary G-field is proportional to the tensor in Wald's entropy formula. For analytic entropy functions, horizons with a single curvature scale have an area term followed by constant and inverse-area corrections. We also extend the volume-constraint cosmological constant to the full family; its leading entropy dependence is set by the scalar mass. A finite set of entropy-function derivatives controls the leading weak-curvature departures from general relativity.
arXiv·2026-10-13·Aleksandr N. Mikheev et al.
No generated summary available for this entry.
overview
Original abstract
Interactions turn a gas into a fluid. We show that two-body loss can take their place. Correlated loss induces elastic scattering, as required by the optical theorem, which dominates at strong loss via the quantum Zeno effect. A nondegenerate gas with only two-body loss thus flows hydrodynamically, with viscosity and thermal conductivity close to those of the unitary Fermi gas. As loss heats the gas, both grow in time with a universal exponent 3/8. Unlike single-particle loss, two-body loss can engineer collisions, and hence transport, in quantum matter.
arXiv·2026-10-13·Zihao Ding, Jun Huang, Cong-cong Xing
No generated summary available for this entry.
overview
Original abstract
Quantum federated learning trains a quantum neural network (QNN) across nodes that hold quantum data, such as the states of quantum sensors. To forget data, unlearning methods for quantum models replay them, and federated unlearning from stored updates removes whole nodes only. Quantum data cannot be replayed, since a state is consumed when measured and cannot be cloned. We propose Shadow-based Data Erasure (SHADE), in which each node records a classical shadow of every training state, a few randomized single-qubit measurements taken at training time. The gradient and curvature of a QNN on a state are expectations of observables, so SHADE estimates them for the forget data from the shadows at any later parameters and removes their effect by a federated Newton correction. Only classical estimates cross the network. We prove that the shadow size needed for a target unlearning error grows exponentially in the size of the backward light cone of the measured observable and not in the number of qubits. In simulation with 50 nodes and on edge boards, SHADE matches the forget accuracy of retraining within 0.5 points, without replay and in under 0.2 s.
arXiv·2026-10-13·Zhide Lu et al.
No generated summary available for this entry.
overview
Original abstract
Ultra-high-rate quantum error correction codes can store many logical qubits in a single code block with few physical qubits. A fault-tolerant quantum computer, however, also requires a universal set of logical operations on individually addressable logical qubits, and the ancilla overhead of these operations may erode the advantage of the high encoding rate. Here, we propose the Cornucopia architecture, in which a universal set of logical operations is implemented at low overhead for the Cornucopia codes. In particular, we focus on the [[2844,1426,18]] Cornucopia code as an example and introduce a modular quantum computer built from such code blocks connected by bridges. Each block stores 1,426 logical qubits and serves as a universal logical processor. Exploiting the code's translation symmetry, we construct a family of reusable gadgets that individually address 1,422 logical qubits within each block. These gadgets support three universal logical instruction sets: basic, high-throughput and fixed-extractor. Excluding magic-state factories, a module with sufficient workspace to execute any instruction in the basic set requires an average of 4.1 physical qubits per logical qubit, compared with 3.0 for memory alone. The architecture thus preserves the resource advantage of ultra-high-rate quantum memory while enabling universal logical computation, providing a route towards low-overhead fault-tolerant quantum computers.
arXiv·2026-10-13·Riccardo Castellano, Pavel Sekatski, Nicolas Brunner
No generated summary available for this entry.
overview
Original abstract
A long-standing open question is to characterize the classical communication cost of simulating the correlations arising from measurements on finite-dimensional quantum systems. We consider this question in the prepare-and-measure scenario. First we construct a classical simulation model involving a finite average number of bits of one-way communication that simulates exactly the correlations arising from arbitrary $d$-dimensional quantum states and arbitrary measurements. Second, we show that no classical simulation protocol involving a finite average message dimension can exist for $d\geq 4$, hence strengthening a recent result of de Gois, Santos and Vieira. Our first result relies on a more general simulation theorem which can be applied to certain continuous variable (i.e. infinite-dimensional) quantum systems, and even beyond quantum theory, e.g. to generalized probabilistic theories. In particular, we show that multimode Gaussian states of bounded average energy and general Gaussian measurements admit an exact classical simulation with a finite expected number of bits. Overall, our results show that the classical simulation cost of quantum communication is essentially as high as it could be.
arXiv·2026-10-13·Celina Bräutigam, Steffen J. Glaser, Dennis Huber
No generated summary available for this entry.
overview
Original abstract
A deep understanding of quantum information theory is essential for quantum science and technology. However, quantum mechanics and particularly quantum information theory suffer from a lack of intuitive images. Visualization tools offer novel perspectives on many problems in quantum physics by revealing important properties of quantum states and processes that are otherwise obscured by abstract mathematical formalisms. Here, we extend the previously established BEADS representation of pure states to the so-called generalized BEADS representation of mixed quantum states. We introduce spherical functions, so-called beads to visualize correlation structures of mixed quantum states. A recursive optimization scheme is used to obtain minimum-entanglement pure state decompositions of all subsystems of a given N-qubit state. We show how correlation function components can be decomposed into individual contributions that directly correspond to different types of correlations of mixed states. This allows us to visually characterize the total correlation, genuine n-partite entanglement, nonclassical quantum-discord-type correlations as well as classical correlations. After outlining the mathematical details relevant for constructing the representation, we examine the generalized BEADS representations for various classes of mixed states including product, classically correlated, separable but nonclassically correlated, as well as entangled states. As exemplary applications of the generalized BEADS representation, we showcase entanglement distillation and the effects of noise channels.
arXiv·2026-10-13·Piper C. Wysocki et al.
No generated summary available for this entry.
overview
Original abstract
Quantum error correction (QEC) can strongly suppress noise, but predicting whether a computation succeeds requires understanding not only how much effective noise persists after QEC, but what form that noise takes. To thoroughly characterize this noise, we introduce logical gate set tomography (``logical GST''). Logical GST produces detailed representations of noisy logical operations that can be used to derive higher-level metrics, such as gate fidelity and diamond distance, and to test for non-Markovian and coherent logical errors. We use logical GST to obtain the first full, self-consistent characterization of a universal single-qubit logical gate set, implemented in the seven-qubit Steane code using Quantinuum System Model H1, a 20-qubit trapped-ion quantum processor. In the experimental data from H1, logical GST identified predominantly logical Pauli-stochastic errors, found no evidence of logical non-Markovianity, and detected weak potential signatures of coherent logical error. By contrast, higher-shot datasets generated with Quantinuum's detailed system emulator, identify mechanisms for weak but statistically significant logical non-Markovianity and strong evidence of coherent logical error. Finally, we use logical GST to perform error attribution with the system emulator, revealing how specific physical error sources shape logical error mechanisms.
arXiv·2026-10-13·Anna S. Roche et al.
No generated summary available for this entry.
overview
Original abstract
Excitons in monolayer transition metal dichalcogenides (TMDs) are highly sensitive to external stimuli, allowing control of resonance energies and lifetimes through electric and magnetic fields, heterostructures, moire potentials and mechanical strain. Observations of single-photon emission (SPE) near sample edges, wrinkles, and strained nanobubbles have motivated strain-engineering aimed at realizing localized emitters in 2D materials. The origin of these emitters remains unclear and prior studies have relied on far-field spectroscopy with strain profiles inferred separately through topography, limiting direct correlation between local strain and excitonic response. We directly probe strain-modified excitonic spectra in monolayer WSe$_2$ using cryogenic scattering-type scanning near-field optical microscopy (s-SNOM). We compare two strain-engineering techniques, nano-indentation and patterned substrates, used to produce SPEs. At 9 K, we spatially resolve exciton resonance shifts with sub-diffraction limit resolution, simultaneously measuring near-field optical response and topography. We observe that strain transferred from nano-indentation into a deformable polymer substrate differs from that produced by draping TMDs over patterned dielectric pillars. Adhesion and tearing during plastic deformation drive a compressive exciton blueshift, while draping produces dominant tensile strain. Comparing the strain model results to the experimentally observed energy shifts shows that the nano-indentation strain is over an order of magnitude smaller than previously inferred, due to puncturing of the fragile monolayer, whereas pillar-strained devices remain intact under more modest strain. These differences suggest SPE arises from complex, strain-mediated interactions rather than simple confinement potentials, establishing s-SNOM as a powerful probe of quantum emission in strained 2D materials.
arXiv·2026-10-13·Amir-Reza Negari, Yijian Zou, Timothy H. Hsieh
No generated summary available for this entry.
overview
Original abstract
Under local Lindbladian evolution, the growth of conditional mutual information and its associated Markov length scale is not limited by Lieb-Robinson bounds, yet it has been unclear how quickly the Markov length can increase. We show that an arbitrarily short, strictly local Lindbladian can generate infinite Markov length from a product state. We also construct strictly local Lindbladians that converge rapidly to steady states with algebraically decaying conditional mutual information. Despite their long-range conditional correlations, the states we construct are local reversibly connected to a product state by sublinear depth circuits. Thus infinite Markov length does not imply slow relaxation nor obstruct phase stability when suitably defined.
arXiv·2026-10-13·Filip Marijanovic et al.
No generated summary available for this entry.
overview
Original abstract
Strong coupling between mobile charge carriers or excitons and lattice vibrations gives rise to polarons: quasiparticles formed by charge carriers dressed by a cloud of phonon excitations. Polaron formation determines transport properties of systems ranging from transition-metal oxides and organic semiconductors to light-harvesting complexes. In excitonic systems that admit a hard-core boson description, mapping the excitations to pseudospins provides a natural framework for studying polaron physics, including the nonperturbative regime in which hopping amplitudes, phonon energies, and coupling strengths are comparable. Here, we propose a trapped-ion blueprint for realizing spin-phonon Hamiltonians with programmable spatial coupling between excitation density and phonon displacements, encompassing local Holstein and long-range Fröhlich-type interactions. To access strongly dressed quasiparticles whose bare spectral weight is suppressed, we introduce displaced Green's functions implemented through spin-dependent phonon displacements. Their spectral response reveals the polaron band spectrum, including binding energies and phonon-excitation sidebands, while spatially resolved measurements probe the structure of the phonon dressing cloud, providing a route to polaron tomography. We further complement this spectroscopy with direct and ancilla-assisted measurements of spin-phonon correlations that track the coupled dynamics of the excitation and its environment. These approaches connect the emergent quasiparticle spectrum to the microscopic buildup of its dressing cloud, enabling controlled studies of how the spatial range of coupling shapes polaron formation and mobility.
arXiv·2026-10-13·Pierre-Antoine Graham, Ahmed Abouelkomsan, Liang Fu
No generated summary available for this entry.
overview
Original abstract
Non-Abelian anyons, strange particles forming the basis of fault-tolerant topological quantum computing, are predicted to emerge in fractional quantum Hall states at even-denominator filling factors. Identifying which topological order is realized has proven to be a challenging problem that requires an accurate, non-perturbative treatment of realistic Landau level mixing, which has so far been missing from theoretical studies. Here we present the first complete solution of non-Abelian quantum Hall problem that includes all electrons and all Landau levels, for spin-polarized electrons at filling factor $ν= 3/2$. We develop a momentum-resolved neural-network variational wave function, optimized solely on the microscopic Hamiltonian, which gives direct access to the topologically degenerate ground states. Without any physics input about the expected outcome, it discovers a degenerate ground-state manifold whose entanglement reveals anyons with quantum dimension $\sqrt{2}$, the hallmark of Ising-type non-Abelian order. By directly computing the overlap with trial wave functions, we further show that Landau level mixing favors the anti-Pfaffian over other candidate states. Our results demonstrate the power of neural-network wave functions in finding and characterizing non-Abelian anyons from first principles, in regimes of strong Landau level mixing, relevant to many recent experiments.
arXiv·2026-10-13·Zhaohui Zhi et al.
No generated summary available for this entry.
overview
Original abstract
Non-Abelian anyon chains whose interactions favor a single fusion channel host quantum critical ground states described by minimal-model conformal field theories (CFTs) protected by a topological symmetry. We show that their measurement-only counterpart, where non-commuting fusion charge measurements act locally on the anyons of a chain of $L$ sites, provides a fundamental example of a non-unitary CFT controlling a non-Abelian learning problem. Mapping the monitored dynamics to a random tensor network, we numerically find $1/L$ scaling Lyapunov gaps, logarithmic entanglement scaling with the chord length, and an effective central charge in the Shannon entropy of the measurement record. The conserved topological charge sharpens with dynamical exponent $z= 1$ and is learnable by a decoder on an $O(L)$ time scale. As the topological symmetry is a non-invertible symmetry of the $SU(2)_k$ anyon theories, we establish the monitored golden chain $(k=3)$ as a non-Abelian generalization of the weakly (Kramers-Wannier) self-dual quantum critical point of the toric code $(k=2)$, and the first of a family for $k\geq 3$.
arXiv·2026-10-13·Jinwei Chu, Savan Kharel
No generated summary available for this entry.
overview
Original abstract
Stabilizer Rényi entropy quantifies magic relative to a complete Pauli frame. In settings such as helicity states of massless particles, unsynchronized qubit registers, energy eigenbases, and systems under superselection rules, the computational basis may be fixed while the transverse Pauli axes remain unspecified. The stabilizer Rényi entropy then depends on the choice of those axes. We define a phase-averaged stabilizer Rényi entropy by averaging the Pauli moments before taking the logarithm. It is exactly invariant under independent local rephasings. For pure states, it vanishes precisely when the state is a stabilizer state in every phase convention. For a broad class of sparse supports, it reduces to a closed-form function of the basis-state probabilities alone. Within this class, the ceiling for $n$ channels is $\ln[n^{3}/(6n-5)]$ for $n\geq3$ and $\ln\frac{7}{5}$ for two channels. We apply the invariant to tree-level gluon scattering at four and five points, where the helicity-basis phases are unspecified. It saturates the two- and three-channel ceilings: $\ln\frac{7}{5}$ at four points and $\ln\frac{27}{13}$ in $3\to2$ scattering. In same-helicity $2\to3$ scattering, it lies between a floor of $\ln\frac{8}{7}$ and a ceiling of $\ln\frac{184}{125}$, reached in the resolved soft limit and particular collinear limits, respectively. In every configuration studied, the invariant is independent of the fixed external colors.
arXiv·2026-10-13·Tian-Gang Zhou et al.
No generated summary available for this entry.
overview
Original abstract
Quantum simulators with disordered spin Hamiltonians offer a natural route to Haar-like unitary ensembles, but face a competition. Disorder enhances randomness, yet strong disorder suppresses dynamics and localizes the system in the computational basis. This suggests an optimal intermediate disorder strength for approximating a unitary $k$-design, which has so far been identified mainly empirically. Here, we develop a perturbative theory for the moment gap $Δ^{(k)}$, the deviation of the $k$-th moment operator from its Haar value, for the full spectrum of the interacting XXZ chain in a fixed-magnetization sector. We find the non-monotonic asymptotic scalings $\ln Δ^{(k)}\sim -σ^2$ at weak disorder and $\ln Δ^{(k)}\sim -1/σ$ at strong disorder, whose crossover sets an optimal disorder strength $σ_c\sim J_{xy}$, where $J_{xy}$ is the energy scale of the non-random interaction. We further show that a multi-quench protocol further suppresses the gap exponentially in the number of quenches. Numerical simulations confirm both scalings and this exponential suppression, and we demonstrate the usefulness of the protocol for classical shadow tomography. This work suggests that strong disorder may block both thermalization and the formation of unitary designs through a common localization mechanism.
arXiv·2026-10-13·Yu-An Chen et al.
No generated summary available for this entry.
overview
Original abstract
Chiral topological order is incompatible with strictly two-dimensional local commuting-projector Hamiltonians on finite-dimensional tensor-product Hilbert spaces. Invertible subalgebras (ISAs) provide an alternative framework. We construct an ISA supporting chiral semions, together with its anti-semion commutant, on a square lattice with one qubit per edge. We give explicit non-Pauli generators for both algebras and prove that together they generate all local operators on the Hilbert space. Starting from the $\mathbb{Z}_4$ toric code, we condense the boson $e^2m^2$ and identify the semion and anti-semion algebras. We then decompose each $\mathbb{Z}_4$ qudit into two qubits and use a finite-depth circuit to disentangle one qubit per edge fixed by the condensation constraints. Pumping the semion ISA along the $z$ direction defines an explicit three-dimensional non-Clifford quantum cellular automaton (QCA). We show that pumping eight times is equivalent to a translation followed by a finite-depth quantum circuit with ancillary qubits. We also give an explicit finite-depth circuit relating this construction to the semion QCA previously obtained from topological quantum field theory. A similar condensation construction yields a $U(1)_4$ ISA on a square lattice. Together with the semion and earlier odd-prime ISAs, finite stacking realizes every pointed Witt class of bosonic Abelian anyon theories. Finally, we extend both constructions to all spatial dimensions $d=4k{-}2$, with one qubit or $\mathbb{Z}_4$ qudit on each $(2k{-}1)$-cell for the semion or $U(1)_4$ ISA, respectively.
arXiv·2026-10-13·Hemant K. Mishra, Mark M. Wilde
No generated summary available for this entry.
overview
Original abstract
Loss and noise limit the use of light to distribute entanglement, transmit quantum information, and establish secret keys. Gaussian states have a compact description in terms of means and covariance matrices, but their entanglement still requires global optimization. We develop a framework for computing Gaussian-restricted versions of the relative entropy of entanglement and Rains entanglement. An integral representation reveals a convex geometry under matrix geometric means and reduces Gaussian Rains entanglement to relative entropy minimized over Gaussian states with positive partial transpose. We obtain unique optimal reference states and additivity for independent Gaussian input states. Our convex-majorization algorithm has an explicit geometric convergence rate, uniform in the faithful regularization parameter and valid for pure input states. Controlled numerical integration and approximate convex subproblem solutions give a bit-complexity bound that is polynomial in accuracy bits for each fixed rational input covariance matrix, with explicit dependence on covariance size. These calculations bound extractable entanglement and, through the relative entropy of entanglement, extractable secret key. Teleportation simulation, energy allocation, and a convex optimization of passive-basis loss cores give bounds on quantum and private communication under an input-energy constraint, allowing arbitrary two-way classically assisted protocols. Two- and three-mode examples compare the bounds with achievable rates, including matching pure-loss benchmarks. Finally, we separate the Gaussian-restricted quantities from their unrestricted counterparts and give a photon-number truncation method with controlled error for computing the latter.
arXiv·2026-10-13·Marco Valentini et al.
No generated summary available for this entry.
overview
Original abstract
Anyons are particles with quantized fractional statistics. In theory, a single anyon can be stabilized as a localized fractional charge within the bulk of a topologically ordered two-dimensional insulator. However, experiments to date have focused on probing anyons in structures in which many anyonic excitations coexist and interact. Here, we demonstrate the trapping of a single anyon in a device consisting of a graphene-based quantum point contact with an embedded tunable quantum Hall dot. Benchmarking our device at v = 1, we demonstrate backscattering between Fermi liquid edge states mediated by the whole-electron Coulomb blockade of the dot. The cleanliness and control available in our device allow depletion of the dot to the last quasihole, and we observe spin blockade for transitions to the opposite-spin Landau level. At v = 1/3 and 2/3, we observe backscattering resonances with three times the frequency, consistent with resonant transmission of e/3 charges via a single anyon transistor. We demonstrate controlled depletion to the last quasiparticle to form a single anyon quantum dot. Tracing the charge addition spectrum for quasiparticle number Nqp = 1-5, we observe highly irregular addition energies, consistent with DMRG modeling showing a complex orbital shell-filling behavior. At higher Nqp = 10-20, the addition energies show a striking pattern: quasiholes at 1/3 (and quasiparticles at 2/3) show a regular addition spectrum while quasiparticles at 1/3 (and quasiholes at 2/3) do not. We trace the origin of this irregularity to an attractive component of the inter-anyon interaction: by experimentally tuning the confining energy, we observe complete suppression of alternating charge sectors, after which the dot charges in increments of twice the fundamental charge. This observation indicates the emergence of an anyon binding energy as large as the charging energy.
arXiv·2026-10-13·Haobo Ma, Maksim E. Shirokov, Wenlin Zhang
No generated summary available for this entry.
overview
Original abstract
It is proved that every Borel ensemble of pure states on a separable bipartite Hilbert space with finite average entanglement admits a countable ensemble with the same barycenter and arbitrarily small additional average entanglement. Consequently, the discrete and continuous versions of the Entanglement of Formation coincide on the whole space of states of infinite-dimensional bipartite quantum system (with infinite values allowed). The main idea of the proof (realized with the AI-assistance) is the identification of a Borel ensemble of pure bipartite states with a Borel probability measure on the unit sphere of the space of Hilbert--Schmidt operators followed by dividing the support of this measure into appropriate cells and replacing each cell by its conditional barycenter. The resulting countable ensemble is obtained by a recursive construction.
arXiv·2026-10-13·Rishabh Batra
No generated summary available for this entry.
overview
Original abstract
A series of recent works has established EFI pairs as the "minimal" assumption for quantum cryptography. Recently, Cavalar et al. [CCC+26] showed that EFI pairs are equivalent to non-uniform expanding single-copy pseudorandom state generators (1PRS), and obtained a non-uniform meta-complexity characterization of EFI pairs. We remove the non-uniformity in their construction and prove that EFI pairs are equivalent to expanding 1PRS. As a corollary, we obtain the first uniform meta-complexity characterization of EFI pairs. Together with the equivalence of statistically verifiable one-way state generators and commitments proved by Batra and Jain [BJ24], this gives a quantum analogue of the classical equivalence between one-way functions, commitments, and pseudorandom generators.
arXiv·2026-10-13·Farzin Salek, Masahito Hayashi
No generated summary available for this entry.
overview
Original abstract
We develop and analyze an entropic descent method for a nonconvex optimization problem on probability simplices arising in classical and quantum secure communication. The optimization variables describe a randomized encoder, allowing its input distribution and stochastic preprocessing to be optimized jointly. An exact relative-entropy identity yields a channel-independent majorization bound and an explicit mirror-descent iteration with a fixed unit step size. We establish quantitative descent, convergence of objective values, and stationarity of accumulation points on their support faces for arbitrary finite classical channels, without assuming degradedness or less noisiness. For strictly positive transition matrices, a square-root parametrization and a Kurdyka--Łojasiewicz argument establish finite length of the transformed trajectory and convergence of the entire sequence, including limits on the simplex boundary. For less-noisy channels, a restricted convex formulation admits global convergence with an explicit \(O(1/t)\) objective-error bound. We extend the relative-entropy construction to noncommuting quantum outputs and derive monotone alternating updates for covariant encoders, including correlated preprocessing over a fixed block. Numerical experiments compare the method with analytic benchmarks and constrained optimization, reveal multiple attracting values, and demonstrate strict improvements from stochastic preprocessing.
arXiv·2026-10-13·Isabelle Franzen et al.
No generated summary available for this entry.
overview
Original abstract
Multimode mechanical resonators offer a large set of densely packed, long-lived bosonic modes within a single compact device, making them attractive for quantum simulation, quantum information processing, and quantum-enhanced sensing. Many such applications rely on multipartite entanglement, yet deterministic mechanical entanglement has so far been largely limited to pairs of modes. Here we demonstrate the deterministic and programmable preparation of multipartite entangled states among the phonon modes of a high-overtone bulk acoustic wave resonator coupled to a superconducting transmon qubit. By sequentially applying optimal-control-engineered isometries between the qubit and successive modes, we generate matrix product states of bond dimension two, including $W$, Greenberger-Horne-Zeilinger (GHZ), and cluster states. We fully characterize these states via quantum state tomography and certify genuine multipartite entanglement among up to four modes. We further demonstrate correlated-noise sensing by exploiting the complementary decoherence responses of the stored $W$ and GHZ states, isolating inter-mode phase correlations from local decoherence and placing quantitative bounds on collective dephasing. Our results establish a scalable approach to preparing multipartite entangled states in mechanical systems, with promising applications in multiparameter sensing and tests of quantum mechanics with massive objects.
arXiv·2026-10-13·Finn Müßigbrodt et al.
No generated summary available for this entry.
overview
Original abstract
Massive mechanical oscillators couple directly to forces, accelerations and gravity, making them attractive probes of new physics and of quantum mechanics at macroscopic scales. Pushing sensitivities beyond the standard quantum limit for signals of unknown phase requires non-Gaussian quantum states, whose metrological advantage has so far been confined to lighter systems such as trapped ions. Here we operate a microgram-scale acoustic mode of a high-overtone bulk acoustic wave resonator as a phase-insensitive quantum-enhanced sensor. A transmon qubit prepares the mode in Fock states of up to seven phonons by optimal control, and resolves its phonon-number distribution after interaction with a weak resonant signal. Bayesian analysis yields a Fisher information five times the vacuum value, a 7.0 dB gain in signal-amplitude sensitivity over any classical probe state, irrespective of its energy, currently limited by state preparation infidelities. We then train a neural network on the measured sensor response to perform Bayesian estimation without any analytical model of the system, showing the same sensitivity gain with half the systematic bias. Our results establish acoustic resonators prepared in non-Gaussian states as quantum-enhanced probes for high-frequency gravitational waves, dark matter and wave-function collapse.
arXiv·2026-10-13·Stefano Pirandola, Gaetana Spedalieri
No generated summary available for this entry.
overview
Original abstract
We study quantum communication, entanglement distribution, and secret-key generation through multimode bosonic loss and fading channels, assisted by local quantum operations and two-way classical communication. Using sector teleportation, we determine the exact two-way quantum and secret-key capacities of multimode pure-loss channels under a mean photon-number constraint, allowing arbitrary adaptive quantum protocols. We extend these results to continuous frequency-dependent loss under a power constraint and identify the optimal allocation of photons among optical modes. For constant loss over an unlimited bandwidth, we obtain a closed-form capacity proportional to the square root of power. For randomly varying loss, we determine exact finite-energy capacities when the channel realization is publicly revealed, distinguishing knowledge before and after transmission. When fading remains unobserved, we derive capacity bounds and explicit formulas for an on/off channel. We also establish strong-converse bounds, with exact thresholds for the deterministic loss models considered here, observed fading, and unobserved fading with finitely many possible transmissivities. Under mean energy constraints, these thresholds generally exceed the corresponding finite-energy capacities. These results guide energy allocation and provide benchmarks for energy-constrained optical quantum communication with multimode signals and variable loss.
arXiv·2026-10-13·Alfonso Castillo-Gonzolez, Eric R. Bittnre
No generated summary available for this entry.
overview
Original abstract
We introduce PULSUS, a direct frequency-domain framework for multidimensional spectroscopy of open quantum systems beyond the impulsive rotating-wave approximation. Coherence-frequency intervals are represented through Liouvillian resolvents, while finite Gaussian pulses are incorporated through operator-valued functions of the field-free Liouvillian. This enables direct evaluation on Cartesian grids or arbitrary spectral coordinates while retaining molecular evolution during the pulse envelopes and, when required, the complete light--matter interaction. The implementation is validated against analytical and independent time-domain benchmarks and supports targeted spectral sampling that reduces the number of evaluated coordinates when the response is spectrally localized. A controlled hierarchy of finite-pulse, rotating-wave, short-pulse, and impulsive models separates the errors introduced by each approximation. For a coupled electronic dimer, the total impulsive-RWA error is nonmonotonic in pulse duration: an intermediate regime provides the highest accuracy, whereas ultrashort pulses expose coupling-enabled beyond-RWA pathways and longer pulses develop substantial finite-pulse corrections. These results show that the impulsive and rotating-wave approximations cannot be assumed to improve simultaneously and should be tested when quantitatively interpreting multidimensional spectra. PULSUS provides a direct frequency-domain framework for carrying out that comparison.
arXiv·2026-10-13·Benjamin Corbett, Akimasa Miyake
No generated summary available for this entry.
overview
Original abstract
Explicitly correlated methods, which represent dominant short-range correlations by a diagonal Jastrow-type correlator, are designed to accurately describe systems of strongly correlated electrons, such as the fully periodic 2D Fermi--Hubbard model. However, as the reference state is compact in momentum space whereas the correlator acts naturally in real space, there is a fundamental mismatch of bases that classical algorithms resolve only by restricting the reference or the correlator. Here we propose a hybrid algorithm in which a quantum processor prepares a low-entanglement momentum-space matrix product state (MPS), precomputed classically by the transcorrelated method at the cost of a nonvariational energy, rotates it to real space, and measures in bases fixed by the Hamiltonian. Because the measurement bases are independent of the correlator, the correlator can be variationally optimized entirely in classical post-processing with no quantum-classical feedback loop. We demonstrate our algorithm on 32 qubits of Quantinuum's H2-2 with a bond-dimension-4 MPS for the half-filled $4 \times 4$ lattice and achieve a relative ground-state energy error of $16 \pm 4\%$ after postselection, reduced to $3.5 \pm 0.5\%$ by calibration using low-order moments from the MPS. Compared with other feedback-free hybrid algorithms, even under generous assumptions, our method requires fewer samples than quantum-selected configuration interaction and fewer two-qubit gates than quantum Krylov methods.
arXiv·2026-10-13·Maria Pfahler, Andrea Donarini
No generated summary available for this entry.
overview
Original abstract
We propose a protocol to prepare and probe dark states in a single-molecule electron spin resonance based on atomic force microscopy (ESR-AFM), thus extending existing techniques developed to address Rabi oscillations. To this end, we simulate in analogy to atomic physics the coherent manipulation of a three-level system in the V-configuration using a multifrequency magnetic field. More specifically, we consider a neutral molecule with a zero-field-split (ZFS) first excited triplet and analyze within a pump-probe scheme the dynamics of the total triplet population. In the triplet subspace, the dark state is a coherent superposition formed by two ZFS states which does not evolve in time despite a continuous resonant driving towards the third one. We characterize the properties of this state comparing it to its fully incoherent counterpart. Within a density-matrix formalism for open systems, we then compute the expected dark state signatures both for ideal scenarios and for the realistic parameterization of ESR-AFM on pentacene.
arXiv·2026-10-13·Ipsita Mandal
No generated summary available for this entry.
overview
Original abstract
We study collective charge excitations in pseudospin-1 triple-point semimetals within the random-phase approximation, considering both the linearised model with a flat-band and its quadratic-corrected counterpart. We analyse their density response, Drude weights, screening, plasmon dispersion and damping, particle-hole continua, and Friedel oscillations from the long-wavelength to the arbitrary-momentum regime. The quadratic correction renders the flat-band dispersive and endows it with a Fermi surface, thereby affecting the overall response. Comparisons with Weyl and Hopf semimetals reveal how bandstructure and quantum geometry jointly govern collective charge dynamics. While the Drude weights are determined by the Fermi surface and band-velocities, interband screening, plasmon dispersion, and Friedel oscillations reflect the quantum geometry of the eigenstates.
arXiv·2026-10-13·Diyi Liu et al.
No generated summary available for this entry.
overview
Original abstract
We construct Clifford+$T$ circuits implementing arbitrary $n$-qubit unitaries with worst-case $T$-count $\widetilde{O}(N^{8/7})$ at constant operator-norm error, where $N=2^n$, improving the previous exponent $5/4$. The construction uses $\widetilde{O}(N^{6/7})$ clean ancillas. The main idea is to reduce the data addressed by each query to the block-encoding circuit for a sparse piece while controlling the additional simulation work needed to combine the pieces. We simulate a Hermitian logarithm of the target by flattening its traceless part with a two-layer random similarity transformation, randomly partitioning the transformed generator into block-sparse Hermitian pieces, and combining their evolutions using qDRIFT. For a target operator-norm error $ε\in(0,1/2)$, let $L=\log_2(N/ε)$, the qubit count plus the requested bits of accuracy. By successively correcting the approximation error, we obtain a circuit using $\widetilde{O}(N^{8/7}L^{3/7}+NL)$ $T$ gates and $\widetilde{O}(N)$ clean ancillas whenever $L\le N$. We also prove that, at constant precision, the exponent $8/7$ is optimal within a sequential block-SELECT model.
arXiv·2026-10-13·Sayan Sengupta et al.
No generated summary available for this entry.
overview
Original abstract
We investigate how unresolved quasistatic disorder in system bath coupling affects non-Markovian dynamics in spin environments. The coupling is fixed within each experimental shot but varies between shots, so repeated shot tomography reconstructs a disorder averaged dynamical map. For a single spin bath with pure dephasing Ising interaction, disorder can drive a transition to CP-divisible dynamics for fixed bath preparations, with a critical strength set by bath polarization along the interaction axis. However, when the bath state fluctuates physically between shots, the averaged dynamics remain CP indivisible at any finite disorder strength. We extend these results analytically to inhomogeneously coupled pure dephasing baths of any number \(N\) of non-interacting spins. At any finite disorder strength, one unpolarized bath spin suffices to retain CP-indivisible dynamics, whereas a fully polarized bath yields Markovian (CP-divisible) dynamics. Dynamics with physically fluctuating bath states likewise remain non-Markovian (CP indivisible) at finite disorder for arbitrary \(N\) in the pure dephasing case. For anisotropic Heisenberg interactions, any nonzero transverse exchange eliminates the disorder driven transition to CP divisibility in a single spin bath. Exact diagonalization of anisotropic models with inhomogeneous couplings up to \(N=12\) reveals persistent trace distance revivals for fixed bath preparations, sampled Haar random preparations, and physically fluctuating bath states, showing that this effect of transverse exchange extends beyond a single bath spin. Increasing disorder still suppresses experimentally accessible revivals and can make memory effects unresolvable at finite measurement resolution even as the dynamics remain CP indivisible. Thus, transverse exchange and physical bath state fluctuations preserve dynamical indivisibility against unresolved coupling disorder.
arXiv·2026-10-13·Cedric Igelspacher, Roderich Tumulka
No generated summary available for this entry.
overview
Original abstract
We consider a closed macroscopic quantum system in a pure state $ψ$ evolving unitarily with Hamiltonian $H$ in a finite-dimensional Hilbert space $\mathscr{H}$. Following von Neumann, we assume a decomposition of $\mathscr{H}$ into mutually orthogonal subspaces $\mathscr{H}_ν$, where each $ν$ represents a macro state, and $\mathscr{H}_ν$ contains the pure states compatible with $ν$. We define the quantum Boltzmann entropy for a macro state $ν$ as $S_\mathrm{qB}(ν) = k_{\mathrm{B}} \log \dim \mathscr{H}_ν$, where $k_\mathrm{B}$ is the Boltzmann constant. Goldstein et al. [http://arxiv.org/abs/1903.11870] have suggested, as a version of the second law of thermodynamics, that $S_\mathrm{qB}$ predominantly increases with time for realistic macroscopic systems. Here, we discuss precise versions of this statement and confirm them for several simple models of $H$ and $\mathscr{H}_ν$.
arXiv·2026-10-13·Hélène Perrin, G. M. Kavoulakis
No generated summary available for this entry.
overview
Original abstract
We investigate the rotational properties of a zero-temperature Bose-Einstein condensed gas, which is confined in a hard-wall potential. For weak interactions the gas carries its angular momentum via vortices of multiple quantization. As the coupling increases and for sufficiently slow rotational frequencies of the trap, the multiply-quantized vortex states become unstable against a mixed state. For stronger couplings, as the angular frequency of the trap increases, there is a transition from a vortex lattice, to a vortex lattice with a hole at the trap center, and finally to a giant vortex. For weak effective attractive interactions we still have vortices of multiple quantization. These states become unstable towards states which break the axial symmetry of the problem and resemble center-of-mass excitation, as the coupling becomes more negative. Finally, for even more attractive forces, the system becomes unstable against collapse.
arXiv·2026-10-13·Riccardo Piantoni et al.
No generated summary available for this entry.
overview
Original abstract
In order to execute quantum algorithms on bosonic quantum computers, it is necessary to encode their inputs into a desired target quantum state, with a process called state preparation. In real settings, state preparation methods operate in stochastic scenarios, where the prepared state is represented as a mixed state, that is a probabilistic ensemble of pure states. Therefore, existing state preparation methods optimize a variational ansatz by averaging over all possible sequences of photon loss events contained in the prepared ensemble, yielding an output state which approximates the desired target with a certain average fidelity. Such an approach, however, does not take into account directly the distribution of fidelities across states in the ensemble. In this work, we aim to maximize the fidelity of only a subset of pure states sampled from the prepared ensemble, at the cost of reducing the average fidelity overall. This trade-off is relevant when the goal is to obtain high-fidelity states with a certain probability, rather than maximizing the average fidelity of the prepared ensemble. We borrow and adapt objective functions from risk-sensitive optimization, a framework that optimizes specific characteristics of a distribution rather than only its expectation, and that has been successfully applied in Reinforcement Learning. In the considered experimental settings, our results show that the infidelities of some pure states in the prepared ensemble can be reduced by up to four orders of magnitude when using risk-seeking objectives, compared to those achieved using the standard optimization of the average fidelity. Furthermore, we show that it is possible to control the trade-off between the probability of obtaining high-fidelity states and the lowest infidelity threshold reached, providing the flexibility to select the operating point that best suits a certain application.
arXiv·2026-10-13·Chi Zhang et al.
No generated summary available for this entry.
overview
Original abstract
Quantum computing promises new capabilities beyond classical computation. Mid-circuit measurements (MCMs) enable error correction and outcome-dependent control, but their reliability is limited by noise on superconducting hardware. These operations depend on accurate quantum state discrimination (QSD), which assigns measured signals to state labels. Neural network-based (NN-based) QSD improves this assignment, yet its error remains bounded below by the Bayes risk of the available readout distributions. A complementary challenge is state deterioration as successive measurements accumulate and circuit execution advances, making static calibration less representative of the workload. We present Lifting, a QSD framework that addresses both challenges through repetition encoding, neural decoding, and in situ calibration. Encoding supplies joint in-phase and quadrature (I-Q) readout signals from the target and auxiliary qubits, while contextual calibration trains the decoder for the conditions encountered during execution. Our theoretical analysis shows that retaining additional channels from a fixed joint distribution cannot increase Bayes risk and establishes sufficient conditions for contraction of an overlap-based upper bound. Experiments across three IBM processors evaluate the framework on repeated stabilizer measurement, parity-check, and teleportation workloads.
arXiv·2026-10-13·Weiping Yuan et al.
No generated summary available for this entry.
overview
Original abstract
Fast entangling gates and low-interaction idling require distinct operating conditions in superconducting quantum processors. We experimentally realize a transmon-C-shunt-transmon (TCT) device in which a flux-tunable, three-junction capacitively shunted flux-qubit coupler connects two transmon data qubits. The C-shunt coupler provides a flux-tunable, positively anharmonic spectrum for tailoring the interactions between the data qubits. Conditional Ramsey and swap measurements identify an idle region with near-zero residual ZZ interaction strength and suppressed transverse exchange. At this bias, simultaneous single-qubit interleaved randomized benchmarking yields X-gate fldelities above 99.7%, consistent with individual operation. A 45 ns nonadiabatic controlled-Z (CZ) gate achieves an interleaved randomized benchmarking fldelity estimate of 99.23(15)%. Numerical simulations identify coupler energy relaxation as an important limitation on CZ-gate fldelity and indicate that extending the coupler lifetime can improve gate performance. These results demonstrate the experimental feasibility of C-shunt flux-qubit couplers for combining low-interaction idling with fast entangling operations between transmon qubits.
arXiv·2026-10-13·Tonipe Anuradha et al.
No generated summary available for this entry.
overview
Original abstract
The ergotropy, or unitarily extractable work, of a quantum system naturally splits into incoherent and coherent contributions, respectively set by population inversion and coherences in the energy eigenbasis. We show that this split makes the coherent ergotropy of a Mach--Zehnder qubit sensitive to path predictability that the output interference fringes do not reveal. We send the path qubit, prepared as a thermal quantum battery, through two quantum-controlled interferometers built from the same elements, a fixed beam splitter and a beam splitter coherently controlled to be present or absent, differing only in the order in which these two act. The two arrangements share identical visibility, stored energy, and incoherent ergotropy at every point in the parameter space. Yet, for work extracted from the output battery alone, placing the controlled beam splitter first never yields less coherent ergotropy, and at fixed visibility and interferometric phase the difference is governed by the path predictability that this ordering creates. The same expression reappears as a purity deficit on the beam-splitter controller, so the work advantage comes with a Landauer bound on the cost of locally resetting the controller that is never larger at the same temperature. We further examine the effects of decoherence on the battery and consider a relativistic realization in which a Wigner rotation correlates the particle's spin with its path. Tracing out the spin decoheres the battery and allows the two arrangements to exhibit different coherent ergotropies even in regimes where their non-relativistic counterparts coincide. These results show that interference visibility is not a complete measure of the coherence available as work.
arXiv·2026-10-13·P. K. Tsiopa, S. S. Baturin
No generated summary available for this entry.
overview
Original abstract
We analyze fork-grating generation of electron vortex beams beyond the ideal single-mode approximation. The incident beam is described as a paraxial Gaussian ensemble with finite transverse momentum spread and a first electromagnetic Hartree phase accumulated before the grating. Within Fresnel propagation we derive an analytical expression for each diffraction order and determine the corresponding orbital-angular-momentum statistics. The mean OAM of a selected order remains fixed by the topological rule, $\langle L_z\rangle_m=mp\hbar$, while its variance is set by the residual transverse momentum spread of the beam prepared at the grating. For the Gaussian mixture, the transverse purity is $\mathcal P_{\perp,m}=[1+2(ΔL_{z,m}/\hbar)^2]^{-1}$. The observed annular profile is governed by a separate propagation-dependent blurring scale, so a beam can retain well-defined mean OAM while having low transverse purity or a partially filled vortex minimum. Within the radial phase-screen approximation, the Hartree self-field modifies the propagated profile while preserving the full-plane OAM moments and transverse purity.
arXiv·2026-10-13·Gábor Homa et al.
No generated summary available for this entry.
overview
Original abstract
Polynomial excitations consisting of creation and annihilation operators are studied. Subsystem entanglement is proven produced and preserved by such manipulations. NPT entanglement already present between any two subsystems of a general pure or mixed multipartite Gaussian state is preserved under all polynomial excitations. Nevertheless, these excitations can create NPT entanglement between initially separable subsystems, implying that the number of NPT entangled pairs cannot decrease. Polynomial excitations of a wide class of initially separable pure states are considered. For these states, the method reduces the infinite-dimensional positivity problem to a finite-dimensional one: after partial transposition, NPT entanglement is equivalent to a corresponding bilinear representation matrix not being positive semi-definite. Furthermore, using symplectic diagonalization and spectral decomposition, an explicit transformation is constructed between the Fock-space and position representations. It is applied to quadratic excitations of a three-mode mixed Gaussian state. The behavior of the NPT entanglement is tracked between subsystems as a function of a parameter $κ$, which tunes the non-locality of the excitation, and quantum negativity is evaluated. Under a chosen quadratic Hamiltonian, the resulting unitary time evolution maintains NPT entanglement for long intervals, interrupted only by short periods of PPT states. Finally, a closed analytical expression is derived for the covariance matrix of a general quadratic operator for an arbitrary number of degrees of freedom in phase space. Our framework directly connects mathematical foundations, theoretical modeling, and experimentally feasible implementations.
arXiv·2026-10-13·Chenrui Bi et al.
No generated summary available for this entry.
overview
Original abstract
Variance squeezing of a V-type atom interacting with a dissipative cavity is investigated. First, the influence of atomic initial state parameters on the variance squeezing is explored. The results show that the atomic variance squeezing switches alternately between Sx and Sy as the initial state parameter alpha sweeps from -pi to pi. The two squeezing intervals are symmetric about alpha = pi/4, each with a width of pi/2. For alpha = pi/14, only the Sx component can generate variance squeezing and will eventually disappear with time evolution due to unavoidable environmental noise. Then, the influence of system parameters on the variance squeezing is also studied. It is found that, the optical variance squeezing depth of Sx is determined solely by the atomic initial parameters and is independent of the system parameters. Both weak cavity-environment coupling and atom-cavity detuning can significantly enhance the robustness of the Sx variance squeezing. The SGI parameter has an extremely weak influence on variance squeezing. These results are beneficial for high-precision quantum communication applications.
arXiv·2026-10-13·Lukas Schleicher et al.
No generated summary available for this entry.
overview
Original abstract
Dissipation dilution has driven a revolution in the quality factors ($Q$) of top-down nanomechanical resonators. Yet it has not been leveraged for van der Waals (vdW) materials. Here we report quality factors up to $372{,}000\pm37{,}000$ in monolayer MoS$_2$ drums at 4 K, nearly an order of magnitude beyond the previous best for any vdW material at this temperature, enabled by a clean, polymer-free exfoliation technique. We develop a dissipation-dilution model for circular drums and analyze the contributing intrinsic and extrinsic dissipation mechanisms. The MoS$_2$ monolayer exhibits a dilution factor of order $1,000$, establishing sub-nanometer-thin resonators as ultimate dilution materials. The intrinsic quality factor, however, is limited by surface losses at atomic thickness. Conversely, multilayer drums show a lower dilution factor but a high intrinsic quality factor, on par with established top-down materials of similar dimensions, both resulting from the increased thickness. A two-level-system analysis of the temperature-dependent damping confirms this bulk-versus-surface picture and provides first insight into its microscopic origin. Our results identify dissipation dilution as the governing mechanism for high-$Q$ mechanical vdW resonators. Combined with strategies such as soft clamping or stress engineering, they establish atomically thin resonators as a platform for ultrahigh-$Q$ quantum transduction and sensing.
arXiv·2026-10-13·Sadia Rafi, Aeysha Khalique
No generated summary available for this entry.
overview
Original abstract
Photo-detection is a fundamental component of experimental photonics, yet theoretical models often treat detectors solely in the photon-number basis, neglecting other relevant degrees of freedom such as spectral characteristics. We present a complete quantum process model for physically realistic photodetection that incorporates both photon-number effects and frequency-dependent detector response, described through explicitly derived Kraus operators in the operator-sum representation. This formalism accommodates realistic inefficiencies, models detection within finite spectral windows, and can be directly substituted for idealized models in quantum optical analyses. The model leads to identifying the suitable detection window of the detectors relative to the spectral distribution of incident photons and conversely, in order to maximize the observability of quantum effects.
arXiv·2026-10-13·Adams Ivanov, Daniela Herrmann, Erick Giovani Sperandio Nascimento
No generated summary available for this entry.
overview
Original abstract
We report Zeus-256, a room-temperature nitrogen-vacancy (NV) diamond processor with 256 simultaneously active processor-level logical qubits arranged in a 16 x 16 array. Each logical qubit combines an NV electron-spin ensemble with nuclear-spin memory and ancillary resources. OpenQASM 2.0 circuits are transpiled into RFSoC-controlled microwave, radio-frequency, optical, timing, measurement and bus-configuration sequences. An optically programmable proprietary protein-chromophore layer with an internal metastable-triplet spin mediator provides a reconfigurable biomolecular quantum bus for local and long-range interactions. Benchmarks cover QFT, GHZ entanglement, Grover search, arithmetic, variational, neural-network, graph-state and Shor-family circuits. Factor recovery is reported for 11 integers of 8-84 bits, with 10 attempts per instance; the 84-bit endpoint uses 256 qubits and 40,250,342 reported gates, with a reported execution time of 551.694 ms. Bell-CHSH measurements yield S = 2.8008 +/- 0.0446. Three-qubit Grover search returns the marked state in 958 of 1,024 shots (93.55%), compared with an ideal reference of 94.53%. A separate 30,000-shot population-and-parity protocol yields fixed-phase GHZ+ fidelity of 99.8960%, an estimated standard error of 0.2885 percentage points and a conservative physical 95% interval of [98.2342%, 100%]. Timing metrics are partial and do not establish quantum advantage. Scaling to 9,984 processor-level logical qubits is an engineering target, distinct from the demonstrated register.
arXiv·2026-10-13·Sander Stammbach, Giulio Gasbarri, Stefan Nimmrichter
No generated summary available for this entry.
overview
Original abstract
We present a fully autonomous model of a mechanical Maxwell demon engine that converts heat absorbed by a qubit into population inversion in an attached quantum battery. A damped mechanical oscillator acts as a pointer that incorporates the essential demon function of information acquisition about the qubit state and subsequent feedback into the system dynamics, replacing external measurements and control operations. This is achieved by means of a Holstein-type Hamiltonian, which makes the pointer's equilibrium position depend on the qubit state and thereby induces a state-dependent resonance shift. The mechanism enables a selective energy transfer to an attached spin system that acts as the quantum battery. We derive both local and global Lindblad master equations for the coupled system and identify the parameter regimes in which the engine operates efficiently. The figure of merit is the resulting steady-state population inversion of the battery, quantified in terms of ergotropy. Based on these results, we discuss the necessary conditions for practical implementations of the demon engine on realistic experimental platforms.
arXiv·2026-10-13·Bowen Sun, D. L. Zhou
No generated summary available for this entry.
overview
Original abstract
Quantum devices can lose the resource needed for a specified function without entering a fixed failure subspace. We propose a resource-based reliability framework for this situation, quantifying the remaining task-relevant resource relative to a stated ideal capacity. The resource measure is selected through its operational connection to the task and the allowed operations. We develop this approach for a trusted quantum random-number generator and a calibrated two-port interferometer. Relative-entropy coherence determines the optimal asymptotic yield of standard coherent qubits under incoherent operations for the former, while logarithmic $l_1$ coherence quantifies the fringe resource of the latter and determines its calibrated correct-port probability. An exactly solvable multi-spin spin-boson model illustrates how environmental records affect these resources at the same isolated-spin dephasing strength. Collective noise preserves coherence within magnetization sectors for product inputs, but enhances the decay of Greenberger-Horne-Zeilinger branch coherence. Finite-record simulations connect the resource definitions to measurement counts and show that increasing the sample size reduces statistical fluctuations without eliminating bias from an incorrect many-spin noise model. The resulting framework provides a task-specific route to reliability assessment when a fixed failure projector is insufficient, while keeping retained resource capacity distinct from a classical survival probability.
arXiv·2026-10-13·Xiu-Zhe Luo et al.
No generated summary available for this entry.
overview
Original abstract
Quantum computers are approaching the early fault-tolerant regime. Verifying the next generation of quantum hardware requires joint emulation of the quantum processor, hardware noise, and classical control and decoding logic. We introduce the Programmable Pauli Virtual Machine (PPVM), an open-source framework for digital twins of quantum processors. PPVM unifies Pauli propagation and generalized tableau simulation under a common abstraction within a single virtual machine. Its bytecode supports arbitrary classical control flow, with measurement-conditioned feed-forward available in the generalized tableau backend. For neutral-atom hardware, we derive independent and correlated atom-loss channels and integrate them into both backends. We demonstrate loss-aware magic state distillation on over a thousand physical qubits and integration with classical decoding through Bloqade QEC Studio.
arXiv·2026-10-13·Srijan Chatterjee, Tarun Kanti Ghosh
No generated summary available for this entry.
overview
Original abstract
We uncover an intrinsic gyrotropic spin current (IGSC) driven solely by an oscillating magnetic field, arising from the spin version of Zeeman quantum geometry. Using the density matrix formalism, we derive the IGSC in the low-frequency clean limit, in terms of the Zeeman spin quantum metric and the Zeeman spin Berry curvature. The effect is studied in a minimal Rashba-Dresselhaus model that also supports intrinsic gyrotropic charge currents from the Zeeman Berry curvature. The spin and charge currents exhibit a $π/2$ phase shift and are found to be perpendicular to each other for certain parameter ranges. This not only enables spin current detection but also opens pure spin current channels for energy-efficient spintronics. We further observe that these currents switch directions between longitudinal and transverse relative to the applied field, depending on the relative strength of Rashba and Dresselhaus interactions.
arXiv·2026-10-13·Maxie Bichmann, Ludwig Schmid, Robert Wille
No generated summary available for this entry.
overview
Original abstract
Quantum error-correction code and circuit construction is an active field of research, motivating automated methods for identifying equivalent designs. We develop and evaluate automated strategies for deciding whether two descriptions of quantum error-correction codes are equivalent under specified transformations. We formalize permutation equivalence for stabilizer and CSS codes and local-Clifford equivalence for stabilizer codes within a unified framework that separates physical from representation freedom. We develop three decision strategies (group-action search, isomorphism-based methods, and constraint solving), together with invariants and signatures for preprocessing. The empirical evaluation shows that no paradigm dominates across equivalence notions, code families, and parameter ranges. We therefore combine their complementary strengths in input-dependent hybrid checkers following a staged Refute-Refine-Decide architecture. Mean hybrid runtimes remain below 10 s for most evaluated structured-code cases with $n \leq 37$; for inequivalent code instances with $n=144$, they are about 310 s for permutation and 16 s for local-Clifford equivalence.
arXiv·2026-10-13·Houan Teng, Chenhao Wan, Qiwen Zhan
No generated summary available for this entry.
overview
Original abstract
Spatiotemporal optical vortices (STOVs) are structured light featuring a phase singularity in the spatiotemporal domain, exhibiting unique topology that couples spatial and temporal dimensions. To date, amplification of STOVs remains unexplored, and their wavelength tunability is limited by available light sources. In this work, we present the theoretical analysis and experimental demonstration of optical parametric amplification (OPA) of STOVs. The pulse energy of the STOV signal is enhanced by a factor of 60, while its spatiotemporal structure is robustly preserved. The generated idler inherits the phase-conjugated STOV topology with the opposite topological charge, governed by simultaneous conservation of energy, linear momentum, and spatiotemporal orbital angular momentum. The intrinsic wavelength-conversion capability of OPA further provides a route towards spectrally tunable STOV generation, spanning from visible to near-infrared wavelength regimes. This work paves the way toward further development of multi-stage amplification architectures, facilitating applications of wavelength-tunable spatiotemporally structured light at ultrahigh intensities.
arXiv·2026-10-13·Henrique Ennes
No generated summary available for this entry.
overview
Original abstract
Trotterization is a widely used algorithm for simulating quantum evolutions and consists of approximating a target unitary through a local linear decomposition of its generator that is repeated over $N$ steps. We introduce {scheduled trotterization}, a variable-weight modification in which the coefficients of the local linear decomposition are allowed to change from step to step. Using the geometry of the Lie group of unitary operators, we express the global endpoint error as a product of transported local defects, whose leading terms are obtained by two applications of the Baker-Campbell-Hausdorff formula, one inside each local step and one between different transported defects, separating the internal Trotter error from the external accumulation error. While we recover recent tighter bounds on the global approximation error when the weights are held fixed, the new framework allows us to propose a weight-varying schedule that significantly decreases the global error. For exact infinitesimal synthesis, we prove that this improves the usual fixed-weight $O(N^{-1})$ behavior to $O(N^{-2})$, without changing the basic pulse skeleton. We also extend the framework to imperfect infinitesimal synthesis, as arises in quantum gate synthesis problems, where admissible coefficients may only approximate the desired local corrections. In this case, the error is controlled by a local covering parameter measuring the quality of the available coefficient set. Numerical experiments for random $\SU(2)$ targets further support the predicted theoretical improvements. The results suggest a novel perspective for the analysis of Trotter errors, which can be treated as schedulable quantities to be coherently canceled at the endpoint.
arXiv·2026-10-13·Xi Hu, Yan-Qiong Ma, Su-Peng Kou
No generated summary available for this entry.
overview
Original abstract
Particle exchange in two dimensions gives rise to quantum statistics beyond the boson-fermion dichotomy, with central roles in fractional quantum Hall physics, topological quantum computation, and strongly correlated quantum matter. In conventional topological phases, microscopic exchange geometry is compressed into rigid braid and fusion data. We develop a theory of non-Hermitian statistical geometry in which relaxing Hermiticity softens these exchange data into a larger complex space of spectral and relative-geometric degrees of freedom. For two adjacent braid generators, a single projective exchange spectrum is insufficient: their relative eigenline geometry supplies an additional gauge-invariant modulus. On the generic irreducible two-channel branch, braid consistency locks these coordinates through an exact spectrum-geometry relation. Using Riesz projectors and Kato transport, we realize this geometry in a five-arm Kitaev-Majorana network and test spectral and relative-geometric responses in an independent two-dimensional four-vortex Kitaev model. Finite-time dynamics tests the exchange operation, microscopic fusion sewing tests its composition across fusion descriptions, and matched-spectrum controls isolate the role of relative geometry. Nonzero projective Kato curvature shows that braid-consistent, fusion-coherent exchange can depend on the control path. Non-Hermiticity thus exposes exchange geometry, braid consistency re-locks it, fusion coherence further constrains it, and projective flatness determines when geometric exchange becomes intrinsically topological.
arXiv·2026-10-13·Jerzy Paczos et al.
No generated summary available for this entry.
overview
Original abstract
Quantum mechanics and general relativity are remarkably successful, yet their joint predictions remain beyond direct experimental reach. Photonic interferometers operating in a gravitational field offer a promising route to test this regime: gravitational redshift differentiates photon propagation between vertically separated arms, leading to a predicted phase shift and reduction in interference visibility. These effects are minute on laboratory scales, motivating existing proposals to consider large interferometer areas to accumulate them geometrically. Indeed, such schemes typically require kilometre-scale optical paths to produce appreciable interferometric signals. Here, we propose a strategy that replaces geometric accumulation with spectral enhancement by coupling the two interferometer arms to optical scatterers based on ultranarrow atomic transitions. These transitions serve as local spectral references: gravitational redshift changes the photon's detuning from each resonance, producing large differences in reflection amplitude and hence substantial visibility loss and interferometric phase shift already for centimetre-scale height differences. We quantify the experimental requirements and assess the feasibility of implementation with current or near-term technology. Our proposal thus opens a route to tabletop optical tests of the interplay between quantum mechanics and general relativity.
arXiv·2026-10-13·Nadav Schneider, Eliya Nachmani
No generated summary available for this entry.
overview
Original abstract
The distance of a quantum code is a fundamental metric that dictates its error-correction capability. While quantum low-density parity-check (qLDPC) families such as Bivariate Bicycle (BB) codes offer a promising pathway to low-overhead fault-tolerant quantum computing, computing their distance is challenging. Current exact solvers and even search heuristics that provide a distance upper bound suffer from severe computational bottlenecks, restricting the discovery of optimal codes. In this paper, we construct a dataset of BB codes with corresponding distance upper bounds obtained through high-budget heuristic searches. We introduce BB-Net, an attention-based neural network architecture for predicting the distance of BB codes. It achieves 96.39% accuracy on the reference distances in the test set, compared with 94.86% for state-of-the-art heuristics with a budget of up to $10^{4}$ times more computational runtime. On a subset with certified exact distances, BB-Net achieves 98.94%. By relieving the distance-calculation bottleneck, BB-Net enables faster screening of large code spaces, particularly in ML-driven search pipelines, and thereby can accelerate the discovery of novel quantum error-correcting codes, an important capability for advancing scalable fault-tolerant quantum computing. Our code is publicly available: https://github.com/NadavSc/BBNet
arXiv·2026-10-13·Benedikt Fauseweh
No generated summary available for this entry.
overview
Original abstract
Discrete time crystals are non-equilibrium phases of matter with spatiotemporal order and a response that breaks the time-translation symmetry of a periodic external drive. Interactions, spatial disorder and correlated random driving can in theory stabilize this order. In experiments, however, coupling to the environment limits the time crystal lifetime. Here we use stochastic local bit-flip error correction to prolong the time-crystalline response of a driven, spatially disordered two-dimensional Ising model on a superconducting quantum processor, using a repetition code with distances three and five on a honeycomb lattice with up to 68 physical qubits. Even though ancilla qubits, midcircuit syndrome measurements and decoding increase the required quantum and classical resources, the stochastic drive increases the memory decay time by a factor of up to two. At late times we observe that recovery stabilizes spatial order across the lattice. The spin-configuration distributions explain this separation, as recovery suppresses disagreeing bonds while broadening occupies completely reversed states. Syndrome measurements without correction accelerate the memory decay, demonstrating the importance of conditional correction. Our results show that local bit-flip error correction can preserve time-crystalline memory over more drive cycles than the bare dynamics.
arXiv·2026-10-13·Wen-Qiang Liu, Hai-Rui Wei
No generated summary available for this entry.
overview
Original abstract
Scalable long-distance quantum gates are essential for distributed quantum computation and scalable quantum networks. We propose an efficient scheme for implementing an $n$-qubit fan-out gate $C^n$ (also known as a controlled-NOT-$\cdots$-NOT gate) across spatially separated parties. Our protocol requires only a pre-shared $n$-qubit Greenberger-Horne-Zeilinger state, $n$ local controlled-NOT (CNOT) gates, and feed-forward operations, thereby reducing both the CNOT and Hadamard gate counts by $(n-2)$ when compared with the standard decomposition-based approach. We further develop two optical architectures to implement the heralded and post-selected $n$-photon fan-out gates, respectively. These schemes require fewer single photons resources and achieve higher success probabilities than their decomposition-based counterparts, representing significant improvements. The results indicate that our approach is experimentally feasible and pave the way toward practical long-distance quantum computation.
arXiv·2026-10-13·Pavel Svetlichnyy
No generated summary available for this entry.
overview
Original abstract
We study coherent classical shadows protocols for an unknown $d$-dimensional quantum state of rank at most $r$, allowing an arbitrary joint measurement on all available copies. For observables with operator norm at most one and centered squared Frobenius norm at most $F$, we study the minumum number of copies $T$ needed for the protocol to successed with propbability $1 - δ$. We prove a lower bound on $T$, that depends both on $δ$ and the number $M$ of post-measurement observables. Denoting $\ell=\max\{\log(2M),\log(1/δ)\}$, we show that $T=Ω\left(\min\left\{\frac{\sqrt{rF\ell}}{\varepsilon},\frac{(F\ell)^{2/3}}{\varepsilon^{4/3}}\right\}+\frac{\ell}{\varepsilon^2}\right)$ under the mild assumption $\log(2M)\lesssim d\min\{r,F\}$. The lower bound nearly matches the known upper bound and matches the conjectural strengthening of the known upper bound. The proof is inspired by the framework of the proof of the lower bound for Boolean Hidden Matching. We develop a Gaussian-lift noise kernel that transfers forward and reverse Gaussian hypercontractivity to the Grassmannian, allowing us to bound the distinguishing advantage in an auxiliary game with a revealed query observable. We use Schur--Weyl structure and posterior moment bounds to control arbitrary coherent measurements on the source side.
arXiv·2026-10-13·Orson Ye et al.
No generated summary available for this entry.
overview
Original abstract
Maximum compatibility provides a criterion for phylogenetic reconstruction in which the objective is to retain a maximum set of mutually compatible characters. For binary characters, pairwise compatibility can be represented by a weighted graph whose vertices correspond to characters and whose edges connect compatible pairs. A leading algorithm by Cherry [BMC Bioinformatics, 18(1):127, 2017] uses this representation to identify maximum compatible character sets as maximum weight cliques. We formulate the problem as maximum weight independent set enumeration on the complement graph and use deterministic postprocessing to map sampled bit strings to maximal feasible solutions. To explore the prospects of quantum computational advantage, we further construct bespoke correction-in-the-loop Quantum Approximate Optimisation Algorithm instances and find that traditional Lagrange multiplier choices may not be optimal for the enumeration problem on noisy devices. We also introduce lossless graph reductions with reconstruction rules that preserve the complete set of optimal solutions. Our results indicate that graph reduction and sampling can be effectively combined to address the enumeration bottleneck in maximum compatibility phylogeny, while retaining exact reconstruction when the residual optimum set is completely resolved. We enhance Cherry's approach to maximum compatibility by introducing graph reduction techniques and quantum sampling. Our classical benchmarks show a clear difference between finding one optimum and recovering the optimum set in practice. We demonstrate the utility of our methods on graphs constructed from SARS-CoV-2 sequences.
arXiv·2026-10-13·Ruopu Sun, Xiaofen Huang
No generated summary available for this entry.
overview
Original abstract
We investigate the ergotropy of tripartite Greenberger-Horne-Zeilinger (GHZ) and W states in the quantum atmosphere of a Schwarzschild black hole, focusing on how the extractable work is redistributed under Hawking-induced thermalization. We find that the two classes of multipartite entanglement exhibit qualitatively different ergotropy structures. For GHZ states, the ergotropies associated with different accessible subsystems organize into two degenerate families, whereas for W states they obey a linear averaging relation with no counterpart in the GHZ case. Under symmetric gravitational thermal corrections, the two GHZ families remain separated by a constant energy gap that is independent of the radial position. We further show that the Hartle-Hawking constant $D_{HH}$ and the normalized radial distance $r/r_h$ play competing roles in the evolution of extractable work: increasing $D_{HH}$ suppresses its recovery toward the asymptotic Hawking limit, while increasing $r/r_h$ enhances the ergotropy accessible to the observers. These results show that the redistribution of extractable work in a black-hole environment is governed not only by gravitationally induced thermalization but also by the structure of the underlying multipartite entanglement, providing a thermodynamic signature that distinguishes GHZ- and W-type quantum correlations in curved spacetime.
arXiv·2026-10-13·Nelson M. M. Fernández et al.
No generated summary available for this entry.
overview
Original abstract
Noise characterisation not only enables error mitigation but also provides valuable information about the intrinsic performance of a quantum device, identifying dominant error contributions and bounding noise stability well beyond the aggregated calibration data. Deploying such methods on a specific hardware topology must combine efficiency and accuracy, assess noise stability, and validate the reconstructed noise model. Here we develop and implement these methods on a superconducting processor with square-lattice topology. First, we revise the cycle-benchmarking protocol and reduce the bias arising from unlearnable degrees of freedom via a regularised cost function. Second, we extend a previously developed tensor-network tomography method to match the device layout and show how its accuracy can be improved by repeated layer execution. Both methods allow approximate sublayer noise models to be extracted from parent ones. Using noise characterisation as a tool, we map the noise structure, track drift, and validate the adequacy of the learnt noise models against experimentally observed noisy estimations in benchmark physical and chemistry circuits. These results inform further improvements in the underlying technology and provide estimates of the size of noise-mitigated circuits that the device can support.
arXiv·2026-10-13·Oscar Moreno Segura et al.
No generated summary available for this entry.
overview
Original abstract
We present a Python-based program that combines maximally localized Wannier functions-based first-principles electronic structure with the nonequilibrium Green's function formalism to enable efficient simulations of scanning tunneling microscopy (STM). The workflow builds upon standard density functional theory packages to construct compact transport Hamiltonians that preserve the properties of realistic materials. Superconductivity is incorporated via an effective pairing potential within the Nambu-spinor formalism, while coupling to the STM tip and substrate electrodes is treated using the wide-band limit approximation. Within this formulation, transport quantities such as current-voltage characteristics and differential conductance are evaluated in a closed analytical form. This avoids explicit numerical energy integrations and enables rapid spectroscopic calculations over broad parameter spaces. The framework provides a unified and computationally efficient approach for modeling superconducting hybrid nanostructures with spin-orbit coupling, magnetic textures, and spin polarization. Representative applications in spin chains, two-dimensional and molecular magnets on a superconductor demonstrate its robust capabilities for both simple model systems and realistic ab initio molecular structures relevant to modern STM experiments.
arXiv·2026-10-13·Thomas Chen, Ali Mezher
No generated summary available for this entry.
overview
Original abstract
The dynamical formation of a complete Bose-Einstein condensate and the asymptotic purification of trapped bosons coupled to a quantized radiation field are rigorously established. By tracking the macroscopic one-particle density matrix $κ_T$ through a nonlinear resonance cascade, it is demonstrated that radiative relaxation irreversibly depletes all excited trap modes, even when the initial macroscopic state $κ_0$ is genuinely mixed. Here $κ_T$ is an average, with respect to a de Finetti measure $μ_0$, over mean-field particle-field orbits, so that the mixedness of $κ_0$ reflects a statistical ensemble of orbits. Under the assumptions of a non-vanishing initial ground state component and strictly positive downward Fermi-Golden-Rule rates, strong trace-norm convergence to a pure condensate is proven, $$ \lim_{T\to\infty} \| κ_T-|χ_0\rangle\langleχ_0| \|_{\mathfrak{S}_1(\mathfrak{h})} = 0 \, . $$ Furthermore, the von Neumann entropy of the macroscopic one-particle density matrix is shown to vanish asymptotically, $$ \lim_{T\to\infty}S[κ_T]=0 \, , $$ without any claim of monotonicity in $T$. Thus, any initially mixed, positive-entropy state ($0<S[κ_0]<\infty$) is purified to the ground state $|χ_0\rangle\langleχ_0|$. For the proof, we derive the Hartree hierarchy of the coupled system of bosons and photons from the finite-$N$ BBGKY hierarchy of the microscopic quantum many-body system, establishing trace-norm convergence in the mean-field limit as $N\to\infty$. The limits are taken successively; first $N\to\infty$, then the weak-coupling limit, and finally $T\to\infty$. Although the global particle-field evolution remains unitary, the macroscopic one-particle state converges to a pure state as energy and correlations are continuously radiated into the dispersive field.
arXiv·2026-10-13·Mateusz Kwaśnicki et al.
No generated summary available for this entry.
overview
Original abstract
Spin wave theory plays a central role in the analysis of low-energy properties of the quantum ferromagnetic Heisenberg model. In this work, we present a first step towards a rigorous justification of this approximation in the context of quantum dynamics in one dimension. According to spin wave theory, the evolution of a spin wave state should be well approximated by its free evolution with the appropriate energy of free quasiparticles called magnons. Our main result establishes this idea rigorously for a class of spin wave packets. We focus on spin-$\frac{1}{2}$ systems, and consider wave packets composed of two magnons. We argue our result is optimal with respect to the timescales.
arXiv·2026-10-13·Wei-Wei Yang et al.
No generated summary available for this entry.
overview
Original abstract
Non-Hermitian dynamics possesses distinct left and right eigenstates, but their normalization freedom obscures a direct probabilistic interpretation. Starting from a globally Hermitian system governed by the standard Born rule, we generalize dynamical quantum phase transitions (DQPTs) from a reference state to a physical subspace. This generalization provides a clear probabilistic interpretation of left and right states: when each state is normalized to itself, their mutual overlap determines a directly accessible dynamical transition rate. We discuss the new phenomena governed by this emergent non-biorthogonal Born rule and further identify a class of exceptional-point DQPTs (EP-DQPTs), at which the eigenstates of the critical propagator coalesce. Our theory places the probabilistic interpretation of non-Hermitian quantum mechanics on the firm footing of Hermitian quantum mechanics.
arXiv·2026-10-13·Hyojun Ahn, Joongheon Kim
No generated summary available for this entry.
overview
Original abstract
Amplitude embedding lets a variational quantum model read many classical features with few qubits, but the model output is then only a quadratic form in the normalized input. Data re-uploading, which encodes the input repeatedly between trainable blocks, can be used to enrich such a model. Because every additional upload of an amplitude embedding repeats a costly state preparation, the gain that an upload buys has to be known before the gates are spent. This tutorial thus addresses the problem of explaining what data re-uploading adds to an amplitude-embedded model and how large the gain is. We express sequential re-uploading and parallel re-uploading with two copies in one notation and show that each upload raises the reachable polynomial order by two. Under one trainable circuit family and one budget of trainable parameters, simulation results show that re-uploading raises the test coefficient of determination from 0.689 to between 0.883 and 0.975 on targets of order four and from 0.337 to between 0.642 and 0.783 on targets of order six, on all ten seeds. On a quadratic target and on handwritten digits, one upload remains the best choice, and every additional upload lowers the gate error that the classifier tolerates. These results help designers match the number of uploads to the polynomial order of the task at hand.
arXiv·2026-10-13·C. -Y. Lee et al.
No generated summary available for this entry.
overview
Original abstract
We theoretically investigate single-photon coherent transport through a finite waveguide quantum electrodynamics (QED) array with spatially modulated emitter-waveguide couplings. By combining exact scattering calculations with spectral factorization and a semiclassical WKB analysis, we identify how the coupling profile controls the reflection bandwidth and its finite-size dependence. A Gaussian transverse displacement produces an exponential-of-Gaussian decay-rate profile that broadens the high-reflectivity window and suppresses the boundary-induced Fabry-Perot oscillations compared with a uniform array. The transmission zeros remain exactly degenerate at the atomic resonance for arbitrary positive coupling profiles at non-Bragg spacings. In contrast, the collective poles reorganize under the spatial modulation, redistributing their radiative widths and preventing individual subradiant resonances from terminating the reflection window. We further derive an algebraic 1/N scaling law for the contraction of the bandwidth toward its bulk value. The bulk bandwidth is determined by the largest local decay rate, whereas the finite-size correction increases as the profile becomes sharper, leading to an optimal profile width. These results establish spatial coupling engineering as a practical tool for designing broadband atomic mirrors in atom-nanofiber and circuit-QED platforms.
arXiv·2026-10-13·Matas Garbaravičius, Michael M. Wolf
No generated summary available for this entry.
overview
Original abstract
Any pair of sufficiently generic Hamiltonians on $\mathbb{C}^d$ generates the full unitary group, i.e., any $W\in U(d)$ can be synthesized to arbitrary precision by alternating between the two evolutions for suitably chosen durations. For any given pair of Hamiltonians, the minimal number of switches required to cover the entire group is at least $d$ and unbounded in general. Despite this, we show that it scales linearly in $d$ in expectation. Assuming that the two spectra are sufficiently generic, we derive constructive upper bounds on the minimal switching number as a function of the change-of-basis matrix between the two eigenbases. In particular, if this matrix has a column whose entries all have equal moduli, as for a complex Hadamard matrix, then $9d$ switches suffice to reach every unitary. To obtain these results, we construct a short exact representation of any unitary as a product of unitaries that are alternately diagonal in two given bases. All bounds are extended to non-generic spectra and bounded evolution times.
arXiv·2026-10-13·Ryo Tatsumi, Le Bin Ho, Hiroaki Matsueda
No generated summary available for this entry.
overview
Original abstract
Level crossings, where two quantum energy levels intersect, are ubiquitous in quantum systems and play a central role in controlling quantum dynamics. In this study, we establish a framework that connects these level crossing structures to the ultimate precision limits of quantum metrology. By analyzing a Hamiltonian with the level crossings structure, we identify the conditions under which multiple parameters can be estimated simultaneously with maximal sensitivity near the level crossing point. We then construct a resource efficient sensing protocol based on unitary quench dynamics and Bayesian estimation, enabling high precision, low cost parameter estimation without requiring entanglement or complex control. We present a protocol whose estimation precision saturates the Holevo Cramer Rao bound, the tightest achievable precision bound in multi parameter estimation. Using the two level model and the two spin Ising model as illustrative examples, we demonstrate how the protocol can be applied to a system with level crossing Hamiltonian structure. Our findings reveal that level crossings serve as universal operating points for precision quantum metrology, offering a simple and scalable path toward practical multi parameter sensing across diverse quantum platforms.
arXiv·2026-10-13·Swarnabha Chattaraj, Anupam Madhukar
No generated summary available for this entry.
overview
Original abstract
Boson sampling with array of on-demand single photons (discreet variable Fock states) as resource states provides distinct advantages in complexity scaling compared to single photon resource states mimicked by the states (continuous variable) generated in nonlinear photonics. Recent progress in realization of regular ordered array of mesa top single quantum dots (MTSQDs) enabling on-demand generation of many photon resource states with high single photon purity and indistinguishability [1,2] has opened the possibility of implementing chip-scale Boson sampling with single photons. An important question towards scale up of such circuits is how the dephasing and decay timescale of individual on-demand single photons affect the final probability distribution of the N-photon entangled state. In this work we report a framework that provides direct link between the physical sources of decoherence to the outcome of multiphoton correlation measurements. We explicitly incorporate the symmetrization of the N-photon states while accounting for the shape of the individual wave packets and dephasing. Using this framework, we show predictive estimates of the probability of generation of a 4-photon NOON state using an optical circuit initialized with 4 identical single photon wave packets, mimicking the emitted photons from MTSQD single photon sources reported in [2]. Specifically, we show how the probability of generating various 4-photon entangled states depend on the two-photon interference visibility which is determined by the pure dephasing timescale in relation to the radiative decay timescale. The results provide quantitative guidelines to measure 4 photon and higher number of entangled photon states generated in an optical circuit with on demand single photon sources and provide a link between physical processes such as temperature and the output state of the quantum optical circuits.
arXiv·2026-10-13·Hyunwoo Kim, Youngseok Lee
No generated summary available for this entry.
overview
Original abstract
Variational quantum algorithms utilize parameterized circuits many times during training, at new parameter values, over batches of data, and with gradients. Pauli propagation approximates the expectation values of such circuits classically by evolving the observable in the Heisenberg picture as a truncated sum of Pauli strings. We present PADO-Pauli, a GPU engine for Pauli propagation that compiles a circuit and its observables once into sparse matrices in which each rotation angle contributes only a cosine and a sine factor, so every later evaluation reuses the compiled program. It evaluates batches of parameters and data inputs embedded as rotation angles. By default its gradients come from a vector-Jacobian product registered with PyTorch's automatic differentiation, so they flow through the angles to any classical layer that produces them. PADO-Pauli also provides truncation by Pauli weight and coefficient size, and noise channels. Zero-filtering removes terms that do not contribute to an expectation value in the all-zero reference state and makes the batched forward pass about 1.5 times faster. Compared to cuPauliProp on an NVIDIA A100, PADO-Pauli evaluates up to 10 times faster on 4 to 12 qubits and uses up to 3.1 times less memory on 16 qubits. We check its accuracy against exact statevector simulation up to 28 qubits. These features make PADO-Pauli a practical toolkit for training variational quantum algorithms, including quantum machine learning models.
arXiv·2026-10-13·Yu Yamaoka, Weng Ian Chan, Kosuke Mitarai
No generated summary available for this entry.
overview
Original abstract
Quantum Machine Learning (QML) has a theoretical advantage over classical algorithms for specific synthetic data that is computationally hard. However, it remains unclear whether such theoretical advantages play a meaningful role for realistic classical data, such as natural images. Quantum structural properties induced by unitary operations or entanglement introduce inductive biases that differ from those of classical models, potentially leading to distinct learning behavior on real-world data. In a fully quantum learning pipeline, classical real-world data are first encoded into quantum states via a quantum feature mapping, analogous to a classical feature extractor, and a quantum classifier then classifies the resulting states. Quantum feature mappings generate representations that are difficult to realize classically, while also inducing representation-level biases that do not necessarily match the structure of realistic data. To enable a fair comparison at the classifier level, we focus on the classifier and use classical feature extractors that already provide powerful representations for natural images. By controlling the data scale and supervision strength, we analyze how the unitary structure of quantum classifiers affects generalization, and show that their effectiveness depends strongly on the geometry of the input representations. These results indicate that quantum classifiers benefit from classical features that are aligned with quantum feature spaces. Our analysis shows that kernel alignment identifies representations compatible with quantum feature spaces, providing insights into translating classical models into quantum algorithms.
arXiv·2026-10-13·Yuanjie et al.
No generated summary available for this entry.
overview
Original abstract
Practical quantum programs interleave quantum and classical computation: classical data shape the quantum operations that are performed, and measurement outcomes shape the classical computation that follows. Formal verification of such programs in a proof assistant requires mechanizing a program logic that handles this interplay consistently at every level, from the mathematics of quantum mechanics, through program syntax and semantics, to specifications and proof rules. Such mechanizations, along with the program proofs built on them, typically require substantial manual effort. We present QEDIA, a framework for verifying quantum programs with classical variables in Lean 4. At its foundation is an open library that formalizes the quantum Hoare logic QHL+ across all these levels and proves the logic sound for both partial and total correctness. We construct the library and the program proofs, under human supervision, using an LLM-based prover agent, whose general-purpose core we extend for quantum program verification. We illustrate QEDIA with verified programs including the quantum Fourier transform, phase estimation, repeat-until-success circuits, and Hamiltonian simulation.
arXiv·2026-10-13·Jeremy B. Maddox et al.
No generated summary available for this entry.
overview
Original abstract
Gaussian wave packets provide an exact analytical foundation for modeling time-dependent quantum phenomena, effectively bridging the gap between classical trajectories and full quantum mechanics. We introduce GWPTools, a highly extensible Wolfram Language framework designed to compute exact time-dependent Gaussian wave packet dynamics using a unified symbolic-numeric architecture. Built upon a robust ``parameter bus'' and polymorphic dispatch, the software serves as an interactive pedagogical tool for exploring quantum theory and an exact algebraic engine for rigorously benchmarking numerical grid-based and trajectory methodologies. Version 1.0.0 focuses on exact time evolution in driven one-dimensional quadratic potentials. Native extensions into quantum hydrodynamics and phase space representations enable exact energy decompositions, analytical Bohmian trajectories, and symbolic derivations of quasi-probability distributions and information metrics. We demonstrate the framework's modular scalability by prototyping interference in superpositions, open-system decoherence, and coupled two-dimensional oscillators. Ultimately, these capabilities establish a versatile foundation for maximizing the reach of exact analytical modeling toward increasingly complex driven quantum systems.
arXiv·2026-10-13·Li-Wen Zhang et al.
No generated summary available for this entry.
overview
Original abstract
Achieving measurement precision beyond the standard quantum limit (SQL) is a fundamental object in quantum metrology. In this manuscript, we propose a streamlined protocol for weak signal sensing in a trapped-ion spin-oscillator system that simultaneously exploits detuned motional squeezing and spin-oscillator entanglement. By combining these two quantum resources, the phase accumulation in this spin system is significantly accelerated, as a result achieving an exponential improvement in the sensitivity over unsqueezed cases. Remarkably, we show that the significant metrological gain provided by our protocol persists in noisy environments, with the sensitivity remaining below the SQL. In particular, our protocol retains a distinct advantage in the short interrogation time regime, thus demonstrating the practical potential in quantum-enhanced sensing.
arXiv·2026-10-13·Zekun Ye
No generated summary available for this entry.
overview
Original abstract
We study the number of uniform quantum examples needed to exactly learn a Boolean function with at most $k$ nonzero Fourier coefficients. We give a learner with near-optimal $\widetilde{O}(k)$ sample complexity independent of the input length $n$. The learner uses only separate measurements of individual examples. This improves the previous $O(k^{3/2}\log^2 k)$ upper bound (Arunachalam, Chakraborty, Lee, Paraashar, and de Wolf, 2021). The main ingredient is a candidate set formed by symmetric differences of subsets from independent groups of Fourier samples. A multilinear majority polynomial combines unbiased random approximations into an accurate witness whose Fourier support lies in this set. Granularity then forces the set to contain the entire Fourier support, including subsets never directly sampled. For comparison, we derive the tight classical sample complexity $Θ(nk)$ by combining known sparse-recovery and lower-bound results.
arXiv·2026-10-13·Huijie Guan et al.
No generated summary available for this entry.
overview
Original abstract
When used as function approximators, quantum circuits often lack interpretability and face a fundamental trade-off between expressivity and trainability. We propose a problem-informed framework for financial return generation that uses relational structure and symmetry-inspired parameter sharing to guide the construction of quantum circuits with few trainable parameters and empirically testable operator roles. We evaluate three quantum generator architectures, referred to as ZZ, directed ZZ-CRX, and structured time evolution, within a hybrid Wasserstein quantum generative adversarial network trained to generate 16-step Bitcoin return windows. Across circuits with one to four layers and one to eight trainable coefficients, these generators recover meaningful marginal and temporal distributional features, while single-layer configurations remain competitive with deeper variants. Across matched depths, independently trained ZZ-CRX configurations exhibit a predominantly downward shift in median leverage relative to ZZ, consistent with the intended directional role of the controlled-rotation construction. The small number of coefficients also enables direct landscape analysis, revealing competing parameter preferences between marginal and temporal objectives and helping to explain the difficulty of finding parameter settings that perform well on both. These results provide an initial demonstration that structural assumptions can guide the design of compact quantum generators and link circuit architecture to observable statistical behaviour, motivating more systematic and parameter-efficient approaches to quantum circuit construction.
arXiv·2026-10-13·Hunter Nelson et al.
No generated summary available for this entry.
overview
Original abstract
Fault-tolerant quantum computation requires error-correcting codes that not only protect quantum information but also support useful logical operations with practical physical realizations. Here we develop a general framework in which the stabilizer syndromes of commuting Pauli rotations directly organize logical-gate design. We derive an exact codespace-preservation condition valid at arbitrary rotation angles, providing a common stabilizer-level description for CSS and non-CSS codes and for both Clifford and non-Clifford operations. A particularly useful equal-syndrome specialization reduces Clifford gate design to stabilizer factorization, yields a general generator weight bound of $\lceil d/2\rceil$ for distance-$d$ codes, and systematically extends to logical rotations higher in the Clifford hierarchy. Applied to bivariate-bicycle (BB) and non-CSS Mirror qLDPC codes, the framework gives explicit low-weight Clifford and controlled-phase gates. Our implementations yield new low-weight gates, including an addressed $T$ gate on the $[[16,4,4]]$ BB code, $T$-type rotations on the $[[64,8,8]]$ BB code, and CCZ-, CS-, and $T$-type operations on the $[[36,6,6]]$ Mirror code. We also develop analytic constructions using Clifford algebra bases, which turn the syndrome constraints into explicit algebraic relations and provide a systematic route to logical addressability. We use this approach to analytically construct addressed CNOT, SWAP, controlled, and CCZ-type gates on recursive hypercube codes. An independent construction on middle quantum Reed--Muller codes yields C${}^r$Z gates that saturate the equal-syndrome weight bound. These results establish stabilizer syndromes as a constructive link between the stabilizer structure of a quantum code, the logical computations it can directly support, and the fault-tolerance properties of their physical realizations.
arXiv·2026-10-13·Y. -J. Shen et al.
No generated summary available for this entry.
overview
Original abstract
Charger-mediated quantum batteries offer promising opportunities for efficient energy transfer and storage at the quantum level, with potential advantages beyond their classical counterparts. Here, we theoretically demonstrate that nonlinear charger-battery interactions can substantially accelerate the charging of quantum batteries. In the weak-driving regime, sufficiently strong nonlinear coupling can dominate over the effect of dephasing and significantly reduce the charging time. In the strong- and optimal-driving regimes, where the optimal driving strength maximizes the steady-state ergotropy in the linear-coupling regime, nonlinear coupling gives rise to a new optimum in the charging time beyond that of the linear-coupling regime, accompanied by nearly critically damped dynamics. Remarkably, even in the absence of external driving, nonlinear coupling alone can substantially reduce the charging time, providing an alternative route toward fast battery charging. Our results establish nonlinear charger-battery coupling as an effective resource for accelerating quantum-battery charging and broaden the scope of interaction-enabled quantum advantages in energy transfer and storage.
arXiv·2026-10-13·Xuanran Zhu et al.
No generated summary available for this entry.
overview
Original abstract
Constructing optimal entanglement witnesses for arbitrary quantum systems remains a formidable challenge, hindered by the structural complexity of high-dimensional quantum state spaces. In this work, we overcome this barrier by introducing a unified framework for constructing geometrically optimal witnesses capable of identifying arbitrary entanglement structures. By leveraging the geometric properties of a target quantum state relative to a specific entanglement structure in Hilbert-Schmidt space, these witnesses are constructed in an efficient and effective manner. Among all nontrivial witnesses, they provide maximal distinguishability between the target state and the set of states without the desired entanglement structure. As a result, our approach enables the universal detection of bipartite, multipartite, and high-dimensional entanglement. To demonstrate its experimental feasibility, we apply the framework to a four-qubit nuclear spin quantum system. Compared to existing methods, our approach offers enhanced noise robustness, broader detection universality, and improved construction efficiency, providing a powerful and versatile tool for advancing the characterization and understanding of entanglement in quantum systems.
arXiv·2026-10-13·Yue Li et al.
No generated summary available for this entry.
overview
Original abstract
Leading quantum platforms are largely limited to one or two dimensions, whereas three-dimensional Coulomb crystals of trapped ions self-assemble into dense qubit arrays with no rearrangement overhead. Coherent optical control of such crystals has nonetheless been out of reach, because the optical transition couples to nearly all $3N$ collective modes, i.e., a thermally occupied quasi-continuum bath. Here we cool about 3,600 modes of a crystal of over 1,200 ions below single-phonon occupation, using a continuous cooling band that spans more than five octaves in vibrational spectrum, from about 50 kHz to 2.1 MHz. The crystal then serves as a register of optical qubits, allowing global initialization, coherent manipulation and collective detection. We demonstrate ensemble optical coherence of 21.6 milliseconds and reduce the optical-transition frequency uncertainty from 389 Hz for a single ion to 12 Hz for over a thousand ions, approaching the expected projection-noise scaling. Our approach could be extended to even larger crystals with phonon-mediated many-body couplings, opening a route towards entanglement-enhanced precision metrology and three-dimensional quantum simulation, particularly with spatial-shaped illumination for region-resolved collective control.
arXiv·2026-10-13·Mert Gökduman, Cyril Guyot, Henry D. Pfister
No generated summary available for this entry.
overview
Original abstract
We introduce a parallel decoder for quantum low-density parity-check (QLDPC) codes based on probabilistic bits (p-bits), tunable stochastic binary units controlled by local fields. The idea is that predicted error configurations, interpreted as explanations of the observed syndrome, are updated stochastically using local Gibbs conditionals, while a progressively strengthened parity penalty drives the search toward syndrome-valid configurations. A coloring of the decoding graph enables parallel block updates, and independent replicas and restarts provide trajectory diversity. The best candidate encountered during the search is returned, mirroring the candidate-selection strategy of recent ensemble decoders. At the stated update budgets, the resulting logical error rates are on par with leading decoders under both code-capacity and circuit-level noise. While the total number of variable resamplings can be substantially larger than the message-update count of BP-based alternatives, the numerical results establish constraint-annealed p-bit dynamics as a competitive stochastic alternative for QLDPC decoding and motivate further study of hardware-native implementations.
The Quantum Insider·2026-10-12·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief IonQ has agreed to acquire cybersecurity company Elisity in an all-stock deal worth up to $1.3 billion, according to The Wall Street Journal. Elisity provides software designed to prevent attackers and ransomware from spreading through organizational networks, with customers including health care companies and hospitals. IonQ CEO Niccolo de Masi said the acquisition aims to help customers address growing cybersecurity risks associated with AI and quantum computing. IonQ has agreed to buy cybersecurity company Elisity in an all-stock deal worth up to $1.3 billion, expanding its security business as advances in quantum computing and artificial intelligence raise concerns about cyberattacks. The transaction includes up to $150 million in additional payments tied to Elisity’s future performance, executives told The Wall Street Journal . IonQ Chairman and CEO Niccolo de Masi told the newspaper that the acquisition reflects his expectation that companies will need stronger defenses as both technologies become more powerful. “With Elisity and its team as part of IonQ , we will be well positioned to help customers protect critical infrastructure and enterprise networks throughout the transition to the quantum era. As I said first, Q-Day is coming much faster than predicted. IonQ is offering its customers a vertically integrated full-stack quantum platform across quantum computing, networking, sensing and cybersecurity. Just as adding SkyWater Technology expanded IonQ’s capabilities in chip design, fabrication and packaging, Elisity will bring proven enterprise policy enforcement scale and deployment experience to our quantum security strategy and will give IonQ a strong growth platform to serve customers and create value for our shareholders,” Niccolo de Masi, Chairman and CEO of IonQ, said in a statement . Elisity, founded in 2019, provides software designed to stop attackers and ransomware from spreading through an organization’s network. Its major customers
Phys.org Quantum Physics·2026-10-12
No generated summary available for this entry.
overview
Original abstract
Researchers from Rutgers, IBM and collaborating institutions have shown that a quantum computer can check what is happening inside it and respond while it is running, repeatedly resetting parts of the system to bring chaotic behavior under control.
The Quantum Insider·2026-10-12·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Oxford physicists used a hybrid quantum computer combining qubits and quantum oscillators to observe the Aharonov–Bohm effect in a simulation of interactions between matter and gauge fields. Encoding magnetic flux in entangled qubits caused destructive interference between two paths around a simulated loop, completely suppressing a matter particle’s tunnelling. The study demonstrates how hybrid quantum systems can simulate fundamental interactions that become increasingly difficult to model on classical computers. Image: Artist’s illustration of the loop formed by the hybrid quantum system. (Dr Helene Hainzer, Dr Sebastian Saner, Dr Gabriel Araneda and Dr Oana Bazavan.) PRESS RELEASE — Physicists in the Department of Physics, University of Oxford , have used a hybrid quantum computer, formed by qubits and quantum oscillators, to observe the Aharonov-Bohm effect in a quantum simulation. The effect is a quantum phenomenon in which a particle can acquire a measurable phase by travelling around a magnetic flux, even though it never passes through a region where a magnetic field is present. The result demonstrates how hybrid quantum systems can be used to simulate interactions between matter and gauge fields that become increasingly difficult to model on classical computers. The paper has been published in Nature Physics . In classical, everyday physics, the motion of a charged particle is determined locally by the electric and magnetic fields it encounters. Quantum mechanics allows a more subtle effect. In 1959, physicists Yakir Aharonov and David Bohm predicted that a charged particle travelling around, rather than through, a region containing a magnetic field would still pick up a measurable trace of that field’s presence. This became known as the Aharonov–Bohm effect, and it was later confirmed in experiments with real electrons. Physicists are now interested in seeing the effect emerge in a different setting: lattice gauge theories. T
Quantum Computing Report·2026-10-12·Doug Finke
No generated summary available for this entry.
overview
Original abstract
Yuval Boger speaks with Walter Raquet, Chairman and CEO of Symmatrics, a company that has revived the one-time pad symmetric key encryption concept — once used exclusively by US intelligence agencies — and brought it to the internet age using quantum random number generators. The post Podcast with Walter Raquet, Chairman and CEO of Symmatrics appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-12·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
IonQ researchers have developed a new hybrid physical/logical execution strategy for quantum error correction, significantly accelerating fault-tolerant quantum computing. This approach, detailed in a recent arXiv paper, utilizes scheduled qLDPC error correction and an adapted Logical Clifford Noise Reduction (CliNR) scheme. The innovation has achieved speedups of up to 74-fold for logical Clifford operations and up to 5-fold for logical Toffoli gates, addressing the operational latency bottleneck in quantum computing. The post IonQ Demonstrates Scheduled qLDPC Error Correction to Accelerate Fault-Tolerant Gate Execution by up to 74x appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-12·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief WISeSat.Space is developing a satellite communications and IoT security architecture that integrates post-quantum cryptography (PQC), digital identity, and cryptographic key management across connected devices, ground infrastructure, and future satellite platforms. The company plans to draw on SEALSQ’s QS7001 and QVault TPM platforms, which support NIST-standardized algorithms ML-KEM and ML-DSA, as it develops its Quantum Spatial Orbital Cloud. WISeSat.Space has access to nine active low-Earth-orbit satellites and targets a 100-satellite sovereign constellation by 2033, subject to financing, technical development, regulatory approvals, and launch availability. PRESS RELEASE — WISeSat.Space (Nasdaq: SAIQ) (“WISeSat.Space” or the “Company”) today outlined its strategy to integrate post-quantum cryptography (“PQC”) into its next-generation satellite communications and Internet of Things (“IoT”) architecture, supporting the migration objectives established by U.S. Executive Order 14412, Securing the Nation Against Advanced Cryptographic Attacks. The Company is developing a security architecture designed to protect communications, digital identities and satellite operations against both conventional cyberattacks and emerging quantum-computing threats. Its approach combines post-quantum semiconductor technologies from its sister company, SEALSQ Corp.’s (Nasdaq: LAES) with trusted digital identity and cryptographic key management across connected devices, ground infrastructure and future satellite platforms. “Security is a core differentiator in our strategy to build a satellite communications business serving governments, enterprises and critical infrastructure operators,” said Carlos Moreira, Founder and CEO of WISeSat.Space. “As satellites become increasingly critical infrastructure for our digital economy, protecting them throughout their operational lives is central to our value proposition. Our ambition is to bring trust into every layer, from the
The Quantum Insider·2026-10-12·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief SEALSQ has unveiled VaultIC409, a secure element built on its QS7001 platform to support post-quantum cryptography in connected devices without requiring customers to redesign their existing hardware security architecture. VaultIC409 is designed to support ML-KEM (FIPS 203), ML-DSA (FIPS 204), RSA and ECC, with a hardware Root of Trust, dedicated cryptographic acceleration and SPI connectivity. SEALSQ plans to demonstrate VaultIC409 using a TLS 1.3 application at Electronica from November 10–13, 2026, with engineering samples expected in Q2 2027; the underlying QS7001 platform is undergoing Common Criteria EAL5+ certification. PRESS RELEASE — SEALSQ Corp (NASDAQ: LAES) (“SEALSQ” or “Company”), a company that focuses on developing and selling Semiconductors, PKI, and Post-Quantum technology hardware and software products, today unveils VaultIC409, a next-generation secure element designed to help hardware manufacturers address the growing cybersecurity challenges posed by quantum computing. Built on SEALSQ’s QS7001 platform, which is currently undergoing Common Criteria EAL5+ certification process, VaultIC409 targets the same established markets as VaultIC408, giving existing customers a path to post-quantum security without redesigning their hardware security foundation. As quantum computing advances, traditional cryptographic algorithms such as RSA and ECC face the prospect of becoming vulnerable to future quantum attacks. At the same time, the transition toward Post-Quantum Cryptography (PQC) introduces new requirements for embedded hardware, including larger cryptographic keys, longer certificates, increased data exchange and more demanding computational workloads. VaultIC409 combines a hardware-based Root of Trust, cryptographic agility, dedicated cryptographic acceleration and Serial Peripheral Interface (SPI) connectivity to provide a scalable foundation for the next generation of secure connected devices. Vaul
Phys.org Quantum Physics·2026-10-12
No generated summary available for this entry.
overview
Original abstract
Magnetic fields are invisible yet essential components in technologies ranging from MRI scanners and particle accelerators to atomic clocks and future quantum computers. Each of these applications requires magnetic fields with specific shapes and properties. Today, creating such tailored magnetic fields requires researchers and engineers to design specialized, carefully optimized magnets or large systems of coils for each individual application—a complex and resource-intensive process.
The Quantum Insider·2026-10-12·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Rensselaer Polytechnic Institute (RPI) has appointed James Misewich as the Curtis R. Priem Quantum Computing Constellation Chair, effective January 1, 2027. Misewich will help lead RPI’s quantum strategy, expand collaboration with Brookhaven National Laboratory, and support research spanning quantum computing, materials science, and related technologies. He will retain a joint appointment at Brookhaven, where he serves as Associate Laboratory Director for Energy and Photon Science and is a founding leader of the Co-design Center for Quantum Advantage (C2QA). PRESS RELEASE — Rensselaer Polytechnic Institute (RPI) today announced the appointment of James Misewich, Ph.D., as the Curtis R. Priem Quantum Computing Constellation Chair, effective January 1, 2027. A nationally recognized leader in energy, materials, and quantum science, Misewich will help lead RPI’s quantum strategy, including expanding connections with Brookhaven National Laboratory, and support the development of a growing quantum ecosystem spanning academia, government, and industry. He will join the faculty of RPI’s Physics, Applied Physics, and Astronomy in the School of Science. “Few scientists have done more to connect breakthrough quantum research with the partnerships needed to turn findings into impact,” said RPI President Martin A. Schmidt ’81, Ph.D. “I am confident that Jim’s arrival will accelerate our efforts in quantum computing, expand opportunities for our students and researchers, and strengthen RPI’s role in shaping the next generation of technological innovation.” “New York has emerged as one of the nation’s most important centers for quantum breakthroughs,” said John E. Kelly, III, M.S. ‘78, Ph.D. ‘80, D.H.L. (Hon.), chair of the RPI board of trustees and retired IBM executive vice president. “Jim has been at the center of that ecosystem for years, helping advance the full quantum computing stack, from fundamental science and materials discove
Phys.org Quantum Physics·2026-10-12
No generated summary available for this entry.
overview
Original abstract
Recent research shows that gravity and quantum information are deeply connected and that the shape of spacetime can be traced back to the way information is stored in quantum fields.
Phys.org Quantum Physics·2026-10-12
No generated summary available for this entry.
overview
Original abstract
Many of nature's most important processes depend on how particles of matter interact with light and other force-carrying particles. So far, however, it has proven difficult for conventional computers to determine how individual particles behave in these interactions.
AWS Quantum Computing·2026-10-12·Benchen Huang
No generated summary available for this entry.
overview
Original abstract
Practical quantum computing is hybrid: a quantum processing unit (QPU) executes a classically hard subroutine whose problem structure is amenable to quantum methods, while classical resources handle the surrounding computation. What varies across quantum algorithms is the workflow pattern: how the computation is distributed, what communication is needed, and how the data flows. Variational algorithms such as the Variational Quantum Eigensolver (VQE) and the Quantum Approximate Optimization Algorithm (QAOA) interleave quantum circuit evaluations with a classical optimizer, exchanging data back and forth in a closed loop. Canonical algorithms like Quantum Phase Estimation and Shor’s algorithm, by contrast, concentrate most of the work in a deeper quantum circuit with comparatively little classical processing. Over the past few years, a third group of algorithms has been gaining popularity by decoupling the quantum and classical subroutines into sequential steps. Instead of an optimization loop, these algorithms collect a batch of measurement samples from a QPU and then feed them into classical post-processing that can be computationally demanding, often requiring HPC-scale resources. The quantum-classical auxiliary-field quantum Monte Carlo (QC-AFQMC) algorithm and the sample-based quantum diagonalization (SQD) algorithm are two prominent examples. Orchestrating such workflows can be challenging: a single run spans heterogeneous resources that scale independently and must execute in sequence, with each step consuming the output of the previous one. Coordinating these steps with custom scripts and manual polling is error-prone and difficult to operate and monitor, and few off-the-shelf tools manage an end-to-end lifecycle that spans quantum and classical services. In this post, we show how to run hybrid quantum classical workflows by integrating Amazon Braket and AWS Batch into a scalable compute pipeline orchestrated with AWS Step Functions. To give a practical exampl
Quantum Computing Report·2026-10-12·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
IonQ is set to acquire Elisity for up to $1.3 billion in an all-stock deal, integrating Elisity's Zero Trust cybersecurity with IonQ's post-quantum cryptography. This acquisition, expected to close in Q4 2026, aims to enhance IonQ's security offerings, addressing "harvest now, decrypt later" vulnerabilities and federal PQC mandates. Elisity will operate as a subsidiary, retaining its brand and management. The post IonQ to Acquire Elisity for Up to $1.3 Billion to Integrate Zero Trust with Post-Quantum Cybersecurity appeared first on Quantum Computing Report .
Nature: Quantum Information·2026-10-12
No generated summary available for this entry.
overview
npj Quantum Information
·2026-10-12
·Konstantinos Gkouliaras et al.
·doi
No generated summary available for this entry.
overview
npj Quantum Information
·2026-10-12
·Eugen Coroi, Changhun Oh
·doi
No generated summary available for this entry.
overview
arXiv·2026-10-12·Tristan Zerweck, Juan Carrasquilla
No generated summary available for this entry.
overview
Original abstract
In condensed matter physics, scientists explore phase diagrams of matter through various methods (analysis, numerics, experiment) and achieve consensus when enough methods agree. The quality of variational results for quantum many-body ground states is mainly judged by energy values and respective errors. Here, we present QMBL, the Quantum Many-Body Leaderboard (https://www.qmbl.org), serving as the energy layer of the scientific consensus. It is a maintained, interactive record of published ground-state energies for lattice Hamiltonians. The latest release v0.4.0 holds 1434 energies on 395 instances of six model families and collects all of the community's efforts into one view. Of those instances 153 have no exact solution and any new record serves as a direct improvement to an open science problem. They are the targets of a companion benchmark, QMBL: Open Problems.
arXiv·2026-10-12·Samuel Bevins
No generated summary available for this entry.
overview
Original abstract
We give an explicit construction proving that the exact stabilizer rank of $m$ copies of the qubit face-center magic state is $O(2^{3m/8})$. Two symmetry-related fifteen-term identities combine into a twenty-four-term decomposition at twelve copies. The balanced structure of this decomposition yields a substitution that adds eight copies at a cost of eight terms per existing term. The resulting bound $γ_T \leq 3/8$ improves the previously published exponent $\log_2(3)/4$.
arXiv·2026-10-12·Shuo Ma et al.
No generated summary available for this entry.
overview
Original abstract
Optical lattice clocks in space could improve satellite navigation systems and enable new tests of fundamental physics, including gravitational-wave detection and tests of relativity. In microgravity, atoms can tunnel to degenerate neighboring lattice sites, broadening the clock transition and limiting coherence times. We demonstrate Aubry-André localization in a bichromatic optical lattice formed by two magic-wavelength lasers, suppressing tunneling in a horizontal lattice clock emulating free fall. We recover a Fourier-limited clock Rabi spectrum and measure Ramsey coherence times of up to 2 s in shallow lattices, with up to 100-fold improvement over the delocalized regime. These results establish Aubry-André localization as a practical route to controlling tunneling in future space-based clocks, and open a path to operating terrestrial clocks at shallower lattice depths.
arXiv·2026-10-12·Andrew Laeuger, Nancy Aggarwal
No generated summary available for this entry.
overview
Original abstract
Cavity optomechanical models typically treat a sensor either as a perturbative polarizable object in a pre-existing optical field, or solve the field at a fixed equilibrium and linearize in a fixed optical-mode basis. Neither self-consistently determines the spatially resolved cavity field, the optical force, the mechanical equilibrium, and the back-action when a finite-thickness dielectric plate intercepts the entire optical mode and restructures the intracavity field. In this companion paper to [1], we develop that treatment by extending the vacuum two-photon formalism to finite-thickness planar dielectrics, incorporating their Fresnel reflection, internal propagation, optical forces, and mechanical back-action directly into the field equations. We derive the carrier and sideband transfer functions needed to describe the coupled optical-mechanical system, including optomechanical cooling and the response to external perturbations. The result is a systematic starting point for calculating detector response and noise budgets for cavity experiments with intracavity dielectrics, including gravitational wave detectors deploying levitated sensors.
arXiv·2026-10-12·Praveen Balaji, Patrick Draper, Enrico Rinaldi
No generated summary available for this entry.
overview
Original abstract
Quantum computing may allow unprecedented access to nonequilibrium quantum dynamics, including problems of interest in particle physics, like the real-time development of scattering processes. Although fault-tolerant simulations at scale are still in the future, recent advancements toward early fault-tolerant simulations motivate building increasingly elaborate benchmark problems in order to assess state-of-the-art capabilities and test new algorithms and observables. In this work, we study glueball scattering on a line-of-plaquettes lattice in pure $SU(3)$ lattice gauge theory. We characterize scattering of the lowest-energy glueball states using classical exact diagonalization methods, identifying the continuum resonance structure using real-time simulations and approximate analytic methods, and we propose time-domain observables for extracting properties of the resonance from quantum simulations. We furthermore construct a toy model that shares the spectral features of the lattice gauge theory and demonstrate extraction of the observables. Feasibility on near-term hardware is demonstrated through simulation of a resonant collision of this toy model on Quantinuum System Model $\texttt{H2-2}$, with a 14-plaquette chain encoded in 28 qubits. The Trotterized circuit after optimization and compression requires $\sim 25n$ entangling gates for $n$ Trotter steps.
arXiv·2026-10-12·Payman Kazemikhah et al.
No generated summary available for this entry.
overview
Original abstract
A Dirac mass is characterized not only by its magnitude but also by its sign, which influences the Berry curvature, Hall response, and the propagation direction of chiral boundary modes. However, local spectroscopy of magnetic topological surfaces has so far accessed only the gap magnitude $|M|$. Here we show how the topological sign of $M$ can be determined locally. We first establish the sign information that spin-resolved tunneling can access and the reference required to obtain an absolute Hall sign. Although spin--orbital entanglement generally obscures the relation between measured spin and Dirac pseudospin, crystalline rotation symmetry alleviates this ambiguity at the band edge. On a $C_3$ axis, an axial tip couples to a fully spin-polarized state whose tunneling asymmetry directly reveals the sign of the occupied-band Berry curvature, independent of orbital composition. We further show that the zeroth Landau level provides an independent mass-sign measurement with an unpolarized tip, while opposite domains and their chiral domain-wall modes provide self-consistency checks. These results pave the way for imaging the locations where the topological character changes within a material, rather than merely identifying where a spectral gap appears.
arXiv·2026-10-12·Berke Ünal
No generated summary available for this entry.
overview
Original abstract
We prove that for $k=4$ the quantum uniformity measures are norms, whereas for every $k\geq5$ the triangle inequality fails. This gives a complete answer to an open question of Bu, Gu, and Jaffe. The $k=4$ case is proved using the Cauchy--Schwarz inequality for the quantum uniformity pairing $\langle\cdot,\cdot\rangle_{Q^4}$ introduced here, together with the triangle inequality in a suitable finite-dimensional Bochner $L^8$ space. For $k\geq5$, we construct systems of linear equations over a finite field and derive a contradiction from the structure theory of norming linear systems.
arXiv·2026-10-12·Seloua Boulifa et al.
No generated summary available for this entry.
overview
Original abstract
We present a theoretical study of distributed quantum sensing using a reconfigurable network of $N$ Mach--Zehnder interferometers to simultaneously estimate weighted linear combinations of relative phase shifts. The proposed scheme relies on injecting a Perelomov coherent state, generated from the SU(1,1) group representation, into one port of a passive quantum circuit while the remaining modes are initialized in the vacuum state, thereby establishing non-trivial quantum correlations among the sensors. Based on multi-parameter quantum estimation theory, our analysis shows that this entangled strategy outperforms the standard shot-noise limit and asymptotically achieves the Heisenberg limit. Furthermore, we highlight the crucial role of the first beam splitter's asymmetry; specifically, the optimal transmission coefficient that maximizes sensitivity corresponds to its maximum imbalance. Compared to a separable approach utilizing the same total average photon number, the entangled strategy yields a more efficient use of quantum resources, guaranteeing an accuracy gain between $1$ and $N$. This demonstrates that the entangled strategy is systematically superior to its separable counterpart. Ultimately, these results illustrate the potential of entangled distributed quantum sensor networks for high-precision measurements and provide clear guidelines for optimizing interferometric architectures in quantum metrology.
arXiv·2026-10-12·Polina Belozerova, Pavel Osinenko
No generated summary available for this entry.
overview
Original abstract
Parametrized gates in a variational quantum eigensolver (VQE) live on a product of unitary groups, which makes Riemannian optimization a natural candidate for improving training. We test this candidate in the clean per-gate setting: each single-qubit gate is optimized directly on U (2) and compared with Adam on an unconstrained Euler-angle chart representing the same physical gate, initialized from the same unitaries and tuned with a separate learning-rate sweep. On a validated hydrogen-chain benchmark, we find no measurable practical advantage from the Riemannian machinery. The direct manifold optimizer and the Euler-coordinate baseline are interleaved in final error and success rate; the classical coordinate baseline is not slower in iterations on the successful cells; and the choices of Riemannian metric, retraction, and momentum vector transport do not change the conclusion. We also identify four failure modes that can manufacture an apparent positive result: a trivial product-state benchmark, a projected-matrix Adam baseline that discards most of its own step, a non-unitary inherited Cayley retraction that lets the reported energy pass below the variational minimum, and a learning-rate grid whose optimum sits at its boundary. Each failure mode produced a plausible multi-seed result in our own workflow before being caught. The practical output of this paper is therefore a controlled null result and a validation checklist for VQE optimizer comparisons.
arXiv·2026-10-12·Kavalambramalil George Paulson, Fu Li, Hanna Terletska
No generated summary available for this entry.
overview
Original abstract
We investigate the collective emission spectra and photon correlations of two identical dipole-dipole-coupled emitters under continuous-wave (CW) and periodic pulsed driving. Our results show that a periodic train of instantaneous $π_x$ pulses can generate emission spectra whose dominant features closely resemble those obtained under CW excitation. We find that the structure of the collective emission spectra reflects the interplay among the resonance conditions, dipole-dipole coupling, and the inter-pulse delay $τ_D$. We further demonstrate that finite-duration $π_x$ pulses with sufficiently high Rabi frequencies can closely reproduce the ideal instantaneous-pulse limit. In contrast to the emission spectra, the photon correlations $g^{(2)}(t,τ)$ are governed primarily by $τ_D$ and, unlike under CW driving, become increasingly insensitive to the resonance conditions in the short-pulse limit. These results establish periodic pulsed driving as a versatile means of tailoring both the emission spectra and the photon statistics of coupled two-emitter systems.
arXiv·2026-10-12·Pallavi Bhardwaj, Michael Spannowsky
No generated summary available for this entry.
overview
Original abstract
Lorentz symmetry and the three-prong structure of hadronic top decays provide physical guidance for designing compact quantum jet taggers. We introduce QGrAT (Quantum Grade-Aware Transformer), a quantum transformer that incorporates these structures into its interactions between constituent qubits. Geometric features constructed from the constituent four-momenta are organised by the grades of the spacetime Clifford algebra $C\ell(1,3)$, and their grade-specific inner products determine the pairwise attention couplings. For fixed constituents and co-transforming reference vectors, these couplings are Lorentz invariant, although the component-wise input encoding makes the complete classifier frame dependent. An auxiliary qubit introduces an explicit three-particle interaction through products of pairwise Minkowski inner products, while a trainable in-circuit readout converts the resulting quantum state into a classification score. We evaluate the architecture in state-vector simulation on the Top Tagging benchmarks. With ten constituents per jet, the configuration using grades $0\text{-}3$ and the three-particle ancilla requires twelve qubits and $144$ trainable parameters, reaching AUC $0.944 \pm 0.002$ and background rejection $1/\varepsilon_B = 35.7 \pm 2.4\ (96.8 \pm 7.7)$ at signal efficiency $\varepsilon_S = 0.50\ (0.30)$. This performance is competitive with the L-GATr-Slim baseline at matched constituent and parameter budgets. Adding the three-particle ancilla raises background rejection at $50\%$ signal efficiency from $19.9$ to $35.7$, whereas extending the representation to the tested grade-$4$ feature gives no consistent improvement. The study establishes a framework for incorporating spacetime geometry into quantum attention and identifies explicit three-particle correlations as the principal source of improved background rejection among the architectural variations tested.
arXiv·2026-10-12·Koushik Das, Sayan Mondal, Ujjwal Sen
No generated summary available for this entry.
overview
Original abstract
We investigate superpositions of quantum Ising ground states generated through a quantum interaction, in which the nearest-neighbor coupling strength is promoted to an operator acting on a central auxiliary spin. We prepare the central spin in a superposition, which allows the chain to evolve coherently under different effective interaction strengths. The states are prepared by adiabatic evolution of the joint system comprising the central spin and the many-body spin chain, followed by a measurement on the central spin and post-selection of a specific outcome. It is possible to prepare superpositions of transverse-field quantum Ising ground states belonging to the three magnetic phases, namely, the paramagnetic, ferromagnetic, and anti-ferromagnetic phases. For a spin-1/2 central system, it is possible to prepare superpositions of ground states belonging to any two phases, while for the spin-1 case, the superpositions may contain three ground states, each belonging to one of the three phases. We analytically derive expressions for the magnetization, spin correlations, and entanglement of such states. The magnetization and spin correlations show distinct features in different superposition sectors. The nearest-neighbor entanglement is largest where the transverse field and Ising interaction compete, and its behavior differs from that of the magnetic observables. We also derive the quantum Fisher information relevant to estimating the Ising interaction strength. And it exhibits multiple peaks near the critical points of the constituent ground states, with the maximum value showing Heisenberg scaling, for the parameters and system sizes examined.
arXiv·2026-10-12·Arkaprava Sil et al.
No generated summary available for this entry.
overview
Original abstract
Thermalization in closed quantum systems and its breakdown are central to understanding the emergence of statistical behavior in isolated many-body systems. Kinetic constraints can hinder thermalization by restricting the allowed dynamics and giving rise to non-ergodic behavior. While various aspects of ergodicity breaking in kinetically constrained models have been extensively studied in Hermitian systems, their behavior in non-Hermitian kinetically constrained models remains less explored. In particular, the inequivalence of left and right eigenstate ensembles in non-Hermitian systems raises the question of whether they exhibit qualitatively different dynamical and eigenstate properties. In this work, we study non-Hermitian generalizations of the paradigmatic PXP and PPXPP models, focusing on their Krylov complexity, eigenstate structure, and dynamics. By exploiting the Arnoldi's algorithm, we find distinct behavior of Krylov complexity in the left and right eigenstate ensembles as non-Hermiticity is increased: in the right ensemble, it exhibits persistent oscillations with an increasing period, while in the left ensemble, it gradually saturates. The characteristic arch-shaped profile of the Arnoldi coefficients is also modified differently in the two ensembles, with a Hermitian-like arch re-emerging in the left ensemble at large non Hermiticity. Additionally, in the non-Hermitian PXP model, the right ensemble retains the characteristic scar structure, while the left ensemble develops additional non-scar eigenstates with anomalously low entanglement and large overlap with the vacuum state. These findings reveal that non-Hermiticity can affect Krylov dynamics and eigenstate structure differently in the left and right ensembles, demonstrating the need to treat them separately when characterizing non-Hermitian kinetically constrained systems.
arXiv·2026-10-12·Saheli Mukherjee et al.
No generated summary available for this entry.
overview
Original abstract
Recent efforts to detect non-Markovian memory have become increasingly important, motivated by the broad relevance of memory effects in quantum information processing, metrology, and thermodynamic engines. Here, we show that interferometric methods, particularly the phase shift and visibility, provide an experimentally accessible framework for probing environmental effects and witnessing non-Markovian dynamics. Specifically, suitably constructed witness operators enable the detection of non-Markovianity through measurable phase shifts in the interference pattern. Furthermore, we prove that the interferometric visibility is monotonically non-increasing under incoherent CP-divisible (Markovian) dynamics. Consequently, any revival of the optimized visibility constitutes a sufficient signature of information backflow and hence non-Markovianity. The effectiveness of the proposed phase-based and visibility approaches is illustrated for representative examples of non-Markovian dynamics. Our results offer a simple and experimentally feasible framework for probing memory effects, with potential applications in quantum sensing and noisy intermediate-scale quantum devices.
arXiv·2026-10-12·Kevin J. Randles, Manuel H. Muñoz-Arias, Kevin Thompson
No generated summary available for this entry.
overview
Original abstract
Entangled few-photon states, such as Bell and Greenberger-Horne-Zeilinger (GHZ) states, are central resources for discrete-variable photonic quantum information processing. In many architectures, these states are generated probabilistically by first heralding single photons from biphoton sources and then interfering them in linear-optical circuits. In this work, we show that the entanglement structure of said biphoton sources can be directly exploited for noise-engineering to deliver higher quality resource states. Using the transpose identity of multi-mode squeezed vacuum states, we introduce "ghost-unitary" implementations in which the target resource-generation interferometer is applied to the heralding modes rather than to the delivered resource modes. When the dominant imperfection is interferometric loss, this relocation converts direct amplitude damping of the output into false-positive heralding events that require both higher-pair emission and photon loss. In the low-squeezing regime, these events are parametrically suppressed, yielding higher-fidelity conditional resource states. We analyze this mechanism for single-qubit states, two-photon NOON states, Bell states, and a family of $n$-qubit GHZ states, as well as for single-qubit teleportation and type-I-fusion-based resource growth. Across these examples, we delineate finite parameter regimes in which ghost-unitary implementations outperform direct implementations, with particular relevance to frequency-bin photonics where active linear-optical transformations can be relatively lossy. We also prove that, in the setting considered here, the direct implementation of the $n$-GHZ family delivers identically damped outputs: equivalent to the ideal state followed by uniform amplitude damping. This extends the known $n=2,3$ cases and provides a structural result of independent interest for photonic quantum information processing.
arXiv·2026-10-12·Maor Ben Shahar et al.
No generated summary available for this entry.
overview
Original abstract
Quantum key distribution provides secure communication by relying on physics principles and mathematical reasoning. Security proofs across the field can contain gaps, often between individually valid theorems integrated under mismatched assumptions. We produce an end-to-end security theorem formalized in the Lean proof assistant, eliminating hidden hypotheses by building only on Lean's standard axioms. Our proof covers composable security of the entanglement-based qubit BB84 protocol against coherent attacks by the postselection technique, accounting for finite block size, and is written in a language that enforces local operations and classical communication to help ensure a faithful representation of the protocol. The proof itself was enabled by LLM-based autoformalization, and with the proof complete, we used the same pipeline as a discovery machine, reducing the finite-size penalty on the key rate. Our work sets a reproducible standard for security arguments in quantum cryptography and shows how formal proof engines can accelerate discovery across quantum information science.
arXiv·2026-10-12·Konstantinos Kontogeorgiou et al.
No generated summary available for this entry.
overview
Original abstract
Feynman's ratchet illustrates how work can be extracted from thermal fluctuations in the presence of two heat baths at different temperatures. While some experimental realizations of the ratchet effect have been studied, most lack miniaturization, which is important for some applications. Here, we propose a physical implementation of Feynman's ratchet based on Josephson junctions exhibiting the superconducting diode effect. This setup functions as a heat engine that generates work solely from a temperature gradient via thermal fluctuations. We analyze its output power and efficiency, and, through the Seebeck coefficient, identify the conditions under which the device operates in reverse, functioning instead as a Peltier cooler.
arXiv·2026-10-12·Flaviano Morone, Shivang Rawat, Dries Sels
No generated summary available for this entry.
overview
Original abstract
Every 3-regular graph of girth at least $g$ has a cut containing at least a fraction $M_g$ of its edges, and the best rigorous bounds at large girth are $0.912\le \lim_{g\to\infty}M_g \le 0.92386$. Lower bounds on $M_g$ follow from the performance of local algorithms: on a graph of girth $g \ge 2p+2$ a depth-$p$ local algorithm sees the same tree around every edge, so its expected cut fraction on that tree bounds $M_g$ from below. We apply this strategy to the Variational Iterative Rotation Algorithm (VIRAL), a classical local algorithm, and evaluate it on the depth-$p$ tree for every even depth up to $p=32$. The resulting bounds exceed those recently obtained from the Quantum Approximate Optimization Algorithm (QAOA) for every $p\ge 4$, by $0.005$ to $0.011$, and they extend the range of girths covered from $g=36$ to $g=66$. Notably, at $g=66$ we obtain $M_{66} \ge 0.9127$ at $99.99999\%$ confidence level, which raises the asymptotic lower bound from $0.912$ to $0.9127$.
arXiv·2026-10-12·Filip Sośnicki et al.
No generated summary available for this entry.
overview
Original abstract
Photons emitted by incoherent sources exhibit temporal bunching, a fundamental manifestation of Bose-Einstein statistics first observed by Hanbury Brown and Twiss (HBT). While intensity correlation measurements originated in astronomy and are now central across quantum technologies, biophysics, and spectroscopy, observing temporal bunching in broadband thermal light remains limited by detector temporal resolution. Conventional approaches - such as streak cameras or optical upconversion - introduce severe trade-offs in efficiency, bandwidth, or setup versatility. Here, we propose and demonstrate a third route: pre-detection temporal magnification of the optical field prior to measuring its intensity autocorrelation function in a conventional HBT setup. Using an electro-optic time lens with a temporal magnification of 660, we resolve the temporal intensity autocorrelation of broadband thermal light generated via non-degenerate spontaneous parametric down-conversion with a bandwidth of 250 GHz. This enables direct observation of thermal photon bunching on sub-3.5 picosecond timescales without narrow spectral filtering, establishing pre-detection temporal imaging as a general platform for broadband statistical optics, with applications spanning ultrafast quantum optics, biophysical imaging, and potentially stellar intensity interferometry.
arXiv·2026-10-12·Jeremy Butterfield, Daniel A. Turolla Vanzella
No generated summary available for this entry.
overview
Original abstract
We adapt to the context of quantum theory the treatment, familiar in relativity theory, of a reference frame as a tetrad. Since a tetrad is a set of four orthonormal vectors at a spacetime point, it encodes a timelike direction, three orthogonal spatial directions, and units; and so it gives a configuration in spacetime (a spatial orientation and state of motion) of an idealized infinitesimal apparatus (``rulers and a clock"). So a natural ``first guess" is that the state of a quantum reference frame should be an assignment of complex amplitudes to a set of tetrads. We develop this idea, in terms of bundles over spacetime of bases of the tangent spaces. This paper is a companion to two other papers. It emphasises the main conceptual aspects of our proposal, while the other two papers give physical details. It also explains the main contrast between those two papers. Namely: (i) the first considers a single spacetime geometry, so that a quantum reference frame, on our proposal, gives a superposition of perspectives on that geometry; while (ii) the second considers the spacetime manifold with no geometry given a priori, which will imply that a quantum reference frame, on our proposal, can describe a superposition of perspectives on a superposition of geometries---not ``just" a superposition of perspectives on a single geometry. The main mathematical idea for representing this contrast will be choosing between (i) the orthonormal frame bundle, for a given spacetime geometry; (ii) the frame bundle in the usual sense of containing all bases of all spacetime points' tangent spaces.
arXiv·2026-10-12·Leela Ganesh Chandra Lakkaraju, Naga Dileep Varikuti, Philipp Hauke
No generated summary available for this entry.
overview
Original abstract
Interacting fermions owe both their non-trivial correlations and their computational power to their departure from Gaussianity. Yet, quantifying that departure geometrically faces two challenges: the Gaussian manifold is non-convex, and perturbative treatments are confined to weak interactions. Here, we introduce a geometric measure of fermionic non-Gaussianity, the fidelity distance of a target state to the manifold of fermionic Gaussian states. We construct an iteration formalism to numerically access it, applicable also at strong coupling. Further, we prove a sharpened operator Jensen inequality, of interest in its own right. We use it to derive a witness that involves only two- and four-point fermionic correlators. Numerical benchmarks on the one-dimensional Fermi--Hubbard model show that the quality of the witness improves with system size and, for strong coupling, is tighter than antiflatness. Our results open a scalable route to charting non-Gaussianity of strongly-interacting fermionic quantum simulators.
arXiv·2026-10-12·Sebastian Miles et al.
No generated summary available for this entry.
overview
Original abstract
A recent experiment reported coherent parity oscillations between minimal Kitaev chains, demonstrating a Majorana parity qubit (arXiv:2607.09511). Operations on this qubit are controlled by coupling two Kitaev chains and are intrinsically unprotected against noise in the coupling strength. Here we show how the exponential protection in the underlying chains can nevertheless be revealed through unprotected qubit operations. To this end, we develop an analytical theory of quasistatic dephasing for two coupled $N$-site Kitaev chains at the sweet spot. In Rabi experiments, protection can be resolved by adapting the operating point with chain length: depending on the coupling architecture, it appears as an exponentially increasing optimized number of coherent oscillations or as a longer coherence time. Ramsey experiments show an exponentially increasing coherence time, provided the chains can be sufficiently decoupled. Our analytical theory takes into account the non-Gaussian splitting statistics of the Kitaev chains, allowing us to quantitatively predict the scaling with chain length. Moreover, we determine how residual noise and imperfections limit the range of chain lengths over which this scaling can be observed. Our results show how qubit dynamics can be used to probe Majorana protection in experimentally realistic devices.
arXiv·2026-10-12·Niko R. Reed et al.
No generated summary available for this entry.
overview
Original abstract
The use of artificial intelligence (AI) in physics research is increasingly common, yet few guidelines exist for its effective use. Starting with a principles-based approach, we outline a set of ten requirements for collaborative AI agents in experimental physics, spanning scientific norms, effective agent use, and domain expertise. We take a human-centered approach in which agents act as collaborators that amplify rather than replace the expertise of a human researcher (user) who directs the work and is responsible for its results. We then present a framework designed to enforce these requirements, detailing methods for improving off-the-shelf behavior of large language models (LLMs) with custom scaffolding and describing general-purpose scientific workflows and skills. In particular, we highlight the power of closed-loop campaigns where agents work iteratively toward a well-defined goal. We demonstrate the potential of this mode of research through six case studies in experimental physics, covering device design, hardware control, neural network optimization, physical model identification, and data analysis. All six case studies result in useful work products that add utility to our research, including a neural network architecture and solid-state quantum defect photodynamic model that substantially outperform our published work; a microwave waveguide design that extends a published design concept to a fabrication-ready device meeting our experimental constraints; a quantum control pulse sequence candidate that improves simulated performance by more than an order of magnitude; commissioning of an NMR spectrometer to $\sim$1~Hz frequency precision on live hardware; and finally a data-fitting pipeline that achieves, to our knowledge, the first reconstruction of the Ising microstate of an artificial spin-ice array from diffraction-limited magnetic imaging.
arXiv·2026-10-12·Shifan Xu et al.
No generated summary available for this entry.
overview
Original abstract
Quantum random-access memory (QRAM) enables coherent queries to classical data. However, the \(O(N)\) qubits required for a memory with \(N=2^n\) addresses make QRAM appear vulnerable to noise. Though bucket-brigade routing provides intrinsic noise resilience to reduce the error in QRAM, improving the fidelity of QRAM queries is still an important and challenging problem. We introduce a low-overhead protection framework for bucket-brigade QRAM with two complementary components. First, we propose a one-fault-tolerant repeat-until-success logical controlled-SWAP gate using the \([[4,2,2]]\) code under erasure noise channel. Interleaved erasure checks and local recovery correct every single erasure, so the leading logical failure probability is second order in the physical erasure error rates. Second, we exploit validity constraints of bucket-brigade routing to define local parity checks directly on the router states, without adding extra data qubits to create code redundancy. Under bit-flip noise, minimum-weight perfect matching with noiseless syndrome measurements corrects single interior faults, while open spatial boundaries retain a first-order contribution in the residual bit-flip rate. Monte Carlo simulations confirm quadratic suppression for the protected controlled-SWAP and improved depth scaling for decoded QRAM router-state snapshots. The two codes admit a concatenated realization in which the inner code supplies erasure protection and the outer code optionally corrects interior logical bit flips. Together, these results show how routing constraints and a protected non-Clifford routing gate can improve QRAM reliability under biased and erasure-dominant noise.
arXiv·2026-10-12·Matias Mustonen et al.
No generated summary available for this entry.
overview
Original abstract
Structured light provides a powerful means of controlling matter while itself exhibiting nontrivial spatial topology. Here, we show that these spatial structures can be harnessed to locally engineer the topological properties of matter. In a paradigmatic example of a topological insulator with Dirac surface states driven by an optical skyrmion beam, we show that structured light spatially tailors the effective Hamiltonian, yielding position-dependent topological gaps and Dirac velocities. The resulting gap modulation can create topological and trivial regions separated by optically defined interfaces, without introducing material boundaries or chemical modifications. We further show that the geometry of these interfaces can be controlled through the spatial structure of the light, in particular its orbital angular momentum. Our results establish structured light as a route to dynamically pattern topological phases and open a broader perspective on the interplay between topology in light and matter, including the possibility of transferring topological characteristics between the two.
arXiv·2026-10-12·Evan Zhang et al.
No generated summary available for this entry.
overview
Original abstract
We investigate whether controlled motion of a quantum sensor offers a metrological advantage in a field-detection task. We consider a localized field of known strength $B$ occupying an unknown contiguous region making up a fraction $1/N$ of the total search space, with a qubit sensor controlled for a total time $T$ to maximize the probability of detecting the field. We study the regime in which the characteristic timescale of the field is slow compared to the time to move the sensor between any two regions, and we distinguish classical motion, where the sensor follows a definite trajectory, from quantum motion, where the sensor can be in a coherent superposition of locations. For a single classically moving sensor, we derive an optimal multi-stop protocol and obtain the exact maximum detection probability. Allowing coherent spatial superposition maps the single-sensor problem onto Hamiltonian search and reduces the interrogation time for successfully detecting the field from $Θ(N/B)$ to $Θ(\sqrt{N}/B)$. We then extend the problem to $M$ sensors and identify a hierarchy of optimal time scalings for constant success probability determined by the available spatial and inter-sensor quantum resources. Unentangled coherently moving sensors achieve $T=Θ(\sqrt{N/M}/B)$ by searching disjoint regions in parallel, while entanglement among the sensors can further enhance the effective field coupling and achieve $T=Θ(\sqrt{N}/(MB))$. Matching lower bounds establish the optimality of these scalings in the presence of arbitrary controls and ancilla systems. Our results separate the roles of classical motion, spatial coherence, and entanglement in spatial field detection.
arXiv·2026-10-12·Mykhailo Hontarenko, Karol Życzkowski
No generated summary available for this entry.
overview
Original abstract
A Latin square can be extended by replacing its symbols with probabilities or quantum states. We relate these two extensions through explicit examples, from classical and fractional Latin squares to quantum Latin squares and a real solution of Euler's quantum 36 officers problem. A simultaneous cyclic-shift ansatz on a four-torus of tensor coefficients gives a real absolutely maximally entangled (AME) state of four six-level systems. A local orthogonal change of basis yields a representative with 96 nonzero amplitudes. Two single-party arrays obtained from the corresponding quantum orthogonal Latin square yield fractional Latin squares. Signs matter: comparison with the independent real construction of Bruzda and its sign variant distinguishes three local-unitary classes, two of which have identical probabilities. We extend this probability representation to existing seven- and nine-party AME states with six levels each. Their amplitude matrices reveal 48 complex Hadamard blocks of order $3^3$ and six of order $6^4$, respectively. These constructions separate what can be read from a probability picture from the coherent conditions responsible for maximal entanglement.
arXiv·2026-10-12·Yu-Xin Wang et al.
No generated summary available for this entry.
overview
Original abstract
We consider unstructured search using multimode bosonic quantum systems under energy constraints. The task is to locate an unknown marked mode among $N$ possibilities using arbitrary control, subject to a time-averaged mean-boson-number budget $n_{\text{b}}\gg 1$. We analyze a continuous-time phase-shift oracle of strength $B_{0}$, with cost given by the total oracle time, and a discrete oracle with fixed phase $φ_{0}$, with cost given by the number of queries. We give algorithms that identify the target with query complexity $O(\sqrt{N}/{n_{\text{b}}}B_{0})$ for continuous-time oracles or $O(\sqrt{N}/n_{\text{b}} |{\sin(φ_{0}/{2})}|)$ for discrete oracles with $n_{\text{b}} |{\sin(φ_{0}/{2})}|=O(1)$. In contrast, for discrete oracles with $n_{\text{b}} |{\sin(φ_{0}/{2})}|=Ω(1)$, we provide an algorithm using $O(\max\{1,\sqrt{N/n_{\text{b}}|{\sin(φ_{0}/{2})}|}\})$ queries. We also prove matching lower bounds on the query complexity, showing that these algorithms are asymptotically optimal. Furthermore, we show that, in the absence of loss, non-Gaussianity is necessary to achieve the optimal joint query scaling in $N$ and $n_{\text{b}}$, but entanglement is not. Under uniform boson loss at rate $γ$, we prove a query lower bound of $Ω( γN / n _{\text{b}} B_{0}^{2} )$, attained for $γ= Ω(B_{0} \sqrt{n _{\text{b}}/N})$ using coherent-state probes. Finally, we propose experimental implementations using multipass optical microscopy or superconducting circuits as potential routes to speeding up imaging or device calibration with a low boson-number budget.
arXiv·2026-10-12·Dionisio Cendoya et al.
No generated summary available for this entry.
overview
Original abstract
Quantum sensing is typically based on phase accumulation and is therefore fundamentally tied to the coherence time of the sensing system. Here we introduce an alternative sensing paradigm based on programmable Floquet locking in periodically driven two-level systems. We show that periodic control generates an effective Floquet locking field whose orientation and amplitude depend on global offset, allowing information to be encoded in the driven population relaxation dynamics, not in the integrated phase. By controlling transfer between distinct Floquet locking manifolds, external perturbations can be mapped onto engineered relaxation responses whose characteristics are programmable through the driving sequence. We numerically demonstrate this approach for both DC and frequency-selective AC sensing, and show that temporal encoding of the response can provide enhanced precision in the presence of slow instrumental fluctuations. These results illustrate the potential of programmable Floquet responses and open the way to exploring new sensing strategies in driven quantum systems.
arXiv·2026-10-12·Rex Fleur, Tzula B. Propp, Sebastian Feld
No generated summary available for this entry.
overview
Original abstract
Can quantum advantages in computational efficiency coexist with quantum advantages in privacy? In this paper, we construct and use MasonQ, a universal brickwork transpiler, to answer this question with a resounding yes. We approach this question by bridging two seemingly disparate paradigms: universal blind quantum computation (UBQC), based on measurement-based quantum computation, and quantum machine learning (QML) algorithms such as the Harrow-Hassidim-Lloyd (HHL) algorithm and quantum recommendation systems. We provide new upper bounds on the depth of UBQC brickwork graphs, establishing that $D = \mathcal{O}(ωn)$, where $ω$ is the circuit width and $n$ its computational gate complexity. This is enabled by our newly developed transpiler MasonQ, which maps arbitrary quantum circuits to computational brickwork graph states. Given an optimal Qiskit circuit as input, we prove optimality (up to logarithmic corrections) of the MasonQ transpiler in terms of asymptotic scaling of the total brickwork graph width and depth after decomposition into bricks, enabling systematic cost analyses of blind implementations in near-term experiments and asymptotic regimes. Leveraging MasonQ, we derive depth bounds for several representative blind quantum machine learning (B-QML) algorithms, including the quantum Fourier transform, the HHL algorithm, recommendation systems, and quantum transformers. Lastly, we analyze concrete resource estimates for near-term demonstrations of blind quantum machine learning. We propose a minimal B-QML implementation requiring only a $12$ qubit quantum server. To the best of our knowledge, MasonQ is the first functional and optimal universal circuit-to-brickwork-graph transpiler to implement the full brickwork transpilation process from first principles.
arXiv·2026-10-12·Amit Anand, Dinesh Valluri, Shohini Ghose
No generated summary available for this entry.
overview
Original abstract
Periodically driven quantum systems exhibit a wide range of complex dynamics, including chaos. Yet, at special parameter values, their evolution can recur exactly. Several quantum protocols have recently been proposed that exploit exact Floquet recurrences to demonstrate genuine quantum advantage. Such recurrences can be studied through the arithmetic structure of the Floquet unitary. In this work, we establish a necessary and sufficient arithmetic criterion for exact recurrence and determine the minimal recurrence period when one exists. Because recurrence is a global property of the unitary, it holds for every initial state. Applying our framework requires only knowledge of the number field associated with the Hamiltonian parameters. We demonstrate the method using the kicked Ising chain, establishing exact recurrences in both Clifford and non-Clifford regimes. We further show that, in the recurrent non-Clifford regime, magic--a resource for quantum computation--is generated at intermediate times and undergoes exact periodic revivals enforced by the recurrence of the full Floquet unitary. By connecting number theory, quantum many-body dynamics, and quantum information, our work shows that exact recurrence extends beyond Clifford circuits and opens new avenues for magic generation and quantum hardware benchmarking.
arXiv·2026-10-12·Dmitry Filippov et al.
No generated summary available for this entry.
overview
Original abstract
Scaling fault-tolerant quantum computing (FTQC) requires orchestrating millions of operations continuously across a tightly coupled classical-quantum control stack. A critical challenge in this orchestration is determining the optimal hardware-software boundary, i.e., the Quantum Instruction Set Architecture (QISA). We focus on cryogenic, fixed-connectivity qubit platforms, such as superconducting and topological Majorana qubits. For these, existing QISA choices either operate at too low a level, violating cryogenic thermal budgets at scale, or at too high a level, imposing unrealizable complexity on the control engine. To reason about these tradeoffs, we introduce the ARIES instruction set hierarchy, which categorizes QISAs into distinct abstraction levels. To systematically evaluate these levels, we develop an end-to-end evaluation toolflow featuring a cycle-accurate classical driver and hardware engine simulator. Using eight quantum applications across superconducting and topological qubit platforms, we measure instruction bandwidth, transceiver power dissipation, and measurement processing overheads. We demonstrate that while physical-level abstractions exceed the thermal limits of dilution refrigerators by orders of magnitude, canonical-level abstractions significantly underestimate hardware routing congestion and execution runtimes. Our Level 4 QISA (local logical operations) offers an optimal architectural balance. As quantum hardware platforms scale toward FTQC in the coming years, our findings provide concrete architectural guidance for the design of their classical control stacks and instruction interfaces.
arXiv·2026-10-12·Eoin O. Irving et al.
No generated summary available for this entry.
overview
Original abstract
Molecular systems with optically addressable electron spins are emerging as versatile quantum sensing platforms, offering tunable qubit properties and molecular-scale spatial control. Owing to their longer lifetimes, coupled nuclear spins provide an attractive resource for enhancing sensing performance. For molecular spin systems, the ability to initialise, coherently control and readout nuclear spins at room temperature is crucial for realising such benefits. Here, we present the first optical detection of nuclear magnetic resonance and coherent nuclear spin control with a molecular system at room temperature. Specifically, we demonstrate optically detected Rabi oscillations of $^{14}$N nuclear spins in the photoexcited triplet state of the organic chromophore 6,13-diazapentacene. The strong hyperfine coupling between the electronic spin and $^{14}$N nuclei enhances the nuclear Rabi frequency, enabling fast coherent nuclear-spin rotations. This work lays the foundation for leveraging nuclear spins as memories for enhanced molecular-based quantum sensing.
arXiv·2026-10-12·Lei Shao, Hai-Jun Xing, Libin Fu
No generated summary available for this entry.
overview
Original abstract
Nonlinear effects are widely utilized in quantum metrology to enhance measurement precision by leveraging complex dynamical behaviors. Here, we propose a quantum scrambling-integrated scheme that optimizes the selection of initial states and parameter encoding by exploiting the nonlinear dynamical trajectories and their geometric properties in phase space. We consider a two-mode Bose-Einstein condensate as a typical example. Within a certain parameter range, using uncorrelated spin coherent states located at saddle points and separatrices enables the measurement precision to reach the Heisenberg scaling. An analytical expression for the quantum Fisher information under long-time evolution is provided, and our analysis further reveals that the enhancement mechanism is governed by the sensitivity of the energy spectrum to parameter variations. Compared to the criticality-enhanced protocol that requires parameters to approach the critical point, our scheme offers a distinct advantage in its applicability over a broader range of parameters. Moreover, this scheme can also be applied to models that include one- and two-axis countertwisting interactions and chaotic dynamics. This Letter offers a new perspective for advancing the application of nonlinear dynamics to enhance the parameter estimation precision in quantum systems.
arXiv·2026-10-12·Robert Ferydouni, Thomas Jackson, Samuel O. Scalet
No generated summary available for this entry.
overview
Original abstract
Spatial sudden death of entanglement refers to the disappearance of quantum correlations between subsystems after a certain distance called the entanglement length. Specifically, given a density matrix $ρ_{ABC}$ on a tripartite system $ABC$ with $B$ spatially separating $A$ and $C$, the entanglement length is the distance $\ell(A,C)$ after which the reduced density matrix $ρ_{AC}$, given by tracing out the $B$ subsystem, is separable. We show in the case of gapped ground states in any dimension that the entanglement length is finite on finite subsystems. Restricting to one-dimensional systems, we prove that normal matrix product states have a finite entanglement length independent of $A$ and $C$, and that a finite pure state with such uniform entanglement length has a matrix product state representation with bond dimension independent of $A$ and $C$. Consequently, in one dimension, entanglement length distinguishes matrix product states from all other pure states.
arXiv·2026-10-12·Aleksandr Gulkanov
No generated summary available for this entry.
overview
Original abstract
Bosonic codes often read out their syndrome with a transmon ancilla whose computational levels $g$ and $f$ have equal parity and matched dispersive shifts: a decay $f\to e$ is then heralded and leaves the code intact, while the direct $f\to g$ is forbidden by parity. We show that the photons of the code open this decay at first order in the ancilla's decay rate. Dressing by the code mode lets the charge noise that limits the ancilla's $T_1$ drive a photon-stimulated Raman decay $|f,n\rangle\to|g,n+1\rangle$, at $(n+1)(χ_{ge}/2g_{01})^2$ times the $f\to e$ rate for a smooth noise spectrum. When the matching is set by the detuning, the decay costs $\approxΓ_{fe}/α$ per gate and photon, whatever the coupling strength; a deliberate mismatch or matching by a drive lowers this cost, and a qubit ancilla has no such channel. The opened decay is unheralded and flips a cat with probability $\approx 1/2$; being first order, it overtakes the second-order double decay $f\to e\to g$ as the ancilla improves. In a microscopic model of the Ocelot repetition cat code, it makes the bit-flip floor of the gates grow linearly with the cat size, by a factor 1.2-1.7 from four to ten photons, which would limit the noise bias to $\sim 10^3$. The published gate data end at four photons and do not yet test this growth.
arXiv·2026-10-12·Z. L. Li, R. Z. Jiang
No generated summary available for this entry.
overview
Original abstract
The vortex structures in the momentum distributions of multiple particle-antiparticle pairs produced from the vacuum by a spatially uniform, time-varying electric field with arbitrary polarization are investigated using the Bogoliubov transformation. For linearly polarized fields, as the field strength increases, the nodal lines in the multi-pair momentum distribution break up into vortex-antivortex pairs in both the bosonic and fermionic cases. Each vortex carries a topological charge that is an integer multiple of the single-pair vortex topological charge. For circular polarization, a central vortex appears at all field strengths. For bosons, its topological charge is an integer multiple of the single-pair vortex topological charge; for fermions, it is an integer multiple of the vortex topological charge for single-pair production with zero total spin projection along the field propagation direction. For elliptical polarization with suitable ellipticity, discrete vortices coexist with a central vortex. In this case, however, the integer-multiple relation for fermions generally fails because the two-pair production amplitude is a determinant and spin-channel contributions are separated in momentum space. These results provide a theoretical basis for understanding the vortex topology of multi-pair production in strong-field QED and for its potential control.
arXiv·2026-10-12·Shira K. Huizing Lemstra, Tzula B. Propp
No generated summary available for this entry.
overview
Original abstract
The second quantum revolution is a revolution of information. Advances in quantum computation, communication, and sensing offer new capabilities while raising questions about how quantum infrastructures will be organised, accessed, and governed. We argue that their significance for governance lies not in transforming political principles, but in how their technical and infrastructural requirements may affect existing relationships of authority, responsibility, legitimacy, and power. This paper develops a quantum governance lens that connects governance scholarship with quantum information science, examining interactions between technical design, institutional arrangements, and infrastructural dependencies. We apply this lens to five areas: quantum computation, quantum key distribution, Quantum Byzantine Agreement, blind quantum computation, and dual-use quantum sensing. These applications illustrate how technical capabilities may influence access, trust, privacy, oversight, and accountability, while demonstrating that technical guarantees cannot resolve institutional questions independently. We conclude that quantum technologies do not necessarily introduce unique governance challenges or require entirely new governance frameworks. Rather, they provide a context in which established questions of legitimacy, accountability, and equity must be reconsidered in relation to emerging technological capabilities and institutional choices.
arXiv·2026-10-12·Wuttichai Pankeaw, Pruet Kalasuwan
No generated summary available for this entry.
overview
Original abstract
What quantum mutual information adds to conventional correlation functions is often unclear. We study the spin-1/2 $J_1$-$J_2$ Heisenberg chain, using DMRG on infinite chains and periodic rings and an SU(2) decomposition of the mutual information into correlation channels. For singlet ground states the two-site mutual information is an exact function of the spin correlator, so any additional content must come from blocks. In the dimerized phase, blocks resolve bond-energy correlations in the SU(2)-scalar channel without an independent asymptotic length: singlet and triplet correlation lengths agree to about 1%. The scalar channel dominates block mutual information at large distances in the commensurate regime up to $J_2/J_1=0.40$, but falls to a few percent beyond the disorder point, which coincides numerically with the Majumdar-Ghosh point $J_2/J_1=1/2$; the structure-factor peak splits only at the Lifshitz point $J_2/J_1=0.520622(2)$. On the gapless side we compare block mutual information on rings extrapolated to infinite size with the two-interval prediction of SU(2)$_1$ conformal field theory across the Kosterlitz-Thouless point $J_2/J_1=0.241167$. There, for block lengths $l\le6$, the correction decays as $l^{-p}$ with $p=1.96$-$2.07$, and any logarithmic term is at least 60 times smaller than in the Heisenberg chain. Expanding in the marginal coupling (from level spectroscopy) the first-order coefficient is consistent with $l^{-2}$ scaling and the second-order coefficient is positive for $x\le1/4$, suggesting that the mutual information relative to the field-theory value becomes stationary at the KT point for large blocks. The scalar-channel share approaches 1/4 at small cross ratio $x$, as expected from SO(4) symmetry; under two stated assumptions its first-order response to the coupling is $(3/8)\ln x-5/8$ at small $x$, matched by the $l=4$ data within 1-3% at $x\le1/9$.
arXiv·2026-10-12·Zi-Xuan Wang, Xiu-Hao Deng
No generated summary available for this entry.
overview
Original abstract
Can collective quantum-noise measurements distinguish different mode temperatures from one common temperature when the coupling spectrum is unknown? For stationary Gaussian oscillator environments, we derive a sharp bandwidth threshold for an exact thermal alias on the integer-time sampling lattice. The threshold depends on temperature order through the quantum response. For frequencies within the first alias period, fixing sufficient integer-time correlations makes one additional fractional-time fluctuation observation enough to exclude every common-temperature fit. A calibrated second pulse width provides another route through the same collective port: both widths must probe one spectrum and retain their measured variance scales. For a specified two-mode example, continuous-frequency certificates cover all common temperatures and uncertainty in a shared pulse ramp. A binary-readout protocol combines randomly interleaved matched references with collective-variance and coherence checks to handle Gaussian oscillator loss and predictable readout drift. The selected fractional-clock and two-width designs require approximately $3.8\times10^7$ and $1.6\times10^8$ outcomes for at most 5\% type-I error and at least 95\% power on the stated alternative class. These theoretical and numerical acquisition guarantees assume independently validated preparation, spectral support and control specifications; validation costs are additional. The result identifies which new observation makes thermal-model testing informative when mode-resolved access is unavailable.
arXiv·2026-10-12·Wojciech Bruzda
No generated summary available for this entry.
overview
Original abstract
Seeking a pictorial representation of four-party absolutely maximally entangled (AME) states of local size six, we independently construct a real AME$(4,6)$ state from a table of signed Pauli matrices. Its two-unitary matrix has $60$ nonzero entries, equal to $1$ or $\pm 1/\sqrt{2}$. A locally equivalent representative yields a genuine geomagic square, where every row, column and main diagonal tiles a hexagon and all $36$ pieces are pairwise non-congruent. Colors, shapes and hatching retain the full tensor, allowing its reconstruction from the picture.
arXiv·2026-10-12·Shane P. Gervais, Lambert Giner
No generated summary available for this entry.
overview
Original abstract
Weak measurements are used to amplify small signals, to address foundational questions, and to characterise quantum states without tomography. In direct state reconstruction each amplitude of the state vector is proportional to a single complex weak value, which for a temporal pointer is read from the mean arrival time and the mean frequency of the postselected pulse. Such an experiment requires three quantities to be fixed, the coupling, the angular resolution demanded of the reconstruction, and the set of states over which the method remains usable, and these are commonly set by the available apparatus rather than derived. We derive all three for a Gaussian temporal pointer and an arbitrary postselection state. The states that cannot be reconstructed form a spherical cap centred on the state orthogonal to the postselection, whose geodesic half-angle follows from the largest of three independent thresholds and involves no adjustable parameter. Two states are distinguishable only if they differ by more than a minimal step fixed by the coupling, by the number of incident photons and by the sensitivity of the weak value along the path followed. For an inversion at first order in the coupling the systematic and statistical errors are opposed and fix an optimal coupling that varies as the inverse sixth root of the number of incident photons, whereas an exact inversion at finite coupling removes the systematic error, the remaining bound being one on the two-centroid readout rather than on the inversion, since below an amplitude equal to a quarter of the coupling two states give the same pair of centroids while their profiles differ. These results allow a direct reconstruction experiment to be dimensioned before the apparatus is assembled.
arXiv·2026-10-12·Sahand Nikzat Ali Nassimi, Rony Modak Parai
No generated summary available for this entry.
overview
Original abstract
Liouville equation contains an excess coupling term in addition to the Poisson bracket. Neglecting this term yields the Poisson bracket mapping equation (PBME). We expand the mapping dependence of the density in Hermite functions about the Gaussian factor common to all physical mapping densities. In this basis, the excess coupling term acts purely as a raising operator and exactly cancels the raising contribution generated by the back--reaction force. Consequently, the exact dynamics does not generate higher Hermite orders and closes on a finite, sparse system of equations for the coefficient fields. Within the physical sector, these equations reduce to the subsystem quantum--classical Liouville equation. In contrast, the PBME retains the raising contribution of the force, modifying the back reaction within the physical sector while continuously generating higher Hermite orders. For Tully's dual avoided crossing model, direct propagation of the coefficient equations confirms this finite closure and agrees with independent solutions of the subsystem equation. Comparison with converged full quantum dynamics further shows that, across all regimes examined, the PBME is less accurate than the quantum--classical description for populations, coherences, and momentum distributions.
arXiv·2026-10-12·Keshav Venkataraman et al.
No generated summary available for this entry.
overview
Original abstract
We describe an optimal-control strategy designed to accelerate the dissipative preparation of complex, highly entangled quantum many-body states. Analogous to optimal steering of isolated quantum systems, our scheme identifies control pulses that guide the evolution of open quantum systems along trajectories of instantaneous steady states while minimizing leakage resulting from non-adiabatic transitions. In many cases of interest, these control parameters can be derived analytically and without the need for computationally expensive numerical simulations of the full many-body master equation. We apply this technique for the preparation of bi- and multipartite entangled states in qubit systems coupled to a common photonic waveguide or a distributed squeezed reservoir. In both scenarios, our optimal-control strategy significantly outperforms the bare relaxation dynamics after a quench, reducing preparation times of near-maximally entangled states by orders of magnitude. This drastic speedup makes dissipative entanglement distribution protocols compatible with high-fidelity quantum information processing applications and illustrates more broadly the potential of leakage minimization for accelerating reservoir-engineering schemes.
arXiv·2026-10-12·Kagwe A. Muchane
No generated summary available for this entry.
overview
Original abstract
Bastidas et al. (2025) highlighted the importance of exploiting group symmetries to reduce computational overhead and unify simulation methods across both condensed matter physics and ab initio quantum chemistry. I discuss the discrete character transform, which is the group Fourier transform restricted to $Z(\mathbb{C}[G])$, the center of the group algebra, where class functions form a commutative convolution algebra and irreducible characters are its spectral basis. The normalized character table of a non-abelian group can be obtained through a restriction operator, which means an efficient quantum character transform for any finite group with an efficient quantum Fourier transform. I give complementary quantum algorithms for class convolution based on direct class-sum block encoding and spectral implementation in the character basis, explaining their applications to symmetry-adapted many-body dynamics, molecular and spectroscopic symmetry analysis, and quantum walks, as well as characterizing the central information used in hidden-subgroup problems, including its limitations for graph isomorphism.
arXiv·2026-10-12·Sebastiano Corli et al.
No generated summary available for this entry.
overview
Original abstract
Photonic technologies are among the leading platform contenders for demonstrating quantum advantage. Nevertheless, photon losses represent the major hurdle for the realization of a fault-tolerant optical quantum computer, and the need for an accurate characterization of this phenomenon is crucial for classical simulations of quantum algorithms on noisy backends. The noisy regime would require the simulation of the algorithm on a Fock backend or rather assuming the a priori hypothesis on the uniformity of the optical losses, which may lead to wrong predictions about the outcome from the algorithm on a cerain hardware. We propose a Gaussian model that can reproduce a lossy dynamics through the experimental characterization of imperfect interferometers, yielding the corresponding mean vector and the covariance matrix. Such model can be adapted to any continuous-variable architecture (spatial or time-bin encoded) and for both the Gaussian boson sampling or general-dyne based algorithms. Eventually, we quantify the drift of optical losses from being uniform throughout the multiport interferometer by a numerical simulation. This work proposes a blueprint for future characterizations, tailor-suited for specific devices and architectures, as well as for potential error correction and mitigation techniques, and it paves the way for realistic simulations of quantum algorithms on NISQ optical platforms.
arXiv·2026-10-12·Juan Sumaya-Martínez, Omar Olmos-López, Jorge Mulia Rodríguez
No generated summary available for this entry.
overview
Original abstract
Bell-test data are typically used to certify nonlocal correlations, while quantum metrology is concerned with the sensitivity of measurement statistics to unknown parameters. Here we connect these tasks at the level of experimentally accessible Bell statistics. Using standard moment-based Fisher-information inequalities, we derive lower bounds on the classical Fisher information directly from Bell scores and their parameter dependence, without requiring full state tomography. For CHSH measurements we establish a hierarchy between the information contained in the full outcome record, the set of individual correlators, and the compressed Bell parameter, thereby quantifying the metrological cost of data compression. In polarization-phase sensing, this hierarchy reveals a Bell-metrology tradeoff: the point of maximal CHSH violation need not maximize, and can even suppress, the Fisher information carried by the Bell score itself. We further derive finite-sample lower-confidence bounds from coincidence counts and analyze the effects of biased marginals, accidental coincidences, visibility loss, and multipair emission. The framework provides a practical route for extracting metrological guarantees from Bell-type experiments using only standard correlation measurements.
arXiv·2026-10-12·Palash Pandya
No generated summary available for this entry.
overview
Original abstract
Absolutely maximally entangled states of four six-level systems, AME$(4,6)$, are the quantum solutions of Euler's problem of the thirty-six officers. Until recently all reported solutions were complex, and it was conjectured that no real orthogonal 2-unitary matrix of order $36$ exists. We give real AME$(4,6)$ states with $60$ non-zero coefficients in $\{\pm1,\sqrt2\}/\sqrt{72}$. Of their thirty-six officers, $12$ are classical, as some must be whenever fewer than $72$ coefficients are non-zero. They lie in the $-1$ eigenspace of an order-$4$ local symmetry, and on their support the AME conditions become linear. We derive two closed-form families of AME$(4,6)$ states that meet at one of these states: a $10$-parameter family that is supported on $72$ basis states, and an $11$-parameter family on $60$ basis states. At each of its two ends the first family loses $12$ coefficients, and the AME states on the remaining $60$ basis states form an $11$-parameter family: the second family at one end, and an analogous family at the other. These two $60$-term families contain $4096$ real AME states up to diagonal local unitaries, $1024$ of which are limits of the first family. They fall into exactly $20$ classes under local unitaries and permutations of the parties, and we certify their separation with interval arithmetic.
arXiv·2026-10-12·Bulti Paul, Biswabibek Bandyopadhyay, Tanmoy Banerjee
No generated summary available for this entry.
overview
Original abstract
Quantum aging transition has recently been reported, whereby the oscillatory dynamics of a network of globally coupled quantum self-sustained oscillators is degraded sharply when the fraction of inactive nodes exceeds a critical value. Here we explore the reverse process: the revival of rhythmic dynamics from an aged state in a quantum oscillator network by introducing a controlled incoherent single-boson pumping channel. Using a self-consistent quantum master equation in the Lindblad form for globally coupled active--inactive quantum Stuart--Landau oscillators, we show that increasing the pumping strength progressively suppresses the aging transition and eventually eliminates it, restoring rhythmicity even when all oscillators are inactive. Remarkably, complete compensation of the coupling-induced dissipative loss is not required; a substantially weaker pumping strength is sufficient to eliminate the aging transition. We show that the revival is governed by a redistribution of the Fock-state population of the inactive oscillators toward higher-occupation states. Our results establish controlled incoherent pumping as an effective mechanism for restoring dynamical robustness in quantum oscillator networks.
arXiv·2026-10-12·Anupam Ghosh
No generated summary available for this entry.
overview
Original abstract
This article aims to introduce the bosonic asymmetric quantum conditional mutual information (QCMI), $I_{B}(A; B|C)$, as a rigorously defined information-theoretic quantity for continuous-variable (bosonic) systems. After defining $I_{B}(A; B|C)$ through quantum instruments on infinite-dimensional Fock spaces, we prove that Bose-Einstein condensation (BEC) induces a logarithmic divergence $ I_{B}(A; B|C) \geq α\log_2 (N_{0}^C+1)$, which further establishes $I_{B}(A; B|C)$ as a quantum-information order parameter for BEC with power-law scaling near the critical point. We provide the complete five-step proof of this result, connecting measurement back-action, off-diagonal long-range order, and Jensen's inequality. In the condensed phase, the effective causal propagation velocity is set by the Bogoliubov sound speed $c_s$ in the long-wavelength limit, and vanishes continuously at the superfluid--Mott-insulator transition. Applications to composite bosons, the BEC--BCS crossover, and a quantum-gas-microscope measurement protocol are presented. Finally, we demonstrate how the reduced bosonic QCMI serves as a finite-size scaling probe analogous to the Binder cumulant.
arXiv·2026-10-12·Miloslav Znojil
No generated summary available for this entry.
overview
Original abstract
Stable bound states living on a discrete one-dimensional N-point lattice are assumed generated by a certain two-parametric PT symmetric potential $V=V(A,B)$. At any $N$, the coordinates $A=A^{(EP)}$ and $B=B^{(EP)}$ of the Kato's exceptional point (marking the phase-transition instant of the loss of stability) are defined, exactly, via roots of a certain elementary quartic polynomial.
arXiv·2026-10-12·Joseph Tindall
No generated summary available for this entry.
overview
Original abstract
Strong dynamical symmetries provide an algebraic description of persistent oscillations in open quantum systems governed by the Lindblad equation. For finite-dimensional systems with a full-rank stationary state, such symmetries are necessary and sufficient for non-decaying oscillatory modes to appear in the Liouvillian's spectrum. These modes can be directly constructed by acting on stationary states with the identified symmetry operators. Here we establish an asymptotic counterpart of this algebra for collective spins. Taking a single spin $S$ in a magnetic field, subject to dissipation through linear jump operators, we identify the exact conditions on the field and dissipative couplings under which non-decaying oscillatory modes emerge as $S \rightarrow \infty$. We then write down a simple, closed form for the corresponding `symmetry' operator which can be applied to the steady state to construct these modes, which are eigenvectors of the Liouvillian, with imaginary eigenvalues, up to $O(1/S)$ corrections. A second operator, an emergent conserved quantity, completes the algebra, and its slow relaxation determines how quantum noise selects the stationary state. The construction can be directly extended to a pair of interacting spins sharing a common reservoir, with the resulting quantum algebra making the entanglement during a quench analytically accessible.
arXiv·2026-10-12·Conor Power et al.
No generated summary available for this entry.
overview
Original abstract
This work demonstrates admittance extraction of quantum dot arrays using a rate equation frame- work matching experimental reflectometry measurements. Using a semiclassical rate equation, we consider a perturbation of the source/drain chemical potential to model reflectometry readout in a quantum dot array. This is a time-dependent extension of the rate equation which has been employed in literature for pumped arrays of quantum dots and capacitance extractions. Here we extend this to a double quantum dot for admittance extraction. The simulations are calibrated us- ing Fermi-Hubbard parameters extracted from experimental data, which it is then shown to closely approximate to.
arXiv·2026-10-12·Jakob Dolgner, Michael Rübhausen, Dirk Manske
No generated summary available for this entry.
overview
Original abstract
Coherently driven phonons are conventionally described classically. Nonlinear phonon-phonon interactions, however, allow an infrared drive to reshape the fluctuation spectrum and generate substantial nonthermal enhancement of phonon fluctuations, motivating a description beyond the coherent displacement alone. We benchmark classical and semiclassical approximations against the full quantum theory and find that the semiclassical treatment substantially improves agreement with the quantum dynamics. We propose nonequilibrium spontaneous Raman scattering as a sensitive probe of these effects and apply our framework to recent experiments suggesting quantum nonlinear phononics involving the $\mathrm{E}_{1u}$ and $\mathrm{E}_{2g}$ modes in multilayer graphene. At very strong pump fields, driving the $\mathrm{E}_{1u}$ mode significantly modifies the $\mathrm{E}_{2g}$ Raman spectrum; however, reproducing the reported response at experimental field strengths requires accounting for pump-induced Raman matrix element dynamics or alternative energy pathways into the $\mathrm{E}_{2g}$ mode. Our findings extend nonlinear phononics beyond average atomic displacements to the dynamics of lattice fluctuations, highlighting the interplay between coherent motion and quantum correlations in driven materials.
arXiv·2026-10-12·Tzula B. Propp, Chris S. Jackson
No generated summary available for this entry.
overview
Original abstract
Since ancient Greek times, geometry has been a method by which humans can make inferences, by the use of similar triangles, about the world far beyond their immediate senses. Similarity plays an equally important role in quantum measurement, except that instead of triangles, the similarity is between the infinitesimal generators of rotation, canonical transformation, or some other virtual symmetry. For many quantum optical measurements of a single mode, these generators produce Kraus operators that are contained within a twelve-dimensional Lie group: the Instrumental Weyl-Heisenberg group manifold ($\mathrm{IWH}^{\textbf{12}}$). In particular, $\mathrm{IWH}^{\textbf{12}}$ is general enough to include all diffusively generated 'dyne measurements. In this paper, $\mathrm{IWH}^{\textbf{12}}$ will be used to develop two more general classes of 'dyne measurement: one that interpolates between diffusive homodyne and diffusive heterodyne (``slomodyne'') and one that adds to 'dyne measurements adaptive squeezing and displacement. Our analysis uses an approach known as the Instrument Manifold Program (IMP). In particular, a Harish-Chandra-like decomposition of $\mathrm{IWH}^{\textbf{12}}$ is used to calculate the vielbein transformation from a right-invariant basis to the corresponding coordinate basis, allowing us to universally and autonomously navigate $\mathrm{IWH}^{\textbf{12}}$ and locate the Kraus-operator of whatever selective process is being considered as it evolves in time according to the measurement record.
arXiv·2026-10-12·Lorenzo Catani, Nesta van der Schaaf, Rui Soares Barbosa
No generated summary available for this entry.
overview
Original abstract
Bell's theorem is popularly stated as the inconsistency of quantum theory with local realism. Realism is here formalized by the ontological models framework, where elements of reality are points of a measurable space and probabilities obey the Kolmogorov axioms. In the Bell scenario, locally causal ontological models posit a common cause supporting a global valuation, a joint assignment of outcomes to all measurements at once, across incompatible contexts. Within this notion of realism, Bell's theorem makes any realist explanation of the quantum predictions conspiratorial: any mechanism, whether superluminal, superdeterministic, or retrocausal, must be finely tuned so as never to manifest operationally. We redefine realism through a new ontological framework that generalizes the standard one. The elements of reality, which we call records, are no longer points but relational parts of a point-free generalization of a topological space (sublocales of a locale). A record shared by two incompatible contexts establishes the sameness of a measurement across them, without such pairwise identities composing into a global valuation, and the common cause is then a web of such records. Within this framework, Bell's no-go theorem becomes a go theorem: local causality, restated for records, is no longer at odds with the quantum statistics. This is possible because modularity, the inclusion-exclusion law of classical probability, fails across incompatible contexts, so that the probability theory generalizes Kolmogorov's. We exhibit explicit models reproducing several quantum strategies, including the optimal CHSH violation. More broadly, locally causal models of this kind attain every Bell-CHSH value up to the algebraic maximum. A realist explanation of the quantum predictions need not be conspiratorial; every causal influence posited by these models is reflected in the operational predictions.
arXiv·2026-10-12·Daniel Margineda et al.
No generated summary available for this entry.
overview
Original abstract
Intercalation of molecular species provides a route to tailor the electronic structure in van der Waals superconductors, yet intercalated compounds have rarely been integrated into phase-sensitive quantum devices. Here, we realize hybrid molecular Josephson junctions based on TaS2/NbSe2 heterostructures. Selective intercalation of the TaS2 electrode induces monolayer-like Ising superconductivity, while the junctions exhibit asymmetric Fraunhofer interference, field-induced and spontaneous Josephson diode effects. The zero-field diode disappears upon reversing the electrode stacking and re-emerges after intercalating the lower NbSe2 electrode. These findings indicate that the hybrid superconducting electrode hosts unconventional superconductivity underlying the nonreciprocal transport, while molecular intercalation acts as a tuning knob for its internal phase structure. This behavior is consistent with a time-reversal-symmetry-breaking multiband superconducting state characterized by a nontrivial relative phase between superconducting condensates. Our results establish hybrid molecular Josephson junctions as a quantum-device platform for phase-sensitive investigation and integration of molecularly engineered superconductors, opening opportunities to uncover and engineer unconventional superconducting phases.
arXiv·2026-10-12·Shengyan Ma et al.
No generated summary available for this entry.
overview
Original abstract
Quantum state texture (QST) is a recently proposed quantum resource that characterizes the nonuniformity of a density matrix in a given computational basis. In the resource theory of QST, the Fourier states f_k are maximally resourceful states, attaining the maximum QST measure. We study the QST behavior of three maximally resourceful states in a two-mode Dirac field under Hawking radiation from a Schwarzschild black hole, using a fidelity-based measure. We consider three cases: only mode B undergoes radiation, only mode A undergoes radiation, and both modes undergo radiation simultaneously. Our results show that for single-mode radiation, if the mode unaffected by radiation is orthogonal to the single-mode textureless state, the QST of the overall output state remains maximal and is independent of the Hawking temperature; we call this phenomenon orthogonality protection. When both modes undergo radiation simultaneously, orthogonality protection vanishes, and the QST of all three Fourier states decreases with increasing Hawking temperature. Notably, the QST measure of f_3 under two-mode radiation is higher than that under only mode B radiation, indicating that QST can be redistributed among modes: QST gained by one mode under radiation can partially compensate for QST lost by the other. We further provide a general resource-theoretic explanation of orthogonality protection, showing that this phenomenon is independent of the specific form of the QST measure. These results reveal how QST degrades under Hawking radiation and provide a new perspective on the redistribution of quantum resources in black hole backgrounds.
arXiv·2026-10-12·A. Núñez Marcos et al.
No generated summary available for this entry.
overview
Original abstract
Hexagonal boron nitride (hBN) is a promising material platform for quantum technologies, enabling both the realization of nanophotonic devices and the hosting of point defects that act as high-quality single-photon emitters (SPEs). Among these defects, B centers, which reproducibly emit at 436 nm, can be generated individually at predefined positions using electron beam irradiation, a crucial capability for top-down quantum photonics. Yet, the spatial accuracy of emitter creation strongly conditions the potential applications. Here, we generate arrays of individual B centers in a scanning electron microscope (SEM) with in-situ cathodoluminescence (CL) monitoring. We characterize the sources of random deviations from the target positions to identify the limitations to their deterministic positioning. In particular, we measure the distance between the electron beam and the emitter at the moment the emitter is created based on CL mapping. This approach provides a direct estimation of the spatial extent of the beam-emitter interaction. We find this contribution to be the main constraint to the emitter fabrication accuracy, yielding a standard deviation of 27 nm. Additional contributions, primarily from the finite density of UV-emitting carbon dimer precursors, increase the overall positional standard deviation to 40 nm. Our results highlight the possible improvements to the B center creation technique to reach sub-10 nm accuracy.
arXiv·2026-10-12·Gebrat Porta-San Miguel, Shahram Panahiyan, Dieter Jaksch
No generated summary available for this entry.
overview
Original abstract
As quantum hardware enters the fault-tolerant regime, algorithms are beginning to be executed on encoded qubits, yet scalable certification of how well they run remains an open problem. Here we introduce magic-free certification, a certification protocol for universal fault-tolerant circuits that consumes no magic, the resource that generally places them beyond efficient classical simulation and is by far the most expensive element of a fault-tolerant computation. The protocol is code- and decoder-agnostic, runs interleaved with the target circuit on the same device, and has a sample complexity that grows linearly with the number of logical qubits and non-Clifford gates while remaining decoupled from the logical error rate itself. Given a predefined error tolerance $p_L^*$, the protocol determines at a chosen confidence level whether the device executes the target circuit at a logical error rate below $p_L^*$. The method relies on trap circuits, copies of the target with every magic state replaced by a stabilizer state, whose outcomes are deterministic and which, being indistinguishable from the target to stochastic Pauli noise, fail at the same rate. We illustrate the protocol in Steane-code simulations of a magic state injection gadget and a quantum Fourier transform.
arXiv·2026-10-12·Anton Firc et al.
No generated summary available for this entry.
overview
Original abstract
A central goal of quantum machine learning is to identify applications in which small quantum circuits can improve task performance while remaining executable on real hardware. We investigate deepfake (synthetic) speech detection, a largely unexplored application in this area, where reliable confidence scores are as important as discrimination performance because deployment decisions are made at fixed thresholds and overconfident errors can be costly. We introduce QBFF, which routes a compressed speech representation through a small 8-qubit variational circuit (VQC) used as a drop-in bottleneck, with a matched classical bottleneck as the control. The quantum circuit yields better-calibrated confidence in most matched comparisons, including out-of-distribution evaluation, though the downstream deployment-cost benefit is model-dependent. We then run the same circuit on a real IBM quantum processor. To our knowledge, this is the first anti-spoofing pipeline to run on a QPU; hardware execution demonstrates feasibility, with lower subset EER and $C_{llr}$ but higher mean actDCF than the matched classical reference. Together, these results show that hardware-executable quantum bottlenecks can improve score reliability, with gains that vary by evaluation setting.
arXiv·2026-10-12·Roxane Thériault, George Zahariade
No generated summary available for this entry.
overview
Original abstract
We study a system of two quadratically-coupled harmonic oscillators, prepared respectively in the ground state and in a coherent state. This toy model can describe for instance the dynamics of one mode of a quantum field evolving in a harmonically-oscillating classical background. In such situations, it is well-known that, depending on the background oscillation amplitude and coupling strength, the system may exhibit parametric resonance. Using the Feynman-Vernon influence functional, we analyze the interplay between parametric resonance and quantum entanglement by perturbatively computing the purity of the mixed state resulting from tracing over one of the oscillators. We find a runaway behavior of the quantum entanglement between the two oscillators, as well as a rapid breakdown of the validity of perturbation theory, in regions of parametric instability. This provides a quantitative confirmation of various statements in the literature and is highly relevant to questions pertaining to the validity of the semiclassical approximation in coupled quantum-classical systems.
arXiv·2026-10-12·Anna Schroeder et al.
No generated summary available for this entry.
overview
Original abstract
Randomized quantum algorithms for the estimation of expectation values of molecular observables offer a promising route to early fault-tolerant quantum advantage by trading circuit depth for an increased number of samples. However, this begs the question whether the resulting measurement overhead remains feasible for industrially relevant molecular systems. In this work, we benchmark the randomized sampling algorithm of Wang et al. [1] through numerical simulations on a hydrogen molecule and resource estimates for various active spaces of the cytochrome P450, an industry-relevant system in the pharmaceutical industry. Our numerical simulations reveal that the analytical error bounds significantly overestimate the actual sampling error, whereas the analytical bound on the required imaginary evolution time is comparatively tight, exceeding a direct DMRG estimate by roughly 44% for the active space where the comparison is feasible. The measurement overhead nevertheless remains prohibitively high: even for the smallest active spaces, the expectation-value estimation alone requires around 1010 samples, scaling to beyond 1015 for the largest active spaces considered. These results suggest that substantial improvements in measurement strategies or algorithmic scaling are necessary before randomized early-fault-tolerant algorithms become competitive for industrial quantum chemistry applications.
arXiv·2026-10-12·Stefano Tinelli, Francisco Lázaro, Francisco García Herrero
No generated summary available for this entry.
overview
Original abstract
We propose Pathfinder-BP, a recursive decoder for topological quantum codes that combines belief propagation with controlled bit-flipping. An initial BP pass identifies and permanently fixes high-confidence errors. Upon convergence failure, the decoder recursively explores alternative error patterns by tentatively flipping low-confidence variables. On surface codes, Pathfinder-BP achieves a noise threshold and logical error rate comparable to minimum-weight perfect matching (MWPM). A crucial advantage of Pathfinder-BP is its highly parallelizable structure, which yields a worst-case decoding latency quasi-linear in the code distance, making it a suitable candidate for low-latency hardware implementation.
arXiv·2026-10-12·Piotr Ćwikliński
No generated summary available for this entry.
overview
Original abstract
An isolated quantum system evolves reversibly, yet a small subsystem can lose nearly all information about its initial state. Conserved quantities may retain some of this information, depending on how strongly they overlap with local observables. Here we consider a subsystem in an arbitrary initial state coupled to a maximally mixed bath. We show that the worst-input mean-square equilibration error, maximised over window origins, is bounded from above and below by the mean square of a complete local autocorrelation, with the stationary part subtracted. A correlation record over a finite interval therefore controls the equilibration error in every interval of the same length. The result allows arbitrary degeneracies of energies and gaps. We apply it to two static Hamiltonian families. For fixed spin subsystems in the one-particle sector of a bounded-range periodic clock, fixed-accuracy thermalisation is guaranteed on windows that grow only slightly faster than linearly with system size, despite exponentially small positive energies. A random commuting model with logarithmic interaction range retains an extensive set of conserved observables. Its expected mean-square error is bounded by a finite-size term and an inverse-time term. The inverse-time dependence is unavoidable because of the initial transient. These examples show how local relaxation can coexist with exact conservation laws and a finely spaced spectrum.
arXiv·2026-10-12·Ian Marquette, O. Ogulcan Tuncer, I. Yurdusen
No generated summary available for this entry.
overview
Original abstract
We construct representations of the symmetry algebra and derive the exact spectrum of a three-dimensional oscillator with two spin-$\tfrac12$ degrees of freedom. The Hamiltonian and its first-order scalar and pseudo-scalar integrals were obtained in earlier classifications. Here we determine their action on the complete spectral basis. At fixed total angular momentum, a quadratic algebra acts on the three triplet orbital channels and admits a three-dimensional deformed-oscillator representation, while an overlapping two-state exchange algebra joins the middle triplet to the singlet. These finite modules determine angular--spin multiplicities but do not quantize the radial energy. A separate positive-discrete-series $su(1,1)$ representation of the common radial Hamiltonian generates the energy sequence. We give the finite matrices, Casimir and structure functions, normalized eigenfunctions, radial ladder actions, the exceptional $j=0$ sector, complete energy-shell multiplicities, and the effect of particle interchange.
arXiv·2026-10-12·Xing Lin et al.
No generated summary available for this entry.
overview
Original abstract
Quantum random number generators are crucial for information security, yet existing implementations are hindered by bulky optics, device imperfections, and state alignment constraints. Here, using a compact metasurface platform, we achieve polarization-independent certified randomness by establishing a quantitative quantum graph framework. By mapping multi-channel nanophotonic responses onto graph vertices, we assign metasurface measurements an operational information-theoretic meaning, directly connecting weighted graph degrees to conditional min-entropy estimation. The resulting graph-certified measurements yield robust private randomness even under entanglement-based attacks without complex optics. Experimentally, we fabricate 4- and 6-channel dielectric metasurfaces to implement high-dimensional positive operator-valued measure graphs, successfully certifying randomness with heralded single photons and Poissonian light. By integrating complex quantum measurements into a single passive layer, our metasurface quantum graphs provide a scalable route for integrated quantum technologies.
arXiv·2026-10-12·Morgan Jones
No generated summary available for this entry.
overview
Original abstract
We show that completely positive maps can be decomposed into sums of submaps which are close in completely bounded trace norm but as far apart as possible in terms of geometric channel fidelity. We then show that this kind of behavior extends to a large class of quantum channel divergences. We construct quantitative norm estimates for quantum channel divergences in terms of the Arveson-Radon-Nikodym theorem.
arXiv·2026-10-12·Frits Verhagen
No generated summary available for this entry.
overview
Original abstract
In this PhD thesis, we take an axiomatic approach to studying multivariate divergences, which are measures of the information content of a tuple of classical or quantum states. These divergences are studied in the context of large-sample and catalytic convertibility of tuples of states. This type of convertibility is characterized by the ordering of an axiomatically defined family of divergences. In this thesis, we identify this family of divergences explicitly for two scenarios, one classical and one quantum. In the classical setting, we show that the relevant divergences are certain generalizations of the bivariate Rényi divergences. Unlike previous studies, we do not require the distributions to have the same support, yielding interesting new divergences. In the quantum setting, we consider pairs of classical-quantum states with pure component states, and find that majorization is characterized by all $α$-$z$ relative entropies for $α<1$. This demonstrates the first operational interpretation of these relative entropies.
arXiv·2026-10-12·Shashank Shekhar, Siddhartha Santra
No generated summary available for this entry.
overview
Original abstract
Genuine multipartite entanglement (GME) is a valuable resource for quantum technologies, but quantifying it in many-body systems can be demanding since measures defined through optimizations over bipartitions are often assumed to require large joint measurements and many measurement settings. We introduce the concepts of GME evaluation length and GME evaluation number, which capture, respectively, the largest subsystem that must be jointly measured and the number of distinct subsystems that need to be measured to evaluate multipartite entanglement measures defined via bipartition optimizations. Taking the genuine multipartite concurrence (GMC) as a canonical example, we show that, for $N$-qubit Haar-random pure states, the GMC can be evaluated using only $N$ single-qubit purity measurements. Thus, for typical many-body states, evaluating the GMC requires considering only the $N$ single-site bipartitions, rather than the exponentially many distinct bipartitions. We further corroborate this behavior numerically for physically accessible states generated by local random quantum circuits. Our results show that the practical cost of quantifying GME can be dramatically lower than suggested by its formal definition, establishing measurement complexity as a complementary operational lens for multipartite entanglement.
arXiv·2026-10-12·Y. -H. Huang et al.
No generated summary available for this entry.
overview
Original abstract
A one-dimensional waveguide is a crucial medium for transferring propagating quantum information between remote qubits, yet the photon-mediated interaction is typically fixed by the static device geometry, qubit parameters, and their couplings to the transmission line. Such an interaction can be engineered to be coherent or dissipative via virtual- or real-photon exchange, respectively, yet its effective strength remains fixed in either case. Here we demonstrate dynamical control over this interaction by applying Floquet engineering to two superconducting qubits coupled to a waveguide terminated by a capacitive mirror. By positioning one qubit at an antinode and the other qubit at a node or an antinode of the resonant standing wave, we realize a Hermitian or non-Hermitian coupling between the two qubits. A periodic flux drive of the qubit frequencies then enables on-demand control of the coherent energy splitting and the collective decay. Our results establish Floquet engineering as a route to dynamically reshape both coherent and dissipative photon-mediated interactions between remote quantum emitters.
arXiv·2026-10-12·Tongyang Li et al.
No generated summary available for this entry.
overview
Original abstract
The Tarski fixed-point problem asks for a fixed point of a monotone map on a $k$-dimensional grid lattice of width $n$ and has applications in game theory, economics, and verification. Substantial gaps remain between the known upper and lower bounds on its quantum query complexity. We prove two hardness bootstrapping theorems for quantum query lower bounds. Starting from a hard instance family whose instances have pair-wise incomparable unique fixed points, and a lower bound established by the nonnegative adversary method, we bootstrap this lower bound by (i) a factor of $Ω(t)$ when the dimension is multiplied by $t$ and the width remains unchanged, and (ii) a factor of $Ω(\log m)$ when the width is multiplied by $m$ and the dimension is doubled. Applying these theorems, we obtain three consequences: (i) an $Ω(k\log^2 n)$ lower bound for $k\geq 4$, improving previously best-known classical and quantum lower bounds; (ii) for every fixed constant $α>0$, there exists a constant $δ(α)>0$ such that $Q_ε(\text{Tarski}(n,k))=Ω(kn^{δ(α)})$ whenever $k>n^α$, and in particular, an $Ω(kn^{0.0072})$ lower bound for $k>n^{2/203}$, the first lower bound with simultaneous linear dependence on the dimension and polynomial dependence on the width; and (iii) a superpolynomial lower bound of $(k/\log k)^{Ω(\log k)}$ for exponentially wide grids, where $n=2^{Θ(k)}$. The last result rules out a route to polynomial-time algorithms for simple stochastic games and ARRIVAL through generic polynomial-query black-box Tarski solvers.
arXiv·2026-10-12·Fengquan Zhang et al.
No generated summary available for this entry.
overview
Original abstract
Deterministic preparation of bosonic resource states is a central task in continuous-variable quantum information processing and quantum metrology. Here we develop a measurement-based imaginary time evolution (MITE) protocol for preparing squeezed and non-Gaussian states. The protocol combines ancilla-mediated weak measurements of the Hamiltonian with a conditional phase rotation that suppresses excited state trapping and stabilizes convergence toward the ground state. The method is potentially applicable in hybrid discrete variable-continuous variable (DV-CV) platforms, where the qubit acts as the measurement readout. We demonstrate deterministic convergence over a broad range of parameters and show that the performance degradation near the stability boundary is governed by the shrinking Bogoliubov quasiparticle gap. The same framework also extends to non-Gaussian bosonic resource states, including Schrödinger cat states and excited states of the single-mode squeezing Hamiltonian, which display Wigner negativity. The squeezed states remain robust under bosonic loss over experimentally relevant regimes.
arXiv·2026-10-12·Mohamed Meguebel, Nadia Belabas, Nicolas Fabre
No generated summary available for this entry.
overview
Original abstract
Quantum teleportation, a key building block for quantum technologies, enables distant parties, Alice and Bob, to transfer an unknown quantum state using entanglement, local operations, and classical communication. In this work, we propose a quantum teleportation protocol for single-photon time-frequency continuous variables, where time is the time of arrival at a detector. We detail the operational requirements of the protocol, notably the nonlinear interactions needed for the photon-photon time-frequency entangling gate. By explicitly treating the detector position as the reference frame for time of arrival, we show that, even with ideal classical and quantum channels, the input-output fidelity is not unity unless the receiving party can correct the detector-position mismatch. This results in a trade-off between teleportation fidelity and the temporal bandwidth of the input photon wavepacket. The protocol itself can be used for remote detector synchronization. In particular, we show that time-frequency cat and Gottesman-Kitaev-Preskill states provide an internal temporal ruler through fidelity revivals. We further derive the classical and best-copy fidelity thresholds for single-photon Gaussian wavepackets, finding that the relevant vacuum-equivalent shot noise is input-dependent, in contrast with quadrature-based continuous-variable quantum teleportation. Our proposal derives from a quantum theory of space-time events, whereafter we establish space as a reference for the time degree of freedom, thereby grounding our work in ongoing research on reference frames and superselection rules in quantum optics and quantum information. Beyond protocols harnessing time-frequency continuous variables of single photons, this work points toward remote synchronization in quantum communication architectures.
arXiv·2026-10-12·Isaías Vallejo-Fabila, Jing Yang
No generated summary available for this entry.
overview
Original abstract
The spectral form factor (SFF), which is the Fourier transform of the two-point spectral correlation, is a fundamental diagnostics of quantum chaos. Nevertheless, its experimental detection in quantum many-body systems was less unexplored until recently. Here, we establish a relationship between the SFF with the quantum Fisher information (QFI) by means of quantum sensing protocols. Furthermore, when the eigenvalues and eigenstates of the disordered Hamiltonian are statistically independent, we prove that QFI is typical both in short and long timescales while numerics suggest that it is also typical at intermediate timescales, which ensures self-averaging of QFI. The self-averaging property renders the experimental measurement of QFI with our protocol less noisy in contrast with the direct measurement of SFF which is known to be non-self-averaging. Our results reveal an intriguing connection between quantum noise and the signatures of quantum chaos.
arXiv·2026-10-12·Yasoda Lasiru Ariyarathna Epa et al.
No generated summary available for this entry.
overview
Original abstract
Label noise is prevalent in medical image datasets, arising from observer disagreement and ambiguous cases and deep networks memorize the mislabeled examples at the cost of generalization. Current solutions such as loss correction and sample selection add training complexity and generally assume the noise rate is known or estimable. This paper investigates whether robustness can be obtained architecturally, by routing a frozen backbone's features through a low-dimensional bounded bottleneck and classifying them with a head whose function class is intrinsically smooth. Variational quantum circuits with angle encoding and a linear cost function realise exactly such a class. Their use in medical imaging, however, has been limited by the small number of qubits available on noisy intermediate-scale devices, which typically restricts inputs to low-resolution grayscale images. We therefore couple a frozen ImageNet-pretrained ViT-B/16 backbone to a trainable linear bottleneck and an eight-qubit variational quantum circuit, allowing 224x224 RGB inputs to be processed. Under clean labels the model leads five of six MedMNISTv2 benchmarks against published hybrid quantum-classical models, with margins of 17.4 and 15.7 percentages on BloodMNIST and PathMNIST. The advantage emerges under corrupted labels. At symmetric noise rates of 30% and 50% the model outperforms many published quantum and noise-robust classical baselines on all six datasets without any explicit noise-handling component. Against a control that shares the backbone, bottleneck, parameter count and optimizer and replaces only the circuit with a ReLU layer, it retains 89.75% accuracy on PathMNIST at 50% noise where the control falls to 78.96%. Direct measurement of training dynamics shows that this advantage is not an inability to fit corrupted labels, which the circuit retains, but greater stability under prolonged training on them.
arXiv·2026-10-12·Seongjin Jeon et al.
No generated summary available for this entry.
overview
Original abstract
Predicting quantum-photonic circuit performance requires retaining source and device physics without making photon-counting calculations prohibitively expensive. Here we present PhoQuS, a framework that combines frequency-resolved source models, electromagnetic compact models and spatially correlated fabrication variation to simulate quantum photonic circuits. Covariance-Gram reduction after full-resolution Gaussian propagation lowers readout cost while retaining dominant spectral correlations. For continuous-variable state preparation, spectral reduction accelerates photon counting by 60.4-fold in an approximate Gottesman-Kitaev-Preskill circuit. Frequency-resolved modeling guides the use of cascaded squeezing with temporal walk-off compensation, yielding 0.99 fidelity to the single-mode circuit reference and 0.98 conditional purity in lossless simulations. For discrete-variable state preparation, simulations of three-photon Greenberger-Horne-Zeilinger circuits across a virtual wafer show that component robustness alone does not predict circuit fidelity, which depends jointly on source spectra, circuit architecture and control. PhoQuS connects device physics to protocol-level performance through a unified workflow that retains spectral detail while reducing readout cost.
arXiv·2026-10-12·Somshubhro Bandyopadhyay
No generated summary available for this entry.
overview
Original abstract
We consider an orthogonal basis of $\mathbb C^2\otimes\mathbb C^2$ with three entangled states and one product state. This basis is not perfectly distinguishable by LOCC or even by separable measurements when a single copy of the unknown state is available. We show that with two copies no adaptive separable protocol, which measures the copies one at a time, distinguishes the basis perfectly. We then show that a collective separable measurement on the two copies does. Whether two copies suffice for LOCC remains open.
arXiv·2026-10-12·Yiran Huo, Pengfei Zhang
No generated summary available for this entry.
overview
Original abstract
Quantum few-body systems exhibit a rich variety of phenomena that provide fundamental insights into universality. A paradigmatic example is the Efimov effect, in which an infinite tower of three-body bound states emerges with binding energies forming a geometric sequence. Motivated by advances in trapped-ion systems, recent theoretical work has predicted that the Efimov effect can arise in certain long-range quantum spin chains, where magnons exhibit a general dispersion $ε_k=u|k|^z$ with $z\in(0.52,0.88)$ and interact through a contact potential. Nevertheless, whether Efimov universality persists in the presence of experimentally relevant long-range interactions between magnons remains unexplored. In this work, we address this issue by investigating the two- and three-magnon problems with a model interaction potential $V(x)=V_0/(1+|x|^β)$. Our results demonstrate that few-body universality persists for any $β>1$: In the two-magnon sector, the low-energy expansion of the scattering matrix near a two-body resonance agrees with the universal form predicted by contact-interaction theory. The three-magnon bound-state spectrum exhibits Efimov scaling, with a scaling factor consistent with the theory. We further highlight the experimental relevance of our model, which can be readily realized in trapped-ion systems. Our results pave the way for quantum simulations of universal few-body physics beyond the traditional paradigm of nonrelativistic particles.
arXiv·2026-10-12·Owais Ishtiaq Siddiqui et al.
No generated summary available for this entry.
overview
Original abstract
Authentication in quantum-aware communication settings requires mechanisms that verify user legitimacy while also assessing whether the communication channel exhibits excessive disturbance. This paper presents QIAP, a stateful hybrid framework that combines classical commitment-based challenge-response authentication with BB84-based quantum-channel monitoring. QIAP uses a dual-branch verification structure inspired by rectilinear and diagonal basis selection. In the rectilinear branch, the prover opens a hash-based commitment and the verifier checks consistency with the registered round token. In the diagonal branch, the prover returns an HMAC tag bound to the verifier nonce, round identifier, and submitted commitment without disclosing the round-specific sub-secret. Under the stated hash, HMAC, freshness, secure-registration, protected-storage, and high-entropy-secret assumptions, QIAP provides computational resistance to the modeled wrong-secret and replay attempts and protects the long-term master secret from direct recovery. After successful authentication, the BB84 module estimates the quantum bit error rate (QBER) and aborts the session when the measured value reaches or exceeds the configured threshold. In the reported simulation, no successful authentication was observed among 1,000 tested wrong-secret attempts per branch. The baseline and full intercept-resend conditions produced mean QBER values of approximately 0.02 and 0.25, respectively. The classical authentication stage required approximately 0.6 ms, and the implemented authentication messages required approximately 113 bytes per round. These results indicate that QIAP can provide a lightweight hybrid framework for combining secret-based identity verification with QBER-based channel-disturbance assessment under the stated threat model.
arXiv·2026-10-12·Xilong Wang et al.
No generated summary available for this entry.
overview
Original abstract
Precise manipulation of qubits (spins) requires strong suppression of noise arising from couplings between qubits and their environment, as well as from driving field fluctuations. We propose a double-pulse sequence and an eighteen-pulse sequence to realize a single spin pi-rotation under off-resonance conditions (instead of conventional on-resonance or near-resonance conditions). It is proved that the latter sequence performs much better than the former in simultaneously suppressing both dephasing and driving field noise. As a proof of principle, we experimentally demonstrate, by implementing both sequences in an NMR spin system with a polarized initial spin state, that the off-resonance pi-rotation fidelity reaches as high as 0.9992 +/- 0.0008 for the double-pulse sequence and 0.9997 +/- 0.0006 for the eighteen-pulse sequence. In addition, the noise-tolerance range of the eighteen-pulse sequence is about 20 percent of the driving field strength, approximately three times wider than that of the double-pulse sequence. Besides its potential application in the NMR community, our proposal provides an alternative practical way to accurately control qubits by suppressing the coexisting transversal and longitudinal noises.
arXiv·2026-10-12·Zhiwen Zhou et al.
No generated summary available for this entry.
overview
Original abstract
Efficient spin transport with high spin mobility is of both fundamental and practical significance for spintronics. Spin can be transferred by moving particles. However, particle scattering limits spin transfer and prevents high spin mobilities. In this work, we study the kinetics of spin transport mediated by a quantum system of indirect excitons (IXs) in a van der Waals heterostructure composed of atomically thin transition-metal dichalcogenides (TMDs). This spin transfer mechanism allows for the realization of efficient spin transport characterized by a high spin mobility reaching 10$^5$ cm$^2$/(eV$\cdot$s), which is orders of magnitude higher than that achieved via standard diffusive spin transport in TMD materials. The suppression of IX scattering enables high-mobility spin transport.
arXiv·2026-10-12·Ulysses Camara da Silva
No generated summary available for this entry.
overview
Original abstract
An exactly solvable lattice with periodic inverse-square singularities exhibits two physically distinct mechanisms of spectral-gap closure. The model arises from the generalized trigonometric Pöschl-Teller potential in the coupling range where both local solutions at each singularity are square-integrable. A transmitting, current-preserving self-adjoint matching condition connects neighboring cells and generates a nontrivial Bloch spectrum. For a generic lattice with two inequivalent singular sublattices, the spectrum contains two alternating families of gaps, and the band edges reproduce the scale-invariant spectra of the associated finite singular system. One gap family closes when the two sublattices become equivalent. In this symmetric limit, however, the primitive period halves, so the apparent band crossing results from Brillouin-zone folding. A different family closes at a critical but genuinely asymmetric configuration. Because the primitive period is preserved, adjacent bands then meet at the center of the original Brillouin zone in a genuine massless Dirac-like cone. Near either critical limit, a small finite gap acts as an effective Dirac mass: the dispersion remains quadratic near a band edge but crosses over to a massive Dirac-like form beyond that narrow region. The band curvatures define effective electron and hole masses. Exact Bloch eigenfunctions further reveal that isospectral lattices can display different single-particle probability densities. This model therefore provides an analytically controlled one-dimensional setting in which conventional quadratic carriers, massive Dirac-like band dispersions, and a tunable massless contact coexist within the same singular lattice.
arXiv·2026-10-12·Jincheng Lu, Chen Wang
No generated summary available for this entry.
overview
Original abstract
We show that a common quantum-jump feedback protocol can permanently reverse the nonequilibrium free-energy ordering of two prescribed initial states while preserving their Gibbs equilibrium. The construction exploits collective compensation between monitored channels: their feedback corrections cancel at equilibrium but remain active during relaxation. This balance preserves free-energy monotonicity while allowing the relaxation modes to be reshaped. We prove that eliminating the complete slow-sector contribution of the initially higher-free-energy state, while retaining it for the comparison state, produces distinct asymptotic decay exponents. Their free-energy ratio then vanishes at long times, guaranteeing a permanent thermodynamic quantum Mpemba inversion under the same controlled dynamics. A thermal qutrit realizes the mechanism through coherence interference and exhibits distinct detection thresholds for spectral selection and exact slow-sector cancellation under feedback retuning.
arXiv·2026-10-12·Alex Krasnok
No generated summary available for this entry.
overview
Original abstract
Small particles respond to light through electric and magnetic patterns called multipoles. Their interference determines the direction of scattered light and affects the decay of nearby emitters. Larger nanoantenna arrays, metasurfaces, and other nanophotonic systems demand increasingly costly simulations to meet strict performance and reliability requirements. We show how to represent these responses with quantum bits (qubits) and use quantum circuits to calculate scattering and the Purcell effect, the change in an emitter's decay rate caused by its surroundings. The circuits can encode known multipoles or estimate unknown ones from Maxwell's equations at the particle surface. We test the method against classical theory using an ideal quantum simulator and real IBM and IonQ quantum computers. For a silicon nanoparticle of radius 78 nm illuminated at 679 nm, IonQ gives a forward directivity of 2.984, close to the ideal dipolar value 3, quantifying the concentration of scattered light in the forward direction. For an emitter 10 nm from a gold nanoparticle and emitting at 510 nm, IBM measurements yield a calculated total decay rate 20.48 times its vacuum value versus 20.47 from theory, with correction for errors in reading the qubit states. We also establish how the number of multipoles and the required accuracy set the demands on qubits and measurements. These results motivate quantum-assisted design studies of directional radiation and emitter decay in nanophotonic systems.
arXiv·2026-10-12·Pratik Sathe et al.
No generated summary available for this entry.
overview
Original abstract
Topological insulators lie outside the standard Landau paradigm: Instead of being characterized by local order parameters and spontaneous symmetry breaking, their defining properties are encoded in the global structure of their quantum states and manifested as robust boundary states. Crystalline higher-order topological insulators can extend this principle by hosting localized corner modes in two and higher dimensions. Although these boundary modes can be detected spectroscopically through the local density of states, determining the underlying bulk topology, for example through nested Wilson loops, remains an outstanding experimental challenge. Here we use up to 728 qubits in a superconducting analogue-digital quantum simulator to realize and probe a hierarchy of one-, two-, and three-dimensional topological insulators governed by effective tight-binding Hamiltonians. By reconstructing complex propagators from real-space measurements, we obtain complementary boundary and bulk characterizations: local densities of states reveal localized boundary modes, whereas experimentally reconstructed band projectors yield bulk topological invariants, culminating in a three-dimensional octupole moment extracted through third nested Wilson loops. These results establish a route to realizing, characterizing, and manipulating topologically protected states in programmable three-dimensional quantum matter.
arXiv·2026-10-12·Hiromichi Hayashi, Takeshi Sato
No generated summary available for this entry.
overview
Original abstract
Orbital optimization within the variational quantum eigensolver (VQE) framework is useful for improving active-space quality and accurately capturing electron correlation with shallow quantum circuits. The orbital-optimized unitary coupled cluster (OO-UCC) method [W. Mizukami et al., Phys. Rev. Res. 2, 033421 (2020)], in its original formulation, employs the orbital gradient and Hessian in a Newton--Laphson procedure. In this study, we propose sequential orbital-optimized unitary coupled cluster doubles (SOO-UCCD), extending the gradient-free sequential minimal optimization approach [K. M. Nakanishi et al., Phys. Rev. Res. 2, 043158 (2020)] to orbital rotation parameters. Based on the frequency structure implied by the algebraic properties of the orbital rotation generators, our method determines each orbital rotation angle from a nine-point energy profile. The energy landscape is evaluated by classically transforming the Hamiltonian integrals and contracting them with the reduced density matrices already measured for the VQE energy evaluation. This allows for orbital optimization without evaluating the orbital gradient or Hessian. By building on the core benefits of the OO-UCC framework, our method provides a gradient-free and hyperparameter-free orbital-optimization procedure. State-vector simulations for LiH in the STO-3G basis show that SOO-UCCD reproduces UCCSD-level accuracy along the bond-stretching curve and exhibits macro-iteration convergence comparable to that of L-BFGS-based orbital optimization.
arXiv·2026-10-12·Lev Gruber et al.
No generated summary available for this entry.
overview
Original abstract
Entanglement witnesses are a key instrument in determining the entanglement of unknown bipartite qubit systems without requiring a full tomography. Riccardi et al. (2020) proposed a set of two-qubit witnesses, denoted $\{W^3\}$, which require a set of local measurements in three bases. In this work we propose an additional set of witnesses, denoted $\{W^5\}$, that build on $\{W^3\}$ and require measurements in two additional bases. We present an adaptive two-step method that uses the measurement results obtained for $\{W^3\}$ to select which $W^5$ to evaluate. We computationally demonstrate that our adaptive two-step protocol can identify 72% of entangled states generated according to the methods of Roik et al. (2021) while requiring measurements in only five of the nine bases needed for full quantum tomography. Additionally, we experimentally verify the behavior of both sets of witnesses using polarization-entangled photon pairs.
Phys.org Quantum Physics·2026-10-11
No generated summary available for this entry.
overview
Original abstract
Some classical physical systems can explore many configurations over time until their long-term behavior no longer reveals their starting conditions. The sampling of available configurations according to the appropriate statistical distribution is a property called ergodicity.
arXiv·2026-10-11·Xidan Song, Ruifeng Cao
No generated summary available for this entry.
overview
Original abstract
Entanglement entropies of multipartite pure states satisfy linear inequalities; for stabilizer states, the backbone of quantum error correction, the achievable entropy vectors generate a convex cone. We show that, after a linear lift, the closure of this cone is exactly the self-dual slice of a classical object on one more element than there are parties: the closed cone generated by the rank functions of arrangements of subspaces over $\mathrm{GF}(d)$ for a prime local dimension $d$, and of subgroups of abelian groups of exponent dividing $d$ in general. This correspondence brings two features of rank inequalities into play. First, the purifier acts as an extra variable: already for five parties the stabilizer cone is strictly smaller than the quantum linear rank cone, with which earlier evidence suggested it might coincide; an explicit six-variable inequality witnesses the gap. Second, the characteristic of the field enters, so the cone depends on the local dimension. It does not for up to four parties. With enough parties, the cone of $\mathbb{Z}_d$ qudits is contained in that of $\mathbb{Z}_{d'}$ qudits if and only if $d$ divides $d'$, and already for six parties the logical zero state of Steane's code lies outside the stabilizer cone of every odd local dimension. For this last result we show that the seven-variable characteristic-dependent inequalities we checked all follow from Shannon inequalities on the self-dual slice, and instead transfer one of them through a family of subgroups derived from the Fano plane.
arXiv·2026-10-11·Yuewen Hou, Gokul Subramanian Ravi
No generated summary available for this entry.
overview
Original abstract
Fault-tolerant quantum design relies on simulating noisy quantum error correction (QEC) circuits with hundreds to thousands of physical qubits and large circuit depths. High-throughput stabilizer simulators, such as Stim, are the de facto tools for this regime. However, these simulators typically support only Clifford gates and stochastic Pauli noise. As a result, more realistic device noise models-such as coherent control errors and thermal relaxation-are often approximated using Pauli Twirling. This replacement offers speed but can introduce inaccuracies. To address this, we propose QuasiStim for scalable exact QEC simulation of realistic noise, with QuasiFold as a compiler frontend and DeltaFrame as a sampling backend. QuasiFold lowers sampling overhead by merging equivalent non-Pauli sites in the quantum circuit. DeltaFrame samples the resulting stabilizer trajectories by reusing precomputed predicted references instead of resimulating the full tableau for each shot. QuasiFold can reduce the number of shots by over $100\times$ on bivariate-bicycle (BB) codes. Compared to a per-shot tableau simulator, DeltaFrame is $166\times$--$1331\times$ faster on rotated surface-code memory under coherent $R_Z$ noise as $d$ grows from 5 to 35. QuasiStim also makes the PTA bias measurable: the gap is non-negligible and varies with noise strength, decoder, and circuit schedule. QuasiStim will be open-sourced upon publication at https://github.com/isaachyw/QuasiStim
arXiv·2026-10-11·Mark M. Wilde
No generated summary available for this entry.
overview
Original abstract
A multiple-access channel transmits messages from several senders to one receiver. For quantum outputs, the receiver must distinguish states depending on all messages, while tests for different decoding errors may not commute. In this paper, we give a self-contained account of simultaneous decoding, in which one joint measurement recovers the messages at the established achievable rates using independent codebooks. The proof combines Sen's tilted-subspace method with Cheng's analysis of the pretty-good measurement, a standard measurement for distinguishing quantum states. Auxiliary labels close to a common reference state separate the geometric directions associated with different errors. A Gram-matrix bound then allows separately chosen binary tests to certify the performance of one measurement. The labels are removed from the completed decoder, leading to a deterministic packing theorem that applies to finite state ensembles, including unequal priors. We develop the two-sender case first, with worked examples and figures, before treating any fixed number of senders. Sharper finite-error guarantees for the same decoder are developed separately, with sharp bounds for two specified steps of the analysis rather than a claim of globally optimal decoding. Applications recover known achievable rates for unassisted and entanglement-assisted classical communication, distributed classical compression with quantum side information, and coherent-state communication through a beamsplitter or passive multiport device. The common proof makes the geometric mechanism and its quantitative consequences available without repeating the construction for each application.
arXiv·2026-10-11·Nana Siddhartha
No generated summary available for this entry.
overview
Original abstract
Quantum decoherence does not permit the operation of (new) miniaturised devices or protocols that can otherwise run unassisted in classical settings, without explicit user agent intervention in the quantum realm. Classical driving signals are inadequate to model a truly quantum device built entirely in the quantum realm. Synchronisation endures miniaturisation without sacrificing quantum coherence, unlike thermalisation. We quantise the Kuramoto model and the Van der Pol oscillator and couple it with qubit(s) to show a robust limit cycle even in typical quantum thermodynamical settings. Novel effects such as Entanglement State Revivals, Zeno locking and thermal current interference are observed. We propose toy model devices that can be implemented harnessing the Synchronisation of a qubit (or an arbitrary collection of qubits) with a nonlinear phase oscillator. The framework theory used here, Spectral Mechanics, is a fresh look at the foundations of conventional quantum mechanics and is extensible to completely new forms of interactions and models in experimental settings.
arXiv·2026-10-11·Md. Shahinul Islam, Aaryan Reza, Lane G. Gunderman
No generated summary available for this entry.
overview
Original abstract
The protection of quantum information in systems leveraging more than two basis states (qudits) is an ongoing challenge. A tool for transforming the plethora of qubit stabilizer codes into qudit stabilizer codes is the local-dimension-invariant (LDI) extension to the stabilizer formalism. A drawback of the LDI method is that generally in order to ensure the distance of the resultant code is at least preserved the newly selected local-dimension will need to be any prime bigger than a large cutoff value. In this work we consider the repercussions of this large cutoff value, then by focusing on quantum low-density parity-check (qLDPC) codes we are able to bring down this cutoff value. Notably, we are able to reduce it in some cases to the initial local-dimension and for arbitrary CSS qubit-derived codes to singly exponential in $d$ with no dependence on the number of logicals $k$. This reduces the size of the caveat in LDI forms in their distance preservation condition.
arXiv·2026-10-11·Jeffrey H. Shapiro
No generated summary available for this entry.
overview
Original abstract
Zero-added-loss multiplexing (ZALM)~[Phys. Rev. Appl. {\bf 19}, 054029 (2023)] is a midpoint-source scheme for entanglement distribution. Its quantum transmitter (QTX) employs two Sagnac sources of polarization-entangled pairs plus partial Bell-state measurements (BSMs) on their idler outputs to herald entanglement in their signal outputs, thus avoiding the switching losses suffered by other multiplexing approaches. When its Sagnac sources' spontaneous parametric downconverters (SPDCs) utilize $χ^{(2)}$ crystals with phase-matched spectral islands, ZALM avoids the tradeoff between heralding efficiency and output-state fidelity incurred when conventional-crystal SPDCs' outputs are channelized by dense wavelength-division multiplexing filters. This paper reports an end-to-end fidelity and rate analysis for islands-based ZALM that includes: SPDC multipair emissions of all orders and partial-BSM losses in the ZALM QTX; loss in propagation from the ZALM QTX to Alice and Bob's quantum receivers (QRXs); loss and mode mismatch in the mode converters employed at Alice and Bob's QRXs; and loss in the partial-BSM loading of Alice and Bob's emissive quantum memories.
arXiv·2026-10-11·Jan Lewenstein-Sanpera et al.
No generated summary available for this entry.
overview
Original abstract
Quantum localization, the phenomenon by which wave diffusion is halted, here understood as the superposition of propagating waves, can have many different origins, such as onsite random potentials in Anderson localization. However, some systems exhibit complex geometries and could potentially reproduce similar results without external potentials. In this work, we study how localization of single particle states is affected by the underlying topology of a simple but highly predictive complex network model: the geometric soft configuration model $\mathbb S^1$. By tuning the model's temperature and heterogeneity parameters, we are able to generate different structural patterns and focus on the transition from a small-world to a non-small-world regime. Our study suggests that small-world networks tend to have extended states, which spread the whole system's size, in contrast to non-small-world networks which tend to localize, showing how complex connectivity can play the role assigned to random energetic disorder.
arXiv·2026-10-11·Pragna Das, Lev Vidmar, Miroslav Hopjan
No generated summary available for this entry.
overview
Original abstract
We numerically study spectral and wave-function properties, as well as time evolution, in finite-size commensurate approximations of the 3D Aubry-André model. We explicitly show, through scaling analysis, the existence of two critical points. One of the critical points is a localization-delocalization transition in real-space, similar to the critical point in the 3D Anderson model. The other is a localization-delocalization transition in a dual momentum space, which does not have any analog in the 3D Anderson model. We estimate their values from spectral measures, such as the gap ratio and the spectral form factor, as well as from wave-function measures, such as the inverse participation ratio and the participation entropy. Additionally, we demonstrate that both critical points exhibit hallmarks of critical points between quantum ergodicity and localization. First, the eigenstates and the eigenspectrum at the critical point fulfill the mutual universal relation between the eigenspectrum compressibility $χ$ and the eigenstate fractal dimension $d^{(1)}$ [S. Jiricek et al., Proc. Nat. Acad. Sci. 123, e2518027123 (2026)]. Second, the dynamics of the wave packet at the critical point is governed by the critical dynamical exponent $z$, characterized by the spectral fractal dimension and the dimensionality of the lattice [M. Hopjan and L. Vidmar, Phys. Rev. Lett. 135, 060401 (2025)]. Thus, similarly to the 3D Anderson model, the critical dynamical exponent is sub-diffusive with the value of $z=3$.
arXiv·2026-10-11·Hongyu Wu
No generated summary available for this entry.
overview
Original abstract
Ordinal optimization selects designs that are good enough rather than optimal when evaluation is expensive and the budget is small. The alignment probability measures the chance that the selected set contains at least a prescribed number of truly good designs. We formulate quantum ordinal optimization as a class of problems that maximize this probability under a fixed oracle budget. We study exact, coherent pairwise comparisons with one selected design as a first instance, with the budget counted in comparison queries. For every classical comparison budget smaller than the number of designs, we prove that a knockout among uniformly sampled designs attains the optimum. The sample is drawn without replacement and contains one more design than the number of comparisons. For a uniformly random order, the selected design's rank has a polynomial probability law. At the same comparison budget, the maximum quantum degree is at most twice the classical maximum, a factor attained whenever there are more than twice as many designs as comparisons, so a quantum algorithm can realize rank laws that no classical algorithm with the same budget can. We determine the exact quantum optimum with one comparison for every number of designs and every good-enough set. For selecting the best of n designs, the optimal success probability with one quantum comparison is approximately 3.30/n for large n, compared with 2/n for one classical comparison. When the best design is sought, one quantum comparison gives a higher alignment probability than two classical comparisons whenever there are more than nine designs.
arXiv·2026-10-11·Sarbani Chatterjee, Arvind
No generated summary available for this entry.
overview
Original abstract
The Hanbury Brown-Twiss (HBT) effect marked a significant milestone in quantum optics by illustrating that intensity correlations can reveal inherently quantum features of light. Motivated by the structure of the original 8-mode HBT interferometer, we develop a simplified 4-mode toy-model that captures its essential physical ingredients while significantly reducing analytical complexity. Our toy-model provides an intuitive and well-structured framework for examining the desired correlation functions. We investigate whether our toy-model can exhibit genuinely non-classical behaviour by formulating and applying a Bell-type inequality tailored to its specific measurement configuration. Our analysis shows that the correlations generated by the toy-model violate the inequality, indicating the presence of non-local features that are incompatible with any classical hidden-variable description. The results highlight the power of simplified models in uncovering fundamental aspects of non-classicality in optical systems.
arXiv·2026-10-11·Qing Yu et al.
No generated summary available for this entry.
overview
Original abstract
The coherent exchange of pairs of quanta between two bosonic modes is equivalent, up to a numerical factor, to the generator of two-axis twisting, which attains Heisenberg scaling of the squeezing; we determine how much of that equivalence survives in a realistic nonlinear medium. In any such medium the exchange term is accompanied by a local Kerr nonlinearity, and within a sector of fixed particle number the Hamiltonian depends on a single dimensionless ratio of the effective Kerr strength to the exchange strength. We derive two criteria governing this ratio and show that they are independent. The first is the rate at which squeezing is generated: the exponential rate follows in closed form, vanishes exactly when the two strengths are equal in magnitude, and recovers as the square root of the detuning from that point. The second is the depth to which squeezing can be driven: at fixed particle number the attainable depth is a function of the anisotropy of the mean-field saddle alone, reaches the full two-axis-twisting value only for the isotropic saddle, and is independent of the rate, parameter sets sharing the same anisotropy but differing in rate by a sizeable factor giving depths that agree to every printed digit. The closed-form Gaussian dynamics reveals a pitfall: extracting rates from short-time data overestimates them by more than a factor of two unless the saddle is isotropic. An isotropic cubic nonlinearity imposes the value of the ratio where the rate vanishes, so realizing two-axis twisting by pair exchange requires detuning it; a moderate mismatch already recovers almost all of the optimal depth. We also explain why the constraint has not surfaced before: at two quanta the self-Kerr shifts the two coupled states equally, so the two twisting Hamiltonians are rigorously indistinguishable, the degeneracy being lifted only from four quanta.
arXiv·2026-10-11·Pavel Exner
No generated summary available for this entry.
overview
Original abstract
We consider singular Schrödinger operators with an attractive $δ'$ interaction of strength $β$ supported by a star graph and prove that the ground-state eigenvalue is uniquely maximized by stars of the maximum symmetry. Two different proofs are presented, one for an even number of edges using a comparison to the $δ$ interaction star, the other general based on Birman-Schwinger technique.
arXiv·2026-10-11·Zhihong Wu et al.
No generated summary available for this entry.
overview
Original abstract
The integer and fractional quantum Hall effects reveal that quantized physical responses can take integer and fractional values, respectively. This naturally raises the question of whether quantization can extend beyond rational numbers to an irrational value. Here we show that such a quantized response can emerge from the limiting behavior of a finite, experimentally realizable geometric network. We develop a method based on infinite geometric structures, in which a sequence of finite networks rapidly converges toward an infinite limit. Following this approach, we identify a planar network whose normalized resistance converges to the irrational value $\sqrt{3}$, and realize a finite approximation with high-precision geometric control. The measured normalized resistance is $1.735 \pm 0.001\, h/e^2$ for a fully occupied Landau level in the designed pattern. Our experimental results extend the concept of quantization beyond rational values and demonstrate that an irrational quantized response can be approached through a finite physical system.
arXiv·2026-10-11·Andrew Laeuger, Nancy Aggarwal
No generated summary available for this entry.
overview
Original abstract
Levitated dielectric sensors are often treated as perturbative probes of a pre-existing optical field. We show that this picture fails for a novel sensor geometry: a dielectric plate whose transverse extent captures the full optical mode. Even an optically thin sensor with modest refractive index can heavily restructure the intracavity fields, effectively partitioning a cavity into two subcavities with substantial cross-coupling and producing new optical resonances and trapping sites with properties which deviate from the standard intuition. Conventional perturbative expressions for the cavity frequency shift and optomechanical coupling depart from the exact solution at thicknesses as small as $\simλ/(10n)$. Furthermore, cavity locking decreases the coupling and increases the trap stiffness by orders of magnitude, and the coupled subcavity structure permits appreciable optical cooling at zero detuning, a distinct behavior unique to this nonperturbative regime. These effects, sharing a common origin, establish a distinct regime of cavity optomechanics in which the sensor is no longer merely a probe of the cavity field, but an element that helps define it.
arXiv·2026-10-11·Niklas Tausendpfund, Matteo Rizzi
No generated summary available for this entry.
overview
Original abstract
Strongly interacting fermionic chains obeying a $Z_n$ symmetry can host topological phases with highly degenerate ground-state manifolds. The different ground states are connected by strongly bound fractionalized edge modes called parafermionic zero modes. While exactly preserved under time evolution at zero temperature, interactions lead to a destabilization of these modes at finite energy densities, and, given a generic Hamiltonian, obtaining the lifetime of these modes is often impossible as it requires knowledge of the full spectrum of the Hamiltonian or long time evolutions. Here, we propose a novel quantum-inspired algorithm that can be used to variationally search for these almost strong zero modes in generic parafermionic chain models. We demonstrate analytically and numerically that our ansatz faithfully reproduces the exact results and finds strongly bound parafermionic operators in the non-integrable Kitaev-Hubbard chain and chiral Potts model. Our results further allow us to verify the existence of a true strong zero mode in the symmetrical limit of the chiral Potts model for $Z_3$-parafermions.
arXiv·2026-10-11·Takayuki Kubo
No generated summary available for this entry.
overview
Original abstract
Spatial interference can break the inversion symmetry of an effective Josephson potential even in a laterally homogeneous junction with inversion-symmetric local energy. We derive a general criterion based on harmonic-dependent complex spatial form factors: a single local harmonic remains a shifted cosine, whereas multiple harmonics can acquire phases incompatible with any common inversion center, permitting cubic interactions and three-wave mixing. Phase reflection reverses all odd-order expansion coefficients about corresponding minima while preserving the even-order ones. For a capacitively shunted junction at fixed charging energy and arbitrary offset charge, it also preserves the complete quantum spectrum, enabling reversal of the odd nonlinear sector without spectral retuning. A centered cross junction with multiple local harmonics is one concrete example. Within the imposed-field model, a three-component magnetic field can generate an inversion-asymmetric effective potential, and reversing an odd number of field components exactly reflects it without changing the quantum spectrum of the capacitively shunted junction.
arXiv·2026-10-11·Elisa Palacino-González
No generated summary available for this entry.
overview
Original abstract
In molecules, electronic coherence typically decays within a few hundred femtoseconds, a timescale usually attributed to the environment. We show that it is set to a large extent by which coherences are excited: the molecule can host coherences that the bath barely sees, and optimal control can find and exploit them. Using gradient-based optimal control (GRAPE) with Redfield dynamics, we maximize the total vibronic coherence between the electronic ground and an optically bright electronic excited state in a three-state model with nonadiabatic features, in two regimes of low and high nonadiabatic mixing and for different system-bath coupling strengths. The Liouvillian spectrum reveals, in both regimes, a well-separated coherence mode with substantial ground-bright character that decays on a picosecond timescale. This mode is protected by mixing with the dark state, which brings the geometry of the optically accessible excited state close to that of the ground state and thus weakens its coupling to the bath. Without prior information, GRAPE finds this mode and keeps the photoexcited wave packet near the Franck-Condon region. At equal fluence, it increases the coherence at 800 fs by more than two orders of magnitude over a Gaussian pulse at the weakest coupling, and by many more at stronger coupling. The Liouvillian predicts the bath dependence of the long-lived coherence to within 1\%, and a Gaussian pulse tuned to the mode frequency comes within 10\% of the best pulse found. Beyond two-level and spin systems, our study puts forward the vibronic structure of molecules as a route to protected coherence subspaces, identifying a dark-state protection mechanism and a design criterion based on molecular parameters. These results lay the groundwork for our goal of using vibronic molecular systems as a resource for long-lived, controllable coherences in molecular quantum information science.
arXiv·2026-10-11·Qian-Sheng Shi et al.
No generated summary available for this entry.
overview
Original abstract
Magnetic circular dichroism (MCD) is an optical probe of orbital time reversal symmetry breaking. Although frequency integrated MCD is related to the self-rotation contribution to orbital magnetization at zero field, its magnetic response generally differs from the thermodynamic orbital susceptibility. Here, we define the MCD susceptibility and derive general expressions for multiband systems using an electromagnetic $U(1)$ gauge invariant approach. For insulators, the response contains contributions from the non-Abelian quantum metric, Berry curvature, and field induced interband mixing. For metals, a finite temperature Green function formulation separates the smooth response into Fermi sea and Fermi surface contributions. An independent Landau level calculation confirms the expressions for the zero-field MCD moment and its linear magnetic response. In a continuum model for twisted bilayer graphene, the MCD susceptibility vanishes within the charge neutrality gap, while the thermodynamic orbital susceptibility remains markedly diamagnetic. Near the gap edges, the orbital moment term dominates the response. Features near the van Hove energies are associated with density of states enhancement. These results clarify how the two susceptibilities reflect different orbital processes even for the same electronic structure and thus establish the MCD susceptibility as a distinct probe of orbital magnetic response.
arXiv·2026-10-11·Yuhang Xie, Yanjun Chu, Shao-Ming Fei
No generated summary available for this entry.
overview
Original abstract
The detection and quantification of quantum entanglement are central problems in quantum information science. Based on the realignment of density matrices and the vectorization of reduced density matrices, we construct a family of enhanced separability criteria for bipartite and multipartite quantum systems. Our criteria recover the previously proposed realignment-based criteria as special cases and detect more entanglement than the earlier ones. Moreover, we derive tighter lower bounds for the concurrence and the convex-roof extended negativity, criteria for detecting the genuine tripartite entanglement, and lower bounds on genuine-multipartite-entanglement concurrence. The advantages of our results are demonstrated with detailed examples.
arXiv·2026-10-11·Ali Mostafazadeh, Alireza Shariati Joni
No generated summary available for this entry.
overview
Original abstract
Stationary scattering admits a dynamical formulation in which the scattering data are extracted from the evolution operator for an effective non-stationary and non-unitary quantum system. This provides a mathematical method of solving scattering problems. We consider the possibility of realizing such a quantum system and relating the scattering information to outcomes of quantum measurements performed on it. To this end, we examine stationary scattering problems in one dimension where the scattering data consist of reflection and transmission amplitudes and the corresponding effective quantum system is a non-unitary two-level system. The states of this system identify points in a Bloch sphere $S^2$ and their evolution yields trajectories in $S^2$. Quantum measurements turn out to be capable of providing information about the reflection amplitudes. We identify configurations displaying reflectionlessness with situations where one or both of the poles of $S^2$ undergo cyclic evolutions. Spectral singularities and coherent perfect absorption correspond to dynamical spin flips which map one of the poles of $S^2$ to the other.
arXiv·2026-10-11·Pavel Kamenskikh et al.
No generated summary available for this entry.
overview
Original abstract
Scaling trapped-ion optical clocks to hundreds of ions remains a major challenge due to inhomogeneous frequency shifts in large ion crystals. Here, we propose a circular surface-trap architecture for a multi-ion optical clock with hundreds of ions. The rotational symmetry of the ion crystal suppresses the main sources of inhomogeneity, quadrupole shift.We investigate the feasibility of a clock based on a ring crystal of 400 $^{40}\mathrm{Ca}^{+}$ ions and propose a suitable experimental setup configuration. We have shown that circular configuration of ions leads to suppression by two orders of magnitude of the quadrupole shift comparing to the linear trap. Combined with stray-field compensation and dynamical decoupling techniques, this architecture provides a pathway toward multi-ion optical clocks with fractional frequency uncertainty at the $10^{-18}$ level and an expected 20-fold improvement in frequency stability compared to single ion clocks.
arXiv·2026-10-11·Giuseppe Di Molfetta, Petra Camilli
No generated summary available for this entry.
overview
Original abstract
Can quantum communication determine the size of an anonymous network when no size bound is known? Classical impossibility proofs rely on the covering lemma: an execution can be reproduced on a larger network with the same local structure. Quantum interference invalidates this argument - a measurement record possible on a network can become impossible on a cover. We show that the impossibility of exact counting nevertheless survives. Our main result is a quantum analogue of the covering lemma that preserves local possibilities rather than complete executions. Within a cyclic covering family, every local measurement outcome possible at a node remains possible at a corresponding node in every sufficiently large network. This holds even after information has travelled around the smaller network, beyond the reach of a simple locality argument. We extend the principle to the universal covering tree and finite covers with sufficiently long cycles. The proof combines tensor-network methods with graph coverings: a common representation across network sizes turns normalization into a constraint on which local outcomes can occur. For uniform synchronous protocols with independently prepared nodes, this support-lifting principle rules out zero-error counting and even the production of a guaranteed finite size bound on anonymous rings and the other cyclic covering families considered here. It also rules out exact leader election with termination in finite time with probability one on these families. Measurements, classical control, and local memory growing with time are allowed; no predetermined running-time bound is assumed. Quantum interference thus defeats execution lifting without enabling infallible certification of network size.
arXiv·2026-10-11·Doyeol "David" Ahn, Byeongyong Park
No generated summary available for this entry.
overview
Original abstract
Sample-based quantum linear solvers measure quantum Krylov states $e^{-iAT}|b\rangle$ and reconstruct the solution of $Ax=b$ classically on the observed basis states. We develop this approach for positive-definite systems that arise from elliptic partial differential equations. We show that the sampling guarantees hold in any fixed basis with an efficient transform. We then replace the variational reconstruction by a Galerkin solve on the sampled set. For this reconstruction we derive expected and high-probability energy-norm error bounds, a sample complexity in terms of the smallest sampling probability on an essential set, a computable residual certificate, and a support-completeness theorem for the dephased outcome law. We formulate the method for elliptic problems on Riemannian cross sections. In two dimensions the stiffness matrix is metric-independent in conformal coordinates, and curved vessels lead to the same matrix class. Killing symmetries of the cross section give selection rules for the measurement outcomes, and the Lie derivative of the metric gives first-order bounds for geometric perturbations. We separate operator approximations, whose effect we bound, from sampler approximations, which affect coverage but not the target. As examples we treat the implicit step of pulsatile flow in elliptic, lens-shaped, and curved ducts. In simulations of up to 12 qubits, the number of Fourier modes required for 1% error grows from 14 to 60 while the number of unknowns grows from 64 to 4096. A classical residual-greedy selection is nevertheless more efficient than quantum sampling in all cases studied, consistent with the low measured sampling efficiency. On a six-qubit trapped-ion processor, the measured outcome laws follow a replacement-noise model whose strength grows by about 0.6% per two-qubit gate, and a parity selection rule rejects shots at the predicted rate.
arXiv·2026-10-11·Tanay Pathak, Abhik Kumar Saha
No generated summary available for this entry.
overview
Original abstract
The local Hilbert space dimension is a fundamental parameter in quantum many-body systems, but its role in controlling the ergodicity-breaking transition remains less explored. We systematically study this question by introducing toy models of qudits in zero dimensions that exhibit an ergodicity-breaking transition. Using the hybridization condition, we analytically obtain the dependence of the critical value of the interactions on the local Hilbert space dimension. Numerical studies of spectral correlation measures show agreement with the theoretical predictions, hence confirming the existence of the ergodicity-breaking transition in these models. We further introduce a distinct higher spin version of the model and numerically obtain the same critical behavior, demonstrating that the observed critical point is independent of the microscopic structure of interactions considered.
arXiv·2026-10-11·Filippo Caleca, Fabio Mezzacapo, Tommaso Roscilde
No generated summary available for this entry.
overview
Original abstract
Quantum thermalization of closed systems -- i.e. the relaxation of local properties to their thermodynamic value along the Hamiltonian evolution -- is generically expected in non-integrable systems at finite energy density. In this work we show that quantum spin systems with at least one spin component coupled through long-range ferromagnetic interactions, and a second spin component coupled to a field, cannot in general thermalize to a paramagnetic state whenever they have a finite, negative energy per spin. The long-range interactions we consider decay as a power law of the distance, $\sim r^{-α}$ with $α< d$, where $d$ is the number of spatial dimensions of the system. The lack of thermalization is generic to an infinite family of Hamiltonians, and it is not associated to any form of integrability. It can instead be understood by the anomalous features of the thermodynamics of the system in the paramagnetic phase, which cannot be reflected in the properties of the eigenstates. This leads to a breakdown of eigenstate typicality and of the eigenstate thermalization hypothesis. Interestingly, the non-thermal states emerging at long times in the dynamics display long-range multipartite entanglement, elevating the breakdown of thermalization to a resource.
arXiv·2026-10-11·Wei Xie et al.
No generated summary available for this entry.
overview
Original abstract
We formulate massless tree-level Compton scattering as an effective two-qubit operation on electron and photon helicities. In the Bell basis, the scattering map separates into two parity sectors and admits a simple quantum circuit representation with one nonunitary filter. After Kraus normalization, this filter defines an unsharp incomplete Bell measurement that distinguishes the two Bell-parity sectors but not the relative Bell label within each sector. We further show that the incomplete measurement alone does not surpass the classical teleportation threshold, whereas a subsequent complete Bell-basis readout enables unit conditional teleportation fidelity.
arXiv·2026-10-11·Abdullah Alsharari, Francesco Buscemi
No generated summary available for this entry.
overview
Original abstract
The Gorini-Kossakowski-Lindblad-Sudarshan (GKLS) equation, a cornerstone of open-system theory, describes Markovian semigroup dynamics in which information about the initial preparation cannot revive. Beyond this regime, information revivals are widely interpreted as backflow from a non-Markovian environment. However, a decrease followed by an increase in information retrievable from the system need not imply that information has returned from the environment [PRX Quantum 6, 020316 (2025)]. It may instead arise from noise correlations unrelated to the system's initial preparation, carried by inert degrees of freedom that never interact with the system and therefore cannot mediate backflow. Such revivals are called extrinsic; genuine backflow is reserved for revivals that cannot be explained this way. The framework developed in that work, however, assumes access to arbitrary initial system states, an assumption often incompatible with physical constraints or limited experimental control. This leaves open which properties of the available preparations are necessary for an information revival to certify genuine backflow. Here we extend the framework to allow the description of restricted families of initial states and show that genuine backflow is possible only if the family contains noncommuting states. If all available states commute, as in a classical stochastic process, every revival can be explained by a suitable inert extension and is therefore extrinsic. Noncommutativity of the available system states is thus necessary for information revivals to provide an operational signature of environmental memory.
arXiv·2026-10-11·Mehdi Kamal, Massoud Pedram
No generated summary available for this entry.
overview
Original abstract
Thermodynamic computing lets stochastic physical dynamics carry out a computation and reads out the result as a time average. Recently, thermodynamic computing has been demonstrated on several hardware platforms, including digital CMOS circuits based on stochastic computing. Superconducting single-flux-quantum (SFQ) logic offers very high clock rates and very low switching energy, but it heavily penalizes state, memory, fan-out, and feedback, i.e., exactly the per-neuron accumulators on which such designs rely. We therefore realize thermodynamic computing in SFQ logic through a co-design of a generative model and its circuit in which the datapath holds no state at all. The model is a class-conditional flow-matching image generator, which transforms Gaussian noise into an image of the requested class along a short, deterministic path of four Euler steps; in hardware, these steps are unrolled into a feed-forward pipeline of stochastic bitstream operators, whose output is read out as a time average, as in thermodynamic computing, without any relaxation phase. Each layer of the model is a butterfly-factorized linear map built exclusively from multiplexers that operate on split-unipolar bitstreams. The ReLU activation, which in stochastic computing requires a per-neuron up/down counter (accounting for 60-70% of the JJs in a counter-based design), is replaced by a stateless AND-NOT gate whose one-clock input skew is provided at no cost by SFQ gate-level pipelining. The models are trained directly on the stream representation of the hardware, with a regularizer that bounds the stream gains. Synthesis with an SFQ design flow shows that stochastic streams tolerate relaxed path balancing, which reduces the Josephson-junction (JJ) count of a hard-wired stage by 40-47%.
arXiv·2026-10-11·Peng Wang et al.
No generated summary available for this entry.
overview
Original abstract
We show that criticality concentrates extensive sensing information into a local trajectory. In the rapid-readout limit of an all-to-all dissipative feedback network, a single binary trajectory has a Fisher-information rate linear in $N$ for a common weak field, as does the full record. Critical slowing does not remove this gain because the local weight of the slow mode decreases with $N$. An analytic bound guarantees that the local record retains more than half of the full information across the entire channel-parameter range. We also identify how parameter drives and observation dynamics determine local access to collective information beyond permutation symmetry. Furthermore, our sparse-readout theorem establishes a $k^{-1}$ decay of fractional information loss: only $Θ(\varepsilon^{-1})$ trajectories are needed to retain a fraction $1-\varepsilon$ of the full information rate. Any growing readout set, even of vanishing density, asymptotically recovers the full common-field Fisher-information rate.
arXiv·2026-10-11·Yifan Shi et al.
No generated summary available for this entry.
overview
Original abstract
Using established probabilistic measurement-reversal theory, we study recovery placement in encoded-qutrit teleportation under monitored decay. We characterize the success advantage of reversing a no-jump map only on the encoded support and compare two receiver capabilities. The restricted-map construction applies to general finite-dimensional supports; explicit timing results are obtained for a coherent V-type sender, a $Λ$-type receiver, and $S=\{0,2\}$, within a prescribed family of maximal exact sender reversals. With one outcome-independent full-space receiver filter, we maximize success probability at fixed total time subject to a minimum success-weighted conditional fidelity. A single preassigned recovery time yields up to three duration-dependent regimes: no sender reversal, the earliest feasible intermediate reversal, and final-time reversal. If recovery times may be randomized independently of the input and only the pooled successful ensemble must meet the fidelity requirement, the optimum over all such timing distributions mixes the two endpoints for $ΓT \ge (\ln 3)/2$. With Bell-outcome-dependent nonunitary receiver recovery, each accepted full-column-rank transfer branch can instead be reversed exactly. For the same model and sender-operation family, omitting sender reversal uniquely maximizes the exact-teleportation success probability for every finite $T>0$ at positive decay rate. Partial pathway coherence further distinguishes relative support gain from absolute recovery success: the long-time dark-state plateau survives only for fully coherent decay. These results show how receiver control capabilities and the meaning of the fidelity constraint determine whether intermediate sender recovery is useful.
arXiv·2026-10-11·A. R. Urzúa et al.
No generated summary available for this entry.
overview
Original abstract
We perform a detailed mathematical study of the effective Hamiltonian describing a non-stationary electromagnetic cavity field, introduced by C.~K.~Law, in the presence of uniform linear motion. We find that the corresponding dynamical equations admit a unitary diagonalization and that the normalized velocity of motion satisfies the two-sided bound $\lvert v/c \rvert \lesssim 10.1716$. Although this result is mathematically consistent, the interval obtained is an order of magnitude larger than the physically admissible range $\lvert v/c \rvert < 1$. To address this limitation, we propose a reinterpretation of bosonic coupling terms as generators of the symplectic algebra $\mathrm{Sp}(4,\mathbb{R})$, identifying them with transformations that can be implemented through linear optical elements. Within this photonic approach, the coupling parameters are not restricted to small values, allowing us to explore regimes of strong effective interactions. In this case, we demonstrate the generation of two-mode squeezed states and derive analytical expressions for the average photon number in each mode. Furthermore, we analyze statistical properties that characterize mixedness and entanglement, including intermode correlations, the Mandel parameter, and the linear entropy. The corresponding Wigner function provides a phase-space visualization of the system's behavior, illustrating the connection between cavity motion, mode coupling, and nonclassical field correlations via the underlying symplectic algebra.
arXiv·2026-10-11·Yuanbin Chen, Chong Meng Samson See, Chau Yuen
No generated summary available for this entry.
overview
Original abstract
Rydberg atomic quantum receivers (RAQR) exhibit exceptional sensitivity to radio-frequency (RF) signals, positioning them as promising candidates for next-generation wireless systems. Extending their capabilities to orthogonal frequency-division multiplexing (OFDM), however, requires atomic responses that go beyond broadband reception and are tailored to the structured interference of multicarrier signals. To bridge this gap, we develop an atomic-comb Rydberg receiver based on six-wave mixing (SWM) transduction. In particular, injecting a multi-tone local oscillator (LO) into the RAQR generates frequency-shifted replicas of the intrinsic SWM response. By subtly tuning the amplitude and phase of each LO tone, constructive and destructive interference can be selectively induced to preserve desired response components while attenuating harmful frequency offsets. Furthermore, we harness the response-reshaping capability of the proposed atomic comb to proactively mitigate OFDM interference. More explicitly, by exploiting the discrete difference-frequency structure of both carrier-frequency-offset (CFO)-induced and phase-noise (PN)-induced inter-carrier interference (ICI), we optimize the atomic-comb response to suppress dominant ICI components directly. We further reveal an intrinsic coupling between spectral shaping and the time-domain effective channel memory, motivating a joint optimization of both ICI and inter-symbol interference (ISI), which simultaneously suppresses inter-carrier leakage and post-cyclic-prefix (CP) tail energy. Extensive simulation results validate our atomic-comb design, unveiling that the proposed atomic comb can effectively reshape the receiver response over the OFDM, while mitigating ICI, shortening the effective channel memory, and substantially lowering CP overhead.
arXiv·2026-10-11·Pablo Pais, Alfredo Iorio, Marcelo F. Ciappina
No generated summary available for this entry.
overview
Original abstract
Low-energy electrons in graphene obey an emergent, rotationally invariant Dirac equation, while the honeycomb lattice enters only through higher-order, symmetry-breaking corrections, the leading one being trigonal warping. This provides a unique solid-state arena to address a cornerstone challenge in quantum gravity: how to detect ultraviolet symmetry-breaking granular corrections, suppressed by a fundamental scale, atop an emergent infrared relativistic continuum. We show that intense counter-rotating $ω$-$2ω$ fields and valley-resolved high-harmonic generation (HHG) provide such a probe. Within a family of models that interpolates continuously between the isotropic Dirac cone and nearest-neighbour graphene at fixed Fermi velocity, the valley contrast of the harmonic yield vanishes identically in the symmetric theory, grows linearly with the warping coupling, and its valley-even counterpart appears only at second order, as expected from effective-field-theory power counting. The stronger the laser, the farther it drives electrons from the Dirac points, so the laser intensity plays the role of the collision energy. For the fourth harmonic, the leading warping correction alone accounts for the valley contrast of real graphene up to fundamental intensities of about $10^{11}$ W/cm$^2$, below the damage threshold of monolayer graphene, whereas the fifth harmonic already reveals higher-order lattice corrections at intensities around $10^{10}$ W/cm$^2$. The two harmonics, which rotate in opposite directions, are emitted by opposite valleys. Valley-resolved harmonics are far more sensitive than the residual valley populations, making them a practical detector of lattice-scale physics hidden beneath an emergent Dirac theory.
arXiv·2026-10-11·Jiro Soda
No generated summary available for this entry.
overview
Original abstract
We study the entanglement structure of gravitons in quasicrystalline inflation. Both parity-even and parity-odd interactions generate graviton pairs with nonzero total momentum. For opposite-helicity pairs with identical momenta, the parity-even contribution can be nonzero, whereas the parity-odd contribution vanishes. The transition from inflation to radiation domination produces additional conventional two-mode squeezing. We derive the resulting normal and anomalous covariances. The initially nonzero reciprocal blocks of the full field-momentum covariance remain nonzero under homogeneous evolution, although individual components can vanish. We show that this homogeneous, helicity-preserving evolution acts unitarily within each helicity sector and therefore preserves the entanglement between the complete right- and left-helicity sectors. Nevertheless, it can eliminate entanglement in the reduced state of a co-propagating pair. We illustrate this distinction using a solvable four-mode model.
arXiv·2026-10-11·Mohammad Aminul Haque et al.
No generated summary available for this entry.
overview
Original abstract
Use of carbon electrodes integrated with CMOS technology has great promise for lab-on-chip, biomedical, environmental, and industrial applications. One method of developing carbon electrodes is to 3D print polymer nanostructures on a CMOS chip, and use a thermal annealing process to pyrolyze them into carbon at high temperature, approximately 950 °C. Such high temperature is detrimental to the CMOS sensor circuits, causing severe degradation. We present a novel solution of localized Joule heating of these polymer nanostructures to achieve complete carbonization of the electrodes. Both analytical and COMSOL simulations guided the experiments to characterize the carbonization process conditions. Partial carbonization was achieved at 500-600 °C of global temperature, and complete carbonization was achieved by localized Joule heating. Pyrolized nanostructures monolithic samples on a silica wafer were fabricated using standard material processing, such as 2-Photon Polymerization. Pyrolysis was achieved by Rapid Thermal Processing (RTP). Observations using optical microscopy, scanning electron microscopy, and Raman spectroscopy demonstrated the feasibility of polymer carbonization within a CMOS compatible temperature window.
Quantum Computing Report·2026-10-10·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
University of Saskatchewan researchers have achieved a breakthrough in quantum error correction by developing geometry-optimized hyperbolic surface codes. This innovation significantly improves code efficiency by optimizing periodic boundary conditions, effectively doubling code distance and quadrupling efficiency without increasing physical qubit count. This advancement allows for more logical qubits to be protected with fewer physical qubits, bringing fault-tolerant quantum supercomputing closer to reality. The post University of Saskatchewan Researchers Achieve Record Hyperbolic Surface Code Efficiency for Modular Fault-Tolerant Architectures appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-10·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Xanadu has achieved a nearly 4-fold reduction in Quantum Read-Only Memory (QROM) costs by developing an algorithmic technique that reduces the non-Clifford gate cost. This was accomplished through two innovations: Sequential Bit Packets and SelectCopy, and Dense Encoding in Z and X Bases. These advancements significantly cut hardware runtimes and qubit requirements for loading classical data into quantum computers. The post Xanadu Cuts Quantum Read-Only Memory Costs by ~4x via Dense Encoding appeared first on Quantum Computing Report .
Phys.org Quantum Physics·2026-10-10
No generated summary available for this entry.
overview
Original abstract
Physicists in the Department of Physics at the University of Oxford have used a hybrid quantum computer, made up of qubits and quantum oscillators, to observe the Aharonov–Bohm effect in a quantum simulation. The effect is a quantum phenomenon in which a particle can acquire a measurable phase by traveling around a magnetic flux, even though it never passes through a region where a magnetic field is present.
Quantum Computing Report·2026-10-10·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
IBM Quantum has launched a new directed execution model with the Executor primitive in qiskit-ibm-runtime v0.50.0. This framework shifts error mitigation to the client side, giving researchers greater control over quantum error correction (QEC) workflows. It allows for custom control over circuit transformations and error-correction pipelines, improving efficiency and transparency for quantum algorithm developers and QEC researchers. The post IBM Launches Directed Execution Model and Executor Primitive to Give Researchers Client-Side Control Over QEC Workflows appeared first on Quantum Computing Report .
Phys.org Quantum Physics·2026-10-10
No generated summary available for this entry.
overview
Original abstract
When we think about a diamond, we often think about a material whose value comes from its perfection. In my research, however, I am interested in something almost opposite: the tiny imperfections inside diamonds. These atomic-scale defects can give diamonds new optical and electronic properties, and some of them can serve as quantum systems. The challenge is learning how to control these defects without disturbing the others.
Phys.org Quantum Physics·2026-10-10
No generated summary available for this entry.
overview
Original abstract
Most of us recognize basic phases of matter and their properties: solids maintain their shape, liquids flow freely with constant volume, and gases expand to fill their container. Quantum phases, on the other hand, are much harder to categorize, overturning traditional notions of what a phase even is and forcing physicists to rethink their definitions.
Quantum Computing Report·2026-10-10·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Quantum X Labs Inc. announced new intellectual property filings and R&D in quantum technology. This includes a patent application for structured-beam Zeeman slower and atomic push-beam systems for neutral-atom quantum computing, and a laboratory program integrating Ramsey-CPT atomic clocks with Rydberg atom RF sensors. Additionally, a patent was filed for watermarking quantum circuits using Weyl (KAK) coordinate decomposition for IP protection. The post Quantum X Labs Expands Intellectual Property and R&D Across Neutral-Atom Hardware, Rydberg Sensing, and Circuit Security appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-10·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
PQShield, VTT, QuantWare, and Rensselaer Polytechnic Institute have made strategic appointments to their leadership teams. These appointments aim to strengthen their positions in quantum technology, commercial growth, and research. The post Who’s News: Strategic Appointments at PQShield, VTT, QuantWare, and Rensselaer Polytechnic Institute appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-10·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
The European Quantum Industry Consortium (QuIC) has released a whitepaper responding to the EU Chips Act 2.0 proposal, advocating for dedicated industrialization pathways to bridge the gap between quantum chip prototyping and production. QuIC highlights the lack of mechanisms for industrial-scale manufacturing in current proposals and warns about international transactions that threaten European supply-chain resilience. They recommend extending strategic project status to quantum foundries, establishing a subsidized Multi-Project Wafer program, funding cryogenic and packaging infrastructure, expanding photonics objectives to include visible and deep-UV, and providing accessible designations for small-scale fabrication facilities. The post QuIC Whitepaper Calls for Industrial Scale-Up Infrastructure in EU Chips Act 2.0 appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-10·Yuval Boger
No generated summary available for this entry.
overview
Original abstract
Yuval Boger interviews Corey O’Meara, Chief Quantum Scientist at E.ON Digital Technology. They discuss how E.ON’s five-person quantum team works with business units to find high-value use cases, especially where classical methods may hit bottlenecks in optimization and machine learning. Corey describes the company’s work on peer-to-peer energy trading and other grid-related applications, and shares his perspective on cloud access, hybrid deployment, and the accelerating progress toward fault-tolerant quantum computing. Transcript Corey: Hello, Corey, and thank you for joining me today. Thanks for having me. Yuval: So who are you and what do you do? Corey: Yeah, so my name is Corey and I’m chief quantum scientist at E.on Digital Technology. And there I’m technically leading the applied quantum computing program at one of Europe’s largest utility companies. Yuval: E.on, as you mentioned, is a very large company. How large is the Quantum team and when did it get started? Corey: Yeah, great question. So we’re a pretty modest team. We’re five full-time employees on the project and the team. And we started in around 2020. It’s kind of an interesting story. So in the early days, we were approached– so I should preface it that the department where it lands is in– it used to be called the Data and AI Department, or DataOn. And we basically were looking at how to apply machine learning and optimization for different business use cases across the company. And at the time, 2019, 2020, quantum started to get a little bit of a buzz in the industry sector. And so it kind of came actually from the board level. So it came from top down. They asked, hey, you guys in the department down here, you know, working on internal tooling, what is this quantum computing thing? And I had originally done my PhD in quantum computing actually. So we started discussing and came up with a short little kind of proof o
Quantum Computing Report·2026-10-10·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
The Quantum Resource Management Interface (QRMI) is expanding to standardize quantum-HPC integration across major workload managers like Slurm, PBS Professional, and Kubernetes. This open-source middleware layer addresses challenges of integrating heterogeneous QPU hardware by providing a unified interface for abstracting and scheduling QPUs alongside classical resources. QRMI is already deployed in major supercomputing environments, including CINECA, Rensselaer Polytechnic Institute, and the STFC Hartree Centre. The post Multi-Institutional Consortium Expands QRMI to Standardize Quantum-HPC Integration Across Major Workload Managers appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-10·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
IBM Quantum has expanded its Qiskit open-source software to include native C API bindings for Fortran, C++, and Julia. This allows researchers to integrate quantum circuits directly into high-performance computing (HPC) applications without Python, improving performance and interoperability. The new bindings support complex quantum-centric supercomputing workflows and hybrid algorithms. The post IBM Expands Qiskit Beyond Python with Native C API Bindings for Fortran, C++, and Julia appeared first on Quantum Computing Report .
arXiv·2026-10-10·Hamza Harraf, Mohamed Amazioug, Rachid Ahl Laamara
No generated summary available for this entry.
overview
Original abstract
In this work, we study a theoretical scheme to investigate the monogamy of quantum steering in a hybrid exciton--cavity optomechanical (EOM) system. Within the Gaussian-state formalism, we quantify the steerability among the exciton, photon, and mechanical modes in both the steady-state and dynamical regimes. We establish and verify CKW-type monogamy inequalities for Gaussian steering and demonstrate that the distribution of bipartite steering among the three modes can be controlled through the system parameters. We further examine the influence of thermal noise and temporal evolution on the steering properties and the corresponding monogamy relations. Our results show that increasing the temperature generally suppresses the strength of Gaussian steering and modifies the degree of steering sharing imposed by the CKW-type monogamy relations. In contrast, in the dynamical regime, the steerability can increase with evolution time over suitable temporal windows, indicating that the transient dynamics can be exploited to enhance quantum correlations. These results highlight the potential of hybrid exciton--optomechanical platforms for controllable quantum correlations and provide a promising route toward the generation and manipulation of multipartite quantum resources.
arXiv·2026-10-10·Hyunwoo Oh
No generated summary available for this entry.
overview
Original abstract
Quantum computation offers a promising alternative to classical Monte Carlo methods by naturally avoiding sign problems through unitary evolution. A common misconception follows from this: because quantum simulation sidesteps the sign problem, it is often assumed to be an essentially perfect substitute for classical sampling. This is false---quantum measurements are intrinsically stochastic, and estimating observables often requires a number of samples that grows exponentially with system size, time separation, or inverse temperature, exactly as in the classical signal-to-noise problem. In this work, we analyze the origin and structure of signal-to-noise problems in quantum computation, drawing parallels with classical Monte Carlo, and demonstrate that such noise persists even in sign-problem-free regimes. We discuss strategies to mitigate it, in particular a quantum generalization of Stein control variates construction, in which unbiased estimators are built from operator commutators $[X,A]$ and their discrete diagonal counterparts, and validate the approach with exactly solvable numerical examples that quantify the achievable variance reduction. Our results underscore that variance reduction, not merely sign-problem avoidance, is required to make quantum algorithms practically viable for many-body physics.
arXiv·2026-10-10·Tomotaka Kuwahara
No generated summary available for this entry.
overview
Original abstract
Area laws express the expectation that entanglement in gapped quantum ground states scales with a boundary rather than a volume. In one dimension this holds for every Rényi entropy, and the Rényi area-law conjecture asserts the same in higher dimensions for each fixed $0<α<1$. Here we disprove this conjecture in every spatial dimension two and higher. We construct finite-range Hamiltonians with fixed local dimension, bounded interaction strength, unique ground states and a uniform spectral gap, whose ground states exhibit volume-law Rényi entanglement while obeying a von Neumann area law and remaining connected to product states through uniformly gapped local paths. The mechanism is error-space complexity: locally identifiable components of arbitrarily small weight can encode states with high entanglement complexity. We also establish the worst-case rank-error trade-off for approximate ground-state projectors, a key tool in one-dimensional area-law proofs. At fixed gap, the optimal Schmidt rank at projection error $ε$ across a planar cut of cross-section $A$ scales as $\exp[\tildeΘ((A\logε^{-1})^{2/3})]$ when $\logε^{-1}\gtrsim A$. Thus $α=1$ is the sharp threshold for a universal Rényi area law within this adiabatically connected class.
arXiv·2026-10-10·Yongxin Zeng, Andrew J. Millis
No generated summary available for this entry.
overview
Original abstract
The discovery of integer and fractional Chern insulators in rhombohedral graphene, following their discovery in the isolated topological flat band in twisted MoTe$_2$, motivates a search for the conditions under which an electronic band can host a topological correlated state. In this Letter we introduce a ``Berry basin" model which captures the essential features of rhombohedral graphene: a dispersive band with a flat bottom, momentum-space winding of a ``layer" degree of freedom, and Coulomb interactions, while also including periodic potentials, enabling controlled studies of the interplay of quantum geometry, superlattice modulation, and electron-electron interactions in producing correlated topological states beyond the isolated topological band paradigm. While integer Chern insulators emerge at strong coupling without a superlattice potential, stabilizing the fractional state requires nonzero potential for all interaction strengths we access. We provide insight into the greater robustness of integer and fractional Chern insulators in rhombohedral graphene when electrons are polarized away from the moiré interface. Our results establish a new class of systems that host robust fractional Chern insulators and provide a controlled numerical platform to test competing theories of interacting topological phases.
arXiv·2026-10-10·Sophia Knutson et al.
No generated summary available for this entry.
overview
Original abstract
Cancer detection using AI methods and image databases faces several challenges, including limited and imbalanced image datasets, long algorithm training times, and high-complexity feature generation. In particular, many cancer image datasets contain very few malignant examples compared to benign ones, limiting the amount of minority-class data available for training. Although classical AI and especially deep learning methods have had some success in providing cancer diagnostics, Quantum Machine Learning (QML) methods may offer advantages through high-dimensional feature representations, generative data augmentation, and the exploitation of feature correlations through quantum properties such as entanglement. In this paper, we propose using a generative QML method on the compressed breast ultrasound image dataset (BUSI) to generate synthetic images and hence augmented datasets for classifier training. In particular, we train a convolutional neural network with real, synthetic, and a combination of real and synthetic images. We test the algorithm on real images and provide comparative results for all three training cases. Our results show that the classifier trained entirely on synthetic images achieved an AUC-ROC of 0.802 (80.2%), compared with 0.760 (76.0%) for the real-data baseline.
arXiv·2026-10-10·Bingzhi Zhang et al.
No generated summary available for this entry.
overview
Original abstract
Quantum generative models face growing qubit requirements and concentrated loss landscapes when learning long time series. Here we introduce holographic quantum circuit sampling (HQCS), which combines mid-circuit measurements, qubit reuse and independently parameterized temporal blocks to generate trajectories with a fixed number of qubits. For Haar-random HQCS and a normalized exponential kernel, we prove inverse-polynomial bounds on maximum mean discrepancy loss variance, contrasting with exponential concentration in global Haar-random generators. For generic members of a family of nonstationary Markov processes, temporal parameterization reduces exact-generation gate counts from quadratic to linear in sequence length relative to a specified class of repeated shared-block generators. Simulations demonstrate learning of Gaussian autoregressive processes and historical Volatility Index (VIX) trajectories, with the latter achieving over tenfold lower maximum mean discrepancy than the tested classical benchmarks. These results establish a framework for quantum time-series generation with fixed qubit requirements and provable avoidance of exponential loss concentration as sequence length grows.
arXiv·2026-10-10·Xingjian Zhang et al.
No generated summary available for this entry.
overview
Original abstract
Quantum science and engineering increasingly target the exploitation and control of large-scale dynamical systems. As system size grows, novel phenomena and quantum advantages emerge, but the resulting many-body dynamics become correspondingly harder to monitor and characterize. In particular, the underlying Hamiltonian often lacks symmetries, and the induced many-body dynamics quickly become hard to track. Focusing on one of the most important quantum features---entanglement---we demonstrate that, for a broad class of common Hamiltonian models, one can design effective witnesses that detect both the presence and structure of entanglement over relatively long evolution times. Inspired by stabilizer-based simulation, we track the evolution of generalized stabilizers of the underlying state and use them to construct linear entanglement witnesses. Through numerical experiments on Heisenberg-type Hamiltonians with up to twelve qubits, we show that the required number of measurement settings can be kept at a modest scale as the system size increases, and entanglement detection remains effective over evolution times that significantly exceed those accessible to naive approaches. The corresponding calculations can be carried out largely symbolically. Furthermore, unlike accurate state simulation, the stabilizer-based design of entanglement witnesses can be performed in a much more coarse-grained, digitized manner. We hope these results will stimulate further exploration of the quantum control of large systems.
arXiv·2026-10-10·Shane P. Gervais, Lambert Giner
No generated summary available for this entry.
overview
Original abstract
Weak measurement has proven useful for metrology, for probing quantum paradoxes, and for the direct measurement of quantum states. Weak measurements of polarization qubits with temporal pointers provide a direct route to weak-value characterization, including in regimes where the pointer is only partially coherent. We derive a closed-form expression for the post-selected temporal shift that interpolates between the incoherent and coherent (ideal) weak-measurement limits through a single parameter $ν$, the pointer visibility. The expression is experimentally tested for a range of polarization states spanning three trajectories corresponding to rotations about the principal axes of the Poincaré sphere. Two of the trajectories provide parameter-free benchmarks, with the real part of the weak value following $\cos^2θ$ and $1/2$. In contrast, the weak value along the third trajectory is sensitive to incoherence and is well described by the single-parameter partial-coherence model, from which a reduced pointer visibility is obtained. Time shifts are extracted from the smoothed derivative of the pulse leading edge with internal calibration, reaching few-picosecond precision on 10 ns optical pulses using commercial components. The same apparatus also gives qualitative access to the imaginary quadrature through the frequency centroid, showing that temporal weak measurements remain accessible and quantitative in partially coherent pulsed systems.
arXiv·2026-10-10·Sergey Kuznetsov, Alexander Pechen
No generated summary available for this entry.
overview
Original abstract
In this work, we study operator controllability of finite-dimensional closed quantum systems driven by a single coherent control. Two general Lie-algebraic results on controllability of such systems are proved. The first gives sufficient conditions under which controllability of the system is preserved when controlled energy-level shifts are added. The second gives a sufficient basis-element condition under which the dynamical Lie algebra contains $\mathfrak{su}(N)$ and the system is therefore operator controllable. These results, together with known controllability conditions, are applied to obtain a complete classification of operator controllability of all three-level quantum systems in terms of their free and interaction Hamiltonian matrix elements. This classification covers all combinations of energy-level and level-spacing degeneracies, two or three allowed transitions, as well as the presence or absence of controlled energy-level shifts, and gives necessary and sufficient conditions for operator controllability in each case.
arXiv·2026-10-10·Timothy Carlson et al.
No generated summary available for this entry.
overview
Original abstract
This work explores the edge state conduction properties of twinned and spiraled, 2D Sb2Te3 topological insulator crystals. We show the structure supports spatially continuous edge states within two spiral and knotted edge conduction channels. The channels are connected through a topological defect. This geometry introduces boundary conditions into the 2D crystal that modifies the edge state dispersion. Using a combination of low loss Electron Energy Loss Spectroscopy, Magnetic Force Microscopy and traditional carrier transport measurements we identify a distinct excitation at 0.155 eV in the spiral that seems to be related to two isolated states within the gap. This state is localized to the crystal edges. The modification of edge state bands using manipulation of a systems quantum geometry may open new avenues for the use of 2D topological systems.
arXiv·2026-10-10·Adam Burgess, Erik M. Gauger
No generated summary available for this entry.
overview
Original abstract
Superradiance is a collective optical effect where emitters cooperatively radiate with a maximal intensity scaling proportional to the square of the number of emitters. Despite the superradiant cascade transitioning through highly entangled states, it has been shown that, for dynamics along the Dicke ladder, superradiance need not generate entanglement between the emitters. By contrast, we show how introducing incoherent local processes -- normally considered detrimental to both entanglement and superradiance -- can generate high levels of inter-emitter entanglement. We develop a general framework, using degenerate non-Hermitian perturbation theory, for the study of superradiant Liouvillian steady-state degeneracy breaking by these local operations from a few emitters up into the thermodynamic limit. From this, we are able to show that entanglement becomes ubiquitous in this regime and demonstrate its robustness against other forms of symmetric environmental noise. In the regime where pumping dominates, we find that population accumulates towards the maximally entangled minimal pseudo-spin states, corresponding to multi-emitter singlet states. This provides a deeper insight into many-body entanglement and the curious connection between local operations and entanglement generation.
arXiv·2026-10-10·Omri Farber, Gilad Gour
No generated summary available for this entry.
overview
Original abstract
Free classical communication can yield an unbounded single-shot saving in quantum compression, even though it leaves the asymptotic rate of an i.i.d. source unchanged. At every fixed error in $(0,1)$, we exhibit sources whose unassisted compression cost is arbitrarily large, yet a single qubit suffices with classical communication and no preshared entanglement. We establish this separation by determining the exact optimal source fidelity for compression through an $m$-dimensional noiseless quantum channel, with and without free classical communication, while preserving correlations with an inaccessible reference. Without classical assistance, the optimal fidelity is exactly the Ky Fan norm $\|ρ\|_{(m)}$, the sum of the $m$ largest eigenvalues of the source state. With classical assistance, we obtain an explicit spectral threshold formula and a protocol attaining it. Classical communication strictly improves fidelity whenever $m$ is smaller than the source rank. The corresponding compression costs are two smoothed versions of the log-rank entropy, also called max-entropy: trace-distance smoothing under local operations and quadratic smoothing under LOCC. For i.i.d. copies of a fixed source with positive entropy variance, however, the two costs have identical first-, second-, and third-order asymptotic terms. For nonlattice spectra, we determine the constant-order advantage: classical communication saves $\log_2(e)-1$ bits per block asymptotically, and the ratio of assisted to unassisted minimum communication dimensions converges to $2/e$.
arXiv·2026-10-10·Hansol Kim, Younghun Kwon
No generated summary available for this entry.
overview
Original abstract
When implementing scalable fault-tolerant quantum computing using superconducting quantum processors, one of the critical challenges to overcome is the presence of defective qubits arising from fabrication and calibration imperfections. A defect on a specific qubit severely restricts the connectivity between adjacent qubits, disrupts stabilizer measurements, induces frequent detection events, and consequently inflates the logical error rate. To mitigate this issue, various strategies have been proposed, such as syndrome extraction circuits based on stabilizer folding and the construction of super-stabilizers via gauge operators. However, these methods have primarily been developed for architectures with relatively high connectivity of 3 to 4. Furthermore, experimental demonstrations showing an actual reduction in logical error rates in the presence of physical hardware defects have been lacking. In this work, we propose a defect-avoidance scheme tailored for the heavy-hexagon architecture, which features a lower connectivity of 2 to 3. While previous approaches required four measurement cycles to measure all gauge operators comprising a super-stabilizer, our proposed scheme completes all gauge measurements within only two cycles. We experimentally validate this approach on IBM quantum hardware by identifying physical defects and implementing the defect-avoidance circuits. As a result, avoiding the defect yields an approximately 10\% reduction in the logical error rate per cycle for both logical $X$ and $Z$ errors. These findings demonstrate that defects in superconducting hardware can be successfully handled even under the constrained connectivity of heavy-hexagon lattices, and that defect avoidance substantially reduces logical errors on real quantum hardware.
arXiv·2026-10-10·Xingya Fan, Yongzhi Luan
No generated summary available for this entry.
overview
Original abstract
We give an explicit treatment of the third tensor power of the Clifford representation on $n$ qutrits, for $n\geq2$. This representation has five pairwise inequivalent irreducible constituents, with multiplicities $1,1,1,1,2$. The decomposition reduces the Clifford twirl of a tensor cube to four real parameters. Two of them are spectral moments of the input. The other two are cubic invariants expressed as sums of cubes of the Weyl characteristic function and the discrete Wigner function. On trace-one Hermitian matrices, the invariant polynomials of degree at most three are spanned by the constant function and four algebraically independent functions. These functions do not separate Clifford orbits. For pure inputs a single parameter suffices. We recover its range and the characterization of its maximum by stabilizer states. We bound the stabilizer fidelity, determine full separability across the three copies in the symmetric family, and recover the criterion for a complex projective $3$-design. We classify the jointly invariant quantum Boolean functions. For stabilizer testing and for testing unknown observables we give explicit bounds on copies and queries. We also give character formulas for the finite projective Clifford groups and record the complete character table for two qutrits.
arXiv·2026-10-10·Xukun Feng et al.
No generated summary available for this entry.
overview
Original abstract
We propose a crossed electric spin generation effect in multilayer structures. This effect combines the advantages of in-plane and gate electric fields for manipulating spin, and unveils a nice quantum geometric structure in terms of the underlying hybrid Berry curvatures that are unique to quasi-2D systems and manifest inherent spin-layer-orbital coupling. Combining our theory with first-principles calculations, we predict sizable spin generation in 2D ferromagnetic Fe3GeTe2 and altermagnetic V2Te2O. Our theory opens a new Berry-curvature route for all-electric spin manipulation in 2D materials
arXiv·2026-10-10·Katsuhiro Endo
No generated summary available for this entry.
overview
Original abstract
Generative AI can be a powerful tool for supporting the design and implementation of quantum applications, whereas the burden of checking whether generated circuits realize the intended computation increases. In this study, we regard this burden of human understanding, checking, and judgment as ``trust cost,'' and propose a development methodology that integrates AI and formal verification to reduce it. In the proposed development methodology, the implementation is divided into three components: a target mathematical specification, a quantum circuit, and a correspondence theorem and its proof that prove the agreement between the two. This division separates the specifications and theorem statements checked by humans from the theorem proofs entrusted to mechanical checking. As a concrete development example of this proposal, we describe an implementation for the time evolution of a stochastic particle system and its results.
arXiv·2026-10-10·Dong-Gil Im et al.
No generated summary available for this entry.
overview
Original abstract
Linear-optical platforms provide a promising route to demonstrate quantum computational advantage, particularly through the boson sampling problem. While a boson sampling system should be large enough to show the quantum advantage, the size of the boson sampling problem is often restricted by experimental constraints. In particular, as a boson sampling system is scaled up, experimental constraints can limit its effective problem size to permit efficient classical simulation. In this paper, we investigate the theoretical scalability bounds for boson sampling systems under practical experimental conditions, including photon loss, mode mismatch, and input state error. We employ non-negativity conditions for phase-space quasiprobability distribution functions to analyze these effects. In addition, we introduce two device-level metrics, the boson sampling score which measures the usable capacity of a given device and the boson sampling volume which provides a common hardware-level benchmark for comparing different platforms and assessing their access to an advantage-relevant problem size regime. Our results provide fundamental insights into the performance of boson sampling systems under realistic experimental conditions and offer practical guidelines for scaling up boson sampling systems.
arXiv·2026-10-10·Han-Chuan Kou et al.
No generated summary available for this entry.
overview
Original abstract
We investigate dynamical quantum phase transitions (DQPTs) generated by a two-step linear quench with a finite waiting time at the equilibrium critical point. The waiting stage leads to the accumulation of a dynamical phase that depends on the waiting time and directly reflects the critical spectral structure. In the transverse Ising chain, this accumulated phase modifies the critical structure of DQPTs from a single-critical-mode (SCM) regime to a multiple-critical-mode (MCM) regime. We analytically and numerically determine the boundary between the two regimes. Along this boundary, the waiting time approaches a constant in the sudden-quench limit, whereas in the slow-quench limit it follows Kibble--Zurek (KZ) scaling with the quench time. In the SCM regime, the rate function exhibits a conventional linear singularity, $r(t)-r(t^{*})\propto |t-t^{*}|^α$, with the critical exponent $α=1$ near the critical time. At the SCM--MCM boundary, this exponent changes to $α=1/2$, leading to a divergent first derivative of the rate function. Additional discrete parameter lines with $α=1/2$ also appear within the MCM regime in the parameter plane spanned by the waiting and quench times. Our findings establish a direct connection between the accumulated dynamical phase and the critical structure of DQPTs, further supported by an extended Su--Schrieffer--Heeger (SSH) model.
arXiv·2026-10-10·Weidong Liu et al.
No generated summary available for this entry.
overview
Original abstract
Distributed quantum computing distributes workloads that exceed a single processor's capacity across resource-constrained components. Circuit cutting enables this decomposition, but its effectiveness depends on partition choice. We present SACE, a Simulation-Aware Circuit Partitioning framework with Entanglement-Capability-Aware Screening. EP-Cost screens partitions using a parameter-dependent entanglement-capability proxy and native implementation cost. Under reconstruction constraints, finite-bond refinement selects the candidate that minimizes the worst-subcircuit discrepancy between normalized MPS simulations at bond dimensions $χ$ and $2χ$. Across 14 exhaustively enumerated small-scale candidate spaces, EP-Cost-guided genetic algorithm selections attain co-optimal native quasiprobability decomposition (QPD) overhead, with a median within-circuit Spearman correlation of 0.9965 between EP-Cost and QPD overhead. At matched cut counts, EP-Cost reduces QPD overhead by $25.20\times$ and $16.89\times$ for 8- and 9-qubit QFT circuits, respectively, and improves sampled reconstruction. On 12-qubit approximate QFT, deterministic reconstruction reduces Pauli-observable mean absolute error in all six low-bond conditions and total-variation distance in five. With five cuts and 7,776 QPD terms, SACE is best on all four reconstruction metrics in four of six conditions. At 24 qubits, SACE improves exact-local QFT accuracy in all 30 instance-bond-dimension conditions against each EP-Cost-only, Kernighan-Lin, and spectral baseline. The 50-qubit QFT comparisons remain favorable as reference convergence improves. Weighted QAOA circuits provide complementary, more bond-sensitive evidence. Refinement benefits persist across three search methods; larger candidate panels improve the optimized proxy without guaranteeing lower exact-local error.
arXiv·2026-10-10·Shiksha Bhardwaj, Ankhi Roy
No generated summary available for this entry.
overview
Original abstract
Quantum machine learning offers new approaches to multivariate event classification in high-energy physics, but its performance relative to optimized classical methods remains uncertain under limited training data and restricted quantum resources. We investigate the sample-size scalability and representation sensitivity of a quantum support vector machine and a variational quantum classifier for Higgs-boson signal--background discrimination using simulated events from the ATLAS Higgs Machine Learning Challenge. The models are trained on balanced subsets ranging from 250 to 4000 events and evaluated on held-out samples preserving the original class distribution. Principal component analysis (PCA) and autoencoder (AE) representations are examined to reduce the input dimensionality and quantum-resource requirements. Four optimized classical classifiers are used as benchmarks under a common preprocessing, validation, and evaluation protocol. We assess training-sample scalability in classical and quantum classifiers using a four-component PCA representation and examine representation sensitivity through a secondary matched-event comparison of four- and eight-component PCA representations. Within the evaluated Higgs-boson classification setting, the QSVM showed stronger performance than the VQC at larger training sample sizes, while remaining below the best-performing classical classifiers.
arXiv·2026-10-10·Jie Xiao et al.
No generated summary available for this entry.
overview
Original abstract
Trapped ion quantum computing based on the quantum charge coupled device (QCCD) architecture uses functional zoning and ion transport to enable high fidelity computation and all to all qubit connectivity. As trapped ion quantum processing units (QPU) scale, 90° X-junction turns account for an increasing fraction of total transport time. Frequent junction crossings, therefore, make transport speed and final phonon excitation direct determinants of quantum algorithm execution efficiency. However, complex electric fields in X-junctions complicate waveform design, making it difficult to achieve high speed and low final phonon excitation simultaneously. Here, we develop a waveform design method for low-phonon-excitation high-speed X-junction(LHX-T) transport. It integrates low barrier pseudopotential channel design using multiple radio frequency (Multi-RF), multidimensional shortcut to adiabaticity dynamics, and constrained DC voltage optimization over the entire transport sequence. This framework connects waveform design, control, and computational validation, with smooth multichannel waveforms computed rapidly through a Karush-Kuhn-Tucker(KKT) linear system. The resulting waveform transports a single $^{171}Yb^+$ ion through a 90° turn in $5μs$ at an average speed of 14.6 m/s. Over 50 consecutive round trips, the final equivalent coherent phonon number consistently stays below 0.001, with no noticeable accumulation over time. System level evaluations at the QCCD scale show that the median duration of a single execution cycle is reduced by about $30\%$ across various circuit types. The fraction of execution time spent on transport decreases from approximately $70\%$ to $55\%$. This approach offers a means of designing fast ion transport waveforms with low phonon excitation for scalable QCCD based QPUs and provides a technical basis for efficient execution of quantum algorithms.
arXiv·2026-10-10·Ce Wang
No generated summary available for this entry.
overview
Original abstract
We consider spin-coupled Grover walks on hypercubes within the framework of quantum Bernoulli noises (QBN). We identify parity-dependent harmonic subspaces generated by the central Hamming layers: in even dimension they give a fixed-point subspace, whereas in odd dimension the walk reduces on the harmonic subspace to an explicit eight-dimensional reduced dynamics. Using symmetric-group representation theory, we characterize the corresponding isotypic structure and determine the reduced spectrum. The harmonic reduction also yields explicit long-time probability behavior and shows that the resulting states may occupy an asymptotically vanishing fraction of the hypercube while still spanning its full Hamming diameter.
arXiv·2026-10-10·Phi Hung Nguyen, Daniel Soh
No generated summary available for this entry.
overview
Original abstract
We show that a quantum reservoir computer optimized with its quantum Fisher information (QFI) has a quantum advantage over a classical reservoir of equal readout cost, provided by a quantum-information advantage: optimizing the quantum parameters with the QFI metric. On Mackey-Glass forecasting, a driven Jaynes-Cummings reservoir with one to three atoms beats a tuned echo-state network at every size from 4 to 30 trained weights, by 25-69% in held-out error, and is ahead of 99.5% of 10,000 random networks. After grid and Bayesian searches saturate, the QFI-aware stage lowers the error by 29-51% at 12-30 weights, beyond equal-budget black-box search or classical-parameter gradients alone, and at 30 weights turns a loss into a win. We then derive a fundamental QFI bound on the first-order rate of change of the retrained loss and factorize the gap to this bound into five link efficiencies that identify the physical mechanism limiting optimization.
arXiv·2026-10-10·Anne M. Fabricant et al.
No generated summary available for this entry.
overview
Original abstract
We present the concept of quadrature-detected zero-to-ultralow-field nuclear magnetic resonance (QD ZULF NMR). Two orthogonal sensors, atomic optically pumped magnetometers, are used to separately detect components of oscillating sample magnetization, which are then combined into a quadrature signal. This approach enables the distinction of positive and negative resonance frequencies with respect to the laboratory frame---such that absolute signs of gyromagnetic ratios can be determined. In addition, QD ZULF NMR reduces peak density and overlap compared to ZULF NMR with single-axis detection, while providing richer information about nuclear-spin dynamics. As an illustration, we present experimental $J$-spectra for thermally polarized [$^{13}$C]-formic acid and [$^{13}$C]-methanol, compounds commonly used in ZULF NMR which represent XA and XA$_3$ spin systems, respectively. A theoretical framework describing QD ZULF NMR signals is provided.
arXiv·2026-10-10·Jingyan Xu et al.
No generated summary available for this entry.
overview
Original abstract
Detecting weak magnetic fields at hertz frequencies is central to biomagnetism, geophysical sensing, and searches for new physics, yet it remains challenging because of technical systematics and environmental noise. Here, we realize a continuously operating molecular magnetic amplifier. Signal amplification by reversible exchange (SABRE) parahydrogen-based hyperpolarization maintains non-equilibrium spin order at zero field, turning scalar-coupled nuclear spins in liquid state molecules into an active, frequency-selective gain medium. Measurements of its complex magnetic susceptibility ($χ$) reveal an intrinsic response of $ | χ| \approx$ 10. By feeding the collectively generated magnetic field back to the spins below the threshold for self-sustained $J$-oscillation, we extend the effective spin coherence and cooperatively enhance the susceptibility up to $ | χ| \approx$ 80. Near threshold, this produces approximately fourfold amplification of a weak (20 pT) magnetic field at 3.37 Hz at the sensor location. These results establish hyperpolarized molecules as a tunable active magnetic medium for narrowband quantum sensing and precision measurement.
arXiv·2026-10-10·Sojeong Park, Changhun Oh
No generated summary available for this entry.
overview
Original abstract
Sensing time-varying signals is essential for precision measurement and for characterizing fluctuations in physical systems. In this work, we show that quantum entanglement provides an exponential advantage in the acquisition time required to learn the temporal statistics of a stationary classical signal. The task is to estimate the characteristic function of joint displacements on selected bosonic modes within a fixed-duration window, using continuous measurements of one signal realization. We present an entanglement-assisted scheme based on two-mode squeezed probes and local Bell measurements with protected idlers, and bound its acquisition time accounting for readout noise and correlations between signal windows. For a strictly stationary pulse family, it achieves polynomial acquisition time at inverse-polynomial accuracy with logarithmic squeezing and polynomial photon number. On the other hand, we prove that any local idler-free protocols require acquisition time exponential in the number of selected temporal modes per window. This lower bound holds for both sequentially prepared and arbitrarily temporally entangled probes, allowing non-Gaussian inputs and measurements and causal classical feedback, as long as each output is measured destructively within its time bin. These results establish an exponential quantum learning advantage for a single continuously monitored stationary signal, with the sensing cost measured by total acquisition time.
arXiv·2026-10-10·Terry Rudolph, Tony Newton, Dan-Adrian German
No generated summary available for this entry.
overview
Original abstract
We show that it is possible for three people to win the GHZ game with just the standard real valued misty state formalism, but each party will need to have two balls instead of one. That is, there will be six balls involved, rather than three. In fact, as a general rule, instead of using complex numbers in a quantum computer you can always add a qubit to "tag" complex numbers. But for proofs of non-locality, like the GHZ game, we cannot have a single universal tagging qubit, because all three parties would need access to it and therefore they could potentially transfer information via it. That's where we need to replace the one ball with three that each only need to be accessed locally.
Phys.org Quantum Physics·2026-10-09
No generated summary available for this entry.
overview
Original abstract
Every black hole hides a question at its center. Einstein's theory predicts that whatever falls in is crushed into a singularity, a point of infinite density where the theory itself breaks down. Most physicists expect quantum gravity to replace that point with something finite. But the center lies hidden behind the horizon. How could we ever learn what is there?
The Quantum Insider·2026-10-09·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief IonQ has demonstrated entanglement rates exceeding 1,000 events per second between a trapped-ion qubit and a silicon-vacancy solid-state quantum memory using a photonic interconnect. The company says the result is more than four times faster than the previous trapped-ion interconnect record and could support distributed quantum computing. The work supports IonQ ’s participation in DARPA’s HARQ program and builds on commercial quantum networking system sales to the University of Maryland and South Korea’s SDT. PRESS RELEASE — IonQ (NYSE: IONQ), the world’s leading full-stack quantum platform and foundry, today announced the achievement of entanglement rates above 1,000 per second (1 kHz) between a trapped ion qubit and a solid-state memory, through a photonic interconnect. Entanglement is the quantum connection that lets separate systems work together, and it is the essential ingredient for networking quantum computers. While the trapped ion qubit sets the standard for qubit coherence, the solid-state quantum memory has unmatched efficiency coupling to light. Their juxtaposition is the best of both worlds, demonstrating the fastest quantum interconnect rate between qubits of any platform. “ IonQ has crossed a pivotal milestone for memory enhanced quantum interconnects, achieving more than 1,000 entanglement events per second,” said Niccolo de Masi, Chairman and CEO of IonQ. “Classical data centers achieved massive scale by connecting specialized processors, memory, and networks. Quantum systems will scale in much the same way. This breakthrough addresses a critical interconnect bottleneck and advances IonQ’s roadmap to build the networked quantum data centers of the future.” A technical paper presents results from real-world hardware testing of an end-to-end link between a trapped ion system and a silicon vacancy (SiV) qubit, building on IonQ ’s SiV quantum memory platform . IonQ’s demonstration achieves rates more than four times faster than the
The Quantum Insider·2026-10-09·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Quantum Elements ’ Constellation platform has been named a winner of TMCnet’s inaugural 2026 Quantum Computing Product of the Year Awards. Constellation provides a hardware-aware development environment for designing, testing and analyzing quantum systems on classical computing infrastructure. The platform supports quantum hardware teams in evaluating noise, error-correction strategies and decoder performance before hardware runs. PRESS RELEASE — Quantum Elements , developers of software shortening the path to fault-tolerant quantum computing, today announced that its Constellation platform has been named a winner of TMCnet’z inaugural 2026 Quantum Computing Product of the Year Awards. Constellation gives quantum teams a hardware-aware development environment, running on classical computer architecture, to design, test and analyze quantum systems before committing to hardware runs. It allows quantum hardware teams to understand noise, test error-correction strategies, and evaluate decoder performance. The technology builds digital twins for every quantum software layer and user persona. “Constellation is bridging the gap between experimental hardware to fault-tolerant system design by giving development teams a faster, safer, and more repeatable way to validate ideas, improve designs, and prepare workflows for real-world deployment,” said Izhar Medalsy, co-founder and CEO of Quantum Elements . “We are honored by this recognition of the important role we are playing in advancing towards fault-tolerant quantum computers.” “On behalf of TMCnet and our editors, I’m pleased to recognize Quantum Elements as a winner of the inaugural 2026 Quantum Computing Product of the Year Awards,” said Rich Tehrani, TMCnet’s CEO and Group Editor-in-Chief. “Constellation represents the kind of innovation that is helping move quantum computing forward—from extraordinary science toward technologies that organizations can access, develop and ultimately put to work
The Quantum Insider·2026-10-09·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Arqit expects fiscal 2026 revenue of approximately $975,000 to $1 million, with cash and cash equivalents of about $51 million as of September 30. The company signed seven new contracts during fiscal 2026, including three for its Encryption Intelligence product in the second half. Arqit also signed a contract with a winning consortium to provide secure networking services to NATO, with delivery beginning after the fiscal year ended. PRESS RELEASE — Arqit Quantum Inc. (Nasdaq: ARQQ) (“Arqit”), a global leader in quantum-safe encryption, announces select preliminary financial results for the second half and full fiscal year 2026. Based on preliminary unaudited results, management expects revenue for the second half period ended 30 September 2026 of approximately $355,000 to $380,000. For the full fiscal year ended 30 September 2026, revenue is expected to be $975,000 to $1,000,000. Cash and cash equivalents were approximately $51 million as of 30 September 2026. Revenue for the second half period ended 30 September 2026 was down as compared to revenue of $463,000 for the same period in fiscal year 2025. Revenue for the full fiscal ended 30 September 2026 compares favourably to revenue of $530,000 for fiscal year 2025. Growth in revenue for fiscal year 2026 versus fiscal year 2025 resulted from but was not limited to: Revenue recognition associated with delivery under contracts signed prior to the commencement of the period; and Revenue recognition associated with 7 new contracts signed in the period. Revenue for the second half of fiscal year 2026 was adversely affected by cessation of revenue recognition under a material contract with a customer in the Middle East. The customer’s ability to fulfill its contractual obligations has been impacted by, but not limited to, geopolitical events in the region. Recognition of revenue under existing contracts is subject to a number of factors including, amongst others, the successful delivery of our products
The Quantum Insider·2026-10-09·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Quobly and SiPearl signed a non-exclusive agreement to explore combining silicon spin quantum processors with European CPUs to support a sovereign European quantum computing system. The initial phase will assess integrating SiPearl’s Rhea1 CPU and Seine reference server with a Quobly quantum processor system for its Alloy product line, followed by exploration of hybrid computing workloads and future architectures. The companies also plan to coordinate responses to European calls for tenders, including potential joint opportunities under the Chips Joint Undertaking’s quantum programs. PRESS RELEASE — Quobly , a French quantum computing company developing industrially scalable quantum computers based on silicon spin qubits, and SiPearl, the designer of European high-performance energy-efficient CPUs for sovereign supercomputing, AI and data centre, have signed a Memorandum of Understanding (MoU) to combine their respective technologies and expertise towards a sovereign quantum computing solution, bringing together SiPearl’s CPU technology and Quobly ’s quantum processors. Integrating European CPU and quantum technologies This non-exclusive collaboration will initially focus on integrating SiPearl’s first-generation Rhea1 CPU and its associated Seine reference server with a Quobly QPU system, as part of the development of Quobly’s Alloy product line. This first phase will assess the technical feasibility of hybridizing the two technologies within a common system architecture. The partners will then explore the optimization and deployment of hybrid HPC–quantum workloads, followed by potential architecture synergies for future generations of products. Supporting a European sovereign computing ecosystem The collaboration brings together two core building blocks for European computing, combining SiPearl’s CPU technology with Quobly ’s quantum processors, and marks a first step towards bridging Europe’s HPC and quantum computing ecosystems. SiPearl and Q
The Quantum Insider·2026-10-09·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief BTQ Technologies has partnered with MoonPay Korea to secure its Korean won-backed stablecoin infrastructure, with a focus on post-quantum cryptography (PQC). The companies plan to develop a post-quantum security roadmap and test BTQ ’s Quantum Secure Stablecoin Network (QSSN) with Korean banking institutions. The partnership builds on BTQ ’s existing stablecoin security projects with Finger, iM Bank, LINE NEXT, and the Kaia DLT Foundation. PRESS RELEASE — BTQ Technologies Corp. ( “ BTQ “ or the “Company” ) (Nasdaq: BTQ ) (CBOE CA: BTQ), a global technology company building the trust infrastructure for the quantum era, has announced a strategic partnership with MoonPay Korea, part of MoonPay Inc. (“MoonPay”), the leading global crypto payments network. Under the partnership, BTQ will serve as the security partner for MoonPay Korea’s stablecoin infrastructure in Korea, with a focus on post-quantum cryptography (“PQC”). MoonPay Korea is building full-stack on-chain infrastructure for Korea’s emerging won-backed stablecoin market, covering issuance support, distribution, wallet access, settlement, and currency conversion through to last-mile delivery to users and merchants. BTQ ‘s role is to secure that stack against current and future threats, including the risk that quantum computing poses to the cryptography protecting digital assets. The partnership brings BTQ into one of the most innovative infrastructure efforts in Korea’s stablecoin market and connects it to a global network. MoonPay serves more than 35 million customers in approximately 180 countries and more than 1,500 enterprise clients. MoonPay Korea links Korean won-backed stablecoins to that network for distribution, cross-border settlement, and wallet access, so the infrastructure BTQ helps secure in Korea is designed to reach users and merchants worldwide. The partnership scope includes: Quantum-transition roadmap.
The Quantum Insider·2026-10-09·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Quantum X Labs has filed a USPTO patent application for a structured-beam Zeeman slower and atomic push-beam system for its cold-atom quantum computing program. The proposed technology uses non-Gaussian optical beam profiles to control how laser forces slow, guide, push, and transport neutral atoms. The application targets the physical preparation and control systems needed to cool, position, and manipulate atoms before quantum operations. PRESS RELEASE — Quantum X Labs Inc. (NASDAQ: QXL) (“Quantum X Labs” or the “Company”) today announced that its subsidiary, Quantum X Labs Ltd., a developer of technologies across quantum computing, quantum sensing, quantum software and quantum security, has filed a patent application with the United States Patent and Trademark Office (USPTO) titled “Structured-Beam Zeeman Slower and Atomic Push-Beam System”. The patent application relates to technologies for the laser cooling, manipulation and transport of neutral atoms, with particular focus on a Zeeman slowing apparatus in which at least one optical beam used for slowing, pushing, guiding or otherwise manipulating an atomic beam has a non-Gaussian spatial intensity distribution. The technology covered by the patent application is being developed as part of Quantum X Labs’ cold-atom quantum computing program, where the preparation, cooling, transport and precise control of atoms represent fundamental elements of the physical architecture required to prepare atoms for subsequent trapping and quantum operations. Zeeman slowing is an established technique for reducing the velocity of atoms using laser light together with a spatially varying magnetic field. The process enables atoms initially traveling at relatively high velocities to be decelerated to velocities suitable for subsequent cooling, trapping and manipulation. Quantum X Labs’ patent application seeks protection for an approach that introduces structured optical beams into the atom-slowing and manipulat
Phys.org Quantum Physics·2026-10-09
No generated summary available for this entry.
overview
Original abstract
Quantum computers, computer systems that leverage the laws of quantum mechanics, store and process information using qubits (i.e., quantum bits). In many quantum computers, qubits are linked via entanglement, a quantum mechanical effect that connects particles in such a way that their shared state cannot be described as separate, independent states.
Phys.org Quantum Physics·2026-10-09
No generated summary available for this entry.
overview
Original abstract
For highly fragile quantum information systems, the ability to store quantum information is vital—but also challenging. Quantum information is transported in particles of light called photons, which often must be temporarily paused (or "stored") while other, slower quantum operations catch up. This storage must be performed on microchips as small as 1 centimeter (0.4 inches)—a distance covered by light in a few trillionths of a second. Storing photons for a microsecond would represent a massive leap forward for the capabilities of quantum chips.
The Quantum Insider·2026-10-09·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief The Chattanooga Quantum Collaborative (CQC) has graduated 17 professionals from 16 Tennessee employers from its 12-week Quantum Ready Pre-Apprenticeship program. Participants received training in quantum computing, networking and sensing, with coursework, industry speakers, hands-on platform exposure and capstone projects. Supported by an NSF planning grant awarded to the University of Tennessee at Chattanooga , the program aims to help Tennessee businesses assess potential quantum technology applications. PRESS RELEASE — Chattanooga Quantum Collaborative announces seventeen professionals from sixteen Tennessee employers completed the Quantum Ready Pre-Apprenticeship, a 12-week program created by the Chattanooga Quantum Collaborative (CQC) to help companies understand emerging quantum technologies. The program was designed for professionals already working in technology-adjacent roles, with two goals: upskilling the existing workforce and building quantum proficiency inside the organizations where they work. “Quantum won’t replace every system overnight, but exploring where it complements classical technology can provide businesses an early, distinct competitive edge,” said Charlie Brock, CEO of CQC. “This program puts early advocates directly into the companies best positioned to benefit, equipping them to test real-world quantum applications and address complex business challenges classical computing alone can’t resolve.” “Research opens the door to new possibilities, and industry adoption carries that work into economic impact,” said Mina Sartipi, Interim Vice Chancellor for Research at the University of Tennessee at Chattanooga . “That is why industry engagement and commercialization are core parts of the NSF grant UTC is leading, and why we’re proud to help prepare professionals who can bring quantum knowledge and capabilities into Tennessee companies.” The participants who co
Nature: Quantum Information·2026-10-09
No generated summary available for this entry.
overview
Phys.org Quantum Physics·2026-10-09
No generated summary available for this entry.
overview
Original abstract
Many fascinating phases in quantum materials emerge when electrons, atoms and other microscopic components begin to act collectively. But these phases do not necessarily appear out of nowhere when a material crosses a transition temperature. Before long-range order develops, microscopic fluctuations can already be present.
The Quantum Insider·2026-10-09·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Fujitsu and New Mexico announced a collaboration to establish a quantum computing research center focused on hardware, software, algorithms, theory and workforce development. The partners will explore research opportunities with universities and national laboratories, building on New Mexico’s $150 million commitment to support quantum investment and ecosystem development. The collaboration will examine hybrid systems combining Fujitsu’s FUJITSU-MONAKA processors with quantum computing, quantum simulation and AI for potential applications in materials, energy, drug discovery and other industries. Image: Figure : Fujitsu and New Mexico MOU signing ceremony. Left to right: Senator Michael Padilla, Cabinet Secretary New Mexico Economic Development Rob Black, Governor Michelle Lujan Grisham, Fujitsu CTO Vivek Mahajan and Senator George Muñoz (Provided) PRESS RELEASE — Fujitsu announced a collaboration with New Mexico to establish a quantum computing research center in New Mexico. The center will conduct advanced research spanning quantum computing hardware, software, algorithms, and theory, while supporting education and workforce-development initiatives designed to expand the quantum talent pipeline and strengthen collaboration across industry, academia, government, and the research community. The initiative will bring together Fujitsu’s expertise in advanced computing and quantum technologies with New Mexico’s scientific and research ecosystem. Through research collaboration, internships, academic engagement, and other workforce-development programs, the center will help create new pathways for students, researchers, and engineers to participate in the emerging quantum economy. The collaboration also supports the State of New Mexico’s broader vision of building a more interconnected, innovative, and sustainable future through investments in advanced technologies and high-skilled industries. New Mexico has emerged as an important center for quantum r
The Quantum Insider·2026-10-09·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief izmo Microsystems and IIT Madras have entered Phase II of the Centre for Programmable Photonic Integrated Circuits and Systems (CPPICS), a five-year silicon photonics program with a total outlay of ₹99.94 crore. The SPECTRA program will target silicon photonics applications in data-center transceivers, microwave photonics, quantum technologies and photonic computing for AI. izmo Microsystems will contribute packaging, testing and integration expertise, including work on co-packaged optics and a 1.6 Tbps silicon photonics transceiver engine. PRESS RELEASE — izmo Limited (NSE: IZMO) (BSE: 532341) today announced that its semiconductor subsidiary, izmo Microsystems Pvt. Ltd., has entered into a Memorandum of Understanding with the Indian Institute of Technology Madras (IIT Madras) for Phase II of the Centre for Programmable Photonic Integrated Circuits and Systems (CPPICS). The Phase II program, titled Silicon Photonics Enabled Cutting-edge Technology Research and Applications (SPECTRA) , has been sanctioned by the Ministry of Electronics and Information Technology (MeitY), Government of India, with a total project outlay of ₹99.94 crore. The five-year program includes a MeitY contribution of ₹97.54 crore and a ₹2.40 crore cash and in-kind commitment from izmo Microsystems. CPPICS Phase II is designed to advance silicon photonics technologies from research towards commercially deployable products, covering photonic integrated circuit design, fabrication, characterization, advanced packaging, testing and system integration. Silicon Photonics for the AI infrastructure era The program comes at a time when optical connectivity is becoming critical infrastructure for AI and high-performance computing. As GPU and accelerator clusters scale, data-center networks require substantially higher bandwidth while controlling power consumption, latency and interconnect density. This is driving the transition towards 800G and 1.6T optical interconnects, silicon pho
The Quantum Insider·2026-10-09·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief University of Auckland and U.S. researchers demonstrated a chip-based optical frequency comb that could support smaller precision measurement systems, including portable atomic clocks. The design uses two lasers with frequencies an octave apart to generate evenly spaced light frequencies between them, addressing control and stabilization challenges in existing systems. The researchers demonstrated precise optical frequency generation, low-noise millimetre-wave signals and optical clock readout, with potential applications in navigation, telecommunications and sensing. Image: Professor Miro Erkintalo (University of Auckland) PRESS RELEASE — University of Auckland research may help the world to miniaturize the laser tools used for ultraprecise measurements such as atomic clocks and quantum computing. There are big scientific and commercial implications. So far, the laser tools called optical frequency combs have been trapped in the lab because of their size and expense. Optical frequency combs are the standard tools for measuring the frequency – or colours – of light. They are sometimes called `light rulers’ or ‘rainbow rulers’. But research by University of Auckland and US scientists, reported in the prestigious journal Nature, suggests a new path for shrinking the technology to chip size for future navigation systems, communications networks, precision sensors and portable atomic clocks. The breakthrough is a culmination of work that started in 2021, when Professor Miro Erkintalo, who is the head of the Department of Physics at the University and a researcher at the Dodd-Walls Centre for Photonic and Quantum Technologies, began exploring a potential new way to generate chip-scale frequency combs. With the help of his students, he predicted that two laser beams launched into a chip-scale ring could generate a new type of frequency comb. The prediction became reality in 2024, when the Auckland researchers teamed up with Grég
The Quantum Insider·2026-10-09·Resonance
No generated summary available for this entry.
overview
Original abstract
A new paper demonstrating Grover’s search on a room-temperature diamond processor may echo the transistor’s takeover from vacuum tubes – and raises questions about how much vacuum-dependent quantum hardware survives the same transition. Guest Post By Prof. Dr. Marius Grundmann, CEO, SAXON Q Every disruptive technology has a quiet laboratory result that outsiders miss and insiders remember for decades. A newly published demonstration of Grover’s search algorithm on a room-temperature diamond quantum processor is a strong candidate for exactly that kind of moment. The result is narrow in scope – a three-qubit search on a nitrogen-vacancy (NV) center system – but carries a broad implication. It suggests that quantum information processing is echoing the move classical computing made, out of vacuum-based hardware and into the semiconductor lattice. The physics is different, but the direction is the same. The real question is how fast it happens – and what it means for the tens of billions of dollars committed to vacuum-dependent modalities. How Silicon Buried the Vacuum Tube The precedent is instructive. The first electronic computers, like ENIAC, ran on thousands of vacuum tubes – power-hungry, hot and unreliable enough that keeping one running was a full-time engineering discipline. The transistor, invented at Bell Labs in 1947, did not immediately outperform the vacuum tube. What changed the outcome was not a single leap in performance, but a trajectory. Transistors miniaturized, integrated and improved on a curve that vacuum tubes structurally could not follow, because a vacuum tube cannot be fabricated by the billions onto a wafer. By 1958, the first integrated circuits demonstrated that semiconductor logic could be manufactured, not just assembled, and the vacuum tube’s fate was sealed. The lesson is that manufacturability and a favorable cost-and-performance curve beat raw early performance every time the two diverge. Quantum ComputingR
The Quantum Insider·2026-10-09·Katia Moskvitch
No generated summary available for this entry.
overview
Original abstract
Insider brief A new episode of The Quantum Kid’s Kai Asks series uses a violin to explain qubit calibration, featuring Kristina Callaghan, Quantum Education & Workforce Development Program Manager at Quantum Machines. Because of tiny fabrication differences, every superconducting qubit has its own resonant frequency, so researchers must find the right control settings for each one through steps such as spectroscopy and Rabi experiments, then re-tune them as they drift. As quantum computers scale and move into data centres, calibration becomes a growing workload, increasing demand for trained quantum technicians and engineers. Before a violinist plays a note, they tune. Each string is tightened or loosened until it sounds exactly right, and even then, temperature and humidity will pull it out of tune again before long. Quantum computers have the same problem, only far more acute. That was the starting point for the latest episode of Kai Asks, the short-form series from The Quantum Kid in which 10-year-old Kai puts his questions to one expert. Kai opened by playing his violin, then asked Kristina Callaghan, Quantum Education & Workforce Development Program Manager at Quantum Machines, how scientists tune the qubits inside a quantum computer. Why qubits need tuning In a superconducting quantum computer, each qubit is a tiny electrical circuit cooled to a fraction of a degree above absolute zero. Ideally, every qubit on a chip would be identical. In practice, tiny variations in fabrication mean each one behaves slightly differently, with its own resonant frequency: its own “note.” To control a qubit, researchers must hit that frequency precisely with microwave pulses. Miss it, and the qubit doesn’t respond as intended. Calibration is the process of finding those settings and keeping them correct. It typically starts with spectroscopy: sweeping a signal across a range of frequencies and looking for the sharp dip that shows where the qubit
Phys.org Quantum Physics·2026-10-09
No generated summary available for this entry.
overview
Original abstract
University of Glasgow researchers are part of an international collaboration that could lead to a new generation of quantum sensors. The team, which included researchers from the University of Tokyo, University of Glasgow, University of Sheffield and Kobe University, has for the first time used light to read out the magnetic spin of electrons trapped inside a porous crystalline material known as a metal-organic framework (MOF).
Quantum Computing Report·2026-10-09·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Researchers from the University of Auckland, NIST, UMD, and UC Santa Barbara have developed a chip-integrated optical frequency comb that addresses long-standing stability and control issues in microcomb metrology. They achieved this by inverting traditional frequency comb architectures, using two pump lasers an octave apart to generate a self-aligned, octave-spanning microcomb on a single chip. This innovation has significant implications for deployable optical atomic clocks, GPS-denied quantum navigation, and precision quantum sensing, with a provisional patent filed for commercialization. The post University of Auckland, NIST, and UMD Demonstrate Octave-Spanning Chip-Scale Microcomb in Nature appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-09·Doug Finke
No generated summary available for this entry.
overview
Original abstract
Interview with Harry Kumar, co-founder, director, and Chief Creative Officer of Moth Quantum. Moth is the company behind Quantum Backrooms, a browser game whose maze is generated on real quantum hardware. The post Podcast with Harry Kumar, Co-founder, Director & CCO of Moth Quantum appeared first on Quantum Computing Report .
PRX Quantum
·2026-10-09
·Anonymous
·doi
No generated summary available for this entry.
overview
Quantum Science and Technology
·2026-10-09
·Giuliano Chiriacò
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract We introduce a mapping between the ground state of interacting fermionic Hamiltonians and the non-equilibrium steady state of a purely dissipative open quantum system. Within the framework of third quantization, we map the Fermi-Hubbard Hamiltonian onto Lindblad jump operators acting on Majorana fermions. Remarkably, both hopping and interaction terms map onto jump operators that preserve the Gaussianity of Majorana fermions along individual quantum trajectories. As a result, the dynamics can be unravelled and each trajectory can be simulated efficiently using only two-point correlation functions, with a computational cost that scales polynomially with system size. We further show that finite particle number requires negative dissipative rates, leading to an intrinsically non-Markovian dynamics. The corresponding trajectory unravelling involves both positive and negative stochastic weights and exhibits a sign problem and large fluctuations, so that convergence requires an exponentially large number of trajectories. The overall computational cost remains exponential in system size despite the efficient Gaussian representation of individual trajectories, but is crucially dependent on the computational complexity of the non-Markovian unravelling, motivating further studies on the efficiency of such unravellings.
Quantum Science and Technology
·2026-10-09
·Gonzalo Camacho, Benedikt Fauseweh
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract Time crystals are nonequilibrium phases of matter characterized by the emergence of temporal ordering, in which an interacting many-body system develops robust structure in its time evolution that is not trivially dictated by the external driving or environment. While related phenomena have long been studied in classical nonlinear systems, their realization in entangled quantum matter represents a distinct frontier. The theoretical understanding of discrete time crystals has substantially advanced, yet recent experiments using modern quantum devices and quantum processors reveal regimes beyond established paradigms. These developments call for an extended classification of time-crystalline phases according to both their stabilization mechanisms and their physical character, including discrete and continuous, closed and open, critical, topological, quasiperiodic, and controlled realizations. We review recent implementations of time crystals on quantum platforms and propose such a classification framework, identifying promising directions for the discovery of novel time-crystalline phases of matter.
arXiv·2026-10-09·Jaehyun Lee et al.
No generated summary available for this entry.
overview
Original abstract
Quantum geometric quantities, such as Berry curvature (BC) and quantum metric, are known to govern the physical and topological properties of materials, making access to these quantities critically important for the comprehensive understanding of the materials. Chiral crystals offer a natural platform in which structural handedness can control quantum geometry and nonlinear transport, but direct experimental access to the quantum geometric quantities has remained elusive. Here, we show that trigonal tellurium (Te) hosts an enantiomer-dependent Berry curvature dipole (BCD) that can be accessed through the measurement of cross-axial nonlinear Hall effect (NHE), unlike previously studied in-plane configurations where the BCD contribution vanishes. Angle-resolved measurements on left- and right-handed Te devices reveal a second-order transverse response whose sign reverses with crystal chirality. The extracted cross-axial nonlinear susceptibility, $χ_{yxz}$, exceeds the in-plane susceptibility, $χ_{xxx}$, by more than two-folds, indicating a strong BCD-driven contribution. First-principles calculations attribute this behavior to a topologically nontrivial hedgehog-like BC texture near the H points and predict a BCD that reverses sign between opposite enantiomers, consistent with experiment. These results establish cross-axial nonlinear Hall transport as a symmetry-selective probe of chirality-controlled quantum geometry in tellurium and related chiral materials.
arXiv·2026-10-09·Ginger E. Lau, Adil A. Gangat
No generated summary available for this entry.
overview
Original abstract
The low autocorrelation binary sequences (LABS) problem, often formulated as a spin-lattice energy-minimization problem, is a combinatorial optimization problem with a very rugged energy landscape. We demonstrate that iterative optimization of very small subsystems of n spins that are decoupled from the rest of the system achieves global optimization of LABS with a time-to-solution scaling that is competitive with heuristics that optimize the global system of N spins directly. Our isolated-subsystem heuristic with n = 4 achieves a time scaling of O(1.333N ) on the interval N = [27, 60], while the current state-of-the-art classical and quantum scalings are respectively O(1.34N ) and O(1.21N ). Our results suggest that specialized optimization hardware with only small numbers of logical spins may be of practical relevance.
arXiv·2026-10-09·Isaac Vidaña
No generated summary available for this entry.
overview
Original abstract
We investigate how femtoscopic correlations modify the relation between the spin entanglement of emitted particle pairs and that of pairs selected at a given relative momentum. For two spin-$\frac{1}{2}$ particles, we show that the momentum-selected spin state can be entangled even when the corresponding state at emission is separable. We derive a momentum-dependent separability criterion that determines whether the observed spin correlations require entanglement at emission. As an application, we consider a pair of identical $Λ$ hyperons, for which quantum statistics and final-state interactions affect the singlet and triplet spin channels differently at low relative momentum. Our results provide a framework for using experimentally accessible spin correlations to investigate entanglement at emission.
arXiv·2026-10-09·Christopher Peng
No generated summary available for this entry.
overview
Original abstract
Quantum signal processing (QSP) requires the efficient computation of phase factors associated with a polynomial transformation. One existing stable factorization method avoids direct root finding but relies on Prony's method to recover a polynomial from weighted power sums of its roots (arXiv:2202.02671). We present a modification of this approach that eliminates Prony's method by using the logarithmic derivative of an associated polynomial. Because the logarithmic derivative has the same residue at every root after accounting for multiplicity, its Fourier coefficients directly yield the unweighted power sums of the roots inside the unit disk. The Newton--Girard identities then recover the coefficients of the corresponding polynomial without computing its roots. The resulting algorithm has $O(d\log^2 d)$ computational complexity and simplifies the factorization procedure of the original method. In numerical experiments on Hamiltonian simulation, eigenstate filtering, matrix inversion, and the Fermi--Dirac operator, our implementation computes phase factors in seconds with maximum errors on the order of $10^{-12}$.
arXiv·2026-10-09·Shrinkhala Sharma et al.
No generated summary available for this entry.
overview
Original abstract
Topological crystalline insulators are distinguished from the conventional Z2 topological insulators by crystalline symmetry protection of the surface states. Quantitative characterization of these states requires magneto-transport measurements from which the phase coherence length and number of independent coherent channels can be extracted. Here we report such measurements on textured thin films of SnTe grown on Bi2Te3 buffered c-plane sapphire (Al2O3) by pulsed laser ablation. A post deposition annealing protocol was implemented to control the crystallographic texture, which reveals improved crystallinity and enhanced epitaxial alignment along the [111] direction in films annealed at elevated temperatures. The higher carrier density and lower resistivity seen in films annealed at 100 oC are suggestive of Sn vacancies which act as native acceptor defects, while films annealed at 200 oC approach the 1:1 stoichiometry. The magnetoresistance of all samples at T < 10 K characterized by a cusp centered around zero-field is suggestive of weak antilocalization and interpreted in the framework of the Hikami-Larkin-Nagaoka theory in the strong spin-orbit coupling limit. At T > 20 K, the MR is small and positive, and deviates from conventional Kohler scaling. An approximate collapse of the MR curves between 50 and 250 K is obtained using an empirical temperature-dependent scaling factor, indicating that changes in the Hall-derived carrier density alone cannot account for the observed scaling behavior. These results demonstrate that post growth annealing strongly influences the interplay between stoichiometry, crystallinity, and coherent transport in SnTe thin films.
arXiv·2026-10-09·Jacob S. Nelson, Andrew J. Landahl, Andrew D. Baczewski
No generated summary available for this entry.
overview
Original abstract
We deploy a universal fault-tolerant quantum computing (FTQC) architecture based on error-detecting $[\![8,3,2]\!]$ and $[\![4,2,2]\!]$ codes on Quantinuum's Helios-1 trapped-ion quantum computer. We compile and execute ripple-carry adder (RCA) circuits for classical inputs up to five bits on this architecture. Uncomputing a workspace qubit provides an additional ``algorithmic check'' to detect errors. While available at both the physical and logical levels, this check synergizes with our architecture by increasing the effective fault distance of many circuit locations from two to four. Combining this algorithmic check with the error-detecting codes, we observed only a single logical failure in one-bit addition after burst-error filtering, yielding an estimated logical failure rate of $(6.0 \pm 5.9) \times 10^{-5}$. This is well below the $(3.5 \pm 1.3) \times 10^{-3}$ failure probability observed for one-bit addition on the same hardware in unencoded form. Two- and three-bit adders also showed performance improvements, while the longer four- and five-bit adders executed just above threshold.
arXiv·2026-10-09·Thamadathil Aswanth, Navin Kashyap
No generated summary available for this entry.
overview
Original abstract
The codeword stabilized (CWS) framework provides a systematic method for constructing quantum error correcting codes from a simple undirected graph and a classical code. When the underlying classical code is linear, the resulting quantum code is a stabilizer code. In this work, we investigate the conditions under which an arbitrary $[n,k,d]$ classical binary linear code can be lifted to an $[[n,k,d]]$ quantum stabilizer code using the CWS framework. We analyze the random CWS code constructed from a given $[n,k,d]$ binary linear code $\mathcal{C}$ and an Erdős-Rényi random graph $\mathrm{G}(n, \frac12)$. We establish a lower bound on the probability that the resulting quantum code preserves the minimum distance $d$ of the classical code. This probabilistic analysis yields a Gilbert-Varshamov-type condition on the $n,k,d$ parameters of the classical code that guarantees the existence of a graph resulting in a quantum code with the same $n,k,d$ parameters.
arXiv·2026-10-09·Ruge Lin, Ranyiliu Chen
No generated summary available for this entry.
overview
Original abstract
A variational quantum state may have many control angles, and its complete gradient contains one derivative for each. The task is to turn access to selected derivatives into a shared finite-shot record for the complete vector. The Hopf ansatz supplies the setting: it constructs any normalized pure state from nested two-way magnitude splits and, for complex states, leaf phases, with one directly programmed angle per split or phase. Earlier Hopf constructions prepare the state, recover coordinates from known amplitudes, and provide indexed derivative access. With a phase-calibrated controlled reflection, the inverse Hopf frame maps each normalized magnitude direction to a computational label, so every all-$X$ outcome contributes to every magnitude derivative. A separate signed leaf record supplies the complex phase block. A checkpoint variant reverses only the suffix below a selected depth and returns that layer's gradient block. For a complete chart with $M$ real-valued parameters, sufficient execution counts are $\mathcal{O}(\log\log M)$ for the global method and $\mathcal{O}(\log M\log\log M)$ for the complete checkpoint schedule at fixed additive coordinate accuracy and confidence. The global saving is record reuse, not a reduction of the $M$-entry output. Under the designated direct-angle schedules, the global method's assigned Hopf CNOT work and input/output-inclusive storage have at most logarithmic overhead relative to a matched scalar evaluation. The same Hopf geometry thus carries a state forward and the objective's complete coordinate response backward.
arXiv·2026-10-09·Muxin Han, Yichen Hu
No generated summary available for this entry.
overview
Original abstract
In de Sitter static patch holography, coupling bulk quantum fields to an observer's dynamical clock yields a type II$_1$ von Neumann algebra $\mathcal{M}_+$ of gauge-invariant observables. However, the unique tracial state on this algebra fails to reproduce semiclassical bulk correlation functions. We resolve this issue by introducing a family of heavy-clock states, representing an observer reference frame with heavy inertia. We prove that in the heavy-clock limit, $n$-point correlation functions of gauge-invariant dressed observables reproduce the bulk quantum field correlation functions on de Sitter spacetime. Furthermore, we investigate a generalized observer Hamiltonian $\widehat{H}_{\rm obs}=|\widehatπ|$ that incorporates both forward-running ($π\geq 0$) and backward-running ($π<0$) clocks. The resulting von Neumann algebra $\mathcal{M}$ of gauge-invariant observables remains a type~II$_1$ factor and is isomorphic to $\mathcal{M}_+\otimes M_2(\mathbb{C})$, where $M_2(\mathbb{C})$ is the algebra of $2\times2$ complex matrices transforming between the two clock orientations. Time-reversal symmetry is implemented in this setting as an anti-unitary operator that exchanges the two clock orientations, yielding a type~II$_1$ von Neumann algebra $\mathcal{F}$ of gauge-invariant, time-reversal-invariant observables. We generalize the heavy-clock state construction to both $\mathcal{M}$ and $\mathcal{F}$, showing that $n$-point correlation functions calculated in heavy-clock states match the corresponding semiclassical bulk correlation functions. Finally, by coupling Einstein gravity to the Brown--Kuchař dust field, we derive the observer Hamiltonian $\widehat{H}_{\rm obs}=|\widehatπ|$ from a perturbative reduction along the observer's worldline in the $G \to 0$ limit. This provides a field-theoretic foundation for the observer model developed in this work.
arXiv·2026-10-09·Chitose Maruko et al.
No generated summary available for this entry.
overview
Original abstract
Understanding how pairing correlations in superconductors evolve out of equilibrium is a central challenge in quantum many-body physics. In systems with $s$-wave pairing, the character of Cooper pairing evolves continuously from a BCS regime of weakly bound, overlapping pairs to a BEC regime of tightly bound molecules, each with distinct excitation spectra. Here we realize and probe pairing dynamics across these regimes using cold, non-degenerate $^{87}$Rb atoms coupled to an optical cavity with Floquet dressing. Our cavity-QED platform emulates fermionic superfluids through a mapping onto Anderson pseudospins, while optical and microwave control tunes the ratio of interactions to single-particle energies, providing a flexible approach complementary to ultracold Feshbach and ultrafast solid-state platforms. Following a quench, we observe persistent pairing and transient oscillations of the order parameter associated with a collective amplitude (Higgs) mode. We find that the decay of these oscillations sharply distinguishes weak- and strong-pairing regimes: in the weak-pairing regime, oscillations decay with a power-law exponent $|α|=0.65(8)$, whereas in the strong-pairing regime the decay is substantially faster, with $|α|>1$. The oscillation frequency is set by the minimum quasiparticle excitation energy, directly linking nonequilibrium dynamics to the underlying excitation spectrum. Our results establish nonequilibrium dynamics as a direct probe of pairing character and collective excitations in interacting quantum systems.
arXiv·2026-10-09·Matthew Yu
No generated summary available for this entry.
overview
Original abstract
We develop a homotopical framework for understanding the space of quantum spin systems based on topological $n$-nets, which assign associative unital algebras to local regions in an $n$-dimensional space in a manner that captures the locality structure of the underlying lattice theories. The net-theoretic perspective admits a natural categorification, in which the category of topological $n$-nets carries the structure of a higher Morita category. Moreover, the nets of greatest physical interest form a Karoubi-complete subcategory that shares many of the characteristic structural features of the category of finite TQFTs. Our main result identifies the group of locality-preserving symmetries of (3+1)-dimensional quantum spin systems (i.e. quantum cellular automata modulo stabilization, finite-depth quantum circuits, and translations) with the full Witt group of nondegenerate braided fusion categories, thereby answering a question posed by Haah.
arXiv·2026-10-09·Jiyun Su, Shihang Zhang, Peihao Huang
No generated summary available for this entry.
overview
Original abstract
The nuclear spin of a phosphorus atom in silicon is considered as a promising quantum information carrier for quantum computing due to its long coherence time. Coherent control of the nuclear spin is typically realized using nuclear magnetic resonance (NMR). In this work, we theoretically propose that with the aid of hyperfine interactions and magnetic field gradients, fast electric-dipole-induced nuclear electric resonance (EDNER) can be achieved. The stronger EDNER (compared with NMR) arises from the combined effects of hyperfine interaction between the nuclear and electron spins and coupling between the electron spin and charge degrees of freedom mediated by magnetic field gradients in this scheme. By operating at specific working points, the nuclear-spin splitting becomes less sensitive to electrical noise, enabling long coherence times and high-fidelity quantum operations. All elctrical, addressable control of nuclear spins paves the way for scalable silicon-based quantum computing.
arXiv·2026-10-09·Dohyun Kim, Namshik Han
No generated summary available for this entry.
overview
Original abstract
Approximate quantum compilation (AQC) using tensor networks provides a promising route to reducing the circuit resources required for quantum simulation. However, the factors governing the compressibility of many-body dynamics and the extent to which compressed circuits retain physically relevant information on quantum hardware remain poorly understood. We investigate these questions using AQCtensor for an 80-qubit one-dimensional anisotropic XYZ Heisenberg chain initialized in a Néel state. By varying the exchange anisotropy and external magnetic field, we find that compression performance changes systematically with the anisotropic coupling configuration and field orientation. These variations are strongly associated with a nested-commutator measure related to second-order Trotter error, with corresponding directional trends also reflected in the target-state MPS bond dimension. For an 80-qubit quantum-hardware evaluation, AQCtensor compresses a 10-repetition target evolution to 5 repetitions while retaining a target-state fidelity of 0.995474, reducing the total circuit depth by 45.9% and the two-qubit gate count by 47.6%. The compressed circuit exhibits comparable behavior across magnetization, nearest-neighbor correlation, and Hamiltonian expectation measurements, while process-level diagnostics and local reduced-state tomography provide complementary characterization beyond these observables. Together, these results link AQCtensor compressibility to Hamiltonian commutator structure and target-state complexity and demonstrate substantial circuit reduction while retaining physically relevant features in an 80-qubit quantum-hardware experiment.
arXiv·2026-10-09·Chan Bin Bark et al.
No generated summary available for this entry.
overview
Original abstract
Scattering of quasiparticles provides direct access to the interactions that govern strongly correlated systems. In this work, we realize the quasiparticle scattering experiment of the Fermi-Hubbard model on a digital quantum processor by colliding a doublon and a holon in the half-filled chain of 21 sites encoded on 42 qubits of the ibm_boston processor. For the first time, we measure the transmission probability of quasiparticles of the Hubbard model on quantum hardware, which agrees with the Bethe-ansatz scattering matrix without free parameters. Beyond the scattering probabilities, the collision generates entanglement by superposing the transmitted and reflected components, which we infer from the particle-number fluctuation. In sharp contrast, a control collision between two doublons shows neither the interaction dependence nor the number fluctuation, as expected for indistinguishable particles. Our work demonstrates that the ability to create quasiparticles of a chosen flavor on demand and program their motion and interactions makes a digital quantum processor a new experimental toolset for probing the entanglement structure generated by quasiparticle scattering.
arXiv·2026-10-09·Olumakinde Ogunnaike
No generated summary available for this entry.
overview
Original abstract
Quantum mechanics seems to be an incredibly delicate theory. Slight alterations to nearly any part of its structure can lead to huge qualitative differences and wildly unphysical predictions. Here, we explore the many-body consequences of replacing the Born rule $p(m)\propto\|P_m|ψ\rangle|^2$ by a warped rule $p_b(m)\propto\|P_m|ψ\rangle\|^{2b}$. Specifically, in systems with conserved particle number, evolution punctuated by repeated local particle observations acquires a probabilistic bias over measurement histories with an effect controlled by the sign of $b-1$. For $b>1$, this bias generically drives the gas to collect into nearly frozen configurations. Similar to the action of Maxwell's demon, the simple act of observation seems to extract entropy from a closed system. For $b<1$, the bias is reversed, generically scouring out long-wavelength fluctuations to produce a hyperuniform gas. We study this effect in a one-dimensional quantum gas, where these two phases are derived analytically for a particular measurement scheme and corroborated numerically for more general procedures with discrete-time projective-measurement circuit models using matrix product state simulations. We additionally discuss how this bias manifests in a common technique that often employs this warped rule, the ``replica trick,'' implying qualitative differences between finite-replica and replica-limit calculations.
arXiv·2026-10-09·Yutaro Iiyama
No generated summary available for this entry.
overview
Original abstract
A scalable ground-state solver to be used in sample-based quantum diagonalization (SQD) is presented. The solver is built on JAX API, and is intended to be run on GPU platforms and possibly many-GPU high-performance computing facilities. It is capable of subspace diagonalization in up to $2^{30}$-dimensional subspace, with possible upgrades to enable even larger-scale operations. The two main components, a general-purpose eigensolver and an SQD-specific matrix-vector operation function, are described in detail. Efficiency of the eigensolver with respect to the GPU memory is demonstrated using a simple physics model. Furthermore, good strong scaling of the eigensolver in many-GPU environment is observed.
arXiv·2026-10-09·Amin Shiraz Gilani et al.
No generated summary available for this entry.
overview
Original abstract
We study the quantum query complexity of several basic graph problems. 1) We prove a tight $Θ(n^{3/2})$ bound for finding a maximum-out-degree vertex in an $n$-vertex tournament, resolving a conjecture of Mande, Paraashar, and Saurabh [FSTTCS'23]. 2) Using the same proof idea, we give a direct proof that finding a maximum-degree vertex in an $n$-vertex undirected graph requires $Θ(n^{3/2})$ quantum queries, a bound implicit in the work of Apers and Lee [CCC'21]. Both lower bounds above hold even for computing only the maximum degree or maximum out-degree. 3) We also study Maximum $(k,n-k)$-Cut, which asks for the largest cut with one side of size $k$. For every constant $k\geq 1$, we give an $O(n^{2-1/(k+1)})$-query quantum algorithm. 4) We establish a reduction to Maximum $(k,n-k)$-Cut involving $k$-Graph Collision, which asks whether the marked vertices of a known graph contain a $k$-clique. For $k\geq 3$, this yields unconditional lower bounds with exponents strictly larger than $3/2$, showing that this problem is strictly harder than computing maximum degree. Additionally, under a conjecture we propose for $k$-Graph Collision, the reduction yields a lower bound matching our upper bound above.
arXiv·2026-10-09·Rahul Gupta, Arya Haghighian, James D. Whitfield
No generated summary available for this entry.
overview
Original abstract
Fermionic Gaussian states are completely characterized by their two-point correlations, making the covariance matrix a natural reference for quantifying non-Gaussian structure. Motivated by fermionic antiflatness, we study its extremal form for pure number-conserving states and ask which states can be maximally antiflat and how they can be constructed. We show that, at fixed particle number, maximal first antiflatness is equivalent to a completely flat one-body reduced density matrix, and we obtain a complete existence classification together with explicit block and cyclic-orbit constructions of all allowed sectors. We then investigate the structure that appears beyond the covariance level. Maximally antiflat states with identical one-body data can exhibit distinct connected four-point correlations, which we characterize through the four-point Majorana Wick error and, equivalently, the connected two-body reduced density matrix cumulant. We show that this quartic structure is necessarily nonzero and formulate its extremization as a two-body reduced density matrix (2RDM) purity problem. Combining this framework with a Hilbert--Schmidt estimate of Christiansen for truncated two-body correlations, we obtain an upper bound on the connected quartic structure in terms of first antiflatness. Our results establish both a complete characterization of maximal fermionic antiflatness at fixed particle number and a constrained hierarchy linking covariance-level flatness to higher-order non-Gaussian correlations.
arXiv·2026-10-09·Otto Menegasso Pires et al.
No generated summary available for this entry.
overview
Original abstract
Air pollution poses a significant threat to public health, exacerbated by the rapid industrialization and urbanization of modern society. While traditional deep learning offers predictive capabilities, recent advancements in quantum machine learning (QML) present a compelling alternative. Here, we introduce a scalable hybrid framework that integrates variational quantum circuits with quantum annealing. Leveraging a neuromorphic quantum computing platform to transcend the qubit limitations of the NISQ era, we model particulate matter (PM$_{2.5}$) dynamics using high-density urban data from the UK. We demonstrate that our Quantum Neural Networks (QNNs) exhibit an intrinsic resilience to input volatility, significantly outperforming classical baselines (MLP and LSTM) on raw, high-entropy environmental data. Furthermore, we successfully scaled the model to 172 qubits, observing a synergistic enhancement when coupled with wavelet decomposition that achieves state-of-the-art predictive fidelity. These findings establish a critical benchmark for quantum utility, proving that scalable, neuromorphic quantum machine learning can now address complex, non-linear real-world problems.
arXiv·2026-10-09·Gideon Lee
No generated summary available for this entry.
overview
Original abstract
Two-block group-algebra codes are among the simplest quantum LDPC codes, and many of them are translation invariant on a twisted torus, which suits neutral-atom arrays and other platforms with movable qubits. We ask how far they go at small sizes when searched systematically across all groups. To tackle this question, we use a series of algebraic constraints and screens to design a search pipeline capable of enumerating broad and complete swathes of two-block codes on a laptop. With it we census about $10^8$ two-block codes with up to $320$ qubits at check weights five to nine. Several of these censuses are exhaustive, and support complete statements; for instance, the Gross code is, up to equivalence, the only abelian weight-six two-block code with $n \le 200$ to reach $kd^2/n=12$, and the known $[[64,18,8]]$ is the best two-block code by $kd^2/n$ across weights five to nine with $n \le 94$. The censuses are also large enough to give insights into where good codes live - they concentrate in a handful of groups; abelian groups give the best codes at small $n$ and non-abelian groups at large $n$, with the crossover appearing to move out as the check weight grows; and high quality codes become $100$ to $1000$ times rarer per draw from weight six to weights eight and nine. Using the group algebra and the census data to steer a statistical search finds four to fifteen times as many good codes as uniform draws in equal time. Among the codes found are $[[102,20,10]]$ and $[[120,24,10]]$ at check weight nine, which we simulate in noisy syndrome-extraction circuits, and $[[288,16,16]]$, the best weight-six two-block code with $n \le 300$. At check weights seven to nine, our best codes exceed the best published $kd^2/n$ with exact distance at the same check weight in most length bands up to $320$ qubits. All codes are available in a public database.
arXiv·2026-10-09·Ming Wang et al.
No generated summary available for this entry.
overview
Original abstract
Quantum low-density parity-check (qLDPC) decoding requires reliable corrections and low latency over long syndrome histories. We extend BP-SF, an oscillation-guided belief-propagation (BP) decoder with independent syndrome-flip trials, by introducing windowed and streaming operations. Our CUDA implementation combines disordered-memory retries, sliding windows, correlation-aware graphs, and layered scheduling. Circuit-level simulations test fixed-basis memory and complete logical Pauli-frame recovery. On the [[144,12,12]] bivariate bicycle code at physical error rate p = 0.002, parallel BP-SF reduces 99.9th-percentile call latency by a factor of 13.15 relative to an eight-chain Relay-BP GPU baseline on 100,000 matched samples for which every tested method's initial BP stage fails within 80 iterations. Windowed BP-SF maintains a flat logical error rate and nearly constant per-round compute time through 512 rounds, reaching a 17.1-fold speedup over monolithic decoding. In 512-round full-frame streaming decoding with 2.97-ms syndrome arrivals, layered BP-SF on a transformed joint graph with 20 retries reduces 99.9th-percentile correction-release age from 166.29 to 36.25 ms relative to the joint graph with flooding updates and 100 retries. These results connect parallel BP post-processing to lower decoding costs and earlier correction release in streaming quantum memory.
arXiv·2026-10-09·Amir Arqand, Graeme Smith
No generated summary available for this entry.
overview
Original abstract
We prove that four capacities of single-mode bosonic dephasing channels coincide under an average photon-number constraint: the unassisted quantum capacity, the unassisted private capacity, the two-way classically assisted quantum capacity, and the two-way public-classically assisted private capacity. The assistance may be interactive: the parties can exchange classical messages between channel uses and choose subsequent inputs based on earlier outcomes. For every finite value of the constraint, their common value is the coherent information optimized over Fock-diagonal input states satisfying the constraint. The proof uses a relative entropy comparison with the completely dephasing channel to derive chain rules for the Rains relative entropy and the relative entropy of entanglement. These chain rules give an upper bound on the rates achievable by adaptive protocols whose mean input photon number is constrained on average over all channel uses. We also show that both chain rules are attained by canonical purifications of finite-energy Fock-diagonal states.
arXiv·2026-10-09·Robert J. Banks et al.
No generated summary available for this entry.
overview
Original abstract
The introduction of two-body XX interactions has been shown to improve the performance of quantum annealing in solving certain combinatorial optimisation problems and would enable the simulation of a broader class of many-body Hamiltonians. Due to experimental constraints, such interactions are typically not natively available on analogue quantum devices. To overcome this limitation we introduce the truss gadget. This is an exact construction that generates two-body XX interactions using only one-body X and Z fields and two-body ZZ interactions which are readily accessible on, for instance, superconducting quantum annealers. We experimentally validate the construction by reproducing the dynamics of a target XX Hamiltonian on a trapped-ion quantum processor. We then apply the gadget to an illustrative set of instances of the weighted maximum-independent-set problem on a superconducting quantum annealer. We empirically determine an approximate thousand-fold improvement in the probability of finding a state close to the ground state for these instances, over implementation without an XX interaction.
arXiv·2026-10-09·Masoud Hakimi Heris, Yuan Liu, Frank Mueller
No generated summary available for this entry.
overview
Original abstract
Scaling trapped-ion processors by adding ions remains challenging. A complementary route exploits the multilevel internal structure of each ion to increase the computational Hilbert space per ion. We introduce a hardware-native hybrid qudit-oscillator instruction set for a general d-level internal register coupled to bosonic modes and prove that three of its native operation families suffice for universality of one qudit coupled to several modes. Adding an entangling operation between ions extends universality to a connected register of several qudits. The architecture natively supports both phase-space and sideband instruction sets and is implemented in the open-source framework HybridLane. As a representative application, we reproduce the dissipative vibronic dynamics of a three-chromophore complex previously simulated on a hybrid qubit-oscillator superconducting platform. Moving from a one-qubit-per-state register to a single qudit stores the entire electronic manifold in one ion, so every electronic coupling becomes a local intra-ion transition and the lab-frame Hamiltonian compiles directly into the ISA. Under the stated sequential timing model from a 40Ca+ qudit processor, one Trotter step is projected to run about ten times faster on the qudit, with an average RMSE of approximately 1.1 percent against the published reference.
arXiv·2026-10-09·Meriem Terki et al.
No generated summary available for this entry.
overview
Original abstract
Large language models (LLMs) have shown strong results in classical code generation and are increasingly used to write the unit tests that safeguard that code. Whether they can do the same for quantum software is less clear, because quantum programs are probabilistic, depend on numerical tolerances, and are judged by domain-specific checkers, so a well-formed test can still disagree with the benchmark's verdict. Existing quantum benchmarks measure whether a model produces a correct solution, but not whether its tests can distinguish correct implementations from faulty ones. We introduce QTestBench, a framework that evaluates LLM-generated quantum test suites against independent benchmark checkers, never treating the tests themselves as ground truth. For each task, QTestBench prompts models to produce syntactic, semantic, and behavioral tests, injects candidate solutions at runtime, and compares each test verdict with the checker's label under three validation cohorts, each answering a distinct diagnostic question. We benchmark five LLMs on eight PennyLane QHack challenges and ten Qiskit HumanEval tasks. Generated suites almost always execute, but discrimination lags behind: the best generator reaches a test quality of 0.71 on QHack and 0.34 on Qiskit HumanEval, so executability alone overstates test quality. Oracle-verified synthetic mutants stabilize bug-detection estimates when natural faulty solutions are scarce, as on three of ten Qiskit tasks that yield none. QTestBench offers a reproducible, cross-framework benchmark for the trustworthiness of LLM-generated quantum tests.
arXiv·2026-10-09·Jingyan Xu et al.
No generated summary available for this entry.
overview
Original abstract
Variational quantum circuits (VQCs) are highly sensitive to circuit architecture, yet most quantum machine learning pipelines select a single best design and discard the remaining candidates. This paper addresses whether the structural diversity across quantum circuit search spaces can be used to produce stronger predictions through model fusion. We apply Combinatorial Fusion Analysis (CFA), a model fusion framework that selects and combines multiple scoring systems using rank-score function (RSF) and cognitive diversity (CD), to a pool of 29 architecturally diverse classical models and quantum circuits. Using a diversity-aware model selection method, we identify subsets of maximally diverse models and combine them with both score and rank combination. Experiments on four binary classification benchmarks covering different domains demonstrate that CFA-based hybrid classical-quantum fusion consistently outperform the best individual model on every dataset considered with improvements up to 6.03% in accuracy. When comparing with relevant literatures, the CFA framework further achieves superior performance across all four datasets.
arXiv·2026-10-09·Kabir Khanna, Sara Murciano, Romain Vasseur
No generated summary available for this entry.
overview
Original abstract
Performing measurements on gapless quantum ground states can give rise to new universal phenomena, whose origins remain poorly understood even for the paradigmatic Ising critical point. Replica methods offer a natural framework to study such post-measurement ensembles, with the replica limit $Q\to 1$ describing physical Born-averaged observables. Here we show that, for the monitored critical Ising chain, the replicated post-measurement ensemble of states itself undergoes a phase transition precisely at the physically relevant replica limit $Q \to 1$, preventing standard replica treatments. We use boundary conformal field theory (BCFT) methods to explain the underlying mechanism of this transition. Our methods yield a perturbative analytic calculation of the universal $O(1)$ constant in the Shannon entropy of the measurement record, previously known only numerically. We also apply our tools to study measurement-averaged spin correlators, providing a unified description of the universal properties of measurement outcomes and post-measurement states in the critical Ising chain.
arXiv·2026-10-09·Philipp Westhoff, Sara Murciano, Mattia Moroder
No generated summary available for this entry.
overview
Original abstract
Dissipative state preparation engineers quantum many-body states as steady states of an open-system dynamics. The spatial range of the required dissipation sets both the feasibility of analog implementations and the connectivity and control complexity of digital ones. Yet how this locality quantitatively constrains preparation times remains largely unknown. Here, we establish an exact locality-preparation time relation for quadratic fermionic systems and develop a construction that optimizes the locality of the dissipative dynamics while preserving the target state. Applied to the Kitaev chain, our framework reveals sharply different locality-preparation time tradeoffs in critical and gapped regimes. At criticality, suppressing the algebraic tails of the jump operators necessarily forces the preparation time to grow algebraically with system size. By contrast, both trivial and topological gapped phases admit exponentially localized dissipation with a finite preparation time in the thermodynamic limit. Our results identify when fast dissipative preparation is compatible with local control and when criticality imposes an unavoidable dynamical cost.
arXiv·2026-10-09·Orlane Zang et al.
No generated summary available for this entry.
overview
Original abstract
Parameterized Quantum Circuits have emerged as a central framework for variational quantum algorithms in the NISQ regime, with major applications in quantum simulation, combinatorial optimization, and, more recently, quantum machine learning (QML). By developing a new approach for computing dynamical Lie algebras associated with quantum circuits combining parametrized gates and non-parametrized entangling gates, we aim to extend the applicability of recent algebraic results to architectures that are actually used in quantum machine learning.
arXiv·2026-10-09·Amit S. Patel et al.
No generated summary available for this entry.
overview
Original abstract
Resource constraints and imperfect quantum operations remain major challenges for quantum machine learning (QML) on noisy intermediate-scale quantum (NISQ) devices, particularly for fault-diagnosis tasks involving imbalanced and heterogeneous data. This work proposes QTN-RQNN, a Quantum Tensor Network-Based Recurrent Quantum Neural Network that integrates tensor-network-inspired nearest-neighbor interactions with recurrent quantum processing. The model sequentially encodes input features while propagating quantum memory across recurrent steps and incorporates QSMOTE for class balancing. QTN-RQNN is evaluated on four heterogeneous fault-diagnosis datasets SPID, CWRUBD, EFDD, and SFDD and compared with QNN, QTN-QNN, and RQNN baselines through classification, ablation, multi-seed, convergence, and quantum-resource analyses. Results show dataset-dependent predictive behavior, indicating that increased quantum architectural complexity does not universally improve classification. On SPID, QTN-RQNN improves the RQNN F1-score from 0.3077 to 0.4516 and ROC-AUC from 0.4485 to 0.6970, while the remaining datasets exhibit different performance-resource trade-offs and sensitivity to recurrent timesteps and circuit depth. Across all datasets, QTN-RQNN reduces the two-qubit-gate count from 32 to 24 per sample relative to RQNN, corresponding to a 25% reduction without increasing the four-qubit requirement; the same relative reduction is obtained for QTN-QNN over QNN. These findings establish QTN-RQNN as a resource-conscious recurrent quantum architecture and highlight the need to jointly consider predictive performance and circuit-resource requirements for near-term quantum fault diagnosis.
arXiv·2026-10-09·Nicholas Lester Jobbitt et al.
No generated summary available for this entry.
overview
Original abstract
Rare-earth-ion based molecular crystals are emerging as a promising platform for quantum information applications, combining long optical coherence times with the chemical tunability of coordination chemistry. Here we present a comprehensive optical characterisation of twelve Eu$^{3+}$-based molecular complexes, with a focus on the coherent $^{5}\text{D}_{0} \longrightarrow \ ^{7}\text{F}_{0}$ transition at $\sim$580 nm. Judd-Ofelt analyses are performed across all complexes, providing insights into ligand-field environments, local point-group symmetries, and the resulting branching ratios of the coherent transition. We find that lower point-group symmetry (C$_1$, C$_2$) yields higher branching ratios of the $^{5}\text{D}_{0} \longrightarrow \ ^{7}\text{F}_{0}$ transition, exceeding 1\% in several complexes. Optical inhomogeneous linewidths measured at 4.2 K reveal narrow linewidths for some complexes of below ten GHz, indicative of a highly ordered crystalline environment. Optical coherence measurements of one of the complexes, 5-Eu, yields an optical coherence time of $T_{\text{2}}^{\text{opt}} = 2.3~μ\mathrm{s}$ at 4.2 K, comparable to the best-performing molecular systems reported to date. Systematic characterisation and quantitative comparison will be key to find structure-property relations guiding rational design of optimised complexes for quantum information applications.
arXiv·2026-10-09·Luofei Wang et al.
No generated summary available for this entry.
overview
Original abstract
Can quantum data reliably answer questions chosen from earlier results? We prove that $M$ adaptive Pauli predictions on $n$ qubits require $Ω(\sqrt{\min\{n,M\}})$ copies at fixed accuracy. Published upper bounds make this tight for $M\le n$. Thus $n$ adaptive predictions cost $Θ(\sqrt n)$ copies, whereas a fixed list costs only $O(\log n)$. The lower bound uses diagonal states and commuting observables, identifying a statistical cost of adaptation. We also quantify how this cost increases with precision.
arXiv·2026-10-09·Paulo A. Brandão
No generated summary available for this entry.
overview
Original abstract
Exceptional points (EPs) are usually introduced as defective degeneracies of non-Hermitian Hamiltonians and, in fully open quantum dynamics, of Liouvillian generators. Here we formulate an operational theory of exceptional points that does not invoke a Hamiltonian or a master equation. The primitive dynamical object is a completely positive trace-preserving (CPTP) quantum channel $Φ$, applied an integer number $n$ of times, while physical data are probabilities $p_n^{\mathbf A}(x|ρ)$ associated with states $ρ$ and observables $\mathbf A$ having measurements results $x$. We define exceptional channels through nontrivial Jordan chains of $Φ$ and show that a Jordan block of order $m$ generates discrete polynomial-exponential terms with maximal degree $m-1$. This places the physics of exceptional points in contact with what can be directly measured in experiments.
arXiv·2026-10-09·Emanuele G. Dalla Torre, Bat-El Friedman, Daniel Porat
No generated summary available for this entry.
overview
Original abstract
Qubits are powerful computational resources because each additional qubit doubles the size of the accessible state space. This expressive power comes at a cost: adding qubits also increases circuit size, constraint overhead, and exposure to hardware noise. These limitations are especially critical for near-term quantum computers, making the number of qubits required to formulate a problem a central practical concern. In this work, we present a method for efficiently mapping logistics and routing problems onto qubits through structure-aware encoding reduction. We demonstrate the method on a benchmark problem of latency-resilient routing under dual-link failures. For this benchmark, the reduced formulation substantially lowers both the qubit count and the compiled circuit complexity while preserving the original optimization task. By running the reduced model on the same trapped-ion quantum computer as the benchmark, we obtain a 100X improvement in the success probability. This finding shows how careful problem formulation can make current quantum hardware substantially more effective for practical optimization.
arXiv·2026-10-09·Owidiusz Makuta, Flavio Baccari, Remigiusz Augusiak
No generated summary available for this entry.
overview
Original abstract
Experimental detection of multipartite Bell nonlocality faces many challenges. The increase in the size of the system demands a higher fidelity of state preparation, a higher detection efficiency, and a larger number of correlators that need to be estimated. These issues are even more pronounced if one wishes to detect a more restrictive variant of Bell nonlocality called genuine multipartite nonlocality (GMNL). In this work, we introduce two classes of multipartite Bell inequalities that are capable of detecting GMNL correlations and address different experimental hurdles in GMNL detection. The first class consists of the number of correlators that scales linearly with the number of parties. The second class increases the number of correlators and, in return, provides higher noise robustness of GMNL detection. Both classes of inequalities are constructed to detect GMNL in graph states, and in fact both can be used for self-testing of graph states and the performed measurements.
arXiv·2026-10-09·Alexander Streltsov
No generated summary available for this entry.
overview
Original abstract
Quantum entanglement is a fundamental resource in quantum information science, commonly consumed to perform tasks like quantum teleportation and quantum key distribution. Entanglement concentration converts partially entangled pure states into nearly perfect Bell pairs. While its efficiency is well understood in the asymptotic limit, practical protocols must operate with finite systems. In this finite regime, and at the low error levels relevant in practice, performance is penalized by corrections that reduce the achievable yield. We investigate whether this fundamental finite-size penalty can be mitigated by an entanglement catalyst: an auxiliary state that aids the transformation but is returned exactly and uncorrupted. Although such a catalyst cannot increase the leading-order asymptotic yield, we show that it fundamentally alters the finite-size scaling. For every bipartite pure state with nonuniform Schmidt coefficients, we exactly determine the optimal second-order correction to the yield and show that catalysis completely overcomes this finite-size penalty.
arXiv·2026-10-09·Julius Rye Bønnelykke et al.
No generated summary available for this entry.
overview
Original abstract
Practical fault-tolerant quantum computing requires qubit-efficient quantum error correction (QEC). Clifford deformations (CDs) modify the stabilizers of a QEC code to lower its logical error rate at no additional resource cost. However, the number of possible CDs grows exponentially with the number of qubits, making exhaustive search infeasible beyond small codes. In this work, we further show that under circuit level noise the optimal CD depends strongly on both the noise model and decoder. To make systematic CD optimization possible, we introduce Evolution-Based Best-arm Identification (EBBI), a shot-efficient search algorithm that treats the circuit, noise model and decoder as a black box. We benchmark EBBI's performance on the rotated surface code, under two strongly $Z$-biased circuit-level noise models with the PyMatching decoder. At distance 3, EBBI finds the optimal CD using up to $\sim 1100\times$ fewer shots than random search. At distance 5, when run at the target error rate, the median EBBI run converges to the CDs we believe to be optimal, while random search never converges. Under a $Z$-biased SI1000-like noise model, EBBI discovers a new CD, the B-XZZX code, which we generalized to larger distances. It differs from XZZX on only a fraction $\mathcal{O}(d^{-1})$ of the qubits at code distance $d$, yet its relative advantage grows from $\approx 5\%$ at $d = 3$ to $\approx 12\%$ at $d = 11$. We thus show that the B-XZZX pattern found by EBBI can be systematically scaled to larger code distances. Our work represents a first step towards scalable CD optimization for general QEC codes.
arXiv·2026-10-09·M. I. Samar, V. M. Tkachuk
No generated summary available for this entry.
overview
Original abstract
We study correlation-based entanglement evaluation in rank-2 mixed states of two- and multi-qubit systems. The relevant two-dimensional subspace is treated as a logical qubit embedded in the physical Hilbert space, and factorizable realizations of its logical Pauli operators are classified. For two qubits, this yields nontrivial canonical encodings related by local Clifford transformations. The relation between logical and physical Bloch vectors admits a geometric interpretation as a transversely deformed Bloch sphere, leading to closed-form expressions for two-qubit concurrence and generalized concurrence across $N$-qubit bipartitions. The entanglement scaling factor is obtained directly from complementary-subsystem correlations, without prior calibration of state-preparation parameters. Noisy simulations using the IBM Quantum FakeKingston backend model, with readout-error mitigation and zero-noise extrapolation, confirm the analytical results up to $N=10$ qubits. The protocol therefore enables entanglement estimation from only a small number of measurement settings for this class of rank-2 logical states.
arXiv·2026-10-09·Jasper Nongmaithem et al.
No generated summary available for this entry.
overview
Original abstract
We investigate holographic Krylov complexity in bottom-up holographic QCD models describing the confined phase, using the recently proposed correspondence between the growth rate of Krylov complexity and the proper radial momentum of probes, such as particles and strings, falling in the bulk spacetime. As representative confining backgrounds, we consider two horizonless geometries, namely the dilaton-deformed AdS-soliton and the deformed thermal-AdS spacetime, both arising as solutions of an Einstein-dilaton gravity system. We find that the Krylov complexity associated with a massive particle exhibits qualitatively distinct behavior in these two backgrounds when analyzed in the Einstein frame. In the deformed AdS-soliton geometry, the complexity undergoes periodic oscillations, with both the oscillation period and amplitude depending on the parameters of the model. In contrast, in the deformed thermal-AdS geometry, the complexity grows exponentially at late times and does not display oscillatory behavior. We then investigate string dynamics in the string frame and find that the Krylov complexity exhibits oscillatory behavior in both confining backgrounds. This behavior is traced to the emergence of an additional turning point in the deep infrared of the string-frame geometry. Motivated by this observation, we further analyze massive-particle dynamics in the string frame, where we find qualitatively similar behavior in the two confining backgrounds. Our results demonstrate that the Krylov complexity of confined holographic systems depends sensitively on the choice of probe and frame, while also revealing a closer correspondence between the two confining geometries in the string-frame description.
arXiv·2026-10-09·Omer Farooq, Michał Ławniczak, Leszek Sirko
No generated summary available for this entry.
overview
Original abstract
The recently developed concept of germ graphs (P. Kurasov {\it et al.}, Phys. Rev. Research {\bf 7}, L022071 (2025)) is employed to construct families of isocattering, non-isospectral graphs that exhibit dissipation. More specifically, a new pair of isoscattering non-isospectral graphs is constructed by connecting the existing isoscattering non-isospectral graphs, so called attachments, to the different contact vertices of the germ graph. The existing isoscattering non-isospectral graphs contained a two-loop graph labelled $Γ_{A2}$ and a three-loop graph labelled $Γ_{A3}$. These graphs have an equal total metric length, but different topologies. The resulting graphs $Γ_3$ and $Γ_4$ are verified as non-isospectral using their Euler characteristics, while their isoscattering properties are investigated by calculating the one-port scattering matrices numerically.
arXiv·2026-10-09·Borhan Ahmadi
No generated summary available for this entry.
overview
Original abstract
A useful thermodynamic model predicts what a device will do without tracking its full microscopic state. For a finite quantum working medium, the difficult question is which quantities should actually be measured. We develop a task-based method that keeps exact energy accounting separate from calibrated macroscopic prediction. Operator geometry identifies what a measured record determines and bounds what remains uncertain. We then compare direct measurements of dynamical observables with earlier measurements of the same coarse record, selecting the representation together with its measurement cost. A Bose--Hubbard example yields a compact response table tested over a continuous operating region and on unseen microscopic trajectories. A driven Ising chain shows why history is not always the cheaper choice. The result is a way to turn detailed quantum dynamics into a small, reusable, and explicitly qualified thermodynamic description.
arXiv·2026-10-09·Philipp Schmocker
No generated summary available for this entry.
overview
Original abstract
We derive approximation rates for Sobolev functions defined on the complex unit sphere and complex projective space, representing quantum states, and on the special and projective unitary groups, representing quantum unitary operations. By using harmonic analysis on compact groups and compact homogeneous spaces, we characterize the corresponding Peter--Weyl decompositions and Sobolev spaces via irreducible representations and the Laplace--Beltrami operator. Combining spectral truncation with finite-depth quantum-circuit approximation, invoking the Solovay--Kitaev theorem, we establish quantitative rates that separate the spectral truncation error from the circuit approximation error.
arXiv·2026-10-09·Luis Bueno Blanco, Juan Manuel Pérez-Pardo
No generated summary available for this entry.
overview
Original abstract
Josephson junctions are the central nonlinear element of superconducting qubits, yet their standard description is reached through a chain of approximations. We propose a purely quantum-mechanical model of the junction, formulated directly in Hilbert space: a charged particle moves on a one-dimensional loop, and the junction is a point at which the wave function obeys self-adjoint boundary conditions, labelled by a coupling strength $λ$, which controls the transparency of the junction, and a phase jump $δ$, which plays the role of the superconducting phase difference. For a loop with a single junction we solve the spectral problem and show that the ground-state momentum expectation, identified with the supercurrent, factorises exactly as $\langle\hat{p}_0\rangle = I_c(δ,λ)\sinδ$. For opaque junctions $I_c$ becomes independent of $δ$ and the first Josephson relation $I=I_c\sinδ$ is recovered; for strongly attractive coupling, where the ground state is bound to the junction, the $\sinδ$ law is also recovered, but with an exponentially suppressed amplitude. For more transparent junctions, however, the model \emph{predicts} deviations from the pure $\sinδ$ law: $I_c$ acquires a dependence on $δ$ already at order $λ^{-2}$, compatible with the higher Josephson harmonics recently found necessary to describe superconducting qubit spectra, and a fully transparent contact yields a current linear in $δ$. When the phase varies in time, a gauge transformation shows that the voltage drop across the junction is proportional to $\dotδ$, so that the second Josephson relation emerges without being imposed. The boundary-condition approach thus reproduces both Josephson relations from first principles and predicts corrections to them, offering a route towards higher-fidelity models of superconducting qubits.
arXiv·2026-10-09·Mohammad Sharifian et al.
No generated summary available for this entry.
overview
Original abstract
Quantum reservoir computing and its special case, quantum extreme learning, are powerful tools for predicting classical discrete time-series with quantum devices. Forecasting continuous signals, however, requires careful discretization as oversampling artificially boosts short-term accuracy but fails over realistic intervals, while undersampling captures too few features and yields poor predictions. Here, we experimentally generate four continuous time-series signals from a chaotic electronic circuit for forecasting with quantum extreme learning. Since simplified circuit models do not fully capture real behaviour, it is unclear whether algorithms that predict simulated time-series also work for experimental signals. We address discretization via two approaches: (i) sampling local peaks/troughs; and (ii) uniform sampling at the autocorrelation timescale. The former captures resonant behaviour, while the latter fully captures chaotic features as well as allowing the reconstruction of chaotic attractors. Our algorithm achieves high forecasting accuracy for both simulated and experimental signals, demonstrating its power for continuous signal processing on near-term quantum simulators, and remains robust against moderate decoherence.
arXiv·2026-10-09·S. V. Bolshedvorskii et al.
No generated summary available for this entry.
overview
Original abstract
The nitrogen-vacancy (NV) color center in diamond has found applications in magnetometry across various geometrical scales. In particular, vector magnetometry using hand-held devices with low power consumption is of interest for mobile and geological applications. However, such a device requires efficient driving of the four different orientations of the NV center, thus placing demands on a broadband microwave resonator that provides a uniform and highly insensitive microwave magnetic field at the resonance frequencies of the NV centers. Here, we propose a unique planar resonator design that enables efficient driving of all four orientations of NV color centers over a 100 MHz range with only 0.5 W of microwave input power and 250 mW of laser power, allowing vector magnetic field measurements. Using the planar resonator to drive NV centers in diamond, a compact vector magnetometer was fabricated and experimentally studied. The sensitivity of the device is about \[{1.2\text{ nT}}/{\sqrt{\text{Hz}}}\;\]. While this is not a record sensitivity for diamond-based magnetometers, this device occupies its own niche as a compact hand-held magnetometer.
arXiv·2026-10-09·Shivang Srivastava et al.
No generated summary available for this entry.
overview
Original abstract
Deploying QKD-based secure communication at scale requires reducing duplicated optical hardware while preserving the rate of protected user data. Earlier studies established the physical feasibility of carrying CV-QKD and classical signals over shared infrastructure, motivating a quantitative comparison between optical hardware savings and the OTP-encrypted rate. We perform this comparison by defining the secure communication rate (SCR) as the rate jointly supported by secret-key generation and classical transport, and using it to optimize a shared discrete-modulation CV-QKD link. The model combines a binomial 64-QAM security bound with a trusted receiver, protocol traffic, spectral leakage - optical power leaking into the quantum receive band - and Raman scattering. At 25 km, the asymptotic model gives an optimized SCR of 12.079 Mbps, compared with 12.095 Mbps for a separated-link reference, while reducing the transmitter and fiber counts from two to one each in the modeled direction. Increasing channel separation suppresses spectral leakage, but the resulting SCR gain diminishes once receiver bandwidth limits the rate. Under the adopted receiver-noise law, increasing the bandwidth budget from 350 to 750 MHz raises the projected 25-km SCR to 24.535 Mbps despite higher trusted electronic noise. For the studied metropolitan link, sharing saves optical resources with little rate loss, while receiver-bandwidth improvements provide greater benefit than further spectral separation. Together, these results suggest an integration path: share the transmitter and fiber, limit unwanted classical power in the quantum receive band, and increase usable receiver bandwidth where the noise budget permits.
arXiv·2026-10-09·Zheng Li
No generated summary available for this entry.
overview
Original abstract
We characterize compactness of the Hilbert-Schmidt semigroups induced by finite-mode Gaussian quantum Markov semigroups with a faithful normal invariant state. A unitary second-quantization representation for every $ s $-embedding shows that compactness at one positive time, compact resolvent, drift stability, and uniqueness of the normal invariant state are equivalent. These conditions imply immediate trace-class membership for all embeddings. We derive exact trace-norm and Hilbert--Schmidt norm formulas, an embedding-independent trace identity, and the generator spectrum with algebraic multiplicities. Examples show that compactness does not require the existence of a spectral gap and that a spectral gap need not imply compactness when the invariant state is not unique.
arXiv·2026-10-09·Omer Farooq, Michal Lawniczak, Leszek Sirko
No generated summary available for this entry.
overview
Original abstract
The present paper sets out a general method for extending the isoscattering, non-isospectral quantum graphs. The methodology is illustrated by considering two graphs, denoted by $Γ_1$ and $Γ_2$, which have the same total metric length but different topologies. It is demonstrated that, despite the fact that their scattering matrices are identical, their eigenvalues, denoted by $k_n$, and Euler characteristics differ from one another. The next step in the process is to extend both graphs by affixing the same star graph to each of them. Utilising the Titchmarsh-Weyl M-function formalism, it is proven that the newly constructed, extended graphs are also isoscattering and non-isospectral.
arXiv·2026-10-09·Dylan Laplace Mermoud et al.
No generated summary available for this entry.
overview
Original abstract
Solving combinatorial optimization problems on near-term quantum computers mainly relies on their quadratic unconstrained binary formulation. Lately, binary polynomial formulations start to take the center stage, having a better scaling with respect to the number of used qubits. However, while quadratic forms are straightforward to implement on quantum circuits, polynomial forms of degree $d$ incur in circuit depth overheads, due to the lack of $d$-qubit gates, for $d\geq 3$, on current hardware. In this paper, we study the problem of designing the shallowest quantum circuit for a given polynomial form. We formulate it as a classical binary linear problem and we prove the \textsf{NP}-completeness of a variant of it. On the algorithmic side, we offer a scalable and performant heuristic method to tackle it, Tempura, as well as faster binary linear problem formulations, which offer computational feasibility while sacrificing optimality. Our performance evaluation shows that the algorithms yield far shorter circuits than the state-of-the-art approaches, and Tempura is mostly comparable with them in terms of runtime.
arXiv·2026-10-09·Geonwoo Hwang, Jun-Won Rhim
No generated summary available for this entry.
overview
Original abstract
The Zak phase provides a fundamental geometric characterization of one-dimensional band structures and, when quantized by symmetry, serves as a bulk indicator of polarization and boundary phenomena. Conventionally, its exact quantization is tied to a global symmetry of the Bloch Hamiltonian, such as inversion or reflection symmetry. Here, we demonstrate a distinct mechanism by which the Zak phase remains exactly quantized even when the corresponding protecting symmetry is explicitly broken at the level of the full Hamiltonian. The mechanism is based on local support symmetry and destructive interference: symmetry-breaking degrees of freedom are coupled to a topological parent system in such a way that the relevant Bloch states cannot leak into them. The preserved states therefore retain their parent wave functions and inherit their quantized Zak phase exactly, despite the absence of the protecting global symmetry. We establish this mechanism for general one-dimensional insulators and demonstrate it in an inversion-broken minimal model and a reflection-broken armchair nanoribbon, where a quantized $π$ Zak phase and associated boundary-localized states persist. We further show that perturbations violating the exact destructive-interference condition continuously dequantize the Zak phase, while a finite regime with a near-$π$ Zak phase and boundary response can survive. Our results establish wave-function support, rather than global symmetry alone, as a mechanism for protecting quantized quantum geometry in one-dimensional systems.
arXiv·2026-10-09·L. Maisel Licerán, H. T. C. Stoof
No generated summary available for this entry.
overview
Original abstract
Excitons are bound electron-hole pairs in semiconductors whose interactions influence optical properties and determine their collective behavior and emergent correlated phases. Despite the theoretical and experimental significance of these phenomena, a microscopic theory of exciton-exciton interactions that takes into account the full composite nature of these quasiparticles is lacking. Here, we present a general theory of exciton-exciton interactions that builds upon our previous publication [Physical Review B 113, 155440 (2026)], which applied only to conventional semiconductors with weak band hybridization. By contrast, the theory presented here is valid in virtually any crystalline semiconducting system and can be applied to the study of biexciton formation and correlated excitonic phases in systems where band topology, quantum geometry, and moiré effects play a significant role. In addition to the analytical theory, we also present results in simple systems with flat bands with a nontrivial quantum metric and show that the biexcitonic spectrum differs strongly from that in the case without quantum geometry. Our theory paves the way for accurate quantitative calculations of biexciton spectra and excitonic many-body phases in modern condensed-matter systems.
arXiv·2026-10-09·Han Ma
No generated summary available for this entry.
overview
Original abstract
We study how a neural network reorganizes its learned function as training proceeds and as previously unseen parity data accumulate. The trained model is itself a Boolean function on binary strings of finite length. We then evaluate it on all data, inside and outside the training set, and read off its complete sign table. Its $\pm1$ entries are the amplitudes of a normalized state, dubbed the function-state, whose inverse subsystem purity $K_f=1/\textrm{Tr}(ρ_A^2)$ is an effective Schmidt rank. We find that small data additions broaden the Schmidt spectrum, whereas larger additions reconcentrate it in the target mode. The former is called differentiation because the model distinguishes inputs more sharply. The latter is called target-selective recoherence, where the model settles on the single rule shared by the added data. As the dataset grows, the connectivity of the constraint graph defined by the training set increases monotonically, whereas the learned inverse purity changes nonmonotonically. On a fixed connected dataset, as learning proceeds, the Schmidt spectrum begins to reorganize, followed by gains in target alignment and later by improvement in predictive accuracy. This ordering distinguishes three aspects of learning: constraint identifiability, function-state organization, and predictive accuracy. At fixed data size, a function that has already been learned can re-differentiate, an event we call retreat, without changing graph connectivity. Recovery reconcentrates the Schmidt spectrum in a similar target-selective pattern, without exact recurrence of the Boolean state. Thus the percolation of data constraints fixes the identifiable support, while the reduced state produced by training continues to reorganize even after that support stops changing.
arXiv·2026-10-09·Giacomo Antonioli, Gianna M. Del Corso, Roel Van Beeumen
No generated summary available for this entry.
overview
Original abstract
We present an explicit quantum circuit that constructs a block encoding of a generator-representable semiseparable (one-pair) matrix directly from its two generators. For an $N\times N$ semiseparable matrix with $N=2^{n}$, the circuit uses $2n+2$ ancilla qubits and has $O({\rm polylog} N)$ depth, and it realizes a $(2\sqrt{N},\,2n+2,\,2 \sqrt{2}\ \varepsilon)$-block encoding, where $\varepsilon$ is controlled by the accuracy of the state-preparation routines that load the generators. The building blocks of the circuit are cyclic shifts, swaps, and Hadamard gates, each admitting an efficient implementation through the binary decomposition of the relevant indices.
arXiv·2026-10-09·Matteo Inajetovic, Anna Pappa, Petros Wallden
No generated summary available for this entry.
overview
Original abstract
Generative machine learning has shown remarkable results across a wide range of interdisciplinary tasks, motivating significant efforts toward Quantum Generative Models as a path to beyond-classical performance, given their capability of generating classically intractable distributions. However, comparatively little attention has been paid to securely delegating such computations to a powerful remote quantum server. In this work, we propose a blind and verifiable protocol for sampling that can be used for the inference phase of such quantum models. Such a protocol inherits blindness from Universal Blind Quantum Computing and achieves verifiability by exploiting known approaches based on trapification schemes. Alongside, to delegate the training phase, we discuss an extension of the previously proposed verifiable end-to-end Delegated Variational Quantum Algorithms (Inajetovic et al., Phys. Rev. Research, 2026). Beyond the usual Accept/Abort outcome characterizing verification protocols, the sampling protocol for inference also provides, even against a malicious server, an estimation of the amount of corrupted generated samples, i.e., a fine-grained feature describing the quality of the outcome connecting verification protocols and application-level benchmarking.
arXiv·2026-10-09·Alexis Wietzke et al.
No generated summary available for this entry.
overview
Original abstract
Matter-based two-level quantum systems are fundamental building blocks of quantum technologies, underpinning applications in quantum computing, simulation, communication, and sensing. Today, most of these two-level quantum systems, including Rydberg atoms, trapped ions, superconducting circuits, molecules, and quantum dots, involve transition frequencies in microwave or optical domains. However, extending their transition frequency to the THz spectral range could provide numerous benefits, leveraging the unique properties of THz radiation. Here, we show that an hBN-encapsulated graphene double quantum dot realizes a two-level system with a transition frequency in the THz spectral range. Using low-temperature transport spectroscopy in the dark combined with modeling based on nonequilibrium Green's function formalism, we demonstrate the formation of an artificial molecule, featuring bonding and antibonding states separated by an energy of up to 0.6 meV, corresponding to a resonance frequency of 0.145 THz. This approach provides direct access to important parameters of open double quantum dot systems, including tunneling rates, offering a practical alternative to conventional techniques such as photon-assisted tunneling, which are challenging to implement at THz frequencies. The realized 2D-material-based THz two-level system, compatible with direct on-chip integration, could serve as a key building block for future THz quantum technologies. Furthermore, by involving a single-electron transition, coupling these devices to a THz resonator could enable the exploration of ultra-strong light-matter interactions at the fundamental limit of a single transition coupled to a single cavity, beyond the reach of existing THz quantum systems based on collective transitions.
arXiv·2026-10-09·Igor Van Loo, Frédérique Oggier
No generated summary available for this entry.
overview
Original abstract
We investigate restrictions on the dimensions and coordinate fields of real Weyl-Heisenberg fiducial vectors. Our main result is that such vectors can exist only in dimensions $d\equiv 3\pmod{4}$. This result is motivated by evidence showing that real Weyl-Heisenberg fiducial vectors can exist only in dimensions $d = 4m^2 + 3, m \in \mathbb{Z}_{\geq 0}$. We further restrict the possible dimensions when the coordinate field is a totally real number field, an even or odd degree extension of $\mathbb{Q}$, a real quadratic field, or a maximal real subfield of a cyclotomic field. Lastly, we establish non-existence over odd-degree number fields under either positivity of all non-trivial cyclic-shift overlaps or a conjectural containment of a distinguished quadratic field in the SIC field.
arXiv·2026-10-09·Ryusei Okaniwa et al.
No generated summary available for this entry.
overview
Original abstract
Nitrogen-vacancy (NV) centers in diamond are promising quantum sensors for AC magnetic fields. However, conventional dynamical-decoupling-based magnetometry becomes technically demanding at high frequencies because of the requirement for increasingly short and high-power microwave pulses. This paper describes an AC magnetometry technique based on continuous-wave optically detected magnetic resonance (CW-ODMR) measurements, which enables the detection of signals in the hundred-MHz range. By applying a strong static magnetic field transverse to the NV axis, the energy separation between the relevant electron-spin states was tuned and resonantly coupled with the target radiofrequency (RF) magnetic field, thereby forming RF-dressed states. Unlike pulsed dynamical-decoupling schemes, this approach does not require high-power microwave pulse sequences. The key feature of our method is that the detectable frequency can be tuned by controlling the bias magnetic field strength. Using this methodology, we have experimentally achieved the frequency-tunable detection of AC magnetic fields from 14.4-632 MHz. The sensitivity was 0.558 uT/Hz^(0.5) at 14.4 MHz and 24.4 uT/Hz^(0.5) at 632 MHz. We characterized the field-dependent ODMR contrast and linewidth, and found that their degradation at large transverse fields is a important factor limiting the high-frequency sensitivity. These results establish a simple CW-ODMR approach for widely tunable RF magnetic-field sensing without high-power pulsed spin control.
arXiv·2026-10-09·Eran Kopel
No generated summary available for this entry.
overview
Original abstract
The entanglement-breaking index of a channel is the number of self-compositions after which all entanglement with a reference system is destroyed. In a thermal qubit collision loop whose round is affine in the bath polarisation p, some circuits have thermal valleys: on an interior window of p the index falls below its infinite-temperature value. Rounds at different p compose exactly, so every schedule of polarisations defines a composite channel whose entanglement-breaking status can be certified in ball arithmetic. A gated search of 33 million random circuits finds no valley with contrast above about 3e-3, with an interior maximum near index 90, and yields six certified targets. At the reference target, held inside its window for 88 rounds, a centred excursion to p = 0.05 restores entanglement at exactly eight rounds: every shorter centred pulse certifiably fails, and so do the same eight rounds at the start. A 53-round pulse certifiably beats the static protocol, a depth-three valley is walked down its staircase by pulse duration, and a 1.2 per cent coherent tilt of the ancilla opens the switch at fixed population. Closing the switch costs 21 to 35 rounds. The asymmetry is not one of local rates, which agree to within about two per cent at matched circuit positions (certified). It is one of distance and response: closing must remove an entanglement margin 2.2 times larger, and while hot rounds added to a window hold act almost independently, window rounds added to a hot hold act collectively. Near the crossing, the lever of the log-margin is that of a linear approach to the entanglement-breaking boundary, with no free parameter. At the reference target, depolarising noise of about $4ν/n$ per round kills a signature of size $ν$ read after $n$ rounds: 1.3e-4 for the static signal, 6.5e-6 for the eight-round switch.
arXiv·2026-10-09·He Wang
No generated summary available for this entry.
overview
Original abstract
The uncontrolled endpoint channel can conceal how well a quantum process can protect a logical task under time-resolved control. We formulate a fixed-task resource theory of continuous process tensors with physical access interfaces, entrance-erasing free objects, and budgeted free conversions. Complete-record total-variation error measures performance; the calibrated capability is monotone under conversions that preserve a common free baseline. For unknown-state transmission the baseline is exactly $1-d^{-2}$. Two qubit processes with the same endpoint channel have optimal errors $0$ and $p=\sin^2(2gh)$ at the same finite pulse budget in an ideal-transparent system-only window architecture, forcing any endpoint-only predictor to err by at least $p/2$ on one of them. An exactly solvable family shows how the allocation of a fixed interaction phase around a control window sets the attainable error, and a nontrivial perfect echo requires and attains total control action $π$ in that architecture. The separation extends directly to every qubit unitary target at a budget that includes its boundary gate, while unitary tasks in any dimension have baseline $1-d^{-2}$ whenever a budget-feasible free realization gives the depolarizing output. Complete-record implementation bounds quantify coherent and dissipative control imperfections. Continuous-process randomized compilation supplies physical instrument pullbacks; compatible completion conditions extend their action, and certified dynamical bounds yield achievable task-error and capability guarantees. The resulting theory identifies temporal structure and control investment that endpoint characterization alone cannot resolve.
arXiv·2026-10-09·Lu Fan et al.
No generated summary available for this entry.
overview
Original abstract
Continuous-variable quantum key distribution utilizes advanced digital signal processing techniques to mitigate channel impairments, driving the progress of high-performance quantum secure communications. Specifically, digital heterodyne receivers are commonly implemented using down-conversion algorithms to detect both components simultaneously where the signal is modulated onto an intermediate frequency to avoid low-frequency noise and bypass stringent optical phase-locking requirements. However, a rigorous analysis of the quantum security implications of the digital down-conversion algorithm remains absent. In this paper, we investigate the algorithm process from the perspective of quantum operator evolution, revealing that the frequency folding effect inherent in down-conversion inevitably mixes the image-frequency information into the baseband signal. To address this issue, we propose a novel operator reconstruction detection scheme based on dual-path digital heterodyne receiver. By performing a non-equal weighted combination of the output operators along two optical paths in the digital domain, this scheme perfectly cancels out the image-frequency operator physically. The robust receiver architecture preserves the baseband noise-suppression advantages, inherently achieves perfect mode balancing for asymmetric optical detection losses, and fundamentally closes the image-frequency crosstalk. Practical experiments have validated the feasibility of the proposed architecture and its effective suppression of image-frequency noise, achieving a performance of 11.4 Mbps @ 42 km. This work lays a solid theoretical and algorithmic foundation for future high-performance, highly secure digital continuous-variable quantum key distribution systems.
arXiv·2026-10-09·Zhifeng Xue et al.
No generated summary available for this entry.
overview
Original abstract
Chiral anomaly in topological materials manifests as negative longitudinal magnetoresistance, yet the tunability and evolution of this effect remain elusive. Here we show that doped tellurium serves as a versatile platform to realize a giant negative longitudinal magnetoresistance that is highly tunable via the Fermi level and magnetic field. By moving the Fermi level towards the Weyl point, we observe a pronounced enhancement of negative magnetoresistance, which arises from chiral anomaly and robustly persists up to ambient temperature. Beyond the quantum limit, the system exhibits positive linear magnetoconductance, serving as a compelling transport signature of the chiral anomaly in the lowest Landau level. Notably, in the extreme quantum limit at cryogenic temperatures, the magnetoresistance undergoes a dramatic reversal from negative to positive. This reversal points to a potential field-induced phase transition into a collective electronic state driven by enhanced electron-electron interactions. Our findings provide valuable insights into the unconventional chiral transport and emergent correlated quantum states under extreme magnetic fields.
arXiv·2026-10-09·Yujiro Eto
No generated summary available for this entry.
overview
Original abstract
The resolution of spectroscopic measurements is fundamentally limited by the convolution between a system's intrinsic response and the instrument response function, creating an ill-posed inverse problem. While entangled photons can theoretically bypass these limits, low photon flux has hindered their experimental realization. Here, we propose quantum cross-correlation spectroscopy (QCCS), utilizing macroscopic twin beams (signal and idler beams) to physically circumvent this convolution limit in coherent anti-Stokes Raman scattering. Employing the signal beam as a broadband probe, QCCS achieves all-optical deconvolution through a correlation-enhanced sum-frequency generation channel between the convoluted anti-Stokes and idler beams. By subtracting the uncorrelated background using a 500-femtosecond temporal window, we successfully retrieve narrow Raman bands (8 cm^{-1} and 15 cm^{-1}) completely obscured by a 75 cm^{-1} probe bandwidth without numerical deconvolution or prior knowledge. Our results establish macroscopic quantum correlations as a robust resource for high-fidelity spectroscopy, paving the way for ultrashort-pulse-free operando studies under natural, incoherent excitation conditions.
arXiv·2026-10-09·Arijit Das, Masaki Owari
No generated summary available for this entry.
overview
Original abstract
The indirect-control paradigm offers a scalable approach to quantum computation by restricting external operations to a small subset of qubits, whereas the entire system evolves under its intrinsic many-body Hamiltonian. This framework reduces hardware complexity and limits the noise introduced through control channels. Recently, Anan et al. proposed an implementation of the variational quantum eigensolver (VQE) within this indirect-control architecture. However, the impact and integration of quantum error mitigation techniques in such a setting remain largely unexplored. In particular, zero-noise extrapolation (ZNE), a widely used error mitigation strategy, has not yet been systematically adapted to indirect-control VQE. A key requirement of ZNE is the controlled amplification of noise, which is commonly achieved through circuit-level techniques such as unitary folding. In the indirect-control framework, however, quantum operations are largely governed by continuous time-evolution under the system Hamiltonian, making the construction of physically realizable inverse operations non-trivial. In this study, we investigate the feasibility of implementing ZNE within the indirect-controlVQEframework.We address the challenges associated with unitary folding in the presence of time-evolution operators and, with a minimal relaxation of the indirect-control constraint, we propose a ZNE-based error-mitigation strategy that exploits the symmetry of the one-dimensional XY spin chain.
arXiv·2026-10-09·Chenyan Jia et al.
No generated summary available for this entry.
overview
Original abstract
The predictive performance of neural networks for receptor functional potency modeling depends on both molecular representations and prediction-head design. Using GLP-1R cAMP-related pEC50 prediction as the primary task, we jointly train a classical molecular encoder with a linear base head and a shallow quantum-circuit residual head that share the learned molecular representation. We evaluate the models using random and structure-group splits, include tuned Chemprop as a domain reference, and extend the evaluation to ADRB2 and MC4R. Under the GLP-1R structure-group split, the quantum-residual models reduce mean absolute error relative to the corresponding base models from 0.677 to 0.639 with a multilayer perceptron (MLP) encoder and from 0.680 to 0.641 with a graph neural network (GNN) encoder. In structural control experiments, a parameter-count-matched real-orthogonal control achieves similar predictive performance, suggesting that some quantum-residual gains may be associated with structured quadratic feature interactions. By combining receptor functional potency prediction with structural analysis of the quantum residual, this study provides empirical evidence to inform compact residual-head design and highlights the potential of quantum-circuit parameterizations for this task.
arXiv·2026-10-09·Fan Zhong
No generated summary available for this entry.
overview
Original abstract
The real-time dynamics of quantum phase transitions in open systems coupled to finite-temperature environments sits at the heart of contemporary condensed-matter and quantum-information science. Here, invoking a Schwinger-Keldysh formalism, we uncover that, within the coherence-dominated regime of critical real-time evolution, a dissipative coupling deemed naively irrelevant determines, counterintuitively, the longest timescale that holds sway. Possessing a well-defined temporal scaling dimension, it engenders a novel dissipation-regression scaling that systematically reproduces the unusual Kibble-Zurek scaling and relaxation observed in recent numerical studies. By contrast, dissipation-dominated dynamics behaves qualitatively differently. There, furthermore, we show that the discretized and diagonalized formulations of the same open quantum Ising chain realize distinct universality classes.
arXiv·2026-10-09·Yanmiao Han, Rundong Zhao, Yu-Hao Wan
No generated summary available for this entry.
overview
Original abstract
The parity anomaly of a single massless Dirac fermion is manifested as a half-quantized Hall response once the required parity-breaking regularization is supplied. We study the corresponding response for two-dimensional chiral Lifshitz fermions. For a node with low-energy coupling (qx +iqy)^N, the Fermi-loop winding number W = N gives an anomalous Hall response σxy^anom = (W/2)e^2/h. We examine this mechanism in chiral multilayer Haldane models tuned to a valley-selective critical line, where a single gapless chiral Lifshitz fermion remains at the K valley. For the AB, ABC, and ABCA stacks, the projected pseudospin textures give W = 2, 3, 4, while Kubo calculations yield σxy = (1, 3/2, 2)e^2/h; integrated equilibrium boundary currents reproduce the same W/2 sequence. Six-terminal simulations with dephasing further show that the Hall conductivity is quantized at W/2 while the longitudinal conductivity remains finite. These results identify gapless chiral Lifshitz fermions as a higher-order, winding-controlled generalization of the parity-anomalous Hall response, distinct from a quantum anomalous Hall insulating state even when W/2 is an integer.
arXiv·2026-10-09·Ashmita Das, Anjana Krishnan, Soumitra Sengupta
No generated summary available for this entry.
overview
Original abstract
We examine the response of a two level Unruh-DeWitt (UD) detector interacting with the Kaluza-Klein (KK) mass modes of a bulk scalar field in extra dimensional models. Considering two of the promising extra dimensional models with distinct compactifications, such as large, flat extra dimensions in the Arkani Hamed, Dimopoulos \& Dvali (ADD) framework and warped extra dimensions in the Randall-Sundrum (RS) scenario, we compute the profile function of the detector. We extend this computation to the 6 dimensional doubly compactified spacetime geometry. The profile function of the detector has been examined as a function of the energy gap of the detector, the compactification radius of the extra dimension, and the dimensionality of spacetime, requiring the chosen parameter space appropriately such that the gauge hierarchy problem is duly addressed. We find that the pattern of the profile function is dictated by the spacing of the KK mass spectrum and the resolution of the detector. For ADD model, the spacing between successive KK modes decreases with the increasing compactification radius, yielding a smoothly increasing continuum pattern in the profile function. Whereas for the RS warped geometry model, a tiny deviation in the radius of the extra dimension produces a large change in the same, resulting a sharp increment. The resolvability of the KK mode structure is sensitive to the underlying geometry of the spacetime, providing a qualitative distinction between flat and warped extra dimensional scenarios within the UD detector framework.
arXiv·2026-10-09·Kiran Adhikari, Janis Nötzel
No generated summary available for this entry.
overview
Original abstract
Stimulated Brillouin scattering (SBS) is a powerful mechanism for distributed sensing in optical fibers, as the Brillouin response is highly sensitive to local material parameters. Assuming the input probe is a quantum state, we develop a quantum-information-theoretic framework for SBS-based fiber sensing and intrusion detection. Starting from a linearized opto-acoustic Hamiltonian, we derive an effective input-output relation for a short fiber segment. We then model each fiber segment as a single-mode bosonic Gaussian channel and the entire fiber as a cascade of quantum channels. We then compute the quantum Fisher information for general SBS-dependent parameters and identify optimal measurement settings to achieve the quantum limit, comparing them with receiver-constrained strategies such as heterodyne detection and photon counting. In addition, we propose an adaptive approach that achieves first-order asymptotic optimality and provides a novel second-order correction to address preliminary miscalibration. As an application, we apply the framework to the fiber-tapping detection problem.
arXiv·2026-10-09·Zi-Heng Zhu, Yu Chen
No generated summary available for this entry.
overview
Original abstract
We study a two-dimensional electron gas in the integer quantum Hall regime coupled to a single spatially modulated cavity mode in the static off-resonant limit. Retaining both paramagnetic and diamagnetic contributions on equal footing, we derive a gauge complete single-particle Hamiltonian in which virtual photon exchange generates a periodic kinetic renormalization and a diamagnetic scalar potential. Both terms transfer momentum by $2k_0$ and displace guiding centers by $ΔX=2k_0\ell_B^2$, forming a finite-$k_0$ momentum ladder. Diagonalizing the strip Hamiltonian, we find that the ladder reconstructs the Landau-level band structure and redistributes, rather than multiplies, the associated chiral edge states. Occupied-subspace Chern numbers remain $C_ν=ν$ for $ν=1,2,3$ throughout $0\leλ_{\mathrm{cav}}\le 0.5$, while the bulk gaps decrease without closing. Strip Kubo responses show cavity-induced displacements of the Hall-step energies; at finite width the plateau heights are noninteger and approach the integers as $L_x$ increases. The ladder is spectrally resolved at $k_0\ell_B=0.5$ and collapses at $k_0\ell_B=0.1$. These results isolate a spatially local, finite-$k_0$ momentum ladder as a clean-system mechanism by which a structured vacuum field reconstructs quantum Hall spectra and strip transport without changing the integer topology, complementary to cavity-mediated all-to-all hopping.
arXiv·2026-10-09·Ce Wang
No generated summary available for this entry.
overview
Original abstract
We study quantum-assisted balanced rendezvous on the $d$-dimensional hypercube in a one-step two-agent quantum-walk framework, where the two agents move the same Hamming distance and meet at a common midpoint. The key structure is a projective $t$-sphere resolution, which governs exact finite-dimensional quantum attainment. Its scalar analogue recovers the corresponding classical characterization. We characterize finite-dimensional quantum attainment of the no-signalling benchmark, construct quantum strategies from projective sphere resolutions, and establish a rigidity theorem for optimal finite-dimensional strategies. A marked difference appears between nearest-neighbor and higher-cardinality updates: quantum advantage can occur in the former, whereas in the latter the geometry of the relevant Hamming spheres rules out exact finite-dimensional attainment of the no-signalling value. Together, these results connect quantum-walk dynamics, Hamming-sphere geometry, and quantum rendezvous within the quantum Bernoulli noises (QBN) framework.
arXiv·2026-10-09·David C. Newsom, Michael Levin
No generated summary available for this entry.
overview
Original abstract
The Markov length, the length scale governing the exponential decay of conditional mutual information (CMI) in a quantum many-body state, has proven useful for characterizing mixed-state phases of matter. Nevertheless, we show that a state's Markov length is not generally stable under weak local channels. The failure of stability occurs already at a pure product state. We demonstrate this explicitly in a one-dimensional fermionic chain, where a fine-tuned depth-two circuit of nearest-neighbor Gaussian channels maps the vacuum to a state whose CMI decays \emph{algebraically} and whose Markov length is therefore infinite, even when the channels are taken arbitrarily close to the identity. The algebraic decay is rooted in the nonanalyticity of the von Neumann entropy at rank-deficient density operators. We exhibit an analogous instability on an ordinary qubit chain. More generally, we show that the Markov length is unstable in any translation-invariant state with even a single rank-deficient reduced density operator. These results pose a challenge to recent definitions of mixed-state phase equivalence based on the Markov length.
arXiv·2026-10-09·Eduardo Dueñez, José Iovino
No generated summary available for this entry.
overview
Original abstract
A bipartite observable is stable when its idealized responses are continuous. We show that it is NIP exactly when they are of the first Baire class. They then form a Rosenthal compactum, and the dividing lines of Shelah in model theory, together with the classification of Rosenthal compacta of Todorčević, acquire a physical meaning. For observables, mixtures of states make every hereditarily separable compactum of idealized responses metrizable, and the Todorčević trichotomy becomes a classification into three classes. Each class contains a physical order: the comparison of photon numbers, the comparison of positions, and the causal order of spacetime, whose idealized responses are not first countable because a light cone can shrink to a point; the comparison of two phases on a circle joins it there. Each of the seven minimal families of the heptachotomy, which Argyros, Dodos and Kanellopoulos extracted from the methods of Todorčević, is realized by a tree of preparations of photons, of a particle in a box, or of a spin chain read by a probe; the spin chain also shows that NIP, unlike its uniform version, is not symmetric between the two parties. Finally, for the Ising model in a transverse field we show that, in the ordered phase, the responses of the two pure phases form split pairs whose midpoints, the responses of the symmetric state, form an uncountable discrete set; the proof uses a Lee--Yang theorem for this model.
arXiv·2026-10-09·Ojas Parekh
No generated summary available for this entry.
overview
Original abstract
We give a polynomial-time randomized classical algorithm that approximates the largest eigenvalue $λ_{\max}$ of a traceless quartic fermionic Hamiltonian $H$ on $n$ modes. The algorithm achieves energy at least $λ_{\max}/O(\sqrt n)$ and outputs either a fermionic Gaussian state or a polynomially sparse state in the Fock basis. This is achieved through a new upper bound on $λ_{\max}$ in terms of the maximum energy of a Gaussian state and $\sqrt{2^{-n}\operatorname{Tr}(H^2)}$.
The Quantum Insider·2026-10-08·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Oratomic has raised $775 million in total funding since its launch in March 2026 to develop utility-scale, fault-tolerant quantum computers. The financing was led by ARCH Venture Partners, Spark Capital, Khosla Ventures, Index Ventures, General Catalyst and Bezos Expeditions. Oratomic will use the funding to expand its scientific and engineering team, laboratory infrastructure and quantum computing systems. PRESS RELEASE — Oratomic , whose mission is to build the first fault-tolerant quantum computers, announced today that it has raised a total of $775 million since its launch in March 2026. The company will use the funds to accelerate the development of utility-scale, fault-tolerant quantum computers. ARCH Venture Partners, Spark Capital, Khosla Ventures, Index Ventures, General Catalyst, and Bezos Expeditions led the financing. Oratomic is building quantum computers based on reconfigurable arrays of neutral atoms and advanced quantum error correction. The company is focused exclusively on building a fault-tolerant quantum computer. The new funding will support the continued growth of Oratomic ‘s scientific and engineering team, laboratory infrastructure, and the systems required to build its quantum computers. For more information, visit Oratomic.com .
Quantum Computing Report·2026-10-08·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
The U.S. Department of Energy (DOE) Office of Science has released the Quantum Genesis Priority Applications (QGPAs), outlining eight key scientific problems to assess the relevance of fault-tolerant quantum computers. This framework supports the federal Quantum Genesis initiative, including the $215M Q Competition and a National Quantum Computing User Facility. The QGPAs focus on areas where classical computing faces limitations, such as chemistry, materials, subatomic physics, and applied mathematics. The post U.S. Department of Energy Unveils Quantum Genesis Priority Applications to Guide Fault-Tolerant Scientific Utility appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-08·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief IonQ has advanced to Stage C of DARPA ’s Quantum Benchmarking Initiative under an agreement with a potential value of up to $300 million. Stage C will independently evaluate IonQ ’s Superion quantum systems against the company’s technical roadmap through 2029. IonQ will continue developing and scaling its hardware and software while participating in DARPA’s verification and validation process. PRESS RELEASE — IonQ (NYSE: IONQ), the world’s leading full-stack quantum platform and foundry, has advanced to Stage C of the Defense Advanced Research Projects Agency’s Quantum Benchmarking Initiative (QBI). IonQ and DARPA have signed a Stage C agreement with a potential value of up to $300 million to continue validating IonQ’s approach to delivering large-scale fault-tolerant quantum computers. Funding beyond the initial obligation remains subject to future appropriations and DARPA funding actions. The Big Picture DARPA’s QBI is one of the most rigorous technology evaluation programs in the U.S. government, designed to determine whether quantum computing systems can reach utility scale — where their computational value exceeds their cost. Throughout Stages A and B, IonQ shared prototype hardware data with DARPA to support its technical roadmap. IonQ’s successful advancement to Stage C brings DARPA’s most exacting, independent review of the coming generations of IonQ’s Superion quantum systems . IonQ is among the first companies to advance to this stage after demonstrating leadership with its technical plan and execution in earlier stages: Stage A – IonQ defined the technical concept for a utility-scale quantum computer. Stage B – IonQ developed a detailed R&D roadmap, including the technical requirements, designs, and risk-mitigation plans needed to achieve its proposed system. Executive Perspective “Advancing to Stage C is a significant vote of confidence in IonQ ‘s technology roadmap and architecture for delivering qua
Quantum Computing Report·2026-10-08·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
India's MeitY has sanctioned ₹99.94 crore (approx. $10.3 million USD) for Phase II of the SPECTRA program at IIT Madras, in partnership with izmo Microsystems. This five-year initiative focuses on developing silicon photonics for high-bandwidth data centers, AI compute clusters, and quantum communications, including chip-scale QRNG and integrated QKD photonic circuits. The collaboration aims to establish an end-to-end solution for photonic integrated circuits from fabrication to system integration. The post India’s MeitY Sanctions ₹99.94 Crore ($10.3 Million USD) for IIT Madras and izmo Microsystems Silicon Photonics Program appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-08·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief SpecterAI Quantum Security delivered an interactive quantum-safe banking workshop at the inaugural Asia Fintech Forum in Kuala Lumpur. More than 40 participants used Mosca’s inequality to assess quantum risks, data confidentiality requirements, and potential migration timelines. The workshop covered harvest-now-decrypt-later risks, NIST’s post-quantum cryptography standards, and practical steps for planning a PQC migration. PRESS RELEASE — SpecterAI Quantum Security , a post-quantum cryptography (PQC) assessment, validation and training firm, delivered an interactive Quantum-Safe Banking Workshop at the inaugural Asia Fintech Forum, held on 2 October 2026 at the World Trade Centre Kuala Lumpur and convened by the Responsible Fintech Institute. The workshop was co-led by Dr. Peter Phuc Huynh, Chairman APAC of SpecterAI Quantum Security, and Edmond Tung, a Singapore-based workshop co-lead for SpecterAI. More than 40 forum participants took part. Rather than presenting quantum computing as a distant technology topic, the session asked participants to apply it to their own organizations. Working in teams and voting live by table, participants assessed how long their sensitive data must remain confidential, how long their institutions might need to migrate to quantum-resistant cryptography, and when the quantum threat could become relevant. From a Technology Issue to a Readiness Issue At the center of the workshop was a simple framework based on three variables, widely known as Mosca’s inequality, after Michele Mosca of the Institute for Quantum Computing at the University of Waterloo: X — how long sensitive data must remain secure; Y — how long an organization could take to migrate; Z — when the quantum threat might become relevant. When X plus Y is greater than Z, data that is encrypted today may still need protecting after a capable quantum computer exists. Participants used the framework to estimate their own position, then ranked common categorie
The Quantum Insider·2026-10-08·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Atom Computing has advanced to the final stage of DARPA’s Quantum Benchmarking Initiative, with potential funding of up to $300 million. The Stage C phase will independently assess whether Atom ’s proposed utility-scale neutral-atom quantum computer can be built and operated as designed. Microsoft will provide algorithmic support and error-correction codes to Atom Computing as part of the program. PRESS RELEASE — Atom Computing today announced it has been selected by the Defense Advanced Research Projects Agency (DARPA) to advance to the final stage of the Quantum Benchmarking Initiative (QBI), a landmark program assessing the feasibility of building utility-scale quantum computers on an accelerated timeline. This stage, with potential funding of up to $300 million, reinforces the momentum behind Atom Computing’s vision and roadmap for building a utility-scale quantum computer using neutral-atom quantum technology. DARPA launched the Quantum Benchmarking Initiative to evaluate whether practical, industrial quantum computers can be realized sooner than conventional industry projections. Atom Computing was selected for Stage A of the program in early 2025 and subsequently advanced to Stage B in late 2025, where the company developed and presented a comprehensive plan for realizing a utility-scale quantum computer. This work included detailed technology development milestones, risk assessments, mitigation strategies, and prototype systems designed to demonstrate critical capabilities. With Atom ’s selection for Stage C, an independent government verification and validation team will determine if the company’s utility-scale quantum computer concept can be constructed as designed and operated as intended. As part of the program, Microsoft has agreed to also provide algorithmic support and error correction codes to Atom Computing. “We are excited to be chosen for the final stage of DARPA’s Quantum Benchmarking Initiative,” said Dr. Ben Bloom, CEO and F
The Quantum Insider·2026-10-08·Resonance
No generated summary available for this entry.
overview
Original abstract
Insider Brief The U.S. National Science Foundation has named the initial founding partners of its new NSF X-Labs Consortium, which it says represents over $300 million in commitments to support X-Labs teams with floor space, instrument access and direct support. Partners named so far include the Astera Institute, Ginkgo Bioworks, Tom Secunda and the Secunda Family Foundation, the Alfred P. Sloan Foundation, Matt Cimaglia with Occam Foundry, and the Florida Quantum Center. The consortium backs NSF X-Labs, the $1.5 billion, decade-long program funding independent teams of researchers, engineers and entrepreneurs through milestone-based awards, with quantum systems among its first topics. The U.S. National Science Foundation has put names to the founding partners of its new NSF X-Labs Consortium , the private-sector and philanthropic backbone for the agency’s $1.5 billion X-Labs initiative. In a post on X, NSF thanked the Astera Institute, Ginkgo Bioworks, Tom Secunda at the Secunda Family Foundation, the Alfred P. Sloan Foundation and other national philanthropic partners, along with Matt Cimaglia with Occam Foundry and Florida Quantum Center , as the initial group that will help X-Labs stand up what the agency calls a new generation of independent research organizations. The consortium was announced alongside a broader set of NSF programs tied to the White House report Science: A New Golden Age , including a Quantum+X Grand Research Challenge, an Office of Metascience and new workforce investments. NSF said the founding partners represent more than $300 million in commitments and will support X-Labs teams with floor space, instrument access and direct support. What the consortium is for NSF X-Labs, launched in May with $1.5 billion over ten years, funds independent teams of researchers, engineers and entrepreneurs through milestone-based awards under NSF’s Other Transaction authority rather than conventional grants. The teams are meant to operate outside
The Quantum Insider·2026-10-08·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Diraq has advanced to Stage C of DARPA ’s Quantum Benchmarking Initiative to evaluate its silicon-based approach to utility-scale quantum computing. DARPA’s independent verification team will assess Diraq ’s system design, performance, manufacturing economics, and critical capabilities during the final stage. Diraq will receive an initial $51 million funding tranche to support technical demonstrations, infrastructure, and development of its fault-tolerant quantum computing platform. PRESS RELEASE — Diraq today announced it has been selected by the U.S. Defense Advanced Research Projects Agency (DARPA) to advance to Stage C of the agency’s Quantum Benchmarking Initiative (QBI), the final stage of the world’s most rigorous program evaluating whether any quantum computing approaches can achieve utility-scale operation by 2033. Utility scale is the point at which a quantum computer can solve problems which deliver more value than the machine costs to build and run. In Stage C, Diraq will work with DARPA’s independent verification and validation team to assess the design and performance of its silicon-based systems and the critical capabilities required to deliver a utility-scale quantum computer. “Advancing to Stage C of the QBI program represents a crucial independent validation that our path to utility-scale quantum computing holds up under rigorous technical scrutiny,” said Andrew Dzurak, Diraq Founder and CEO. “Diraq’s silicon spin qubits are built using the same manufacturing processes and infrastructure that already produce the world’s conventional computer chips, which is a different starting point than approaches that require entirely new fabrication techniques to reach scale. That gives Diraq a decisive advantage: we are scaling on a manufacturing base that already exists, while others are still working out how to build one.” Diraq ’s advancement follows the successful completion of Stage B . During Stage B, Diraq developed and d
IonQ·2026-10-08
No generated summary available for this entry.
overview
Original abstract
IonQ has now been selected to advance to Stage C of QBI, the initiative’s final and most rigorous phase. It’s a major milestone for IonQ: under an agreement with a potential value of up to $300 million, DARPA will independently evaluate multiple generations of our Superion quantum computers through 2029, testing whether the engineering roadmap we’ve laid out holds up in practice.
The Quantum Insider·2026-10-08·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief The Department of Energy released eight Quantum Genesis Priority Applications to guide the development and evaluation of fault-tolerant quantum computers for scientific use. The applications span chemistry, materials, subatomic physics and applied mathematics, with performance to be benchmarked against advanced supercomputing methods. The priorities will inform DOE’s Q Competition, a National Quantum Computing User Facility and focused research on applications of fault-tolerant quantum computers. PRESS RELEASE — The U.S. Department of Energy (DOE) today announced the release of Quantum Genesis Priority Applications (QGPAs), a set of eight key scientific utility problems that will guide the Quantum Genesis’s goal of developing fault-tolerant scientifically relevant quantum computers. This effort directly supports the goals outlined in President Trump’s Executive Order Ushering in the Next Frontier of Quantum Innovation and builds on the recommendations made in the Blueprint for DOE Quantum Supercomputing and the Office of Science Advisory Committee’s Quantum Report . The QGPAs will serve as beacons for the quantum applications community, provide a concrete basis for judging the “scientific relevance” of fault-tolerant quantum computers, and coordinate the hardware, software, and domain science R&D needed to realize new scientific advances not otherwise possible today. These Priority Applications, along with the other elements of Quantum Genesis, will bring domain scientists from across disciplines into direct partnership with quantum researchers. Together, they will integrate quantum computing into real-world scientific workflows and benchmark performance against today’s most advanced supercomputing methods. “The Quantum Genesis Priority Applications are a bold declaration of how quantum computing capabilities will open up new scientific frontiers,” said DOE Under Secretary for Science Darío Gil . “D
The Quantum Insider·2026-10-08·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Qubo Consulting Corporation and Mitacs are offering six free quantum technology workshops for post-secondary students and recent graduates in Canada. The workshops will cover quantum technologies, materials, sensing, computing and AI, networking, and foundational quantum physics from October 2026 through March 2027. The online workshops are open to eligible participants from Canadian institutions and will include English delivery with bilingual support from francophone quantum experts. PRESS RELEASE — Qubo Consulting Corporation , a quantum training and advising organization, is offering six quantum workshops in partnership with Mitacs to prepare post-secondary students for the quantum workforce. The workshops will dive into a variety of quantum topics including: Introduction to Quantum Technologies – October 29, 2026 Quantum Materials: The Foundations of Quantum Tech – November 19, 2026 Quantum Sensing: Real-world Applications – January 12, 2027 Quantum Computing & AI Use Cases – February 9, 2027 Quantum Networking: Ground & Space-based Links – February 25, 2027 Young’s Double Slit Demo & Workshop – March 18, 2027 “At Mitacs, we open the door to opportunity, creating jobs and equipping students and postdoctoral researchers with skills, industry experience, and professional networks. Training the quantum-ready talent today ensures we can turn ideas into results that drive economic growth, positioning Canada to continue as a leader in harnessing quantum’s power,” said Michelle Aguayo, Vice President, Operations and Program Management, Mitacs. “The quantum ecosystem is growing as quantum technologies move from the lab into the market, and so is the demand for quantum talent in Canada,” said Dr. Katanya Kuntz, Founder, CEO and Chief Quantum Scientist of Qubo Consulting. “At Qubo, our goal is to take a complex topic like quantum physics and provide an engaging, educational workshop experience. We connec
Quantum Computing Report·2026-10-08·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Oratomic, a Pasadena-based quantum hardware developer, has secured $775 million in cumulative funding to advance its fault-tolerant quantum computing systems. The company focuses on neutral-atom arrays and quantum error correction, aiming for utility-scale quantum computers. The post Neutral-Atom Developer Oratomic Secures $775 Million in Cumulative Funding for Fault-Tolerant System R&D appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-08·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
The U.S. Department of Energy has awarded $159 million in Phase II Genesis Mission awards to 12 projects. These projects focus on quantum error correction, materials co-design, and custom microelectronics, leveraging AI and high-performance computing. Key initiatives include Harvard's ASQC project for quantum error correction, Oak Ridge National Laboratory's AI-Empowered Design of Functional Quantum Magnets, and Fermilab's AXESS project for accelerating chip design for extreme environments. The post U.S. Department of Energy Allocates $159 Million in Phase II Genesis Mission Awards for Quantum Error Correction and Materials Co-Design appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-08·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
DARPA has selected Atom Computing, Diraq, IBM, and IonQ for Stage C of its Quantum Benchmarking Initiative (QBI) to verify the performance of their fault-tolerant quantum computing architectures. This stage involves direct physical testing and empirical validation of their hardware, aiming to assess their potential for utility-scale operation by 2033. The chosen companies represent diverse qubit technologies, including neutral atoms, silicon spin qubits, superconducting transmons, and trapped ions. The post DARPA Selects Atom Computing, Diraq, IBM, and IonQ for Final Stage C Verification under Quantum Benchmarking Initiative appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-08·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Universal Quantum raised more than $100 million in Series A funding to develop and commercialize its modular quantum computing technology and expand internationally. The round, co-led by DCVC and Firgun Ventures , will support systems that connect trapped-ion quantum chips to build larger, error-corrected quantum computers. The funding will support a new research and development center in Singapore and expansion in the United States, Japan and Hamburg, Germany. PRESS RELEASE — Universal Quantum , the company building large-scale quantum computing systems for real-world use, today announced it has secured over $100 million in Series A funding – marking the largest Series A ever raised by a quantum firm headquartered in the UK. The funding will accelerate the company’s global expansion, as well as the development and commercialisation of its modular technology, advancing a path towards fault-tolerant quantum computing. The round was co-led by DCVC and Firgun Ventures , with participation from EDBI , Artal (advised by Invus), Integral GlobalTech, Main Sequence , Hostplus, NGS Super, IAG Capital , EdenBase , Eigenstate.holdings, and Dave Baszucki (founder and CEO of Roblox), as well as other existing and new strategic investors including Nauta Capital and The Venture Collective. “ Universal Quantum ’s progress reflects our partners’ belief that we represent one of the most credible paths to quantum computing at scale,” said Dr Sebastian Weidt, CEO and co-founder of Universal Quantum. “This round unites an extraordinary group of investors from the world’s most important pools of capital around a single mission: delivering utility-scale quantum computing.” The new capital will drive the continued development and commercialisation of Universal Quantum ’s modular approach to building the quantum computers needed for practical, error-corrected use – leveraging the company’s patented, world-record interconnect technology and advanced integrated
Quantum Computing Report·2026-10-08·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
PsiQuantum has secured a conditional loan commitment of up to $150 million from the U.S. Office of Strategic Capital to expand its PsiFactory in Milpitas, California. This funding will support the development of a domestic supply chain for quantum computing and follows other significant investments from DARPA and the U.S. Department of Commerce. PsiQuantum is also developing facilities in Illinois and Australia. The post U.S. Department of War Announces $350 Million Quantum Package, Highlighted by $150 Million OSC Loan Commitment for PsiQuantum appeared first on Quantum Computing Report .
Phys.org Quantum Physics·2026-10-08
No generated summary available for this entry.
overview
Original abstract
In some materials, physical properties don't emerge from their individual particles, but from the collective behavior of their quantum spins. Now, researchers led by Pengcheng Dai at Rice University in the U.S. have discovered that in one compound containing the rare-earth element ytterbium, these spins can behave much like the molecules in a liquid crystal: favoring a certain direction without lining up to create magnetism on larger scales.
Quantum Computing Report·2026-10-08·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
NVIDIA is investing $1 billion over five years to advance U.S. scientific computing and quantum infrastructure. This commitment supports research institutions, cloud providers, and national laboratories, focusing on hybrid quantum-classical hardware integration, fault-tolerant quantum software, fusion energy, and microelectronics design. A key aspect is expanding access to high-performance computing and NVIDIA's open-source CUDA-Q platform for quantum processor simulation and control. The post NVIDIA Commits $1 Billion over Five Years to Accelerate U.S. Scientific Computing and Quantum Infrastructure appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-08·Doug Finke
No generated summary available for this entry.
overview
Original abstract
In part five of our five part series on quantum patents, Sinan Utku discusses why an attempt to patent Shor's algorithm would likely be challenged. The article concludes with an observation about the uncertain state of patent eligibility law in the US. The post Patenting Quantum Computing Innovations – Part 5: Shor’s Algorithm and Conclusions appeared first on Quantum Computing Report .
Nature: Quantum Information·2026-10-08
No generated summary available for this entry.
overview
Quantum Computing Report·2026-10-08·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Quantum Source has introduced QS-LINK, a memory-assisted photonic interconnect that unifies multi-modal quantum computing. This technology overcomes scaling limitations in multi-processor quantum networks by using a single cavity-trapped rubidium-87 atom as an asynchronous quantum memory buffer to establish remote entanglement between separate quantum processing units (QPUs). QS-LINK significantly reduces the attempts needed to achieve entanglement compared to traditional methods, operating at room temperature and supporting various hardware modalities. The post Quantum Source Introduces Memory-Assisted Photonic Interconnect to Unify Multi-Modal Quantum Computing appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-08·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Universal Quantum, a UK-based hardware developer specializing in trapped-ion quantum processors, has successfully closed a $100 million Series A funding round. This investment will fuel their international expansion, including operations in Europe, Singapore, the U.S., and Japan, and support their $77 million contract with the German Aerospace Center. Their technology utilizes modular silicon chiplets connected by micro-electric ion-shuttling links, operating at a mild cryogenic temperature of 70 Kelvin, which reduces error rates and avoids complex sub-Kelvin cooling systems. The post Universal Quantum Closes $100 Million Series A to Accelerate Modular Trapped-Ion Architecture Scaling appeared first on Quantum Computing Report .
Phys.org Quantum Physics·2026-10-08
No generated summary available for this entry.
overview
Original abstract
Quantum technologies are considered key technologies of the future. However, research in this field requires not only scientific expertise but sometimes also highly specialized laboratory conditions. Bose–Einstein condensates are a remarkable example, in which atoms move in lockstep, making quantum-mechanical effects visible not only at the level of individual atoms but also on a macroscopic scale. The first Bose–Einstein condensates were observed in ultracold atomic gases at temperatures close to absolute zero. The cooling required to achieve this was technically demanding, costly and restricted to specialized laboratories.
The Quantum Insider·2026-10-08·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Researchers discovered a repeating, twisted atomic structure in uranium oxytelluride that combines ferromagnetic and antiferromagnetic properties, potentially informing the design of advanced electronics and computer memory. High-resolution microscopy and additional measurements showed that the previously unrecognized structure helps govern how electrons move through the material, with potential applications in faster memory more resistant to external magnetic fields. Computational analyses suggest hundreds of related compounds could contain similar structures, providing a new approach to finding materials with unusual magnetic properties. Image: Dr. Mengke Liu, assistant professor of physics at The University of Texas at Dallas , operates a two-dimensional transfer stage inside a glove box to fabricate atomically thin quantum devices. (University of Texas) PRESS RELEASE — A University of Texas at Dallas scientist and her colleagues have discovered an unusual atomic pattern in a uranium-based material that gives it a rare combination of magnetic properties, a finding that could open new pathways for designing advanced electronic and computer memory devices. Dr. Mengke Liu , an assistant professor of physics in the School of Natural Sciences and Mathematics , and her collaborators found a previously unrecognized chiral superlattice in a crystal of uranium oxytelluride (UOTe). Liu is a corresponding author of a study detailing the research published online Oct. 7 in the journal Nature . The discovery began when Liu was a Harvard Quantum Initiative in Science and Engineering postdoctoral fellow, a position she held before joining the UT Dallas faculty in 2025. One of Liu’s collaborators, Dr. Sheng Ran, associate professor of physics at Washington University in St. Louis, gave Liu crystals of a uranium compound that he had synthesized for her to analyze. Liu, an experimental physicist and an expert in imaging technology, was using transmission electr
Phys.org Quantum Physics·2026-10-08
No generated summary available for this entry.
overview
Original abstract
Molecules can be placed in a wide variety of quantum states. How can these states be distinguished in measurements when theoretical models are unreliable? Which excitation process lies behind which measurement signal?
Quantum
·2026-10-08
·David Jennings et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Important nonlinear dynamics, such as those found in plasma and fluid systems, are typically hard to simulate on classical computers. Thus, if fault-tolerant quantum computers could efficiently solve such nonlinear problems, it would be a transformative change for many industries. In a recent breakthrough [Liu et al., PNAS 2021], the first efficient quantum algorithm for solving nonlinear differential equations was constructed, based on a single condition R &#x003C; 1 , where R characterizes the ratio of nonlinearity to dissipation. This result, however, is limited to the class of purely dissipative systems with negative log-norm, which excludes application to many important problems. In this work, we correct technical issues with this and other prior analysis, and substantially extend the scope of nonlinear dynamical systems that can be efficiently simulated on a quantum computer in a number of ways. Firstly, we extend the existing results from purely dissipative systems to a much broader class of stable systems, and show that every quadratic Lyapunov function for the linearized system corresponds to an independent R -number criterion for the convergence of the Carleman scheme. Secondly, we extend our stable system results to physically relevant settings where conserved polynomial quantities exist. Finally, we provide extensive results for the class of non-resonant systems. With this, we are able to show that efficient quantum algorithms exist for a much wider class of nonlinear systems than previously known, and prove the BQP-completeness of nonlinear oscillator problems of exponential size. In our analysis, we also obtain several results related to the Poincaré-Dulac theorem and diagonalization of the Carleman matrix, which could be of independent interest.
Quantum
·2026-10-08
·Robert Oeckl, Adamantia Zampeli
·doi
No generated summary available for this entry.
overview
Original abstract
A universal framework for the joint measurement of multiple localized observables in quantum field theory satisfying spacetime locality and compositionality is still lacking. We present an approach to the problem that is based on the one hand on the positive formalism, an axiomatic framework, where it is clear from the outset that we satisfy locality and compositionality, while also having a consistent probabilistic interpretation. On the other hand, the approach is based on standard tools from quantum field theory, in particular the path integral and the Schwinger-Keldysh formalism. After an overview of the conceptual foundations we introduce the modulus-square construction as a formalization of the measurement process for the expectation value of an important class of observables including quadratic observables. We show that this construction has many of the desired properties, including positivity, locality, single measurement recovery and compositionality. We introduce a renormalization scheme for the measurement of quadratic observables that also satisfies compositionality, in contrast to previous renormalization schemes. We discuss relativistic causality, confirming that measurements in our scheme are indeed localized in the spacetime regions where the underlying observables have support.
Quantum
·2026-10-08
·Lukas Brenner, Beatriz Dias, Robert Koenig
·doi
No generated summary available for this entry.
overview
Original abstract
Quantifying the accuracy of logical gates is paramount in approximate error correction, where perfect implementations are often unachievable with the available set of physical operations. To this end, we introduce a single scalar quantity we call the (composable) logical gate error. It captures both the deviation of the logical action from the desired target gate as well as leakage out of the code space. It is subadditive under successive application of gates, providing a simple means for analyzing circuits. We show how to bound the composable logical gate error in terms of matrix elements of physical unitaries between (approximate) logical computational basis states. In the continuous-variable context, this sidesteps the need for computing energy-bounded norms. As an example, we study the composable logical gate error for linear optics implementations of Paulis and Cliffords in approximate Gottesman-Kitaev-Preskill (GKP) codes. We find that the logical gate error for implementations of Paulis depends linearly on the squeezing parameter. This implies that their accuracy improves monotonically with the amount of squeezing. For some Cliffords, however, linear optics implementations which are exact for ideal GKP codes fail in the approximate case: they have a constant logical gate error even in the limit of infinite squeezing. This is consistent with previous results about the limitations of certain gate implementations for approximate GKP codes. It shows that findings applicable to ideal GKP codes do not always translate to the realm of physically realizable approximate GKP codes.
arXiv·2026-10-08·Mi-Ra Hwang et al.
No generated summary available for this entry.
overview
Original abstract
Sierra and Townsend (ST) [1] showed that the ``absorption spectrum'' model of Connes [2] arises as the lowest-Landau-level (LLL) limit of a charged particle in crossed electric and magnetic fields, and suggested that the higher Landau levels supply the fluctuation part of the Riemann-zero counting function $N(E)$. Within the approximation used by ST we construct the eigenfunctions of an arbitrary Landau level $n$ and derive their asymptotics at the two box boundaries that ST identify. The boundary condition is the same as for $n=0$ up to an $E$-independent phase $(-\ii)^n$, so no $\ln E$ term arises for any fixed $n$. We also note that the $\ln E$ term in the semiclassical Eq.~(29) of ST is the first-order shift of the smooth LLL counting function, $E\to E+γz^2$.
arXiv·2026-10-08·Sky Nelson-Isaacs
No generated summary available for this entry.
overview
Original abstract
A photon has the strange property that it travels along a null interval with zero proper time, hence its emission and absorption points are, in a sense, a singular event. For their part, the emission and absorption processes have a finite duration which determines the spectral content of the photon. The question in the title points to the conceptual difficulty in `stitching' together these three intervals, which all correspond to the same physical entity but have fundamentally incompatible temporal descriptions. A previously developed model for quantum wavefunction propagation solves this apparent dilemma by formulating the life cycle of a photon in terms of recursive Fourier transforms on dual spaces. Because it doesn't treat space as dependent on time, and it is built on the Fourier transform whose phase is an invariant in special relativity as well as the foundation of the uncertainty principle, the model is a promising candidate framework for making quantum mechanics compatible with relativity. The model proposes to serve as an improved Klein-Gordon equation, or relativistically compatible replacement for Schrödinger's equation.
arXiv·2026-10-08·Maxim V. Churilov
No generated summary available for this entry.
overview
Original abstract
Exact permutation covariance does not itself supply a sparse metric geometry. For permutation-covariant, full-support $k$-body interaction orbits, the incident interaction norm scales as $\binom{N-1}{k-1}|J_N|\|h\|$; such orbits cannot have uniformly finite range in metrics of diverging diameter. A permutation-invariant Hamiltonian diagonal in the graph basis has ground-state multiplicity at least $N!/|\mathrm{Aut}(G)|$ whenever $G$ is a ground graph. We give a quantitative version for approximately symmetric energies, together with fixed-radius connectivity and unitary-isometry obstructions. The trace-distance asymmetry of an arbitrary state also bounds its probability of selecting one labeled graph. We then construct two exactly solvable finite relational history Hamiltonians. A cyclic clock with a reversible incidence update has a unique ground state; gauge reduction yields a cycle Laplacian with a rank-one pin and the exact gap $Δ_{N,L}=E_* (1-\cosθ_L)$, where $\tan(Lθ_L/2)=1/\sinθ_L$ and $0<θ_L<π/L$. In particular, $Δ_{N,L}/E_*=π^2/(2L^2)-2π^2/L^3+O(L^{-4})$, independently of the number of vertices. In an alternative order-free architecture, one clock qubit per unordered pair gives commuting four-local terms, $2^N$ ground states and a size-independent gap $E_*(1-1/\sqrt2)$. A fixed-weight control penalty selects $\binom Nq$ ground states without reducing the gap. These exact finite results expose clock and locality resource tradeoffs; they do not establish an emergent geometric phase.
arXiv·2026-10-08·Deniz Yunus Göğüş
No generated summary available for this entry.
overview
Original abstract
We study byte-level autoregressive language models whose hidden state is a small quantum register, whose transitions are learned token-conditioned quantum channels, and whose next-byte probabilities come directly from Born-rule measurements without a learned classical vocabulary projection or softmax. In the fixed-width recurrent setting, unitary dynamics cannot contract or reset stored distinctions; experimentally, unitary recurrence loses to its retrained one-token control in every tested variant. Introducing learned dissipation, then token-conditioned dissipative gating, yields useful memory beyond one token. The gated model improves test negative log-likelihood by 0.20 +/- 0.03 nats/byte over retrained parameter-matched one-token controls at context length 12, and by 0.29-0.33 at longer contexts, but never beats retrained two-token controls. A key-value recall benchmark shows a width-dependent threshold: one stored pair meets the pre-registered accuracy bar at 4-5 memory qubits, two pairs at 6-7, and three pairs remain unsolved. This is consistent with, but does not establish, a capacity explanation for the short effective memory horizon. As a secondary result, one-qubit models reach lower stationary memory entropy than a heuristically optimized classical predictive frontier at matched error in 9/9 seeds. On IBM Heron hardware, computational-basis memory-register distributions show signal against a uniform null in 12/12 circuits across prefixes of up to 12 tokens, next-bit probabilities pass pre-registered accuracy bars at four-token prefixes, and bytes are generated autoregressively by sampling physically measured bit probabilities. The tested models are classically simulable and substantially worse than classical n-gram baselines. We claim no computational quantum advantage.
arXiv·2026-10-08·Vahagn Mkhitaryan et al.
No generated summary available for this entry.
overview
Original abstract
Frustrated magnets host rich emergent behavior because competing interactions generate dense manifolds of low-energy states. The Ising Shastry-Sutherland model is a paradigmatic setting, motivated experimentally by Ising-like rare-earth tetraborides such as TmB$_4$ and ErB$_4$, whose field-induced magnetization plateaus have motivated extensive microscopic modeling. Yet how tunable quantum fluctuations reorganize this material-motivated phase diagram remains largely unexplored. Here, we realize a transverse- and longitudinal-field Ising model on the Shastry-Sutherland lattice using a programmable Rydberg-atom array. We map its quantum phase diagram using density matrix renormalization group calculations and probe corresponding signatures experimentally in arrays containing more than 110 atoms. Beyond the established classical phases, the calculations identify two regimes absent in the classical limit and stabilized at finite transverse field: a $2/5$ filling plateau whose finite stability region emerges from a classically degenerate phase boundary and a symmetry-preserving quantum-dimer regime replacing classically selected collinear order. Experiments on finite open arrays reveal signatures consistent with these regimes across three boundary-pinning conditions, with the resulting response maps agreeing qualitatively with the calculated phase diagram. Our results establish programmable Rydberg-atom arrays as tools for exploring frustrated, material-motivated Hamiltonians and motivate searches for new, quantum-driven magnetization plateaus and quantum-dimer behavior in ErB$_4$ under a transverse field or in strain-tuned TmB$_4$.
arXiv·2026-10-08·Rajendra Prasad Rajpurohit, V. Lalitha, Shayan Srinivasa Garani
No generated summary available for this entry.
overview
Original abstract
We introduce coset lifted product (CLP) codes, a family of quantum LDPC codes that combine the protograph structure of lifted product codes with the coset action of Aydin, Tamo, and Barg \cite{AydinTamoBarg2026}. Given a finite group $G$, a subgroup $H \le G$ that need not be normal, a protograph $A$ over $\mathbb F_2[G]$, and a protograph $B$ over $\mathbb F_2[N_G(H)]$, the two protographs act on the cosets $G/H$ from the left and from the right to produce quantum CSS codes. Further, for groups of odd order, we give an explicit formula for the dimension as a sum over the irreducible representations $ρ$ of $G$ of hypergraph product dimensions. A search over $14,843$ pairs $(G,H)$ with $H$ restricted to be non-normal and $120 \le n \le 400$ yields certified codes that exceed the best published value of $Q=kd^2/n$ at check weights $6,7$ and $9$, i.e., we obtain $[[360,20,20]]$ at $w=6$, a $[[360,24,20]]$ code at $w=7$, and codes $[[252,16,18]]$ and $[[288,16,20]]$ at $w=9$. Our search also produce high-distance codes with parameters $[[168,10,14]], [[240,8,20]]$ at $w=6$ and $[[216,8,18]]$ at $w=7$.
arXiv·2026-10-08·Gabrielle Carrel et al.
No generated summary available for this entry.
overview
Original abstract
Electronic properties of materials depend both on band energies and quantum geometry of electronic states. We relate bonding indices to the quantum geometric tensor (QGT), showing how chemical bonding dictates the momentum-space texture of bands, bridging chemical and physical descriptions of solids. We show the QGT decomposed into the three center bond index, weighted by their oriented area. Resolving these contributions by orbital pair reveals the donor--acceptor character that distinguish ionic, covalent, hypervalent, and metavalent bonding. We identify the bonding pattern for topology in materials: noncollinear three center bonds, which are the source of Berry curvature in solids. Bond fluctuation can be directly linked to electromagnetic response by resolving their energy spectrum, opening a quantitative route towards the design of physical properties of materials from bonding motifs.
arXiv·2026-10-08·Carla Rubiliani, Marius Wesle, Tom Wessel
No generated summary available for this entry.
overview
Original abstract
In this note, we study a broad class of time-dependent and irreversible dynamics for quantum spin systems in both finite and infinite volume. We develop a simple and flexible strategy for expanding commutators of the form $[A,τ_{s,t} \, B]$ in terms of self-avoiding paths of sets, where $A$ and $B$ are local operators and $τ_{s,t}$ is the Heisenberg time evolution. This adaptive Dyson expansion requires no backwards time evolution and is thus also applicable to irreversible dynamics. Furthermore, we discuss how such an expansion directly implies Lieb-Robinson bounds. A central feature of our result is that the obtained Lieb-Robinson bounds are independent of any Hamiltonian and dissipative on-site terms of the generator.
arXiv·2026-10-08·Israel Klich, Ravisankar Rajagopal
No generated summary available for this entry.
overview
Original abstract
The strong Szegő theorem and the Fisher-Hartwig formula describe the asymptotic behavior of determinants obtained by restricting translationally invariant operators to large finite regions. In particular, Szegő's theorem states that, beyond the leading extensive contribution to such a determinant, there is a universal finite correction, $\sum_{r>0} rV_rV_{-r}$ where $V_r$ are the Fourier coefficients of the logarithm of the symbol. Although this formula appears throughout analysis and mathematical physics, the origin of its quadratic form and of the weight $r$ is often obscured in its standard analytic derivations. We develop an elementary picture in which the strong Szegő term arises from boundary leakage: paths contributing to the matrix exponential leave the finite interval and subsequently return. Counting the shortest such excursions immediately produces the factor $r$. We then show that an isolated boundary contributes exactly one half of the strong Szegő correction, while the two boundaries of a long interval decouple. For finite-range matrices this gives a rigorous and intuitive elementary derivation of the asymptotics, with extensions to sufficiently rapidly decaying interactions. A complementary free-fermion argument provides a physical interpretation of the same cancellation mechanism. Numerical examples illustrate the asymtotics in the well controlled regime, the Fisher Hartwig logarithmic correction. The boundary formulation does not itself require translation invariance and therefore suggests natural extensions to disordered systems, higher dimensions, and symbols with internal matrix structure. To illustrate this we numerically go beyond the formal applicability region of the Szegő formula, considering slow decay and disordered cases, and showing in some cases a robustness of the approach even for slowly decaying but disordered potentials.
arXiv·2026-10-08·Jude McClay et al.
No generated summary available for this entry.
overview
Original abstract
Bilayer graphene (BLG) is a unique electronic material offering electrostatic tunability of its band gap. Here, we study how charge disorder in the dielectric environment modifies band-edge states by binding electrons and holes to Coulomb centres, taking into account the in- and out-of-plane dielectric response of Bernal bilayers. We apply this framework to (a) hBN-encapsulated medium-size-gap BLG used for gate-defined quantum dots, and (b) BLG under double n/p ionic gating. In hBN/BLG/hBN, we find that single remote charges produce only weakly bound states, with binding energies generally small compared with the BLG gap. Under ionic gating, we find that the bound states are too large to be trapped by individual ions -- localisation arises from fluctuations in the ion density, whose magnitude is limited by Coulomb charging energy at the freezing temperature $T_f$ of the ionic configuration. Thus, in both regimes, charge disorder does not produce deep midgap states, with the bound states remaining closer to the conduction and valence band edges.
arXiv·2026-10-08·Andrea Di Fini et al.
No generated summary available for this entry.
overview
Original abstract
Quantum LDPC codes promise to reduce the overhead of fault-tolerant quantum computation, but their practical use requires efficient logical gates, measurements, and access to non-Clifford resources. Here, we develop a complete set of computational primitives for La-cross hypergraph product codes. For a subclass of these codes, we show that seed automorphisms together with fold-transversal gates generate the full logical Clifford group up to Pauli corrections. We further prove that every rank one logical operator admits $D$ pairwise disjoint physical representatives, enabling parallel gauging and a space--time tradeoff for logical measurements. Finally, we construct an addressable surface code interface for injecting externally prepared resource states into selected logical qubits. Together, these results establish La-cross codes as a simple, low-connectivity generalisation of surface code computation, retaining analogous computational primitives while providing a complete Clifford+$T$ instruction set across multiple encoded qubits.
arXiv·2026-10-08·Yu-Ao Chen
No generated summary available for this entry.
overview
Original abstract
We construct exact deterministic circuits for transposing and inverting an unknown qutrit unitary $U\in\mathrm{SU}(3)$ using only forward queries. Three queries prepare a catalyst independently of the input state. Four further queries implement transposition while returning the catalyst unchanged and uncorrelated with the output. Two uses within an antisymmetric encoding implement inversion with eight processing queries and return the same catalyst. Reusing the catalyst implements $m$ transpositions or inversions with $3+4m$ or $3+8m$ total queries, respectively. More generally, we prove that exact transposition and inversion of an unknown $U\in\mathrm{SU}(d)$, $d\ge2$, require at least $d+1$ and $d^2-1$ processing queries, respectively, in fixed causal order. These processing bounds hold for any program state prepared independently of the input state using finitely many forward queries, even if that state is consumed during processing. Both our catalytic qutrit algorithms attain their respective bounds. Moreover, exact qutrit transposition with four processing queries requires at least three preparation queries, and our construction attains this bound.
arXiv·2026-10-08·Stefano Longhi
No generated summary available for this entry.
overview
Original abstract
Quantum Zeno dynamics constrains a continuously monitored system to measurement-selected subspaces. Here we show that the structure of such Zeno subspaces can be governed by a \emph{latent symmetry}, namely a symmetry that is absent from the geometry of the underlying physical network. We consider a minimal circuit-QED network of coupled microwave resonators subject to quantum-nondemolition (QND) monitoring of local photon occupations. Two distinguished resonators are geometrically inequivalent, yet are exactly exchanged by a latent symmetry of the network. Strong monitoring partitions the single-excitation Hilbert space into three quantum-Zeno subspaces, two of which correspond to localization on the distinguished resonators. Latent symmetry exactly exchanges these two Zeno subspaces and enforces identical escape and residence statistics despite their different microscopic environments. In the strong-measurement regime their residence times grow linearly with the measurement strength and diverge in the ideal Zeno limit, where the measurement subspaces become dynamically disconnected. Our results show that latent symmetry can act as a hidden organizing principle of quantum Zeno dynamics, imposing exact relations between measurement-selected subspaces that are geometrically inequivalent in the physical system.
arXiv·2026-10-08·Robert A. Grinshtein, Ivan V. Dyakonov, Stanislav S. Straupe
No generated summary available for this entry.
overview
Original abstract
We investigate the construction of unitary $t$-designs in a multi-photon Fock space on programmable linear-optical interferometers. Using the frame potential as the optimization objective, we identify architectures that realize approximate unitary 1- and 2-designs with considerably fewer controllable parameters than required for universal linear optics. For example, we find numerical evidence suggesting that for unitary 1-designs, the required number of programmable parameters scales empirically as $2d$ with the number of modes $d$, instead of $O(d^2)$. We benchmark the resulting ensembles using single-photon transition probabilities and average channel fidelities. Furthermore, as a practical result, we develop a photon-number estimation protocol for multi-photon Fock states that leverages these optimized 1- and 2-designs. Our findings demonstrate that shallow interferometers can accurately reproduce Haar-averaged first moments, while second-moment-sensitive observables provide a considerably stricter test for approximate unitary 2-designs.
arXiv·2026-10-08·Mytraya Gattu, J. K. Jain
No generated summary available for this entry.
overview
Original abstract
The even-denominator fractional quantum Hall (FQH) states, understood as topological superconductors of composite fermions, are predicted to support elementary quasiparticles (QPs) or quasiholes (QHs) obeying non-Abelian braid statistics. Using the microscopic framework of parton theory, we investigate many experimentally observed paired composite-fermion states and find that their elementary QPs and QHs in general bind to form Abelian molecules, thus obscuring non-Abelian braid statistics. An exception is the $ν=1/2$ state in wide quantum wells, where our calculations show free QPs or QHs; we thus identify this state as an especially promising candidate for realizing and studying non-Abelian braid statistics. We also indicate how the study of such bound states can help reveal the topological structure of the state.
arXiv·2026-10-08·Hung-Hsuan Teh, Tokiro Numasawa
No generated summary available for this entry.
overview
Original abstract
We study symmetries and anomalies of dissipative Majorana chains described by Lindblad dynamics. Using the operator-state mapping, we represent the Lindbladian as a non-Hermitian operator on a doubled Hilbert space. In this formulation, the ket and bra contours admit strong fermion parities and strong translations, while their diagonal combinations define weak symmetries. For even and odd chain lengths, we diagnose anomalies by comparing symmetry algebras with and without weak fermion-parity defects. These algebras retain the lattice precursor of the modulo-$8$ anomaly of the closed Majorana chain and exhibit projective relations between strong fermion parity and weak translation, as well as between weak fermion parity and strong translation, which are intrinsic to open quantum systems. We establish the IR correspondence between the lattice symmetry algebras and those of the doubled Majorana CFT in four spin sectors, identifying chiral fermion parities emanated from the lattice translations. Finally, we develop the lattice bosonization of the dissipative chain. For even length with collective energy dephasing, combining the defect and no-defect sectors and imposing GSO projections gives rise to an Ising Lindbladian with non-invertible Kramers--Wannier symmetries descending from the anomalous strong translation and fermion parity of the Majorana chain. For odd length, constructing mutually commuting ket- and bra-sector spin operators instead yields an Ising Lindbladian with a Kramers--Wannier duality defect. Our results provide a controlled framework for extending lattice anomalies and non-invertible symmetries to open quantum systems.
arXiv·2026-10-08·Giovanni Cemin, Marin Bukov, Andrea Solfanelli
No generated summary available for this entry.
overview
Original abstract
Quantum error-correcting codes on graph geometries beyond regular euclidean lattices have emerged as a promising route toward robust quantum information processing. A major challenge in quantum error correction is the trade-off between favorable properties of codes constructed in high dimensionality and the need for locality in practical implementations on near-term hardware. Sparse intermediate geometries may combine the advantages of both, but how their structure governs quantum information dynamics and code performance remains unclear. Here we show that the spectral dimension $d_s$, defined from the low-energy spectrum of the graph Laplacian, is the universal parameter connecting these properties. Using Floquet random Clifford circuits on two distinct sparse graph architectures with tunable spectral dimension, we find that $d_s$ governs both quantum information spreading and the scaling of the resulting quantum error-correcting code distance. We identify a geometry-induced entanglement phase transition from localized area-law to ergodic volume-law, whose universality is determined by $d_s$ and exhibits long-range percolation criticality. In the ergodic phase, the circuit acts as a CSS code encoder whose code distance is set by the competition between two logical sectors --- the cost of severing the graph and the length of its shortest winding cycle --- which connectivity pushes in opposite directions. The spectral dimension organizes this trade-off, highlighting a maximum at intermediate $d_s$ retaining sparse connectivity and physical realizability.
arXiv·2026-10-08·Visal So et al.
No generated summary available for this entry.
overview
Original abstract
Spin-dependent forces enable independent control over the effective frequencies of bosonic motional modes and their coupling strengths to spins in trapped-ion spin-boson quantum simulators. We show that the relative signs of these effective frequencies provide an important programmable resource for engineering distinct multimode dynamics. Focusing on a two-mode quantum Rabi model, changing the frequencies of the two modes from the same sign to opposite signs reorganizes the resonance structure of the spin-mediated bosonic interaction, converting the dominant resonant process from excitation exchange to correlated pair creation. In the dispersive regime, the resulting effective interaction realizes a two-mode parametric amplifier with stable oscillatory, critical, and exponentially amplifying regimes separated by a spin-dependent instability threshold. Across these regimes, the dynamics generate collective-quadrature squeezing and bipartite motional entanglement. Preparing the spin in a coherent superposition further allows different spin components to experience distinct stability regimes, generating tripartite spin-boson entanglement, while spin postselection can coherently combine the conditional bosonic branches to generate non-Gaussian entangled bosonic states. Finally, we outline an implementation using parameters within reach of current trapped-ion platforms.
arXiv·2026-10-08·Sergio Garrido Bourkhaeva, Claudio Castelnovo, Wojciech J. Jankowski
No generated summary available for this entry.
overview
Original abstract
By studying the interplay of geometric frustration with Aharonov-Bohm fluxes in three dimensions, we unveil a rich playground exhibiting topological semimetallic ground states with orbital magnetic dipole, quadrupole and ferrotoroidic orders, akin to spin patterns in classical spin ices - a class of phenomena which we dub frustrated topological orbital magnetism. We demonstrate that the ground-state toroidizations underpinned by non-Abelian topological nodal lines induce measurable current-induced Hall phenomena. We further find that distinct 2-in-2-out and 3-in-1-out frustrated orbital current patterns can be associated with topological Weyl node charges, and corresponding anisotropic linear and nonlinear Hall effects. We propose signatures for experimental validation of distinct frustrated topological orbital magnetic orders in candidate materials.
arXiv·2026-10-08·J. Christiansen-Salameh et al.
No generated summary available for this entry.
overview
Original abstract
The integration of low-loss dielectrics into superconducting circuits is of importance to the functionality of quantum computers and sensors. In this work, we fabricate and measure niobium resonators atop few-layer, epitaxial hexagonal boron nitride (hBN) grown by Molecular Beam Epitaxy on a sapphire substrate and compare against a control counterpart without hBN. We conduct radiofrequency measurements which probe the responses to power, temperature, and temporal fluctuations of two-level systems. The resonators integrating hBN maintain low dielectric loss with a low-power internal loss tangent on the order of $10^{-6}$, and demonstrate hBN can be added to the conventional superconducting qubit stack with minimal degradation of the quality factor. This research represents a first step towards a materials-driven strategy to eliminate phonon-mediated correlated errors in solid-state quantum systems, which leverages the thermal properties of 2D materials to prevent athermal phonons excited in the device substrate from transmitting across the superconductor-substrate interface. The same technique applied to quantum sensors would maximize phonon collection by blocking phonons from entering passive metal films.
arXiv·2026-10-08·Ilia Komissarov, Daniel E. Sheehy, Ahana Chakraborty
No generated summary available for this entry.
overview
Original abstract
Quantum geometry underlies a wide range of correlated phenomena in electronic systems, yet accessing the geometry of individual bands remains experimentally challenging. Advances in quantum simulators, such as ultracold atoms in optical lattices, have enabled local state preparation and site-resolved measurements, offering direct access to quantum dynamics beyond conventional transport probes. These developments naturally raise the question of whether band-resolved quantum geometry can be extracted from local occupation readouts. Here, we propose an on-site quench protocol to probe the flat-band quantum geometry via local occupation measurements in an atomic lattice. Our scheme dynamically isolates the flat-band sector by coupling a one-dimensional flat-band lattice to a two-dimensional flat-band bath. The bath selectively removes dispersive excitations, while compact localized states remain trapped due to their overlap with the flat-band modes of the bath. We show that the late-time occupation pattern directly encodes the integrated overlaps between flat-band states separated by the wavevector of the initial density pattern, thereby enabling access to integrated quantum distances between the states separated by the commensurate momenta $δk = 2 πs/r$, $s,r \in \mathbb Z$ and to the integrated flat-band quantum metric. Our results thereby establish a direct connection between quantum geometry and the long-time memory of an initial spatial pattern in flat-band systems.
arXiv·2026-10-08·Sagnik Chaudhuri et al.
No generated summary available for this entry.
overview
Original abstract
A periodically driven quantum many-body system is believed to approach a locally infinite-temperature-like state as dictated by the ergodicity hypothesis, when all the couplings/parameters are of the same order. When the drive is stronger than a threshold value, a large class of systems is shown to break this mandate, exhibiting Dynamical Freezing (DF): ergodicity is broken due to the emergence of local operators with permanent memory of their initial values (PRX 11, 021008, 2021). However, an exception to DF has recently been noted in a particular setting (PRX 16, 011041, 2026). Here we identify the condition for ergodicity-breaking in a system under strong drive, and show how to stabilize DF by exact, local engineering. We further show that the Floquet Hamiltonian $H_{eff} = (i/T)\ln{[U(T)]}$ is non-local when ordered by spin-flips, in a non-DF system, while it turns quasi-local under our simple, local DF engineering that keeps the Hamiltonian $H(t)$ still non-integrable at each $t$. This perplexing non-universality is absent in equilibrium, where non-integrability is believed to imply ergodicity and thermalization universally. Our work paves a way to engineering novel ergodicity-broken interacting Floquet phases of matter in various quantum platforms, and also endows DF-assisted quantum error mitigation and state stabilization techniques (see Nature 653, 1027 (2026)) with unprecedented versatility and flexibility.
arXiv·2026-10-08·Mohammad Maghrebi
No generated summary available for this entry.
overview
Original abstract
Applications of quantum devices and simulators require an accurate understanding of their dynamics as well as the effects of environmental noise. While some sources of noise can be modeled as Markovian dissipation, coupling to resonators or vibrational modes often produces non-Markovian dynamics as well, making it difficult to characterize the system, particularly for interacting many-body systems. Here, we identify a broad class of exactly solvable many-body quantum systems with both non-Markovian dynamics and Markovian dissipation. We consider a prototypical model of spins coupled to lossy bosonic modes that mediate Ising-type interactions. We exclude a transverse field but allow local spin dissipation that need not commute with the interactions, including dephasing, relaxation, pumping, and even processes that generate coherences. Using an exact stochastic representation, we decouple the many-body dynamics into the evolution of individual spins, yielding exact spin observables and correlations without adiabatically eliminating the bosons. In the Markovian limit, our solutions describe Ising models with correlated dephasing and nonreciprocal interactions. An example of spin squeezing shows that both the achievable squeezing and its optimal preparation time depend strongly on the interplay between non-Markovian dynamics and Markovian dissipation.
arXiv·2026-10-08·Ludovico Lami
No generated summary available for this entry.
overview
Original abstract
We study entanglement distillation under operations that remain completely positive under partial-transpose conjugation, a.k.a. PPT channels, in the standard quantum Shannon theory regime of asymptotically vanishing but non-zero error. Our main results are: (a) a regularised formula for the PPT distillable entanglement in terms of a measured-relative-entropy-like quantity; and (b) two different single-letter converses, one based on operator quadratic forms and the other on Hirschman's strengthening of the Hadamard three-line theorem. As an immediate application of (b), we show that the PPT distillable entanglement can be strictly smaller than the regularised Rains bound, thereby resolving an open problem in the theory of entanglement manipulation [Regula et al., NJP 21:103017, 2019]. A gap appears already for $3\times 3$ Werner states: at antisymmetric weight $25/26$, a certified upper bound of $0.62107$ ebits lies below the (regularised) Rains bound, which equals $\frac{25}{26} \log_2 5 - \log_2 3 \approx 0.64766$ ebits. On a different note, (a) implies a faithful lower bound on the PPT distillable entanglement in terms of the entanglement negativity, which provides a quantitative counterpart to the qualitatively known fact that any NPT state is PPT distillable [Eggeling et al., PRL 87:257902, 2001].
arXiv·2026-10-08·Marcin Szyniszewski, Razin A. Shaikh, Aleks Kissinger
No generated summary available for this entry.
overview
Original abstract
Entanglement and non-stabilizerness are complementary resources underlying the complexity of quantum states, yet extracting either quantity from large quantum circuits generally requires exponentially scaling resources. In diagrammatic approaches to quantum computation, such as the ZX-calculus, both quantities likewise typically require expensive tensor contractions that are not native to graphical rewriting. Here we show that both entanglement and magic can be efficiently estimated directly from ZX-diagrams. Flow enables efficient extraction of a normal form separating a potentially extensively entangled graph-state backbone from non-Clifford Pauli gadgets. This structure yields additive upper and lower bounds on bipartite entanglement entropy, which we further tighten through a preprocessing procedure that removes or merges redundant non-Clifford contributions. The same normal form gives an upper bound on logarithmic stabilizer extent. We benchmark these methods in random unitary and monitored circuits, and a circuit combining Trotterized Hamiltonian evolution with Clifford layers, finding that the resulting bounds remain informative even at large qubit numbers, circuit depths, and internal spider counts. Our results provide scalable probes of entanglement and non-stabilizerness of ZX-diagrams and establish a bridge between ZX-calculus and quantum many-body resource characterization, with applications across quantum computing, quantum information, and condensed-matter physics.
arXiv·2026-10-08·Saeefa Rubaiyet Nowmi, Md Mahmuduzzaman Kamol, Mohammad Saidur Rahman
No generated summary available for this entry.
overview
Original abstract
Building a quantum model involves a tradeoff: how complex the circuit should be, and how much training data it needs. Caro et al. show that models with fewer trainable gates need less training data to generalize well. Q-FLAIR shows that a quantum feature-map circuit can be grown gate-by-gate, stopping once further growth stops improving the training loss. We ask whether these two results combine into a predictable scaling law. Does Q-FLAIR's own stopping rule pick larger or smaller circuits as training data grows? Does the resulting generalization behavior track Caro et al.'s bound? We reimplement Q-FLAIR's growth mechanism faithfully, including its analytic reconstruction and exact stopping rule. We run it on full-resolution (784-pixel) MNIST 3-vs-5 classification, at five training-set sizes from N = 2000 to 10000. We then fine-tune each resulting circuit, so we can measure Caro et al.'s notion of active gates, K. We find no predictable relationship between training-set size and the circuit size Q-FLAIR converges to. Circuit size and test accuracy both vary non-monotonically with N, and seed-to-seed variance is nearly as large as any trend across N. The empirical generalization gap never exceeds Caro et al.'s bound in 14 of 15 runs, so the bound holds as a valid guarantee in those runs. But the gap correlates only weakly with the bound's value (r = 0.12). This shows that K does not explain most of the variation we observe. Why a valid guarantee can coexist with such weak predictive power remains an open question, and answering it may be necessary before circuit depth and training data size can be jointly optimized in practice.
arXiv·2026-10-08·Xiangkai Sun et al.
No generated summary available for this entry.
overview
Original abstract
Optical tweezer arrays trapping ultracold atoms and molecules are a versatile quantum science platform with broad impact in quantum simulation, quantum computation, and quantum metrology. The polarization dependence of anisotropic vector and tensor light shifts offers a degree of freedom for precise quantum state engineering of trapped particles. Similarly, state-selective operations depend on the polarization of the addressing light through the atom--light coupling strength. Yet, methods for controlling the polarization of individual tweezers or local addressing beams remain an experimental challenge. Here, we demonstrate independent, site-resolved linear polarization rotation across an optical tweezer array by exploiting the local birefringence tunability of a spatial light modulator. Applying this capability to an array of $^{88}\rm{Sr}$ atoms, we homogenize differential light shifts imparted by the 813-nm tweezers to the narrow ${^1{\rm S}_0}\leftrightarrow{^3{\rm P}_1}$ transition, enabling sideband cooling under a magic-angle condition. Furthermore, we show dynamic transport of trapped atoms across distinct polarization zones with high survival and preserved coherence. Finally, we characterize tweezer polarization noise and demonstrate closed-loop stabilization referenced to the atomic transition frequency, reaching mrad-level stability. Our work establishes a technique for manipulating polarization-sensitive atomic and molecular transitions in tweezer architectures, with immediate applications to optical tweezer clocks and multi-zone quantum processors.
arXiv·2026-10-08·Oles Shtanko et al.
No generated summary available for this entry.
overview
Original abstract
Early fault-tolerant quantum algorithms are a key step in scalable quantum computing, but are ultimately constrained by residual, uncorrectable logical errors. Logical quantum error mitigation can eliminate this bias, however its standard requirements include prior noise characterization, more complex experiments, and substantial sampling overhead. Although no mitigation technique can simultaneously overcome all three constraints, we demonstrate that the first two---noise learning and need for modified circuits---can be completely bypassed for logical circuits by leveraging only syndrome records. Specifically, we introduce virtual error cancellation: a method that, unlike previous bias-free approaches, operates entirely in classical post-processing on universal quantum circuits. We develop and numerically test end-to-end protocols that reduce the sampling overhead beyond fundamental limitations of existing syndrome-aware mitigation techniques, including syndrome-based postselection. In particular, we propose a scheme that pairs the low-latency decoder used in the experiment with a high-complexity decoder run in post-processing. In numerical simulations of a distance-7 rotated surface code, we show that our full-stack dual-decoder algorithm exhibits an error that diminishes as the number of samples increases, capable of reaching more than three orders of magnitude of suppression compared to the decoded logical error rate in an experimentally achievable setting. These results establish syndrome records as a resource for correcting universal computational estimates after quantum execution.
arXiv·2026-10-08·Alessandro Falco et al.
No generated summary available for this entry.
overview
Original abstract
We determine the two-way quantum and secret-key capacities of the pure-loss channel under an average input photon-number constraint. For transmissivity $η$ and photon budget $N$, both capacities equal $g(N)-g((1-η)N)$, where $g$ is the entropy of a thermal state. This coincides with the rate achieved by the known reverse coherent information of a two-mode squeezed vacuum. Our result provides the last missing capacity formula for the celebrated pure-loss channel, completing the picture of bosonic quantum communication under pure loss.
arXiv·2026-10-08·Yihang Sun, Mary Wootters
No generated summary available for this entry.
overview
Original abstract
We study two problems: Local Leakage Resilience (LLR) for Shamir secret sharing, and worst-case Optimal Polynomial Intersection (OPI). Both problems concern polynomials $Q(X)$ of degree less than $k$, over a prime-order finite field $\mathbb{F}_p$. In LLR for Shamir secret sharing, one asks how much one can learn about $Q(0)$ given a few bits leaked from each of $Q(α_1), \ldots, Q(α_n)$, for distinct non-zero evaluation points $α_i \in \mathbb{F}_p$. In OPI, one is given input list $S_1, \ldots, S_n \subset \mathbb{F}_p$, and wants to find a polynomial $Q(X)$ of degree less than $k$ so that $Q(α_i) \in S_i$ for as many $i$ as possible. Leveraging recent connection between these two problems due to (Sun, Wootters 2026), we improve the state-of-the-art for both problems. For LLR, we show that there is some constant $δ> 0$ so that, as long as $R := k/n \geq 1/2 - δ$, Shamir secret-sharing is one-bit locally leakage resilient (meaning that one can learn only a negligible amount about $Q(0)$). This is the first result to break the so-called "one-half barrier" for LLR, and improves over the previous best known result, requiring $R \geq 0.668$ (Kasser, 2025). For OPI, we give a quantum algorithm that finds a polynomial $Q(X)$ that agrees with at least a $\mathsf{SCL}_ρ(R)-\varepsilon$ fraction of the lists in expectation, for every fixed $\varepsilon>0$, where $\mathsf{SCL}_ρ$ is the \emph{semicircle law} of (Jordan et al., 2025). This improves previous algorithmic (and existential) results of (Jo, 2026) and (Horinaga, Yamakawa, 2026). We also give further improved existential results. We also adapt the hardness result of (Yamakawa, Zhandry, 2024) to apply to OPI (rather than a folded version); over large fields, this gives an unconditional separation between the quantum and classical hardness of OPI relative to a membership oracle.
arXiv·2026-10-08·Catalin-Mihai Halati, Tony Jin, Roderich Moessner
No generated summary available for this entry.
overview
Original abstract
We develop a framework to construct large decoherence-free subspaces with a non-trivial structure. The construction is based on hybrid quantum systems in which quantum matter is coupled to a dissipative bosonic mode. Dissipation imposes a global constraint on the matter by selecting the matter null states in the long-time limit. The decoherence-free subspaces spanned by matter null states can exhibit exotic quantum properties and emergent symmetries that do not characterize the full Liouvillian dynamics. We show how to construct many-body operators with physically interesting null states by employing representation theory of Lie algebras. This approach allows us to choose models based on their underlying algebraic structure. We consider explicitly the example of coupling a lossy optical cavity to the directed tunneling operator of quantum particles in one-dimension. In this case, the symmetries of the decoherence-free subspace originate in an $\mathfrak{sl}(2,\mathbb{C})$ algebra, leading to an exponentially large number of steady states. We characterize the null states for both fermionic and bosonic particles, employing analytical and numerical methods. The states exhibit several properties that underline their complex quantum nature: long-range kinetic correlations and volume-law entanglement. The nonreciprocal nature of the directed tunneling dynamics leads to the emergence in the many-body regime of a symmetry-constrained Liouvillian skin effect. The open light-matter system exhibits a strong symmetry stemming from spinless $η$-pairing algebras. We show how the non-trivial properties of the long-times states emerge in the dissipative dynamics from generic initial states, by performing time-dependent matrix product state simulations. Our framework opens avenues for dissipatively engineering complex quantum correlations and harnessing nonreciprocity in a controlled manner.
arXiv·2026-10-08·Zoha Laraib et al.
No generated summary available for this entry.
overview
Original abstract
Dense-neutrino flavor evolution is a quantum many-body problem whose fully correlated treatment becomes rapidly more expensive with increasing particle number and spatial structure. We develop a \texttt{QCNO} quantum simulation code that maps a inhomogeneous forward-scattering neutrino Hamiltonian with advection and finite-range interactions to TEBD2 product-formula quantum circuits, and connects ideal many-body simulation, backend-aware execution, and fault-tolerant resource estimation within the same physical model. We reproduce the exact many-body evolution of the suppressed mean-field-like transverse fast flavor instability through $N=30$ and show that even a single open-boundary interaction generates Rënyi entanglement and non-stabilizer magic, although noisy backends still produce polarization RMSEs of order $0.1$--$0.3$. The restricted active interaction graph of this problem allows us to estimate the circuit depth and $T$ gate cost through $N=50$ for both NISQ and fault-tolerant approaches. The measured TEBD2 error in our fiducial ideal simulation of order $10^{-3}$ motivates a synthesis tolerance $\varepsilon_{\rm syn}\sim10^{-7}$, corresponding to about $70$ $T$ gates per $R_Z$ rotation. The generated circuit contains $1.4\times10^4$ $T$ gates per qubit for open boundaries (twice that for closed boundaries), requiring an application-level logical-$T$ error target of order $10^{-7}$ for early fault-tolerant architectures.
arXiv·2026-10-08·Hengjian Li, Baisong Sun, Bei Zeng
No generated summary available for this entry.
overview
Original abstract
Full Pauli-basis tomography of an arbitrary $n$-qubit state uses the expectation values of all nonidentity Pauli observables. For multiqubit systems, prior knowledge that the state is pure allows some of these observables to be omitted while retaining uniqueness. We study two resulting notions of uniqueness: whether every pure state is uniquely determined among pure states (UDP), and whether every pure state is uniquely determined among all states, including mixed states (UDA). We derive quartic uniqueness certificates from the fourth elementary symmetric polynomial of operators in the real span of the omitted Pauli observables. An exact quartic identity shows that, for $n$-qubit systems with $n\geq 3$, every pure state is UDA whenever the omitted Pauli observables contain no four distinct operators that commute pairwise and multiply to $\pm I$. For three qubits, this condition is also necessary for UDP, yielding an exact characterization of both UDP and UDA. We further prove that UDP and UDA coincide for any number of qubits whenever the omitted Pauli observables commute pairwise. These results provide directly checkable structural criteria for certifying pure-state tomography from restricted Pauli measurements.
arXiv·2026-10-08·Yuanjing Zhang, Zewen Zhang
No generated summary available for this entry.
overview
Original abstract
Trapped-ion quantum simulators are powerful platforms for exploring many-body physics, yet engineering of arbitrary interaction graphs remains a central challenge. To leverage the intrinsic structure of native motional modes and thereby enhance programmability, a residual-guided optimization protocol is introduced for the systematic design of multi-tone global drive spectra. While the achievable interaction fidelity is fundamentally bounded by the available motional modes, this adaptive strategy converges on the theoretical limit using a number of laser tones that scales nearly linearly with system size. The versatility of this method enables the synthesis of both long-range and traditionally difficult short-range coupling topologies. Additionally, by incorporating a penalty for residual motional excitation, the algorithm effectively mitigates errors associated with incomplete closure of phase-space trajectories. Overall, this scalable framework significantly expands the programmable capabilities of trapped-ion architectures while maintaining low computational overhead and high potential for experimental implementation.
arXiv·2026-10-08·M. Paulet et al.
No generated summary available for this entry.
overview
Original abstract
Witnessing entanglement between electrons propagating in quantum circuits requires accessing their two-electron coherences, which encode the two-particle quantum correlations generated by Coulomb interactions. Yet, experimental reconstruction of two-electron coherence remains a major challenge. We introduce photo-assisted two-electron tomography, a quantum coherence reconstruction protocol from dc-currents and time-averaged current correlations, routinely measured in electron quantum optics experiments. Driving an energy filter with a small rf tone encodes off-diagonal coherences in the frequency domain into the dc-current response, enabling single-electron tomography without resorting to current-noise measurements. Extending it to two channels, current correlations after two photo-assisted filters reconstruct the two-electron Wigner distribution and isolate its irreducible two-body part. When applied to Coulomb-coupled quantum Hall edge channels, the protocol reveals interaction-induced energy entanglement. Signatures of this entanglement are visible through the violation of an entanglement witness based on Cauchy-Schwarz inequalities, as well as Wigner function negativities, which remain resolved above the thermal background for realistic device parameters. A generalized Franson geometry further extends the approach to intra-channel two-electron coherences. This opens a direct pathway to detect and characterize electronic entanglement in ballistic quantum circuits.
arXiv·2026-10-08·Chanaprom Cholsuk, Tobias Vogl
No generated summary available for this entry.
overview
Original abstract
Establishing the microscopic origin of localized emission in two-dimensional materials through consistent agreement between experiment and theory remains challenging. Recent STM/STS-STML measurements assigned an emission near 1.8 eV in monolayer MoS$_2$/hBN(2L)/graphene to the negatively charged CH$_\mathrm{S}^{-}$ defect. However, a comprehensive theoretical description of this emitter is still lacking. Here, we develop such a description and systematically investigate the photophysical properties of CH$_\mathrm{S}^{-}$ in monolayer MoS$_2$, two bilayer configurations, and a MoS$_2$/hBN heterostructure. The defect retains a similar local geometry and favors a singlet ground state in all four environments, whereas its electronic transition, zero-phonon line, electron-phonon coupling, radiative lifetime, and transition-dipole orientation depend strongly on the surrounding layers. The isolated-monolayer model exhibits substantial structural reorganization and produces a broad, dominant phonon sideband that is inconsistent with experiment. Adding an adjacent layer, either MoS$_2$ or hBN, substantially suppresses the phonon sideband, with only a minor dependence on the defect position in bilayer MoS$_2$. In particular, the MoS$_2$/hBN model yields a weak phonon sideband and closely reproduces the experimental photoluminescence lineshape. Our results thus provide the first theoretical agreement of CH$_\mathrm{S}^{-}$ emission and further reveal the role of adjacent layers in determining the electronic, vibronic, and optical properties of the quantum emitters in two-dimensional materials.
arXiv·2026-10-08·Sylvain Carrozza, Johann Chevrier, Luca Lionni
No generated summary available for this entry.
overview
Original abstract
The entanglement structure of a bipartite pure state is characterized by its entanglement spectrum, or equivalently, by the family of Rényi-$k$ entanglement entropies with integer $k$. Taking the difference of two such entropies defines a quantity known as an entanglement spread, that is monotonous under local operations, and that vanishes if and only if the entanglement spectrum of the state is flat. We introduce a multipartite generalization of this notion which, for a fixed number $D\geq 3$ of parties, results in a collection of maps indexed by pairs of $D$-edge-colored graphs (obeying some condition). Each member of this collection takes the form of a difference of two multipartite Rényi entanglement entropies, each associated to a local unitary polynomial invariant (known in this context as a trace-invariant), and is shown to be monotonous under local operations. We then argue that a previously introduced family of so-called hypergraph-tensor (HT) states can be understood as a multipartite counterpart to the family of flat bipartite states. Indeed, we first prove that, when $D=3$, a tripartite pure state is HT if and only if it minimizes a particular (infinite) family of entanglement spreads. Second, we embed the set of HT states into the much larger family of spectral hypergraph-tensor (SHT) states, defined by a new Ansatz we introduce. We then prove that HT states can be uniquely characterized as the minimizers of some fixed entanglement spread among SHT states, for arbitrary $D\geq 3$. We also investigate SHT states in their own right: in particular, we characterize their orbits under local unitary transformations. Finally, along the way, the asymptotic large-$N$ expectation values of a number of entanglement spreads are computed in the Haar-random state of local dimension $N$.
arXiv·2026-10-08·Sanchari Chakraborti et al.
No generated summary available for this entry.
overview
Original abstract
We propose and experimentally demonstrate an asymmetric key-generation scheme in which public and private keys are derived from a six-qubit photonic entangled state. A six-qubit entangled state is generated from two photons, each carrying one polarization and two path qubits. The state is prepared in an equal superposition of eight of the sixty-four six-qubit basis states, in which each photon's three qubits form a codeword of the classical [3,2,2] even-parity code, and are distributed between the two parties, Alice and Bob. This ensures, each triple is a uniformly random codeword and the two codewords are locked together through the correlation. The parity constraint is a local stabilizer, so each party verifies it on its own data every round, and eliminates the bit flip errors arising from imperfections, detector dark counts and multiple occupancy before it enters the raw key. A single publicly announced bit, chosen at random from either of the path qubits, allows each party to reconstruct the other's full triple while leaking no information to third party. We realize the desired six-qubit state using a Sagnac-based type-II SPDC source, reporting a Bell-CHSH parameter S = 2.798 +/- 0.008, by implementing gate operation on polarization and path degree's of freedom. This approach provides a physics-based alternative to public-key cryptosystems built on computational hardness assumptions. A t-bit string generated from multiple rounds for encryption will be intrinsically random. Without the private key, one needs at least O(2^t) runs on an t-qubit quantum system to find the matching bit to decrypt.
arXiv·2026-10-08·Trond Hjerpekjøn Haug et al.
No generated summary available for this entry.
overview
Original abstract
Superconducting quantum circuits underpin large-scale quantum processors and are increasingly interfaced with optical systems, yet they are vulnerable to quasiparticle poisoning from high-energy radiation and optical fields. Gap engineering of Josephson junctions suppresses quasiparticle-induced relaxation, but quasiparticles near the junction can still shift the qubit frequency and cause phase errors. Here, we extend gap engineering beyond the junction using a flux-tunable transmon with a gold-on-niobium ground plane and island and strongly gap-engineered aluminum junctions designed to keep quasiparticles away from the junction leads. Compared with an all-aluminum transmon with nominally identical junctions, we demonstrate that the niobium device withstands more than an order of magnitude higher near-infrared optical power before excess relaxation appears. The Nb transmon shows no resolvable quasiparticle-induced frequency shift over the same power range. At the same time, we observe that dephasing and state-preparation-and-measurement infidelity increase with optical power even while relaxation remains protected. These results suggest that engineering the quasiparticle energy landscape beyond the junction can substantially increase qubit resilience, not only to radiation-induced error bursts, but also to nearby optical fields.
arXiv·2026-10-08·Katharina Laubscher, Jay D. Sau, Sankar Das Sarma
No generated summary available for this entry.
overview
Original abstract
A recent experiment [arXiv:2507.08795] has reported measurements of the interwire $X$-parity lifetime in a Majorana tetron device via the quantum capacitance of an auxiliary readout dot. Motivated by these measurements, we theoretically study the interwire parity lifetime in a minimal model of the coupled dot-tetron system subject to electrostatic noise. We show that coupling to the measurement dot can itself strongly modify the parity dynamics by generating an energy splitting that shifts noise-induced transitions to finite frequency and thereby stabilizes the measured states against low-frequency fluctuations. For representative noise strengths motivated by disordered nanowire devices, we find $X$-parity switching lifetimes of order microseconds in the measurement configuration even when the corresponding bare-tetron coherence time is only tens of nanoseconds long. We analyze both the dispersive regime, where the dot can be integrated out and the dynamics reduces to an effective two-level system, and the near-resonant regime, where all four low-energy states participate. In the latter case, rapid transitions organize the spectrum into two long-lived manifolds that approximately correspond to sectors of the combined dot-tetron $X$-loop parity, yielding effective two-state switching despite the underlying multilevel structure. Our results show that measurement-induced stabilization can substantially enhance the observed $X$-parity switching lifetime, such that the lifetime measured under continuous readout can greatly exceed the intrinsic idle $T_2^*$ coherence time of the isolated Majorana tetron qubit.
arXiv·2026-10-08·Reece Robertson, Sejal Patil, Sebastian Deffner
No generated summary available for this entry.
overview
Original abstract
Quantum networking represents the future of secure communication, enabling fundamentally new capabilities through quantum information exchange. However, these networks require secure, high-fidelity quantum communication channels, and they require every participating node to be a genuine quantum device. Currently, there is no reliable method to verify whether clients entering a quantum network truly possess quantum computational capability and are connecting over robust channels. In this work, we introduce a client-validation protocol that functions as a proof-of-quantum-capability handshake. Our protocol secures a quantum network against classical spoofers, noisy quantum computers, and genuine quantum devices connecting with the network over noisy or insecure channels. We validate the efficacy of this protocol through numerical simulations under erasure, dephasing, and depolarizing noise models.
arXiv·2026-10-08·W. Michael Brown et al.
No generated summary available for this entry.
overview
Original abstract
Quantum programming requires concepts and intuition that differ substantially from those used in traditional programming languages. Multiple quantum programming frameworks address these requirements through different abstractions and execution models, creating tradeoffs in programmability, portability, and performance. Because quantum software is less prevalent in the training data available to large language models, autonomous coding agents might be expected to face additional challenges when working with these frameworks. We present a case study in autonomous migration of the QED-C Application-Oriented Benchmarks from Qiskit to CUDA-Q. Opus, GPT, and Gemini models were each tasked with porting thirteen benchmark methods spanning foundational algorithms, amplitude estimation, Monte Carlo methods, variational optimization, linear-system solving, and factoring. In all cases, the models were able to generate satisfactory ports with little direct coding help and there was a drastic reduction in the time required compared to a human engineer. However, in all cases, the agents resorted to shortcuts when implementation challenges surfaced and multiple prompts were required to force appropriate coding directions. Assessment of the generated implementations showed that no single model consistently produced the best port across all benchmarks, indicating that multi-agent ensemble strategies could mitigate challenges associated with quantum software. The effort resulted in publicly available, near-complete CUDA-Q support in the QED-C benchmarks along with model-generated skills designed to improve agent performance when implementing CUDA-Q applications. When tested on an unseen benchmark, these skills reduced the required model turns by up to 85% and token usage by up to 96%. We conclude by distilling lessons from the case study.
arXiv·2026-10-08·Hao-Yu Sun
No generated summary available for this entry.
overview
Original abstract
Which pure states give uniform outcomes in several mutually unbiased measurements, and when can they form another measurement basis? We distinguish common unbiased states, their orthonormal completion, and further extension. For a displayed phase-deformed Fourier pair in dimension $2m$, a clock symmetry and skew antiunitary complete every prescribed common unbiased state to an explicit orthonormal basis. In dimension six, an amplitude-profile obstruction proves strong unextendibility of a given mutually unbiased triple when its original third-basis rays are invariant under the ternary clock. We give an exact nonproduct example and an application to a companion whose columns are localized at single Fourier frequencies. For every exact Hadamard matrix in a specified closed entrywise neighborhood of a fixed reference matrix, the coordinate and Hadamard bases have exactly 48 common unbiased rays but no third measurement basis, with a quantitative lower bound on the squared Gram defect of every six-column candidate. We also study auxiliary complex equations for common states, retaining algebraic multiplicities. For a flat unitary of order six with all $3\times3$ minors nonzero, the projective ray scheme is finite; each singular two-minor contributes two reduced isolated boundary points, and the affine coordinate algebra is finite-dimensional over $\mathbb{C}$. In every order, a critical-algebra identity preserves multiplicities; in dimension six it gives finiteness for a fixed phase fibre. Specialization over a discrete valuation ring controls complete reciprocal-orthogonal collections. A nonphysical Tao/Potts collection separates algebraic from physical solutions. These results do not determine the global maximum number of mutually unbiased bases or classify all triples.
arXiv·2026-10-08·Jack Waller et al.
No generated summary available for this entry.
overview
Original abstract
Quantum machine learning, and quantum neural networks (QNNs) in particular, are advancing fields with growing potential. Although systematic comparisons of QNN configurations have been explored primarily for classification tasks, comparatively little attention has been given to regression problems, particularly financial time series forecasting. This study presents a large-scale systematic comparative evaluation of QNN component configurations for financial time series forecasting, using the GBP/USD spot exchange rate as a case study. A grid search across encoding methods, ansatz designs, qubit counts, layer depths, and cost functions yields 1,368 distinct model configurations, each evaluated in terms of prediction accuracy, computational cost, and convergence behaviour. The results reveal unique insights into how the choice of methods influences performance, such as that gate selection and arrangement are more critical to model success than raw parameter count, and that entanglement is a system-level property of the full circuit rather than solely at the ansatz level. The best-performing QNN configuration achieves an $R^2$ score of 0.985, outperforming a classical BiLSTM baseline. Additionally, the impact of real quantum hardware noise is assessed through execution on the IQM Emerald device, revealing that gate errors and decoherence represent a significant barrier to practical deployment, with gate selection and circuit depth identified as key determinants of hardware noise resilience. Overall, the findings provide practical architectural guidance for QNN design and establish a baseline characterisation of QNN noise sensitivity on near-term quantum devices.
arXiv·2026-10-08·A. N. Khondker
No generated summary available for this entry.
overview
Original abstract
We establish a rigorous functional-analytic framework for the imaginary component $p_I$ of the complex weak momentum $p_Q = p_R + ip_I = \frac{\hbar}{i}\nabla\lnψ$. For every wavefunction in the Sobolev space $H^1(Ω)$, including those with nodal sets, we prove that the expectation value of $p_I$ vanishes identically, as a consequence of the regularity of $ρ= |ψ|^2$ and without appeal to the polar form $ψ= Re^{iS/\hbar}$. We further show that \textnormal{(i)} the Bohm quantum potential arises entirely from $p_I$ and satisfies $\langle V_{\mathrm{qu}}\rangle = \langle p_I^2\rangle/2m$, from which the known Fisher information relation follows as a corollary; \textnormal{(ii)} the group velocity of a Bloch band is the density-weighted average of $p_R/m$, with no contribution from $p_I$; \textnormal{(iii)} the decomposition is gauge-invariant under magnetic minimal coupling, the vector potential acting only on $p_R$; and \textnormal{(iv)} the results extend to curved Riemannian manifolds.
arXiv·2026-10-08·Jialiang Tang et al.
No generated summary available for this entry.
overview
Original abstract
Protecting quantum information from noise is essential for reliable quantum computation and quantum memories. Quantum state purification addresses this challenge by processing multiple noisy copies of an unknown quantum state to produce an output state of higher fidelity. Here we establish nearly tight upper and lower bounds on the non-Clifford resources required to implement the symmetric-projection purification protocol. For $n$ copies of a $d$-dimensional system, we construct a Clifford+T circuit that block-encodes the symmetric projector with operator-norm error at most $ε$ using $\widetilde{O}(n)$ T gates, where the tilde-$O$ notation suppresses polylogarithmic factors in $n$, $d$, and $1/ε$. Conversely, using stabilizer nullity, we prove that any Clifford+T implementation of such a block encoding with error $ε<\frac{1}{2}\sqrt{1-1/n}$ requires at least $2n-2$ T gates, even allowing arbitrary positive normalization and clean stabilizer ancillas. Taken together, these results establish the nearly optimal scaling of non-Clifford cost with the number of copies and uncover the fundamental resource requirements for coherent symmetry projection in quantum state purification.
arXiv·2026-10-08·Quanhui Zhu, Zhenning Cai
No generated summary available for this entry.
overview
Original abstract
Developing general-purpose numerical methods for non-Markovian quantum state diffusion has long been a challenge in the simulation of open quantum systems. This paper proposes a deterministic polynomial chaos Galerkin method, which is easy to implement, accurate, and efficient. By combining a low-rank decomposition of bath correlations with Galerkin projection onto a polynomial chaos basis, the method yields a deterministic formulation compatible with standard numerical solvers for partial differential equations. The reduced density matrix is obtained from a single deterministic solve at a cost comparable to that of computing one stochastic hierarchy trajectory. Replacing an ensemble of $N_{\mathrm{traj}}$ trajectories therefore reduces the computational cost by approximately a factor of $N_{\mathrm{traj}}$ and eliminates statistical sampling error. Benchmark comparisons show that the proposed method achieves smaller errors at lower computational cost than the tested stochastic hierarchy methods. Applications involving nonquadratic potentials, diffraction and interference, and coupled three-dimensional dynamics demonstrate its ability to handle challenging problems.
arXiv·2026-10-08·Grachik A Simonian, Alexey G. Mikhaylenko, Andrew G. Semenov
No generated summary available for this entry.
overview
Original abstract
In this work, we theoretically investigate the non-equilibrium evolution of the correlation functions of a quantum scalar field following a mass quantum quench in a finite-size system. The self-consistent equation for the Keldysh (statistical) correlation function is solved numerically in the one-loop approximation. A specific spatio-temporal effect is observed: at a point in time approximately equal to half the system size, the effective mass experiences a strong disturbance. It is shown that this effect is driven by the interference of counter-propagating wave fronts of fluctuations that propagate within the light cone and is induced by periodic boundary conditions.
arXiv·2026-10-08·Gabriele Lo Monaco et al.
No generated summary available for this entry.
overview
Original abstract
Quantum fidelity kernels and quantum extreme learning machines share the same basic architecture: a fixed quantum device generates features that are combined through a classically trained linear model. We refer to this broad non-variational setting as quantum linear regression. A defining aspect of these models is that the quantum features are not directly available, but must be estimated from a finite number of shots. We show that finite statistics makes quantum linear regression unavoidably ill-conditioned. Ideal feature vectors are confined to a subspace determined by the dimension of the Hilbert space, whereas finite-shot estimates generically acquire components outside this subspace. Training then attempts to fit directions that disappear in the infinite-statistics limit, making the learned model increasingly sensitive to sampling noise. We analyze this mechanism for quantum extreme learning machines trained on $n_{\rm tr}$ states with $N$ shots per state. Despite the ill-conditioning, predictions remain controlled when the training targets are exact. Finite sampling produces a systematic prediction error that decreases quadratically with $N$, while fluctuations induced by the random training measurements decrease inversely with the total training budget. Thus, unlike in standard linear regression with exactly known features, increasing the dataset size alone cannot remove the error caused by sampling noise. If the training targets are also noisy, due for instance to state-preparation errors, the otherwise hidden directions become active. The test error can then increase with $N$, a behavior that we ascribe to a form of quantum overfitting. Our results expose a fundamental tradeoff between dataset size and per-state statistics in non-variational quantum learning and provide a baseline for resource-aware training and regularization strategies.
arXiv·2026-10-08·Isaac Barouch Essayag, Aryeh Lev Zabokritskiy
No generated summary available for this entry.
overview
Original abstract
The $2\times3$ magic rectangle is a nonlocal game in which two players match entries subject to incompatible parity constraints. We prove that its quantum value is $(1+\sqrt{2/3})/2$ and classify all optimal strategies in arbitrary finite local dimensions, allowing general measurements. Every optimal strategy contains a maximally entangled pair of four-dimensional systems, with fixed measurements on the local state supports up to local isometries and ancillary systems. The attaining construction was previously known from quantum random access codes. An exact sum-of-squares identity gives the upper bound, and its equality relations determine the measurement algebra needed for the classification. The rectangle determines the largest magic-square score compatible with perfect prediction of Alice's first row by an adversary with quantum side information. We classify all finite-dimensional strategies attaining this score with perfect prediction and show that one minus the best compatible guessing probability has linear order in the score excess above it. The same rigidity theorem classifies all optimal three-bit random access codes that hide the full input parity.
arXiv·2026-10-08·Ayan Patra, Beatrix C. Hiesmayr
No generated summary available for this entry.
overview
Original abstract
Absolutely positive partial transpose (APPT) states, which remain PPT under every global unitary, provide a spectral relaxation of absolutely separable states, which remain separable under every such transformation. Despite substantial progress, whether these two notions coincide beyond qubit-qudit systems remains unresolved, motivating the study of structured state families in which the APPT spectral constraints and separability can be analyzed exactly. We study this problem for Bell-diagonal states in two settings: the standard two-qutrit Weyl-Heisenberg basis and the two-ququart lattice basis generated by two-qubit Pauli operators. In the two-qutrit case, we show that a linearized necessary condition for APPT defines a polytope of spectra in which every associated Weyl-Heisenberg Bell-diagonal state admits an exact decomposition into explicitly separable states. This yields a separability criterion that applies to a region even larger than the APPT set itself. In the two-ququart lattice Bell-diagonal setting, we show that a state remains PPT under every permutation of its Bell coefficients if and only if its six largest Bell coefficients sum to at most 1/2, and we prove that all such states are separable. Equivalently, every entangled lattice Bell-diagonal state becomes NPT after a suitable coefficient permutation and is therefore not APPT. The proofs combine convex-polytope analysis, affine and symplectic orbit reductions, and exact rational decompositions into separable states supported on affine Lagrangian subsets. Our results rule out entangled APPT states in both Bell-diagonal families, and provide simple spectral inequalities as sufficient criteria for separability in both cases. Being basis-specific, however, they do not by themselves settle whether APPT and absolute separability coincide.
arXiv·2026-10-08·Dong-Ping Xuan et al.
No generated summary available for this entry.
overview
Original abstract
We introduce the unitary-accessible coherence-erasure distance, which measures the minimum unitary-control cost required to transform a quantum state into an incoherent state without changing its spectrum. The target states are restricted to incoherent states on the same unitary orbit, leading to a geometry different from conventional state-space proximity. We establish inequalities relating orbit-restricted quantum transport, Bures geometry, and the unitary-control distance. These quantities coincide for pure states but can differ for mixed states. For qubits, we derive an exact expression and show that, in the nondegenerate case, the coherence-erasure cost depends on the eigenbasis orientation rather than on the eigenvalues. For nondegenerate qutrits, we reduce the problem to an optimization over the monomial unitary group. We derive the tight universal bound $\arccos[(2\sqrt2-1)/4]$ and construct an explicit eigenbasis that attains it. The resulting distance also determines the minimum coherence-erasure time under bounded unitary driving, giving it a direct operational meaning.
arXiv·2026-10-08·Sidhartha Chatterjee et al.
No generated summary available for this entry.
overview
Original abstract
We investigate the effects of quantum geometry on the motion of magnon wave packets in one-dimensional quantum spin chains. In contrast to fermionic systems, where transport phenomena driven by the quantum metric have been extensively studied, we show that the dynamics in bosonic magnon systems are strongly affected by the symplectic structure and the pseudo-unitarity of the transformation of the magnon Bogoliubov-de Gennes Hamiltonian. A chiral soliton lattice provides a setting in which the symplectic quantum metric strongly influences the longitudinal magnon dynamics. We derive the semiclassical response of a magnon wave packet in such a system to a weak, slowly varying perturbation and demonstrate that the wave packet velocity acquires a geometric contribution proportional to the momentum derivative of the symplectic quantum metric, which dominates over the conventional group velocity for a nearly flat band. Solving the resulting equations of motion, we obtain a bounded trajectory in real time with a phase-space area determined by the symplectic quantum metric.
arXiv·2026-10-08·Anjali Waghmare, Yu Tian, Renaud Lambiotte
No generated summary available for this entry.
overview
Original abstract
Structural measures such as the clustering coefficient and the average shortest-path length characterise how a network is organised. These measures are typically formulated for real, non-negative edge weights. A class of quantum and photonic architectures has complex edge weights instead, whose phases determine whether alternative routes interfere constructively or destructively. These architectures are also bipartite, so triangles are absent and the smallest closed cycle is a four-node square. Existing measures address complex weights and bipartite structure separately: bipartite clustering coefficients quantify clustering through four-node squares but do not contain phase information, while interferometric coefficients retain phase but are defined on triangles. In this work, we define a clustering coefficient for complex-weighted bipartite networks which reduces to the classical bipartite coefficient when the phases vanish, becomes negative when alternative routes cancel, and can be obtained for all nodes from a single sparse matrix product. We show that the phase accumulated around a square is the smallest gauge-invariant carrier of structural phase information in a bipartite network. The clustering coefficient factorises into a topological contribution and a phase contribution, making a bipartite Watts--Strogatz ensemble analytically tractable. For phases uniformly distributed on $[-Δ,Δ]$, the mean phase contribution is $(\sinΔ/Δ)^4$, independent of node, degree, and topology. We also derive closed-form expressions for the clustering coefficient, open-path visibility, and phase variance. We numerically verify these predictions and further show that phase disorder increases coherent distance.
arXiv·2026-10-08·H. Shen et al.
No generated summary available for this entry.
overview
Original abstract
We investigate a cavity--atom system beyond the rotating-wave approximation and recast its dynamics as an effective tight-binding problem in the excitation-number basis. The same experimentally relevant light--matter platform exhibits two distinct regimes controlled by the photon number. In the large-photon-number regime, the hopping amplitudes become nearly uniform and the effective lattice reduces to a dimerized SSH-type chain subject to a linear energy gradient. The spectrum then organizes into one or two Wannier--Stark ladders, giving rise to controllable Bloch and Bloch--Zener oscillations and quantitatively explaining the observed revival patterns. In the small-photon-number regime, the intrinsic $\sqrt{\bar n+(\cdots)}$ dependence produces a pronounced hopping deformation, namely dimerized couplings that increase along the excitation-number lattice. This deformation reshapes the density of states, enhances collective localization, and generates an energy-resolved spatial bias of the eigenstates. The corresponding real-time dynamics displays direction-dependent anomalous diffusion together with Bloch-like revivals and beat phenomena in selected parameter windows. Our results show that the same cavity--atom platform can realize both emergent ladder spectra and hopping-induced localization in excitation-number space.
arXiv·2026-10-08·Xin-Ze Song, Xiao-Li Huang, Shu-Min Wu
No generated summary available for this entry.
overview
Original abstract
We investigate the redistribution and directional properties of Gaussian tripartite quantum steering in de-Sitter space within the continuous-variable framework. By expressing the Bunch-Davies vacuum in terms of the open-chart modes through a Bogoliubov transformation, we derive the covariance matrix of the resulting multipartite Gaussian state and analyze both one-to-two and two-to-one steering configurations. We find that de-Sitter curvature generally suppresses the steering initially shared among the accessible modes, but its influence depends strongly on the steering direction. In particular, while some steering configurations undergo sudden death at finite curvature, two-to-one steering toward a nongravitational mode remains finite throughout the parameter range considered, demonstrating a robustness of tripartite steering absent in its bipartite counterpart. Remarkably, the maximum steering asymmetry occurs at the critical point at which steering in one direction undergoes sudden death, marking the transition from two-way to one-way steering. We further show that the de-Sitter gravitational field can generate tripartite steering involving modes separated by the cosmological horizon. Depending on the steering partition, this curvature-induced steering exhibits persistent one-way or asymmetric two-way behavior, as well as a sudden-birth transition from one-way to two-way steering. These results demonstrate that de-Sitter curvature not only degrades preexisting quantum correlations but also redistributes and generates directional multipartite steering across causally disconnected regions.
arXiv·2026-10-08·Louis Hanotel
No generated summary available for this entry.
overview
Original abstract
While the Bloch sphere provides a canonical geometric representation for qubits, its generalization to pure qudit states ($d>2$) is not unique. This representation can be extended following two different approaches: increasing the number of points, as in the Majorana representation, or using a single point but in a space of larger dimension, as in the generalized Bloch representation. In this work, we compare these representations of pure qudit states by finding explicit analytical relations between them. In particular, a general formula of the Bloch vector in terms of the Majorana points of a given state is provided. We also analyze some suitable extensions of these representations in the case of pure permutation-symmetric two- and three-qubit states, deriving the corresponding relation between them. These analytical results allow us to study, from a geometric point of view, quantum correlations of special classes of two-qubit states.
arXiv·2026-10-08·Rashi Kaimal, Roderich Tumulka
No generated summary available for this entry.
overview
Original abstract
In quantum mechanics, among the proposals for how to compute the probability distribution of detection time and place along a given spatial surface or in a given volume, two leading candidates involve absorbing boundary conditions (ABCs) and complex absorbing potentials (CAPs) for the Schrödinger equation. Here, we extend earlier results on how the two are related. It was previously shown that ABCs arise as a limiting case of CAPs, but for that a (reflecting) Neumann boundary condition was assumed at the end of the region with the CAP. Here, we obtain ABCs in a different limit using a Dirichlet boundary condition at the end of the CAP region, which seems more practically relevant and realizable.
arXiv·2026-10-08·Xiao Xiao et al.
No generated summary available for this entry.
overview
Original abstract
Achieving and quantifying ultrastrong magnon-magnon coupling (USC) remains a key challenge for quantum magnonics. Here, we demonstrate widely tunable USC between chiral (right- and left-handed) and acoustic or optical magnon modes in the van der Waals antiferromagnet $CrPS_4$. Using a full quantum model, we decompose the interaction into three microscopic interaction channels: the co-rotating term $g_1$ (mode hybridization), the counter-rotating term $g_2$ (two-mode squeezing), and, uniquely in the chiral regime, the self-squared term $g_3$ that mediates single-mode squeezing. The normalized coupling ratio reaches $g/f_g$ $\sim$ 0.41, entering the USC regime. Most significantly, we establish a complete protocol linking these USC parameters to a measurable quantum phenomenon: a squeezed magnon vacuum state. Our simulations not only visualize the chirality and polarization evolution of the hybrid modes but also demonstrate how to directly extract quadrature fluctuations and a substantial squeezing factor (up to $\sim$ 9.7 dB) from thermal noise-driven magnetization dynamics. This work provides a material-specific quantum framework for USC and a practical pathway to detect and exploit non-classical magnon states in low-damping two-dimensional magnets, opening a route toward quantum-enhanced spintronics and hybrid quantum information platforms.
arXiv·2026-10-08·Hoong Chuin LAU
No generated summary available for this entry.
overview
Original abstract
Near-term quantum approaches to combinatorial optimization are limited by qubit counts, circuit fidelity, sampling cost, and the difficulty of encoding constraints, while machine learning is increasingly used to configure and control quantum optimization workflows. We call such workflows adaptive: decisions conventionally fixed in advance, from formulation and penalties to shot budgets, backends, and whether to invoke a quantum processor at all, are made by learned policies that respond to the instance, the progress of the solve, or the hardware. This review examines three paradigms, AI for quantum optimization, quantum for AI-driven optimization, and AI-quantum co-optimization, and organizes the literature by the decision being learned rather than by application. A structured review of 119 papers, 67 coded in detail, shows that the evidence is considerably stronger for AI-assisted quantum optimization than for the reverse direction: learning already reduces quantum evaluations, improves initialization, supports decomposition and penalty control, and mitigates noise, whereas evidence that quantum computation improves learned optimizers remains largely confined to small-scale simulation. Experimental controls are thin: 25 of 57 studies include no classical baseline, the quantum contribution is fully isolated in 10 of 24 studies where an ablation applies, and the median experiment uses 17 qubits. We introduce an M0-M5 evidence hierarchy, from simulation to matched-resource practical advantage, and find no broadly convincing result at the highest level. We argue that scaling is increasingly a systems problem: the question is not only whether a problem fits on a quantum processor, but how classical and quantum resources should be allocated across the optimization process. The review is aimed at researchers in quantum computing, machine learning, and operations research.
arXiv·2026-10-08·Jorja Kirk, Ashley Montanaro
No generated summary available for this entry.
overview
Original abstract
The Quantum Approximate Optimization Algorithm (QAOA) is a variational quantum algorithm used for solving combinatorial optimization problems, which is thought to be a promising application of near-term quantum hardware. However, high rates of noise in these devices can obscure meaningful results. Therefore, it is crucial to understand and suppress the effects of noise on the algorithm's output. Here, we find that the stability of the algorithm in the presence of noise is dependent on its variational parameters. Using a Pauli noise model, we derive an upper bound on the total variation distance between the noisy and noiseless circuit output as a function of these parameters. Results from noisy simulations support this bound and give insight into the best methods to use for parameter generation in the presence of noise. We also introduce new methods of optimization using error penalties and truncated search based on this bound to manufacture error resilience. We extend this analysis to the quantum adiabatic algorithm (QAA) by taking the continuous limit of the QAOA.
arXiv·2026-10-08·Sameernandan Upadhyayula, Jiří J. L. Vaníček
No generated summary available for this entry.
overview
Original abstract
We present a non-perturbative framework for the quantum treatment of vibrational excitation in molecular systems driven by electric fields with arbitrary time dependence. For harmonic potentials with linear dipole coupling, the field-induced dynamics is exactly described by a displaced coherent state, whose evolution is completely determined by a complex phase-space coordinate. Closed-form expressions for this coordinate reveal a clear distinction between resonant and non-resonant regimes. The resulting vibrational populations follow a Poisson distribution determined by a dimensionless time-dependent phase-space displacement, for both resonant and non-resonant driving. Resonant driving results in an enhanced phase-space displacement, whereas finite detuning between the driving and vibrational frequencies leads to an exponential suppression of the phase-space displacement and vibrational excitation. While the approach reduces to the standard time-dependent perturbation theory in the weak-field limit, it remains valid in the strong-field regime, where perturbative treatments fail. Our results provide a transparent phase-space picture of vibrational control and enable non-perturbative state preparation in ultrafast spectroscopy.
arXiv·2026-10-08·Campbell K. McLauchlan et al.
No generated summary available for this entry.
overview
Original abstract
Large quantum computations require high-fidelity error-corrected memory and fault-tolerant logical operations. To achieve these with superconducting circuits, quantum processors will need many components operating with low error rates. In practice, fabrication of monolithic superconducting devices produces unavoidable heterogeneity in component performance, which the quantum computer must accommodate. We implement strategies to operate a large dynamic compass code on an array of 156 superconducting qubits arranged on a heavy-hexagonal lattice, making use of the entire monolithic quantum processor and redesigning our measurement schedule to exclude underperforming components. We demonstrate improvements of up to $35\%$ in logical error probabilities for a memory experiment by using a noise-informed decoder combined with strategies to exclude the worst-performing qubits and couplers, along with post-selecting on shots with a low probability of leakage errors. In addition to these memory results, we also observe performance gains of up to $56\%$ when these strategies are applied to measurement-based logic, demonstrated by stability experiments. We furthermore demonstrate high-fidelity fault-tolerant logic through lattice surgery. Through pre-selection filtering techniques, we can obtain Bell fidelities above $77\%$, and further logical gap post-selection using exclusive decoding increases these fidelities to above $97\%$. Our experiments demonstrate that high performance can be maintained in key elements of fault-tolerant quantum memory and logic when working on monolithic superconducting quantum processors with underperforming components, by using a suite of noise-informed quantum error correction strategies.
arXiv·2026-10-08·Jyotiprakash Parhi, Ayan Majumder, Kasturi Saha
No generated summary available for this entry.
overview
Original abstract
Quantum optical sensing has evolved from isolated solid state spin defect platforms to increasingly bio-integrated systems designed for biomedical applications. This review presents a perspective on this transition, spanning nitrogen vacancy centers in diamond to emerging fluorescent protein based spin qubits. Advances in diamond fabrication have enabled photonic cavities, nanomechanical resonators, and microstructured devices that enhance spin photon interactions and room temperature sensitivity. Exploration of spin defects in alternative materials further expands the sensing landscape. Parallel progress toward biological compatibility includes chip based architectures for in vitro and in vivo studies, microfluidic integration, and minimally invasive nanodiamond probes capable of intracellular nanothermometry and nanorheometry. Improvements in surface functionalization have enhanced coherence and sensing reliability in complex environments. Collectively, these advances highlight the progress and remaining challenges toward application oriented quantum sensing for the life sciences.
arXiv·2026-10-08·Debabrata Ghorai, Taewon Yuk, Sang-Jin Sin
No generated summary available for this entry.
overview
Original abstract
We study dielectric properties of holographic insulators from the quantum geometry of the ground state. We realize the insulating state by the pseudoscalar interaction of holographic fermions and calculate the fermionic Green function to extract the effective hamiltonian. We then derive the quantum metric and Berry curvature to compute the transports and finally get the dielectric constant from the imaginary part of conductivity.
arXiv·2026-10-08·Zan Cao et al.
No generated summary available for this entry.
overview
Original abstract
We investigate spin-outcome correlations and memory-assisted entropic uncertainty in tree-level Bhabha scattering, where an incident electron $A$ scatters with a positron $B$ initially entangled with a spectator electron $C$. For the fixed-angle post-selected final state, we compare the total memory-assisted uncertainty $U_A$ for three alternative Pauli measurements on $A$ with the entanglement entropy $S(ρ_A)$ across the $A|BC$ partition. We resolve $U_A$ into the separate uncertainties $U_B$ and $U_C$ and evaluate the corresponding outcome-memory mutual-information sums $G_B$ and $G_C$. This separates changes in the randomness of the outcomes on $A$ from changes in their correlations with each memory. In the parameter regions studied, enhanced $A|BC$ entanglement is accompanied by lower $U_A$, most prominently near high-energy backscattering. An analytic treatment of this limit shows that $B$ factorizes from $AC$: $G_B$ vanishes, whereas $G_C$ increases with the initial $B$-$C$ entanglement. An entropic complete complementarity analysis characterizes the accompanying loss of local helicity predictability in $ρ_A$ and changes in the coherence, predictability, and mixedness of the interacting pair $ρ_{AB}$. These results show that initial $B$-$C$ entanglement can lower the total memory-assisted uncertainty in high-energy backscattering by strengthening spin-outcome correlations with the spectator $C$, thereby identifying the distinct roles of the interacting particle and the spectator as quantum memories.
arXiv·2026-10-08·Jinhao Jia et al.
No generated summary available for this entry.
overview
Original abstract
We propose a scheme for generating and controlling remote nonreciprocal magnon--magnon entanglement in a cavity magnonic system with coherent feedback.The two microwave cavities are driven by independent single-mode squeezed vacuum fields, with a rotating YIG sphere in the left cavity and a stationary one in the right cavity. For a fixed rotation direction, reversing the bias magnetic field applied to the rotating sphere changes the sign of the Barnett shift, leading to nonreciprocal magnon--magnon entanglement. By tuning the cavity detuning and feedback phase, entanglement can be generated for one direction of the bias magnetic field while it vanishes for the opposite direction, yielding complete nonreciprocity. Coherent feedback enhances the entanglement at an appropriate reflectivity, whereas stronger feedback can reduce it. The relative squeezing phase provides additional control, and an appropriate choice of unequal squeezing factors improves the entanglement at fixed total input photon occupation. With the squeezed inputs kept fixed, moderate feedback also increases the critical temperature for magnon entanglement.Our results provide a controllable approach to preparing remote nonreciprocal quantum correlations in cavity magnonic systems.
arXiv·2026-10-08·Ake Köhne et al.
No generated summary available for this entry.
overview
Original abstract
Randomized benchmarking (RB) with structured circuits is experimentally scalable, but gives biased short-depth fidelity estimates because incomplete ensemble mixing introduces transient modes. Waiting for these transients to decay in deeper circuits can push the signal below the noise floor. This is a well-established obstacle, e.g. in linear cross-entropy benchmarking (LinXEB). Here we overcome this obstacle solely through classical post-processing. We introduce a one-parameter family of estimators that interpolate between the standard LinXEB-type post-processing and a new post-processing technique we call the trace filter function. Under practical assumptions, the trace filter function provably suppresses transient modes, exposing an interpretable fidelity decay at short depth, with theoretical guarantees comparable to standard RB, at the cost of an increased variance. We bound the variance, analyze the evaluation complexity of the new estimators, and develop practical post-processing algorithms. Experiments on a Rigetti superconducting processor validate the method for one-dimensional circuits of up to 12 qubits: where the standard estimator requires depth beyond a 40-layer experimental window, the trace filter function yields consistent estimates below 10 layers. Trace-filtered randomized benchmarking therefore extends reliable fidelity characterization to relevant structured circuit ensembles and short-depth regimes that are inaccessible to conventional estimators.
arXiv·2026-10-08·Rui Che, Ludvig af Klinteberg
No generated summary available for this entry.
overview
Original abstract
Flow models generate trajectories from an initial distribution to a target distribution by solving an ordinary differential equation defined by a velocity field. Flow matching learns this velocity field by modeling the transport dynamics between the two distributions. Wavefunction flow establishes a formal connection between flow models and quantum dynamics by introducing a continuity Hamiltonian, which drives the Schrödinger evolution of quantum states. In this paper, we investigate accurate and efficient quantum simulation of the wavefunction flow, thereby realizing the efficient implementation of flow models on quantum computers. We first leverage a quantum read-only memory (QROM)-based phase kickback framework for the wavefunction flow simulation, generating probability densities that closely match those produced by the corresponding conventional flow model. To address the high circuit-resource cost, we further incorporate a trained quantum neural network (QNN) into the phase kickback framework, replacing QROM for data encoding. Numerical experiments demonstrate that our proposed method implements flow models on quantum computers more efficiently, since it maintains the accuracy of wavefunction flow simulation compared with the QROM-based framework, and significantly reduces the circuit resources.
arXiv·2026-10-08·Artur Ishkhanyan, Miloslav Znojil
No generated summary available for this entry.
overview
Original abstract
A singular sextic oscillator in the finite-Hermite biconfluent-Heun hierarchy generates an exact four-member power-Liouville Hermite orbit. Power coordinate transformations with the Liouville amplitude map the hierarchy member $N=4$ to four half-line Schrödinger spectral charts while preserving the physical regular-recessive Wronskian zero set under energy-coupling reparametrization. Two charts are the previously studied $x^{2/3}$ and inverse-square-root conditionally integrable potentials; the orbit embeds this known power-dual pair together with the singular sextic and linear-plus-quadratic charts. On the selected physical slice, the degree-five accessory compatibility obstruction vanishes identically, while the transformed Frobenius index reproduces both published fractional-power centrifugal coefficients. The common endpoint condition yields an exact discrete sequence of quartic Sturmian eigencouplings for the sextic oscillator. Independent two-sided shooting confirms representative eigencouplings and node counts. A matched large-action analysis further derives the first matched-endpoint correction within the leading Langer action and improves the Maslov-shifted effective-level approximation. The construction thus connects exact Hermite solvability, energy quantization, coupling quantization, and power duality within a single spectral orbit.
arXiv·2026-10-08·Alessandro Colombo et al.
No generated summary available for this entry.
overview
Original abstract
Large-scale Quantum Key Distribution (QKD) networks rely on trusted repeaters, making the security properties of the selected communication path an essential part of end-to-end assurance. At the same time, network operators may be unwilling to disclose their internal topology. We present a topology-certification mechanism that lets a provider prove in zero knowledge that policy-compliant routes between two endpoints exist, without disclosing the routes in an individual presentation. Our main idea is to certify nodes and edges independently using multi-message signatures, rather than signing the complete graph as one object. For a route chosen in advance, proof size and cryptographic proving and verification work depend on its positions and attributes, independently of the overall network size, whereas route discovery and certification have separate graph-dependent costs. The construction hides the actual route length up to a public bound and sketches extensions to node-disjoint routes and monotonic additions within a graph epoch. We give a formal security model and conditional proofs of unforgeability and graph hiding for a generic construction. For a BBS-based construction, presentation-size estimates remain below $300$\,KiB at $\ell=m=n=50$, and measured generation and verification times remain below $400$\,ms at $\ell=64$ and $m=n=8$.
arXiv·2026-10-08·Yunhao Liu et al.
No generated summary available for this entry.
overview
Original abstract
Superradiant phase transitions are fundamental phenomena in light-matter coupled systems. Here, we uncover a novel class of superradiant criticality that is topologically distinct from previously known superradiant transitions. Using cavity-mediated cluster-Ising chains as an illustrative example, we numerically demonstrate that the critical line separating the superradiant phase from the cavity topological phase hosts robust symmetry-protected edge degeneracies, a feature absent in conventional superradiant transitions. Remarkably, although its local bulk critical properties are indistinguishable from those of the previously identified topologically trivial superradiant transition, the two criticalities cannot be smoothly connected without breaking the protecting symmetries or passing through a multicritical point. We further show that such topological superradiant criticality is generic, also occurring in cavity-mediated $\mathbb{Z}_{n}^{}$ cluster-qudit chains, as supported by complementary lattice simulations.
arXiv·2026-10-08·Zhihao Wu et al.
No generated summary available for this entry.
overview
Original abstract
As superconducting quantum processors scale toward hundreds of qubits, manual calibration becomes increasingly costly and difficult to sustain. Here we address two system-level factors governing automated calibration, namely, crosstalk induced by parallel operations and temporal drift of control parameters. On a 66-qubit superconducting processor, cross-entropy benchmarking shows that single-qubit calibration tolerates full-chip concurrency with minimal fidelity loss, whereas CZ calibration requires a minimum coupler-graph distance of four to avoid elevated control errors. Continuous monitoring of representative qubit and coupler parameters further yields quantitative refresh rules that assign refresh priority by error-budget consumption. These results turn two conventionally heuristic choices, the concurrency density of calibration tasks and the refresh priority of each control parameter, into measurable operating rules. Implemented within an automated calibration framework, the rules support a six-qubit Greenberger-Horne-Zeilinger state with a zero-noise-extrapolated fidelity of 89.64%, distance-dependent logical-error suppression in a single-cycle repetition-code benchmark, and a reduction of the mean single-qubit error from 0.023 to 0.011 on a 337-qubit processor, providing an experimentally grounded reference for the automated calibration and maintenance of current and future large-scale superconducting quantum systems.
arXiv·2026-10-08·Trung Minh Huynh et al.
No generated summary available for this entry.
overview
Original abstract
We develop an iterative Bayesian variational quantum eigensolver in which the unknown ground state, parametrised as a real unit vector, is inferred through a von Mises--Fisher distribution sequentially updated from Hadamard-test measurements on a single ancilla qubit. Building on a companion paper that treated a single success outcome via exact moment matching, we generalise the scheme to condition on $m$ success outcomes for the likelihood function per iteration. Since exact moment matching becomes impractical for $m>1$, we exploit the large-concentration regime, in which a first-order expansion of the log-likelihood yields a closed-form von Mises--Fisher posterior with $m$ entering only through a multiplicative weight. We prove that the two convergence properties of the single-outcome scheme---non-decreasing overlap and non-decreasing concentration---are preserved provided $m$ lies within an explicitly characterised range. Based on the theory, we propose a measurement-based algorithm and illustrate the convergence on randomly generated three- and four-qubit Hamiltonian matrices, on $\mathrm{HeH}^+$, and on $\mathrm{H}_2$.
arXiv·2026-10-08·Zu-En Su et al.
No generated summary available for this entry.
overview
Original abstract
Quantum technologies witness rapid contemporary developments transitioning from abstract scientific ideas and fundamental demonstrations, into systems of sufficient quality and scale, enabling real applications. Photonic quantum technologies are playing a pivotal role in these developments, since photons are robust, easily controlled, detect and measured, thus qualify as flying carriers of quantum information and entanglement distributers. The efforts to develop photonic quantum technologies benefit from the maturity of the classical optical technologies. It was shown that even a source of heralded three entangled photons is sufficient for building large scale quantum computers using otherwise classical optical elements. Here, we demonstrate a novel semiconductor quantum dot based device, which deterministically generate at GHz rates, indistinguishable single photons in a robust Greenberger-Horne-Zeilinger (GHZ) state of more than a dozen photons. The device utilizes novel natural spin echo concept, provided by the opposite precession directions of the negative and positive carriers' spins in the excited and ground levels of the periodically excited dot, respectively. The excitation rate is finely tuned to nullify the phase acquired by both spins' precession. Our record long GHZ state producing device can yet be feasibly improved to provide higher-rate, brighter and more robust deterministic GHZ source, significantly reducing the overhead requirements for photonic quantum technologies.
arXiv·2026-10-08·Yi-Fei Lu et al.
No generated summary available for this entry.
overview
Original abstract
Quantum key distribution (QKD) offers an approach for secure communication over quantum channels, based on the principles of quantum mechanics. However, the inevitable imperfections in QKD systems can introduce critical vulnerabilities, posing significant challenges to the deployment of QKD in terms of both practical security and performance. In this work, we present a comprehensive security analysis of QKD in the practical scenarios involving imperfections in modulation spaces. Specifically, our analysis focuses on the imperfections related to encoding, intensity modulation, and their characterization. We provide a unified framework based on the operator dominance method to overcome these issues and achieve a tight estimation of the secret key rate (SKR). The simulation results show that the SKR in practical scenarios, with parameters characterized from commercial QKD systems, closely matches the SKR under ideal conditions. In the finite case, the maximum transmission distance can reach up to 250 km with total pulse number $N=10^{12}$ and the SKR closely approaches the asymptotic limit up to 250 km with $N=10^{14}$. This validates the robustness of our method against imperfections in state preparation and characterization. Furthermore, the feasibility and robustness of method in measurement-device-independent (MDI) QKD have also been demonstrated. Our analysis not only promotes advancements in enhancing practical security and performance but also highlights the feasibility of deploying QKD for actual applications.
arXiv·2026-10-08·Yi-Fei Lu et al.
No generated summary available for this entry.
overview
Original abstract
Quantum key distribution (QKD) promises theoretically secure communication. However, it encounters challenges in implementation security and performance due to inevitable device imperfections. Since the proposal of measurement-device-independent (MDI) QKD, the critical step toward practical security is to secure QKD with imperfect sources. The source imperfections manifest as state-preparation uncertainty (SPU) in various aspects, e.g., encoding uncertainty, intensity fluctuation, and imperfect vacuum states. Here, we perform an MDI-QKD experiment and achieve both high practical security and superior performance. We address the general form of SPU and guarantee a tight estimation of the secret key rate based on the operator dominance method. We achieve secure key distribution over 303.37 km, which not only represents the farthest distance in experiments involving SPU but also considers the most SPU scenarios. Our experimental results represent a significant step toward promoting practical and secure quantum communication.
arXiv·2026-10-08·István A. Kovács, Neil Shah, Róbert Juhász
No generated summary available for this entry.
overview
Original abstract
Quantum annealing must be sufficiently slow to prevent defect formation. We study this problem in the random transverse-field Ising model via the adiabatic theorem to obtain the limiting rate at which defect formation can be avoided. Our approach based on the strong-disorder renormalization group (SDRG) technique views the annealing process as a gradual aggregation of strongly coupled clusters, giving access to the elementary events of error formation. We present a scaling theory of the statistics of these events in general dimensions and confront it to an extensive numerical analysis carried out in one, two, and three dimensions by an efficient implementation of the SDRG method. This approach is also validated by exact diagonalization in one dimension by means of the free-fermion technique. Our results consistently show a logarithmically slow decrease of the error density with the annealing time, characterized by the dimension-dependent critical exponents of the corresponding infinite-disorder fixed point of the model. Furthermore, we provide a map of individual events of potential defect formation in the excitation energy - control parameter plane, which may help in the design of optimal annealing paths.
arXiv·2026-10-08·Alexander Kulyabin
No generated summary available for this entry.
overview
Original abstract
We study, within a toy model, how a thermal bath of cosmological perturbations can decohere the homogeneous degrees of freedom of the universe, treating the perturbations as an environment in the framework of open quantum systems. In contrast to several earlier approaches, instead of tracing out the perturbations from a semiclassical ansatz for the total wave function, we incorporate their cosmological backreaction through an effective second-order coupling and derive a master equation. Our toy model consists of a spatially flat semiclassical inflationary universe with a clock field in the slow-roll regime, while scalar cosmological perturbations in an assumed thermal-like state constitute the environment. One of the features of the model is the absence of the Markov approximation. The resulting coupling constant is determined by thermal correlation functions of the quantized perturbation modes. Within this framework, we find that, for a representative set of parameter estimates, the characteristic decoherence timescale corresponding to the thermal contribution can be shorter than the Hubble timescale. In addition, we address the question of whether the pointer-state structure induced by the decoherence in such a framework could provide a criterion for the choice of semiclassical states in the early universe.
arXiv·2026-10-08·Soumyadip Patra, Peter Bierhorst
No generated summary available for this entry.
overview
Original abstract
We study a strong form of genuine multipartite nonlocality (GMNL), where an $n$-partite scenario admits a quantum strategy generating outcomes belonging to a restricted set with certainty, whereas every strategy built from nonclassical resources shared among at most $k<n$ parties fails this criterion with positive probability. This generalizes what is referred to as strong contextuality/nonlocality, or pseudotelepathy, beyond ruling out local models. For the simplest five-party Bell scenario of two binary-outcome measurement settings per party, we use the inflation technique to demonstrate that a game with a perfect quantum strategy witnesses a robust separation from models built from bipartite resources under local operations and shared randomness (LOSR), establishing the behavior is LOSR-GMNL. We provide broader context for this result by investigating its simulability with resources shared among three or four parties under different resource models and alternative definitions of GMNL. A central open question is whether $n$-party quantum resources can achieve such a separation from models built from $(n-1)$-party resources, for $n\ge 3$. We make progress here by constructing a family of robustly LOSR-GMNL games with $ε$-optimal quantum strategies experimentally indistinguishable in the limit from true probability-one-winning strategies for any desired level of precision.
arXiv·2026-10-08·Raam Uzdin
No generated summary available for this entry.
overview
Original abstract
Gate insertion (GI) quantum error mitigation replaces involutory gates such as CZ and CX with 2j+1 repetitions of the same gates to nominally amplify noise by the same factor. Analytical and experimental results show that this amplification scaling fails for non-commuting gate noise, as typically encountered in realistic devices. Here we introduce Heisenberg-echo symmetrization (HES), which combines standard GI with an echo inspired by the Heisenberg representation to cancel the leading GI error. In our simulations, HES reduces the absolute fidelity error by one to two orders of magnitude compared with GI. Unlike the more accurate Layered-KIK method, HES is compatible with any hardware and requires only circuit-level access. It enables virtual noise scaling across platforms, potentially reducing sampling overhead substantially. Its agnostic noise amplification also provides full resilience to temporal noise drift. For pure initial states, however, high-rank observables can substantially increase the echo variance relative to non-echoed circuits, whereas rank-one observables incur no additional sampling overhead compared with GI or Layered-KIK. HES is therefore particularly suited to rank-one or nearly rank-one observables.
arXiv·2026-10-08·Oishik Kar, Aswath Babu H
No generated summary available for this entry.
overview
Original abstract
Multi-photon interference is the resource most native to photonic quantum machine learning, yet experiments on photonic reservoirs have reported advantages, null results, and train-only effects. These outcomes cannot be compared: each measures task-dependent accuracy on different tasks and platforms. Here we resolve the question task-independently through the kernel geometry of boson-sampling feature maps. Interference redistributes feature variance across roughly twice as many effective dimensions as distinguishable-particle statistics, generating a large geometric separation between the corresponding kernels. The separation grows superlinearly with indistinguishability, is linear in Hong--Ou--Mandel visibility at small visibility for two to four photons, and retains approximately 80% of its magnitude at the source quality of current quantum processors. Under experimental sampling budgets the separation is learnable on adversarially constructed tasks (accuracy advantage +0.22 plus or minus 0.05) and an order of magnitude smaller on natural tasks, gated by kernel--task alignment. The results reconcile the existing experimental record and supply a pre-experimental protocol: kernel geometry establishes that an interference-specific learning resource exists, and task alignment determines whether a given task can access it; both are computable before committing significant hardware resources.
arXiv·2026-10-08·Nikhil Kumar
No generated summary available for this entry.
overview
Original abstract
Nitrogen-vacancy (NV) centre ensembles are leading room-temperature magnetometers, but their sensitivity is usually extracted from a single resonance and relies on external microwave and bias-field hardware. This work proposes a chip-scale NV magnetometer built around a one-dimensional YIG/CoFeB magnonic crystal, in which a single structural defect forms a passive magnonic cavity and integrated permanent magnets supply the bias field. Micromagnetic simulations show a defect-localised spin-wave mode at 2.910 GHz inside the 2.5-3.0 GHz magnonic band gap, 40 MHz from the NV zero-field splitting, with a band structure that matches an independent plane-wave calculation. A Tavis-Cummings/Lindblad model in which the microwave reaches the NV ensemble through this mode predicts a hyperfine-resolved optically detected magnetic resonance spectrum that is strong only within the mode linewidth, and a dispersive homodyne response with one steep edge per $^{14}$N hyperfine line. The master-equation solutions agree with the closed-form homodyne steady state ($R^2 > 0.9999$) and with an approximate analytic ODMR theory (peak positions within 0.012 MHz). For a critically coupled readout with room-temperature electronics, combining the three edges gives a projected sensitivity of 93 pT/$\sqrt{\rm Hz}$, a $\sqrt{3}$-fold gain over the best single edge. Mapping the sensitivity against the NV-magnon coupling reveals an optimum near $g_{\rm ens}/2π\approx 0.2$-$0.4$ MHz, where it reaches 72 pT/$\sqrt{\rm Hz}$ for a 0.64 MHz spin linewidth and 19 pT/$\sqrt{\rm Hz}$ for 0.17 MHz, with thermal limits of 6.6 and 1.7 pT/$\sqrt{\rm Hz}$. The antenna-mode coupling, the NV-magnon coupling and the spin linewidth are therefore the main design levers.
arXiv·2026-10-08·Wei Wang et al.
No generated summary available for this entry.
overview
Original abstract
Integrated photonic quantum chips have emerged as a promising platform for realizing fault-tolerant photonic quantum computers. Compared with bulk-optics systems, integrated photonics offer compact device footprints, enhanced programmability, and exceptional stability, attributes that are essential for executing large-scale and computationally demanding quantum tasks. In this review, we provide a comprehensive overview of recent advances in both discrete-variable and continuous-variable universal photonic quantum computation. We survey progress in fault-tolerant architectures and state-of-the-art integrated platforms and highlight the key challenges that must be addressed to scale photonic systems toward full fault tolerance. Finally, we outline future opportunities and research directions aimed at bridging the gap between current proof-of-principle demonstrations and fully scalable quantum microprocessors.
arXiv·2026-10-08·Ilia Begichev et al.
No generated summary available for this entry.
overview
Original abstract
Encapsulation of two-dimensional (2D) materials with hexagonal boron nitride (hBN) is widely used to fabricate ultraclean van der Waals (vdW) heterostructures for optoelectronic and quantum transport studies. These devices are often operated under strong out-of-plane displacement fields that tune the electronic properties of the active 2D material, while the surrounding hBN is typically assumed to remain electronically inert. This assumption, however, neglects defect states that are present even in high-quality hBN crystals. Here, we probe their response to the applied displacement field using monolayer graphene encapsulated between hBN crystals as a sensitive charge sensor. Increasing the displacement field induces notable charge transfer between graphene and hBN, producing additional electron doping of 10-20x10^9 cm^(-2) even at the moderate displacement field (~0.5 V nm^(-1)), while simultaneously increasing carrier-density inhomogeneity of the graphene layer. Both effects are consistent with ionization of defect states within the hBN bandgap, with the bulk density ~1-7x10^(-5) nm^(-3) varying across different hBN crystals. Our results show that displacement-field-induced defect ionization in hBN can modify the electronic response of vdW heterostructures, with direct implications for device design and interpretation of experiments.
arXiv·2026-10-08·Aruna Gupta, S. R. Hassan
No generated summary available for this entry.
overview
Original abstract
Constraint-preserving exchange drivers allow many coupling graphs that preserve the same feasible sector, but exhibit different minimum gaps along an annealing path. We derive an exchange-resolved sensitivity of the normalised minimum gap for fixed-cardinality Laplacian drivers sharing a Dicke ground state, and apply it to identify locally favourable modifications of the driver. Numerical experiments indicate this sensitivity reliably predicts beneficial infinitesimal changes, but its reliability decreases when the same direction is extended to a finite edge replacement. The gap landscape tracking reveals one mechanism of this loss of reliability. Improving the active bottleneck can expose a competing minimum, with a more extensive reorganisation of the low-energy subspace. We call this the "repair-and-expose" mechanism and observe it in both dense quadratic and sparse frustrated objective families. This motivates relinearizing the response when competing minima become co-active. In the tested oracle setting, a tied-minimum max-min update is substantially more reliable than continuing the original direction or optimizing only the incoming minimum. Supporting finite-size search and selector tests show that this local information can remain useful beyond the infinitesimal limit, while its practical extraction depends on the driver geometry and identification of the relevant low-energy competitors. These results connect local exchange-resolved gap sensitivity to bottleneck migration and conditional driver redirection.
arXiv·2026-10-08·Awal Ahmed Fime et al.
No generated summary available for this entry.
overview
Original abstract
Variational quantum algorithms are often limited by barren plateaus: gradients vanish as circuit size and depth increase, making quantum neural networks difficult to train. We propose Q-Capsule, a localized capsule-based quantum neural architecture that mitigates this problem through register partitioning, local readout, sparse inter-capsule coupling, trainable data re-uploading, and Quantum Fisher Information Matrix (QFIM)-guided adaptive depth growth. By restricting the dominant support of each observable to a small capsule and controlling inter-capsule entanglement, Q-Capsule preserves useful gradient signals while retaining communication between local quantum representations. As the register width increases, Q-Capsule consistently maintains stable gradient variance, whereas globally entangling baselines exhibit exponential suppression with a log-gradient-variance slope near -ln 2 per qubit. Q-Capsule also produces more structured optimization landscapes, higher parameter efficiency, improved robustness to depolarizing noise, and lower measurement requirements. Its adaptive policy achieves 98.1% accuracy on binary classification and 97.7% on four-class classification, while using approximately 73% fewer two-qubit gates than the fixed-deep model on the multiclass task.
arXiv·2026-10-08·Yu-Hsueh Chen, Tarun Grover
No generated summary available for this entry.
overview
Original abstract
Conditional mutual information (CMI) probes spatial non-Markovianity and plays a central role in a recently developed framework for defining mixed-state phases based on local reversibility. This framework sharply distinguishes exponentially decaying from algebraically decaying CMI, since the latter obstructs equivalence to a state with finite Markov length. Here we show that states that flow to the same renormalization-group (RG) fixed point can nevertheless exhibit qualitatively different CMI. Starting from a critical Gibbs state of a finite-range local classical Hamiltonian, whose CMI vanishes beyond the interaction range, we show that an RG-irrelevant perturbation that breaks detailed balance generically generates algebraically decaying CMI. Crucially, these power-law tails are cutoff-suppressed: although they lead to an infinite Markov length at every fixed lattice cutoff, they vanish as a positive power of the cutoff in the continuum limit. We construct solvable models that exhibit this phenomenon and predict that the Ising-symmetric critical point of Toom's cellular automata generically exhibits such behavior. We also find analogous cutoff-suppressed CMI in the high-temperature paramagnetic phase of the long-range Ising paramagnet, in contrast with the genuine power-law CMI at the finite-temperature critical point in this same model that survives the continuum limit. We also derive a general result that in one spatial dimension, CMI decays faster than the inverse square of the buffer length if and only if the long-distance physics is Markovian.
arXiv·2026-10-08·DaKai He abd Zhi Song
No generated summary available for this entry.
overview
Original abstract
We study a hybrid system of coupled cavities, with or without two-level atoms doped inside. By employing a building-block construction facilitated by nonlinear Stark coupling, we identify a manifold of exact many-body eigenstates that remain analytically tractable across arbitrary lattice geometries and atom distributions. We demonstrate that these exact states exhibit a dual physical nature depending on their spectral positioning: when embedded within the chaotic many-body spectrum, they manifest as quantum scars that violate the eigenstate thermalization hypothesis and undergo weak ergodicity breaking; conversely, as ground states within fixed-total-excitation sectors, they exhibit off-diagonal long-range order and form polariton condensates. Furthermore, numerical calculations of local excitation-number fluctuations suggest that negative Stark coupling shifts the Mott-insulator to superfluid transition toward weaker inter-cavity hopping. Our findings provide a versatile framework for engineering both coherent quantum phases and non-thermalizing states in diverse light-matter architectures.
arXiv·2026-10-08·Takanori Nishi, Hayato Goto
No generated summary available for this entry.
overview
Original abstract
Qudits provide a larger local Hilbert space than qubits and have recently attracted interest as building blocks for efficient fault-tolerant quantum computation (FTQC). In this work, we extend many-hypercube (MHC) codes, high-rate concatenated quantum codes, from qubits to qudits of prime dimension $q$. We construct the level-2 and level-3 MHC codes with parameters $\left[\!\left[6^2,4^2,2^2\right]\!\right]_q$ and $\left[\!\left[6^3,4^3,2^3\right]\!\right]_q$, respectively, and generalize the level-by-level minimum-distance (LLMD) decoder originally proposed for the qubit MHC codes. In a qudit $X$-error model, we evaluate the code-capacity performance of the qudit MHC codes for dimensions up to $q=13$. We find that the error threshold increases monotonically with the local dimension $q$, reaching $10.0\%$ for $q=13$, nearly double the value of $5.1\%$ for qubits. Furthermore, for sufficiently large local dimensions, we observe a pronounced waterfall regime in which the logical error rate decreases substantially faster than expected from conventional distance-based estimates. To understand the origin of the observed qudit advantage, we analyze the decoding performance in terms of the entropy of the underlying $q$-ary noise channel. This analysis reveals a competition between the increased syndrome information available at larger $q$ and the simultaneous growth of the typical physical error weight at fixed entropy. These results demonstrate that higher-dimensional quantum systems can substantially improve the performance of high-rate concatenated quantum codes and motivate further development of qudit-based FTQC architectures.
arXiv·2026-10-08·Mushahid Khan, Olivia Di Matteo
No generated summary available for this entry.
overview
Original abstract
Quantum compilers play a critical role in transforming high-level quantum programs into optimized, hardware-compatible circuits. However, verifying the correctness of compiler passes remains challenging, as determining the expected output of large, deeply entangled quantum circuits is computationally intractable. This challenge is further amplified when compiler passes modify already complex circuit structures, making manual validation of transformed circuits impractical. In this work, we perform a systematic analysis of unit tests for quantum compiler passes in four quantum programming frameworks (PennyLane, Qiskit, Cirq, and pytket). Our findings indicate validation is dominated by program-content and program-metric assertions, and test circuits are generally small and shallow. Motivated by these observations, we introduce a testing methodology for automated validation of quantum compiler passes based on retromorphic testing and principles from the Hadamard test. This methodology analyzes a compiler pass, test circuit, and expected pass behavior to verify semantic preservation and intended structural modifications. We implement our methods in a framework, RetroQ, and apply it to compiler passes in PennyLane and Qiskit. Experimental evaluation reproduced several existing bugs as well as uncovered previously undetected defects, such as flawed symbolic parameter handling, incorrect commutation logic, failure to recognize self-adjointness of gates, and runtime crashes. These findings highlight the need for compiler-pass-specific testing methodologies to improve the reliability of the evolving quantum software stack.
arXiv·2026-10-08·Joaquin Minguzzi et al.
No generated summary available for this entry.
overview
Original abstract
An outstanding challenge in superconducting quantum circuits is mitigating loss from two-level system (TLS) defects. SWAP spectroscopy with flux-tunable qubits can detect individual TLSs, but the Rabi chevrons that signal coherent exchange have been observed only for the most strongly coupled defects. Here, we introduce a sequence with fast flux pulses only at state preparation and readout, switched off during the energy-relaxation delay for finer frequency resolution and longer interaction times. We detect Rabi chevrons at swap rates as low as 0.1 MHz, an order of magnitude lower than previously reported. In the dressed-state picture, we fit the coherent swap oscillations to extract the TLS energy-relaxation time. These Rabi chevrons reveal coherent TLSs with a median energy-relaxation time of 10 microseconds, at coupling strengths previously associated with incoherent TLSs. The swap coherence times exceed the qubit T2* limited by flux noise, indicating that the dressed gap protects them from low-frequency 1/f noise.
arXiv·2026-10-08·Qiaofeng Liu, Ian Low, Zhewei Yin
No generated summary available for this entry.
overview
Original abstract
The three gauge couplings of the Standard Model (SM) can be parameterized as the fine structure constant $α$, the weak mixing angle $\sin^2θ_w$, and the strong coupling $α_s$. They are fundamental constants whose values remain unexplained. Previously we showed that minimizing magic production in charged-lepton scattering reproduces $\sin^2θ_w$ with great precision. Here we study magic production in the six flavor-diagonal color-singlet channels $q\bar q\to q\bar q$ at tree level, including photon, gluon, $W/Z$, and Higgs exchange. Varying only $α_s$, with all other inputs fixed at each center-of-mass energy, we find that the finite-$α_s$ magic minimum in the top channel reproduces the $\overline{\mathrm{MS}}$ value of $α_s$ to within $5\%$ from $1~$TeV to $10^9~$GeV. Higgs exchange involving the large top Yukawa coupling is essential for this agreement. All six channels produce near-minimal magic at the SM couplings, and reducing $α_s$ toward $α$ increases their magic production, potentially explaining why the strong interaction is ``strong.'' To understand why minimizing magic reproduces both $\sin^2θ_w$ and $α_s$, we conjecture that the parameters of fundamental interactions among color singlets reflect a principle of quantum computational efficiency, with the physical universe emerging from a quantum simulation subject to constrained resources.
arXiv·2026-10-08·Nouédyn Baspin
No generated summary available for this entry.
overview
Original abstract
We show that performing lattice surgery on sparse stabiliser codes with sparse ancillas requires $\tildeΩ(k^2)$ ancillary qubits in the worst case. As a result, for codes with large $k$, constant overhead ancillas can only realise a small fraction of possible measurements.
arXiv·2026-10-08·Sunho Kim, Chunhe Xiong, Junde Wu
No generated summary available for this entry.
overview
Original abstract
While conventional quantum resource theories quantify utility relative to an idealized set of free states, practical implementations are confined to a specific supply environment---a framework encompassing all states realizable or preparable via current experimental apparatus and design choices, not limited to free states. This work proposes a novel framework for evaluating the relative utility of arbitrary quantum states against the resource set made accessible by these current selections. We specifically focus our investigation on two canonical representations: the set of states reachable via free operations as the attainable boundary imposed by current experimental constraints, and the set defined through numerical optimization as the criterion for operational equivalence. Our framework establishes two core evaluation methodologies. First, we provide a strategy-dependent benchmark by assessing a state's performance relative to the reference set under its individually optimized strategy, thereby quantifying achievable performance. Second, we derive a computable lower bound on this superiority by considering optimal strategies for each state individually, enabling the quantification of strategy-independent relative performance independent of specific experimental setups. Beyond relative efficiency metrics, we demonstrate the practical utility of this approach for resource management scenarios, including the selective extraction of states advantageous for storage and distribution, and the concentration of residual resources. Using quantum entanglement as a paradigmatic example, we prove that distillable entanglement can be fully recovered via extraction and concentration when the reference set is restricted to pure states, thereby demonstrating the practical relevance of our framework.
arXiv·2026-10-08·Han-xin Che et al.
No generated summary available for this entry.
overview
Original abstract
Hyperbolic geometry hosts a plethora of exotic quantum phenomena ranging from holographic duality to novel topological phases. However, investigating these effects experimentally remains challenging due to the Euclidean constraints of natural crystalline materials. While recent synthetic lattices have achieved static realizations, they often lack the dynamical tunability required to explore the full geometric landscape. Here, we overcome these limitations by implementing a quantum simulation of hyperbolic geometry within the parameter space of a superconducting quantum circuit. We construct a Hyperbolically Driven Quantum System (HDQS) by mapping the hyperbolic properties onto the dynamically controllable Hamiltonian parameters. By probing the systems' response under geometric quantum driving, we elucidate how the intrinsic geometry of the parameter space dictates observable physical quantities. Furthermore, we extend the theoretical framework to realize ensemble simulation. This generalization enables us to harness the fast coherent control of superconducting qubits to capture essential geometric characteristics, establishing a versatile platform for exploring quantum dynamics on hyperbolic manifolds.
arXiv·2026-10-08·Nouédyn Baspin
No generated summary available for this entry.
overview
Original abstract
We show that the fast surgery framework of Baspin-Berent-Cohen can be instantiated using at most $\tilde{O}(n(k + d))$ ancilla qubits, improving on the previously achievable $O(n\cdot k \cdot d)$ overhead. This result also establishes that fast surgery can be performed at a cost comparable to the $\tilde{O}(nk)$ overhead required for regular surgery. We build the surgery ancilla by first starting with a dense, but expanding system; and then applying expansion-preserving sparsification methods from gauging and code embeddings.
arXiv·2026-10-08·Ilan T. Rosen et al.
No generated summary available for this entry.
overview
Original abstract
Understanding the dynamics of interacting quantum fields remains a fundamental challenge. We propose a superconducting transmission line for analog quantum simulation of $(1+1)$-dimensional $φ^4$ field theory. The transmission line comprises fluxonium-like circuit elements whose continuous and unbounded phase variables encode a scalar field without Hilbert-space truncation. Their anharmonic potentials provide strong interactions. Tuning the circuit parameters provides access to two distinct regimes. In the first, the transmission line emulates $φ^4$ field theory with a single-well potential. We confirm this correspondence through lattice Monte Carlo calculations of the low-energy spectra of both the circuit and lattice $φ^4$ theory. This regime enables scattering experiments between counter-propagating particle wave packets. The second parameter set yields a double-well potential that emulates $φ^4$ theory in the symmetry-broken phase and hosts degenerate vacua. Interfaces between the two vacua form topological kinks, and the transmission line can simulate kink-antikink collisions. We present state preparation and measurement protocols for both collision experiments, enabling spatially resolved, real-time studies of particle and soliton scattering in an interacting quantum field theory.
Quantum Computing Report·2026-10-07·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Haiqu has launched AgenticOS, an AI-driven platform that automates quantum computing research workflows. It uses specialized AI agents and a test-driven development approach to prevent errors and ensure scientific accuracy in complex calculations. The platform has successfully simulated a proton-transfer problem and a Fermi-Hubbard model, demonstrating its ability to deliver accurate results and optimize quantum circuits. The post Haiqu Unveils AgenticOS Platform for Automated, Scientifically Verified Quantum Research Workflows appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-07·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Project Eleven has launched Strongpoint, an institutional custody platform designed for post-quantum digital asset security, with the Zcash Foundation as a development partner. The platform aims to provide a crypto-agile control layer for blockchain networks transitioning to post-quantum cryptography. Strongpoint is expected to be deployed in Q4 2026, building on Project Eleven's earlier funding and acquisition of Riva Labs. The post Project Eleven Launches Strongpoint Post-Quantum Custody Platform with Zcash Foundation as Initial Development Partner appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-07·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Leibniz University Hannover researcher Kai Voges has established a research group focused on hybrid quantum systems that combine molecules with Rydberg atoms. The €5.8 million, five-year HybriQCS project aims to demonstrate quantum gate operations using both molecular and Rydberg-atom systems. The group will work within Quantum Valley Lower Saxony and the QuantumFrontiers Cluster of Excellence while exploring applications in quantum computing, simulation and precision timing. PRESS RELEASE — When the scientific community discusses quantum computers, it is usually the question of the underlying system that causes division. Ion traps, Rydberg atoms, or perhaps superconducting circuits? At Leibniz University Hannover, Dr Kai Voges has launched a new research group that positions itself between these factions and aims to combine the strengths of these different approaches without reservation. Located at the heart of Quantum Valley Lower Saxony (QVLS) and building on the fundamental research of the QuantumFrontiers Cluster of Excellence, the research group is developing hybrid quantum systems . With 5.8 million Euros in funding from the Federal Ministry of Research, Technology and Space, the aim is to achieve the first gate operations of a unique technology within five years and to steer the current debate on quantum computing in new directions. Molecules Meet Atoms At the heart of the idea are ultra-cold molecules and individual atoms. Kai Voges has acquired the expertise required for this throughout his scientific career to date. As a PhD student at the Institute for Quantum Optics in Hanover – historically the leading centre for molecular physics – he assembled molecules from individual cooled atoms. He subsequently expanded his area of expertise at Imperial College London, where he cooled entire molecules down to just a few degrees Kelvin. As head of his own research group, molecules remain the focus of Voges’s work: they are intended to become th
The Quantum Insider·2026-10-07·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Chandigarh University’s CUBIC has become an academic and incubation partner for PRAGATI Q-Foundry 2026 and signed an MoU with 247VC Investment Trust to support quantum and deep-tech startups. The MoU provides a framework for potential investment introductions, strategic mentorship, pitch sessions and business-development support for eligible CUBIC startups. CUBIC’s participation in PRAGATI Q-Foundry 2026 supports India’s National Quantum Mission by connecting university research and startups with investors, industry and technology-development opportunities. PRESS RELEASE — Chandigarh University’s CUBIC, India’s first university-led quantum incubator for deep-tech startups became an academic and incubation partner for PRAGATI Q-Foundry 2026, a national initiative of the Ministry of Science and Technology, aimed at accelerating the development and commercialization of quantum technologies, and signed a Memorandum of Understanding (MoU) with 247VC Investment Trust which is a leading Indian venture capital firm on the sidelines of the PRAGATI Q-FOUNDRY 2026 NQM Co-development and Venture Partnership Meet held on September 29–30 in New Delhi. The MoU will facilitate direct access to potential investment opportunities, strategic mentorship and business support for quantum and deep-tech startups associated with CUBIC. The national meet was addressed by the Union Minister of State for Science and Technology and Earth Sciences, Dr. Jitendra Singh, and brought together startups, academic institutions, industry, investors, manufacturers to accelerate the translation of quantum technologies from research towards validation, co-development, commercialization and deployment under India’s National Quantum Mission (NQM). The MoU with 247VC Investment Trust adds an investment and business-development dimension to CUBIC’s incubation activities. This collaboration aims to help promising startups associated with CUBIC access potenti
The Quantum Insider·2026-10-07·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Cisco introduced two research prototypes designed to coordinate quantum networks and help applications use connected quantum devices without configuring each component individually. The Quantum Network Controller manages hardware, schedules connections and monitors their quality, while the updated Network-Aware Quantum Compiler divides computing tasks among processors and requests the necessary network resources. Cisco reported that its software coordinated equipment from multiple vendors across about 11 miles of commercial fiber in New York City, achieving greater than 99% polarization fidelity at room temperature. Cisco has introduced two research prototypes designed to coordinate quantum networks, aiming to make connected quantum machines easier to operate and use. The company’s Quantum Network Controller and updated Network-Aware Quantum Compiler address different parts of that task. The controller coordinates the hardware needed to supply quantum connections, while the compiler determines how a quantum program should be divided among processors and what connections it needs, according to a Cisco blog post by Vijoy Pandey, senior vice president of Outshift by Cisco . The broader goal is to let applications request a quantum networking service without requiring operators to configure every device and connection individually. An application, for example, would specify which endpoints it needs to connect, the quality and rate of the connection, and when it should be available. Software would then arrange and maintain the service. Cisco describes both systems as research prototypes. The announcement outlines an approach to operating larger quantum networks, but it does not establish that a large network of connected quantum processors is ready for commercial use. One of the challenges is that a single processor has limited capacity, and connecting processors could provide another route to larger systems. Those connections, however, require more than a
Nature: Quantum Information·2026-10-07
No generated summary available for this entry.
overview
Quantum Computing Report·2026-10-07·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
A GAO audit found that all 24 CFO Act federal agencies are unprepared for post-quantum cryptography migration, with none having fully implemented the required preparatory practices. The audit, publicly released in October 2026, revealed significant deficits in cryptographic asset inventory, migration funding assessments, and operational PQC testing. This lack of readiness leaves critical federal data vulnerable to future quantum attacks, particularly from "harvest now, decrypt later" tactics by hostile nation-states. The post GAO Audit Finds All 24 CFO Act Federal Agencies Unprepared for Post-Quantum Cryptography Migration appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-07·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Infineon Technologies and ZuriQ AG have expanded their partnership to industrialize 2D trapped-ion Penning micro-trap chips for quantum computing. This collaboration aims to scale trapped-ion quantum processing units by combining ZuriQ's 2D Penning micro-trap designs with Infineon’s semiconductor fabrication and packaging capabilities. Their joint efforts have successfully demonstrated a 3x3 array of nine individually controlled ion qubits, paving the way for scalable quantum hardware. The post Infineon and ZuriQ Deepen Partnership to Industrialize 2D Trapped-Ion Penning Micro-Trap Chips appeared first on Quantum Computing Report .
Phys.org Quantum Physics·2026-10-07
No generated summary available for this entry.
overview
Original abstract
Modern technological breakthroughs like lasers, MRI scanners, semiconductors and quantum computers rest on the study of quantum mechanics. However, the field has predominantly focused on (sub)atomic phenomena far removed from our human senses.
Quantum Computing Report·2026-10-07·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
QuantumCT has opened its 4,500-square-foot innovation headquarters in New Haven, serving as a central hub for quantum computing research, talent development, and startup incubation. This initiative, backed by significant public and private funding, aims to establish Connecticut as a leading U.S. quantum commercialization center. Key funding includes a $50.5 million state allocation and a $15 million NSF grant, alongside institutional research from Yale and UConn, and industry investment from D-Wave. The post QuantumCT Opens 4,500 Sq. Ft. Innovation Headquarters in New Haven to Anchor Connecticut Quantum Corridor appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-07·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Quanfluence, a Bengaluru-based deep technology startup, has secured $10 million in Series A funding led by Chiratae Ventures, with participation from Pi Ventures and Rainmatter by Zerodha. The company will use the investment to develop a full-stack photonic quantum processing system, integrating its photonic integrated circuits, electronic control silicon, and software algorithms. Quanfluence aims to launch initial photonic processors by 2027 and scalable fault-tolerant systems by 2029, reinforcing India's quantum ecosystem. The post Quanfluence Secures $10 Million to Build Full-Stack Photonic Quantum Computer Architecture appeared first on Quantum Computing Report .
Phys.org Quantum Physics·2026-10-07
No generated summary available for this entry.
overview
Original abstract
Today, many physicists are actively exploring how light could be used to link objects through quantum entanglement. By fully harnessing the effect, they hope to unlock a wide array of applications, from secure communication networks spanning vast distances to sensitive new tests of the fundamental laws of physics.
The Quantum Insider·2026-10-07·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Project Eleven launched Strongpoint, an institutional custody platform designed to support digital assets as networks transition to post-quantum cryptography. Zcash Foundation is an initial development partner, contributing expertise in privacy-preserving cryptography and protocol engineering to Strongpoint’s custody architecture. Project Eleven plans to deploy Strongpoint in Q4 2026, with the platform designed to maintain common security controls across different cryptographic schemes and network requirements. PRESS RELEASE — Project Eleven , the post-quantum security company for digital assets, today introduced Strongpoint , its flagship custody platform built for navigating the transition to post-quantum cryptography. Zcash Foundation joins Project Eleven as an initial development partner, helping shape Strongpoint’s institutional custody architecture. Strongpoint is designed to give institutions a consistent control layer for securing and managing digital assets as networks change the cryptographic standards underneath them. Rather than rebuilding key-management, transaction approval, and audit infrastructure for each new signature scheme or network migration, institutions can maintain a common set of security controls while the underlying cryptography evolves. “Institutional digital asset custody was built for a world where the cryptography underneath it rarely changed,” said Alex Pruden, CEO of Project Eleven . “Quantum computing is upending that model. If every network adopts a different solution, institutions could be forced to rebuild their security infrastructure again and again. Strongpoint is built around crypto-agility, so the cryptography can change without the infrastructure changing with it.” “Institutions holding shielded ZEC need custody infrastructure that respects Zcash’s privacy model today and can adapt as cryptographic standards change,” said Alex Bornstein, Executive Director
The Quantum Insider·2026-10-07·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief IBM has been selected for Stage C of DARPA’s Quantum Benchmarking Initiative, where independent experts will test its technology and assess its plans to build a fault-tolerant quantum computer. DARPA’s initiative aims to determine whether a quantum computer whose computational value exceeds its cost can be built by 2033. IBM plans to deliver its fault-tolerant Quantum Starling system in 2029, combining advances in error correction, processor design and systems engineering. PRESS RELEASE — IBM (NYSE: IBM ) today announced it has been selected for Stage C, the third phase of the Quantum Benchmarking Initiative (QBI) led by DARPA, the United States Defense Advanced Research Projects Agency. This phase will advance IBM through DARPA’s verification process, in which independent experts extensively test and measure quantum hardware, technology, systems engineering, and architectures to determine if a company can build a fault-tolerant quantum computer. “Advancing to the third stage of DARPA’s Quantum Benchmarking Initiative validates the strength of IBM ‘s path to building a fault-tolerant quantum computer,” said Jay Gambetta, Director of IBM Research and IBM Fellow. “IBM expects to deliver the first fault-tolerant system in 2029, and we plan to scale the value of quantum computing well beyond that timeline. We look forward to working with DARPA’s team of experts as they advance their review of approaches to fault-tolerant quantum computing into the testing phase.” As an independent research and development arm of the U.S. Department of Defense, DARPA launched the QBI in 2024 to determine whether an industrially useful faulttolerant quantum computer can be built by 2033. The program defines such a system as one whose computational value will exceed its cost. IBM has successfully progressed through the QBI’s assessment process, including the first two stages that analyzed comprehensive R&D plans and risk mitigatio
The Quantum Insider·2026-10-07·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief RapidFort and SpaceWERX signed a Cooperative Research and Development Agreement to develop and evaluate cybersecurity capabilities for U.S. Space Force systems. The collaboration will address AI software vulnerability risks, post-quantum encryption risks, cyber readiness and faster Authority to Operate (ATO) processes. The CRADA will connect SpaceWERX operational and acquisition teams with RapidFort’s software and open-source ecosystem to test and refine commercial cybersecurity solutions. PRESS RELEASE — RapidFort , the leader in Software Supply Chain Security (SSCS) with the largest distribution of curated truly open-source software, today announced it has signed a Cooperative Research and Development Agreement (CRADA) with SpaceWERX, the innovation arm of the United States Space Force (USSF) and a division of the Air Force Research Laboratory (AFRL). This strategic partnership establishes a collaborative framework to build a larger industry consortium to enable SpaceWERX to co-develop, test, and evaluate next-generation capabilities that reduce AI software vulnerability exploitation risk, improve cyber readiness, accelerate ATOs, and reduce post-quantum encryption risk across critical space systems. For the USSF, the CRADA is designed to improve cyber readiness, allowing USSF Guardian personnel to field new software capabilities securely, while having them approved and deployed at operational speed. Under the terms of the CRADA, industry organizations will share technical expertise, infrastructure, and operational insights to accelerate commercialization and cybersecurity mission readiness for space systems. As a CRADA partner, RapidFort now has access to SpaceWERX’s network of operational experts, acquisition professionals, and Guardian talent. Likewise, SpaceWERX has access to RapidFort’s ecosystem of software industry and open-source partners. This collaborative feedback loop will enable the Space Force to validate and refine its capabiliti
Quantum Computing Report·2026-10-07·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Cisco's Outshift division has launched the Quantum Network Controller and Network-Aware Quantum Compiler v0.2.0 to manage multi-node quantum networks. The Controller offers Entanglement-as-a-Service, enabling on-demand entanglement across diverse quantum hardware. The Compiler integrates circuit compilation, qubit partitioning, and distributed quantum error correction, optimizing for physical network limitations. The post Cisco Releases Quantum Network Controller and Network-Aware Compiler v0.2.0 for Distributed Quantum Infrastructure appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-07·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Haiqu launched AgenticOS, a system that coordinates specialized AI agents to plan, validate and prepare quantum research experiments for hardware execution under human oversight. In a chemistry test, Haiqu reported that four of 10 unassisted AI agent runs violated setup instructions, while AgenticOS maintained the approved protocol and produced a simulated result within approximately 3.4% of an exact reference. Haiqu reported that AgenticOS developed and ran a 3-by-3 Hubbard model experiment on an IBM quantum computer, reducing circuit depth by 75% and proposing a calibration that aligned hardware results with an error-free simulation of the same method. PRESS RELEASE — Existing AI models have advanced to the point that they can contribute to real science, but they have their limits. An AI agent can produce convincing math and working code, but it might alter the underlying science while doing so, leaving researchers with results that look right but aren’t. Today, Haiqu is addressing that by unveiling AgenticOS , giving quantum researchers a team of AI agents that are built for scientific exploration, and designed to catch mistakes before they happen. In complex scientific calculations, general-purpose AI agents can make small changes no one asked for, like shifting a molecular geometry or slipping in an unapproved approximation. The calculation then answers a different question, or returns a result that is simply incorrect. With the Haiqu AgenticOS, researchers can now design an entire quantum project — from the initial question to an experiment that’s ready for quantum hardware — and assign multiple teams of AI agents to validate and confirm the research findings every step of the way. The team overseeing the experiment can then inspect each assumption and conclusion to determine how to proceed. “Turning a promising research idea into a real experiment demands years of specialized, hands-on expertise in highly technical method
Phys.org Quantum Physics·2026-10-07
No generated summary available for this entry.
overview
Original abstract
Collisions between particles at high energies can sometimes produce new particles and shed light on interactions between the fundamental constituents of matter. Simulating these collisions and their underlying processes could yield valuable insights into how matter behaves at extremely small scales.
The Quantum Insider·2026-10-07·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief KQC Quantum and Charlton Aria Acquisition Corporation have entered into a definitive business combination agreement that would take KQC public on Nasdaq under the expected ticker KQC. KQC plans to use the transaction proceeds to develop its Qubiteer quantum computing platform, QuantumSpan security platform and other quantum-safe products while expanding customer and delivery teams. The proposed transaction values KQC at approximately $80 million pre-money and is expected to close in the first half of 2027, subject to shareholder, SEC, Nasdaq, minimum-cash and other conditions. PRESS RELEASE — KQC Quantum, Inc. (“KQC Parent”), the Delaware parent company of Korea Quantum Computing Co., Ltd. (“KQC” or the “Company”), which helps enterprises adopt quantum computing and quantum-safe security, and Charlton Aria Acquisition Corporation (Nasdaq: CHAR) (“Charlton Aria”), a publicly traded special purpose acquisition company, today announced that they have entered into a definitive business combination agreement (the “Business Combination Agreement”). Upon completion of the proposed transaction (the “Business Combination”), Charlton Aria will become a wholly owned subsidiary of KQC Parent, with shares of common stock of the combined company expected to trade on The Nasdaq Stock Market under the ticker symbol “KQC.” The Business Combination is expected to give KQC access to the U.S. public capital markets to fund its next stage of commercialization: engineering Qubiteer and its quantum-safe security platform into repeatable products, building the teams that turn customer pilots and proofs of concept into deployments, and completing product security certifications. Putting Quantum Technology to Work for Enterprises KQC was founded in Busan in 2021 on the view that enterprises adopt quantum technology not because of hardware milestones alone, but when a real business problem can be expressed in a form a computer can solve, run on the right resource, and deli
Phys.org Quantum Physics·2026-10-07
No generated summary available for this entry.
overview
Original abstract
Two studies on critical topology have recently been published in the journal Nature. These studies were led by the teams of Prof. Baile Zhang at Nanyang Technological University, Singapore, and Prof. Jianhua Jiang at the University of Science and Technology of China, respectively. Prof. Xue-Jia Yu from the School of Physics at the Eastern Institute of Technology, Ningbo (EIT), served as a co-corresponding author on both papers and provided key theoretical guidance in the related experimental collaborations.
The Quantum Insider·2026-10-07·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Quantus opened trading for its native QTC token on near.com, extending access to its blockchain designed for post-quantum security beyond its native network. Users can buy QTC confidentially with more than 180 assets across over 30 chains through accounts they control, without first transferring funds to an exchange or bridging assets. Integration with the NEAR Intents 1Click Swap API allows participating wallets and applications to offer QTC without building Quantus -specific infrastructure. PRESS RELEASE — Quantus , the proof-of-work blockchain built for quantum-safe money, today opened trading for its native token QTC, with near.com as its launch venue. Holders of BTC, ETH, USDC, ZEC, and 180+ other assets across 30+ chains can buy QTC confidentially from a near.com account they control, without sending funds to an exchange or bridging first. Quantus is also integrating with NEAR Intents to create a distribution path beyond individual exchange and platform listings. QTC is available through the NEAR Intents 1Click Swap API, meaning any wallet or application already integrated with 1Click can give its users access to QTC across the broader NEAR Intents ecosystem without building Quantus-specific infrastructure. This allows QTC to reach new applications and their users through a single integration rather than requiring a separate integration with every platform. QTC launches without a centralized exchange listing. Holders keep it in an account they control on near.com, and NEAR accounts can be secured with ML-DSA, the NIST-standardized post-quantum signature scheme. NEAR is one of the first blockchains with quantum-safe signing live on mainnet . QTC is built to be permanent money: quantum-safe at the protocol level, and confidential and cross-chain from day one on near.com. When quantum computing advances to sufficient scale, the cryptography that secures the majority of blockchains will become vulnerable. Quantus was specifically designed to ad
The Quantum Insider·2026-10-07·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Quantum City , the UK National Quantum Technologies Programme’s public engagement initiative, has relaunched with a redesigned website, updated resources and a strategy focused on training and quantum career pathways. Funded by EPSRC, Quantum City brings together the UK Quantum Technology Hubs and partners including the National Physical Laboratory and National Quantum Computing Centre. The initiative will provide quantum case studies, training resources, career information, events and insights aimed at students, professionals and the wider public. PRESS RELEASE — Quantum City , the public engagement initiative representing the UK National Quantum Technologies Programme, has relaunched today with a redeveloped website, updated resources and a new strategy aimed at highlighting training opportunities and career pathways for the sector. Designed for a wide range of audiences, Quantum City makes quantum science and technology accessible, engaging and relevant. Funded by the Engineering and Physical Sciences Research Council, part of UK Research and Innovation, Quantum City is a collaboration developed by the network of UK Quantum Technology Hubs. Working in partnership with other key stakeholders, including the National Physical Laboratory and the National Quantum Computing Centre, it brings together expertise from across the national quantum landscape to showcase the potential of these emerging technologies and their societal benefits. Quantum technologies offer capabilities unmatched or even unattainable by their classical equivalents. From tackling climate change and improving healthcare to strengthening security, transport, and communications, including via satellites in space, quantum technologies are unlocking new ways to solve complex challenges and create a more sustainable, connected, and resilient future. The UK has long been a leader in research development in the field, and this status was cemented in 2014 with the inception of the Natio
The Quantum Insider·2026-10-07·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Argonne researchers developed an X-ray imaging technique to track silicon carbide’s response to ultrafast laser pulses, providing insights that could improve the precision of creating quantum defects. The measurements revealed energy moving through the crystal as fast mechanical waves and more slowly dispersing heat, capturing changes across its surface and into its interior. The technique could help researchers refine laser conditions to create more reliable defects for use as qubits, though precise placement remains a long-term goal. Image: In a new technique developed at Argonne, an X-ray beam is directed at silicon carbide at a controlled time after the material is struck by a pulse of laser light. The X-ray acts like a camera, letting scientists see in real time how the material responds to the laser. (Haidan Wen/Argonne National Laboratory) PRESS RELEASE — Creating a quantum device often begins by intentionally damaging a crystal. Scientists fire an ultrafast laser pulse into a material, knocking atoms out of place and leaving behind tiny imperfections called vacancies. Far from being flaws, these vacancies can behave as qubits — the fundamental building blocks of quantum information. The challenge is precision. Researchers want to place these quantum defects exactly where they need them, but until now they have had only a limited understanding of what happens inside a crystal during the instant when a laser creates the defect. Scientists at the U.S. Department of Energy’s (DOE) Argonne National Laboratory have now taken an important step toward solving that problem. Using the Advanced Photon Source (APS), a DOE Office of Science user facility, the team developed a new X-ray imaging technique that lets them watch, in three dimensions and in real time, how silicon carbide responds immediately after an ultrafast laser pulse strikes it. Their work provides real-time pictures of how the laser’s energy moves through the material — a ke
The Quantum Insider·2026-10-07·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Zumo and Quantum Chain have partnered to explore quantum-secure financial infrastructure and digital asset applications in the UK. The collaboration will examine integrating Quantum Chain ’s quantum-secure blockchain infrastructure with Zumo’s digital asset infrastructure for regulated financial institutions. The companies plan to explore quantum-secure digital asset management and institutional blockchain use cases across the UK market. PRESS RELEASE — Zumo and Quantum Chain have teamed up to explore opportunities for quantum-secure financial infrastructure in the United Kingdom. The collaboration brings together Quantum Chain ’s quantum-secure blockchain infrastructure with Zumo’s digital asset infrastructure and experience supporting enterprise and institutional applications spanning quantum-secure private networks, digital currencies and tokenized assets. As financial institutions continue to adopt blockchain-based infrastructure for payments, deposits and digital assets, the collaboration will focus on ensuring Zumo’s services remain secure and resilient against emerging threats, including those posed by quantum computing. The partnership reflects a forward-looking approach to infrastructure, embedding stronger security considerations and finance-first performance into systems being built for long-term use. The collaboration will explore: Quantum-secure digital assets: Integrate Zumo and Quantum Chain to support quantum safe digital asset management across central banks, banks and regulated institutions. Institutional market development: Jointly explore digital asset use cases across the UK market. Over the longer term, the collaboration aims to support the development of an ecosystem in which institutions can deploy future-proof digital assets and blockchain-based financial services designed to be secure against emerging threats. Nick Jones, Founder and CEO of Zumo, said: “The UK is preparing for the full implementation of its regulatory re
Quantum Computing Report·2026-10-07·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Chandigarh University's CUBIC has partnered with 247VC Investment Trust to create an investment and mentorship pipeline for quantum and deep-tech startups. This collaboration, established during the PRAGATI Q-Foundry 2026, aims to transition academic quantum research into industrial and commercial deployment. CUBIC will identify eligible seed and early-stage ventures, facilitating their access to funding and mentorship from 247VC. The post Chandigarh University’s CUBIC Partners with 247VC to Expand Investment Framework for Deep-Tech Startups appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-07·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Zumo, a UK-based digital asset platform, has partnered with Quantum Chain to build quantum-safe financial infrastructure in the UK. This collaboration aims to protect regulated institutions, private networks, and digital payments from quantum computing and AI-driven cyber threats. The initiative will deploy post-quantum cryptography across central bank digital currencies (CBDCs), tokenized deposits, stablecoins, and private financial networks, aligning with the UK's upcoming cryptoasset regulations. The post Zumo and Quantum Chain Partner to Deploy Quantum-Secure Financial Infrastructure in the UK appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-07·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Bengaluru-based Quanfluence has raised $10 million in a funding round led by Chiratae Ventures, with Pi Ventures and Rainmatter by Zerodha participating. The company plans to use the funding to build a full-stack photonic quantum computer combining its photonic chips, control electronics and software. Quanfluence is targeting early processors by 2027 and larger systems by 2029, building on its work in photonic integrated circuits, electronic circuits, quantum light generation and photonic devices. PRESS RELEASE — Quanfluence , a Bengaluru-based deep technology company building photonic quantum computers, has raised USD 10 million in a funding round led by Chiratae Ventures. Pi Ventures, which led Quanfluence’s seed round in 2024, returned as co-investor. Rainmatter by Zerodha also invested in this round. The capital will be deployed to build Quanfluence ’s full-stack photonic quantum computer, bringing together indigenously designed photonic chips, control electronics and the software layer into a single system. The company has a roadmap with early processors by 2027 and larger scalable machines by 2029. Since its previous funding round, Quanfluence has built out several of the core technologies required for its full-stack architecture. The company has designed and fabricated multiple photonic integrated circuits (PICs) and electronic integrated circuits (EICs), developed low-loss chip-to-fiber coupling designs, and demonstrated the generation of quantum light states. It has also made significant progress on photonic chips for light-matter interactions. In parallel, Quanfluence has moved parts of its technology beyond the laboratory: its photonic Ising machine has been productized, and several quantum devices developed by the company are now commercially available. Sujoy Chakravarty, Co-founder and CEO, Quanfluence , said: “Our goal at Quanfluence has never been to build a better experiment. It has been to build a useful quantum computer. We chos
Quantum
·2026-10-07
·Rick P. A. Simon et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Measuring the state of quantum computers is a highly non-trivial task, with implications for virtually all quantum algorithms. A promising avenue is multi-copy schemes, where identical copies of a quantum state are measured jointly so that all Pauli operators within the considered observable can be simultaneously assessed. Here, we present a first implementation of such a two-copy scheme in a measurement protocol. Based on Bayesian statistics, it accurately estimates not only the average of the desired observable but also the error en route. This enables an adaptive shot-allocation algorithm that preferentially samples the most uncertain Pauli terms. In regimes with many non-commuting Pauli operators, this “double&apos;&apos; scheme can outperform the state-of-the-art measurement protocol in minimizing total shots for a given precision. We also numerically confirm the finding in previous theoretical works that the two-copy scheme incurs an overhead due to the square-root relationship between the variance of measured quantities and the number of measurement shots.
PRX Quantum
·2026-10-07
·Anonymous
·doi
No generated summary available for this entry.
overview
PRX Quantum
·2026-10-07
·Anonymous
·doi
No generated summary available for this entry.
overview
Quantum Science and Technology
·2026-10-07
·晓旭 宁 et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract The Quantum Mpemba effect (QMPE) is characterized by a state initially farther from equilibrium relaxing faster than one closer to it. In this work, we investigate the QMPE in an open central-spin model, and examine whether the QMPE emerges when the spins' system is subjected to their independent noisy environment for different initial states. Simultaneously, we analyze the influence of the noisy environment on the dynamics and demonstrate that tuning local noise strengths can induce the QMPE. Furthermore, we systematically explore finite-size effects by varying the number of peripheral spins. In addition, we investigate the Pontus Mpemba effect within the same framework, demonstrating that an auxiliary decohering environment can accelerate the approach to stationarity. To observe the effect, we select the trace distance, energy, and l 1 -norm coherence as observables. By combining initialstate engineering (global rotation operations) with the modulation of the noisy environment, we clearly reveal the physical mechanisms for inducing and controlling the QMPE in this model. Our results show that both rotating the initial states and applying non-uniform local noises can alter the relaxation rate ordering among different states, leading to crossings in the evolution curves of various physical quantities, that is, the realization of the QMPE. This finding provides a new perspective for manipulating anomalous relaxation behavior in the quantum many-body system and open quantum system.
npj Quantum Information
·2026-10-07
·Di Fang, Diyi Liu, Shuchen Zhu
·doi
No generated summary available for this entry.
overview
No generated summary available for this entry.
overview
Original abstract
Abstract Accurate excited-state energies are essential for interpreting fluorescence and photochemical processes, yet variational quantum eigensolvers (VQEs) on noisy intermediate-scale quantum (NISQ) hardware have largely been confined to ground states. Subspace-search VQE (SSVQE) offers a NISQ-friendly route to excited states without ancilla-based overlap measurements, however it has lacked an experimental demonstration since it requires the coherent preparation and manipulation of multiple orthogonal basis states under a shared variational unitary. Here we realize SSVQE on a photonic platform by encoding orthogonal qudit states in the orbital angular momentum of single photons and optimizing a shared variational circuit. We estimate excited-state energies for a four-dimensional HeH + molecule and an eight-dimensional Heisenberg chain, thereby demonstrating scalable excited state eigensolving in a high-dimensional Hilbert space. Our results establish photonic qudits as a resource-efficient pathway to excited-state quantum simulation.
arXiv·2026-10-07·Md Masum Mia, Amith Khandakar, Mohamed Arselene Ayari
No generated summary available for this entry.
overview
Original abstract
Hybrid quantum neural networks (QNNs) pair a classical feature extractor with a variational quantum circuit, and the effective dimension of the circuit's quantum Fisher information matrix (QFIM) is widely used to assess such models. This scalar is often interpreted as an indicator of trainability or accuracy, although these readings are rarely tested under controlled conditions. We therefore investigate what it actually measures. We define the effective dimension as the participation ratio of the QFIM diagonal, which lies between one and the parameter count, and we evaluate it across two image datasets, four frozen backbones including a random-projection control, four circuit depths on eight qubits, and three seeds. During training, the effective dimension remains well below the parameter count, and its correlation with test accuracy ranges from -0.72 to +0.87, changing sign across seeds in half of the configurations. Increasing depth activates a larger share of the circuit directions, from 0.38 to 0.91 of the parameter count, while the initialization gradient variance remains between 1e-5 and 1e-4, so no barren plateau (BP) appears at eight qubits. At a fixed circuit, the four backbones share an initial effective dimension of 6 to 9, even though CIFAR-10 accuracy ranges from 23.14% to 86.44%. These results show that the effective dimension characterizes circuit geometry rather than model quality. We conclude with a practical protocol that assigns each diagnostic to the question it can answer.
arXiv·2026-10-07·Aayra Dhindsa Sawkmie
No generated summary available for this entry.
overview
Original abstract
The Travelling Salesman Problem (TSP) is a classic combinatorial optimisation problem which is NP-hard in optimisation form and NP-complete as a decision problem. The standard question asks for the shortest tour that visits every city exactly once and returns to the origin. This paper studies a threshold-fraction variant, which we call the robust TSP, formulated as a promise problem: given a distance threshold $K$ and a promised fraction $p$, decide whether at least a fraction $p$ of all tours have total length at most $K$, or whether no such tour exists. We show that Grover's quantum search algorithm decides this problem using $O(1/\sqrt{p})$ oracle queries, independent of the number of cities $N$, with each query implemented by a quantum circuit of polynomial size in $N$. For any fixed robustness level $p$, the total runtime is therefore polynomial in $N$. Measured in oracle queries, the quantum algorithm offers a quadratic improvement in the dependence on $1/p$ over classical random sampling, which needs $Θ(1/p)$ samples; because each quantum query is costly, however, it is faster in total running time only when $p$ is very small (roughly below $N^{-4}$), where the number of queries is no longer constant. We describe the problem formulation, detail the oracle construction (edge-length loading, sequential quantum addition, and threshold comparison), and analyse the query complexity to achieve the required result.
arXiv·2026-10-07·Stuart J. Masson
No generated summary available for this entry.
overview
Original abstract
Many-body entanglement in atomic ensembles offers the potential for enhanced sensing devices. Entanglement can be generated by interfacing atoms with a cavity. Traditional methods use effective two-level systems isolated from more complex atomic level structures. However, alternative strategies allow entanglement to be generated in atoms confined to a single hyperfine manifold. These strategies enable entanglement in ways fundamentally not available to two-level systems but feature extremely slow dynamics due to requiring strongly off-resonant laser fields. Here, I show that equivalent squeezing dynamics can be achieved much closer to resonance, offering entanglement generation over a hundred times faster than typical experiments. Furthermore, the Hamiltonian can be used to speed up the creation of maximally entangled states via adiabatic passage.
arXiv·2026-10-07·Yayu Mo et al.
No generated summary available for this entry.
overview
Original abstract
Orbital angular momentum (OAM) modes have emerged as an important platform for high-dimensional quantum communication but remain vulnerable to environmental noise and channel imperfections. Here we introduce a logical-qubit representation of OAM propagation in which modes evolve as qubits through noisy quantum channels. In this representation, turbulence manifests as leakage from the logical OAM subspace into turbulence-induced leakage components, providing a unified description of degradation in both single-photon and coherent-beam regimes. We show that turbulence-induced leakage exhibits systematic dependence on turbulence strength and OAM order, revealing structured signatures of information redistribution beyond the logical subspace. Leveraging this insight, we develop a distributed quantum feature-extraction scheme that encodes high-dimensional OAM states into quantum representations and employs quantum convolutional operations to extract turbulence-robust features. Simulations and experimental measurements demonstrate robust extraction of these features across a broad range of turbulence strengths, OAM orders, and propagation conditions. Our results establish a direct link between OAM-channel dynamics, structured leakage, and quantum learning, providing a physics-informed framework for characterizing turbulence-degraded high-dimensional optical states and extracting robust signatures of turbulence-induced information redistribution.
arXiv·2026-10-07·Nicolò Piccione
No generated summary available for this entry.
overview
Original abstract
Spontaneous collapse models provide a possible, testable solution to the quantum measurement problem, but constructing a relativistic version applicable to quantum field theory remains an important open challenge. Challenges in constructing relativistic collapse models include avoiding superluminal signaling and foliation dependence, controlling energy production, and ensuring vacuum stability. Here, we present a relativistic collapse framework that addresses these problems at the cost of introducing a new space of physical states, whose complete characterization is left open. A modified, history-dependent Aharonov--Albert prescription describes instantaneous nonlocal state updates on arbitrary spacelike foliations while preserving foliation independence. To ensure vacuum stability, we modify the standard unitary evolution through a prescription that we name dynamical vacuum subtraction. The resulting dynamical map is linear and trace-preserving but not positive on the full set of standard density operators. We establish no-signaling by proving microscopic parameter independence, and identify conditions under which standard nonrelativistic collapse dynamics are recovered. Finally, we apply our framework to a free massive scalar field, obtaining finite particle-number and energy-increase rates at leading order in the long-time regime, together with further promising evidence for the consistency of the framework.
arXiv·2026-10-07·Ahmed Adel Mahmoud, Steven Rayan
No generated summary available for this entry.
overview
Original abstract
Quantum fault tolerance is a prerequisite to harness the full potential of quantum computers. However, achieving fault tolerance remains a major challenge since it requires optimizing tradeoffs between several intertwined theoretical and experimental parameters, including the encoding rate, code distance, parity-check weights, code planarity, and routing. Surface codes remain strong candidates for fault tolerance due to their simple geometric structure, established decoding methods, locality, and experimental attainability. In this work, we present finite families of hyperbolic surface codes that leverage the optimal efficiency scaling $kd^2/n = C (\log{k})^2$ attainable by surface codes with bounded local geometry. We show that optimizing the periodic identifications can double the code distance and thereby increase the code's efficiency by a factor of four, at fixed qubit count, encoding rate, and parity-check weight. We also address the routing problem of hyperbolic surface codes by introducing a topology-aware algorithm that partitions a hyperbolic code into bounded planar modules while reducing long-range communications demand. Circuit-level Monte Carlo simulations yield finite-size threshold estimates for both modular and monolithic layouts, showing that tripling the long-range gate error probability mildly lowers, but does not eliminate, the estimated error-correction thresholds. Together, these results strengthen the case for hyperbolic surface codes as structured and highly efficient large-scale quantum error correction codes for future fault-tolerant architectures.
arXiv·2026-10-07·Ayoub El-Amrani et al.
No generated summary available for this entry.
overview
Original abstract
Polaritons and quantum vacuum dressing are usually regarded as intertwined consequences of ultrastrong light-matter coupling. Here we show that they can be controlled independently through helicity. We consider cyclotron resonance coupled to a chiral cavity supporting a single circular mode. When the helicity of the cavity field matches the cyclotron motion, energy is exchanged resonantly between light and matter, producing a large Rabi splitting and conventional polaritons, while the ground state remains the bare vacuum. Reversing the magnetic field reverses the cyclotron motion without changing the cavity. The same mode then couples through anomalous processes that create and annihilate light and matter excitations in pairs: the conventional polaritonic anticrossing disappears, while the ground state acquires squeezing and virtual excitations. These two regimes show that spectral hybridization and quantum vacuum dressing are distinct manifestations of ultrastrong coupling, and that a large Rabi splitting alone does not imply a dressed quantum vacuum. Helicity therefore provides a route to controlling polariton formation and quantum correlations as distinct resources in cavity quantum materials.
arXiv·2026-10-07·Mustafa Türe, Mithat Ünsal
No generated summary available for this entry.
overview
Original abstract
In quantum mechanics of genus-1 potentials, perturbation theory around the topologically trivial saddle and non-perturbative instanton saddle are constructively related via the P/NP relation. Whether such a relation persists for higher-genus potentials has remained an open problem. In this work, we resolve it using tools from complex algebraic geometry combined with exact WKB. The classical energy conservation relation $p^2 = 2(E-V(q))$ defines a genus-g Riemann surface $X$, whose periods are naturally organized by its Jacobian variety $J(X) = \mathbb{C}^{\text{g}}/Λ$ via the Abel-Jacobi map, and independently by the solution basis of the associated Picard-Fuchs equations. We show that the physically relevant, WKB-active cycles are generally related to the Picard-Fuchs basis by a linear transformation that lies in $\text{SL}(2\text{g},\mathbb{Z})$ but not in the symplectic group $\text{Sp}(2\text{g},\mathbb{Z})$ once $\text{g}\geq2$, in contrast to the genus-1 case, where the two groups coincide. This mismatch is the obstruction that has made an explicit higher-genus P/NP relation elusive. We show that it can be resolved by passing to a modified Riemann bilinear identity, built from a suitably transformed intersection matrix, which the WKB-active periods do satisfy exactly. The result is an all-orders quantum P/NP relation valid for potentials of arbitrary genus, which we derive explicitly for genus-2 (quintic and sextic) and genus-3 (septic and octic) anharmonic oscillators.
arXiv·2026-10-07·Kuchibhotla Aditi, Stephen Becker
No generated summary available for this entry.
overview
Original abstract
Quantum fidelity estimation is a fundamental task in quantum information and computing to benchmark the quality of quantum states, and hence of quantum processes, on noisy quantum hardware. Point estimates of fidelity by existing methods generally lack the rigorous uncertainty quantification required for reliable preparation and verification of these tasks. While Bayesian and bootstrap frameworks are widely used for uncertainty quantification, they are sensitive to model misspecification or lack formal coverage guarantees in non-asymptotic regimes. This paper introduces a hybrid "Bayesian-informed" conformal prediction-based framework to provide distribution-free, rigorous prediction intervals for quantum state fidelity estimation which can be used, with care, to approximate confidence intervals with respect to the quantum randomness of Born's rule. The framework requires a point estimator, and we consider both classical point estimators as well as data-driven neural net estimators. We evaluate the robustness of the methodology across a diverse range of experimental challenges, including finite-sample noise, tomographic incompleteness, physical model error, and out-of-distribution data. Our results demonstrate that conformalized estimators maintain statistical validity where traditional methods fail, offering a scalable and reliable approach for the verification of modern quantum systems. The best performing variant of our methodology is based on a class-conditional conformal prediction, as this most closely approximates the conditional coverage desired for a true confidence interval.
arXiv·2026-10-07·Roohollah Ghobadi et al.
No generated summary available for this entry.
overview
Original abstract
We formulate diffractive ring focusing of paraxial beams carrying orbital angular momentum (OAM) through a finite circular aperture as a variational optimization problem. For a fixed topological charge, we determine the real-valued radial pupil that maximizes the intensity at a prescribed ring radius and propagation distance under a normalization constraint on the input field. The resulting problem admits an exact analytical solution: the optimal pupil combines the familiar Fresnel phase structure with an OAM-dependent Bessel radial modulation, and the associated eigenvalue yields a rigorous upper bound on the achievable ring intensity. We further analyze the lens-assisted configuration and derive a simple bound that allows direct comparison between diffractive and refractive vortex focusing. The theory also provides a quantitative framework for evaluating the performance of practical mask designs, including binary Fresnel-Bessel zone plates and amplitude-weighted pupils. We have experimentally tested our predictions in the optical domain by implementing the corresponding vortex beam pupils and comparing their propagation and focusing performance with the optimal solution. Our results establish the vortex-beam analogue of optimal amplitude-only focusing and identify the fundamental limits governing diffractive concentration of structured waves
arXiv·2026-10-07·Matthew Chen, Natalie Klco
No generated summary available for this entry.
overview
Original abstract
One aspect of complexity for quantum many-body systems resides in their ability to exhibit entanglement, uniquely quantum correlations central to quantum computation. To quantitatively explore the diminishing effect that quantum noise has on entanglement resources, we focus on the negativity witness, an entanglement measure based on local time reversal transformations that provides a perfect witness in simple physical contexts. Beyond calculation of the negativity, we analyze the associated eigenvalue spectra of partially transposed density matrices for qudit-qudit bipartitions, finding that higher negativity rank provides greater(reduced) robustness to targeted(depolarizing) noise. In particular, we extend the maximum number of separable states that can be arbitrarily mixed into an entangled pure ensemble while retaining negativity to be exactly equal to the original negativity rank. Furthermore, we report how understanding the role of the negativity rank with respect to the completely depolarizing channel allows direct calculation of (1) certain noise boundaries for the Absolutely Positive Partial Transpose (APPT) subspace beyond which no unitary operator is capable of generating negativity and (2) the maximum qutrit-qutrit APPT purity. Beyond proving tight bounds and contributing to the ongoing search for APPT entanglement, these results expand our understanding of the nuanced relationship between computation with entanglement and practical environments for operating quantum devices.
arXiv·2026-10-07·Alessandro Prositto, Dvira Segal
No generated summary available for this entry.
overview
Original abstract
We investigate the relaxation dynamics and steady state of a qubit interacting with a coherent environment through an energy-conserving flip-flop interaction within the Markovian repeated-interaction framework. We derive an exact analytical solution for the evolving and stationary state, nonperturbative in the environmental coherence. We show that environmental coherence provides a resource for dissipative state preparation by expanding the set of accessible steady states. In particular, coherent ancillas can increase the system ground- state population beyond that of the bath, corresponding to an effective temperature below the bath temperature, and enhance its steady-state purity, with these effects controlled by the interplay between the system energy scale and the system-ancilla coupling. Nevertheless, we prove that the purity of the system can never exceed the purity of the ancilla. We further analyze the thermodynamics of the protocol and show that environmental coherence can modify and even reverse the natural direction of heat transfer, giving rise to anomalous heat flow. Remarkably, for fixed interaction parameters, the direction of the coherence-induced heat transfer is governed by the relative phase between the system and ancilla coherence, whereas their magnitudes determine the amount of heat exchanged. Our results establish environmental coherence as a resource for controlling steady-state preparation and energy transfer in repeated-interaction dynamics.
arXiv·2026-10-07·Amana Liaqat et al.
No generated summary available for this entry.
overview
Original abstract
The Minimum Birkhoff Decomposition (MBD) seeks a sparse weighted sum of matchings and is a challenging optimization problem with applications in network scheduling and energy trading. We scale a quantum-assisted decomposition method by combining single-layer QAOA sampling with Extended Fully-Corrective Frank-Wolfe (E-FCFW) optimization, spectral graph partitioning, and greedy feasibility repair. We demonstrate the pipeline on the 1,354-node PEGASE bus test case (representing a 1,354-bus transmission grid with 1,710 transmission lines), whose 1,710 edges define a native 1,710-variable matching optimization problem requiring 1,710 qubits in the unpartitioned encoding. Partitioning enables distributed execution on IBM superconducting quantum processors. The best reported hardware result uses a 50-qubit partition bound, while reducing partitions to 20 qubits degrades convergence in the partition-size comparison. Larger partitions are more demanding for matrix product state (MPS) simulation, and bond-dimension tests show that truncating quantum correlations reduces candidate quality. The results therefore motivate retaining a substantive quantum sampling task within each partition as the overall problem scales. On the PEGASE-1354 benchmark, repaired QAOA samples achieve lower residual decomposition error than both simulated annealing and uniform random sampling baselines, while spatial circuit packing reduces hardware execution time by approximately a factor of three. These results demonstrate that combining spectral partitioning, spatial circuit packing, and classical feasibility repair provides an executable path for deploying gate-based quantum sampling on thousand-variable constrained optimization problems on current hardware.
arXiv·2026-10-07·Niloofar Vardian
No generated summary available for this entry.
overview
Original abstract
The island proposal guarantees a unitary Page curve for evaporating black holes, implying that operators deep behind the horizon must be fully reconstructable from asymptotic Hawking radiation. However, because the interior is causally disconnected and highly dynamical, standard entanglement wedge reconstruction methods, relying on global isometries or continuous modular flow, fail to provide this mapping. We resolve this by constructing a protocol for island reconstruction using the algebraic Petz map. By using modular theory, we reflect island operators into the accessible complement, transport them to the boundary, and map them into the radiation algebra. Furthermore, we demonstrate that this purely algebraic derivation naturally yields the structure of Papadodimas-Raju mirror operators. This framework provides a rigorous operational dictionary for the island formula, proving that information trapped inside a black hole can be decoded.
arXiv·2026-10-07·Sinara S. Dourado et al.
No generated summary available for this entry.
overview
Original abstract
Effective models make complex quantum dynamics tractable by retaining only the states, processes, and timescales relevant to a given physical question. Their predictive power, however, depends on treating the retained manifold, initial state, observables, micromotion, dissipative channels, and eliminated degrees of freedom consistently. We develop a unified framework for constructing and validating effective descriptions using projection methods, Schrieffer--Wolff transformations, Magnus expansions, adiabatic elimination, small rotations, time coarse graining, and Floquet theory. The quantum Rabi model and its dispersive limits serve as recurring benchmarks for identifying control parameters, virtual processes, spectral corrections, observable dressing, and breakdown. Higher-order resonances and applications to collective light--matter coupling, Raman processes, spin-chain buses, lossy mediators, and driven lattices illustrate how effective interactions can be interpreted and designed. A physical prediction is organized into three order-consistent steps: encoding into the retained description, evolution under the effective dynamics, and reconstruction of the physical observable. This viewpoint exposes failures caused by leakage, small denominators, neglected micromotion, inconsistent observables, memory effects, or incorrectly transformed dissipation, while linking derivation, physical interpretation, and mechanism-guided discovery. Companion notebooks provide QuTiP implementations, convergence tests, and microscopic-to-effective comparisons.
arXiv·2026-10-07·Varun Menon et al.
No generated summary available for this entry.
overview
Original abstract
Quantum low-density parity-check (qLDPC) codes can substantially reduce the qubit overhead of fault-tolerant quantum computation, but any useful architecture based on such codes also requires an efficient mechanism to implement non-Clifford gates in a fault-tolerant manner. We introduce a space-time-efficient magic state factory for high-rate qLDPC codes by combining the transversal non-Clifford gates of recently developed tricycle codes with single-shot four-dimensional balanced product quadcycle codes. The key ingredient is an efficient "escape" mechanism that teleports postselected logical magic states from tricycle codes to larger distance quadcycle codes. Under a standard circuit-level noise model at physical error rate $10^{-3}$, our factories produce $\mathrm{CCZ}$ states at logical error rates as low as $10^{-9}$ with 10-40 times lower space-time cost than state-of-the-art magic state generation methods. The resulting states are directly encoded in high-rate blocks suitable for computation. We identify the quadcycle codes by an AI-assisted search and show that they can serve as excellent memories capable of single-shot error correction. Finally, we present a concrete implementation of the entire factory with highly efficient atom transport on reconfigurable neutral-atom quantum computers. Together, these results provide an end-to-end, practical protocol for producing and utilizing high-fidelity magic states within a high-rate qLDPC architecture, with the lowest space-time cost to date.
arXiv·2026-10-07·Emanuele Palumbo et al.
No generated summary available for this entry.
overview
Original abstract
Optimizing Josephson-based nonlinear microwave devices is computationally demanding because the straightforward approach requires exploring broad circuit parameter spaces through expensive nonlinear simulations. Josephson Circuits Optimizer addresses this problem by using harmonic balance simulations in two stages: fast linear simulations to select promising circuit configurations according to properties such as impedance and phase matching, followed by nonlinear simulations to optimize their operating conditions. However, pump-induced effects such as impedance renormalization and Kerr-induced modifications of phase matching are not captured during the initial linear stage. We therefore introduce a nonlinear feedback extension that transfers information from the pumped response back to the linear optimization. The approach is investigated using a Josephson traveling-wave parametric amplifier with a reversed-Kerr architecture, whose model is validated against experimental gain measurements. We then evaluate the difference between the linear and pumped response values of a metric based on the input reflection coefficient, while excluding configurations with insufficient third-harmonic suppression. This discrepancy is considered a candidate feedback observable, as it exhibits features similar to the gain landscape, supporting its use in subsequent optimization cycles.
arXiv·2026-10-07·Takuma Makihara et al.
No generated summary available for this entry.
overview
Original abstract
Quantum mechanics predicts that a vibrating object's energy comes in discrete packets, yet no measurement of its position reveals this discreteness. Resolving individual energy levels requires a qualitatively different measurement, one coupling to the resonator's energy rather than its displacement. We use a superconducting qubit dispersively coupled to a nanomechanical resonator to perform repeated quantum nondemolition measurements of the phonon number. An aligned transfer-print technique integrating the qubit and resonator yields a mechanical lifetime of $T_1 = 2.1$ milliseconds and a dispersive shift of $2χ/2π= 328$ kilohertz per phonon. We heralded single-phonon states with 85% fidelity and observed quantum jumps between the resonator's first excited state and ground state. These discontinuous transitions are a striking manifestation of quantum mechanics in a massive, vibrating object.
arXiv·2026-10-07·Henning Schlömer et al.
No generated summary available for this entry.
overview
Original abstract
A long-term goal of quantum simulation is to faithfully reproduce the low-energy Hamiltonians of correlated quantum materials, establishing a direct connection between solid-state experiment, electronic-structure theory, and programmable many-body systems. Here, we introduce an integrated quantum-simulation architecture based on fermionic alkaline-earth atoms that enables programmable control over the key ingredients of multi-orbital material Hamiltonians. Long-lived clock states encode synthetic orbitals, their differential polarizabilities generate orbital-selective tunneling, and contact interactions provide multi-orbital Hubbard and Hund couplings. Spatially structured coherent driving on the ultra-narrow clock transition further realizes symmetry-selective inter-orbital hybridization, while the clock detuning independently controls orbital energy offsets. In this way, the spatial symmetries of solid-state orbitals can be encoded directly into the effective Hamiltonian, even though the atoms themselves remain in conventional $s$-wave Wannier orbitals of the lowest optical-lattice bands. We demonstrate the resulting integrated control using the four-band low-energy Hamiltonian of the bilayer nickelate La$_3$Ni$_2$O$_7$ as a demanding benchmark. Self-consistent calculations show that the microscopic parameters obtained from first-principles modeling can be reproduced within a single experimentally accessible lattice configuration and independently programmed over substantial parameter ranges. Our results establish a general route for translating material-derived multi-orbital Hamiltonians into programmable ultracold-atom quantum simulators.
arXiv·2026-10-07·Miguel Gonçalves et al.
No generated summary available for this entry.
overview
Original abstract
Moiré materials host integer and fractional Chern insulators (FCIs) where time-reversal is broken spontaneously by flat band ferromagnetism. In twisted MoTe2, unlike in quantum Hall, opposite spins carry opposite Chern numbers and realize Ising ferromagnetism with gapped magnon excitations. Clarifying the nature of these collective modes and the origin of the magnon gap is key to understanding the stability of the Chern magnets in these materials. To do so, we develop a generalized single-mode approximation, which we call the symmetric mode ansatz (SyMA), to describe the low-energy magnon spectrum. We find it to be in exceptional agreement with numerical calculations at integer filling, and qualitatively accurate across fractional fillings including FCIs. To explain the accuracy of the SyMA, we present two families of Hubbard models (including the Haldane model and continuum ideal bands) whose collective modes are analytically solvable and for which the SyMA is either exact or an accurate approximation. For a class of these models where SyMA is exact, we prove two-sided bounds on the zero-momentum magnon gap in terms of the Chern number, Berry curvature, and quantum metric, revealing that uniform quantum geometry is sufficient for stabilizing magnetism in Chern bands.
arXiv·2026-10-07·Lukas Hartung et al.
No generated summary available for this entry.
overview
Original abstract
Distributed quantum computing requires rapid, high-fidelity entanglement between qubits in separate processor modules. Photonic links between single-atom qubits provide switchable, long-range connections, but photon loss limits their entanglement rate. Here we entangle a trapped $^{138}$Ba$^{+}$ ion with a silicon-vacancy (SiV$^{-}$) center in a diamond nanophotonic cavity. A photon emitted by the ion is converted in wavelength and encoding, reflected from the SiV$^{-}$--cavity system and detected, so that a single detected photon heralds entanglement. Including all conversion losses, we generate ion--SiV$^{-}$ Bell pairs at an average rate of 1.03(1)\,kHz with a fidelity of 87.9(7)\%. This is four times the rate of the fastest photonic link between two trapped ions and corresponds to one Bell pair per millisecond, matching the cycle time of planned trapped-ion processors.
arXiv·2026-10-07·Yuan-Hao Zheng, Jiayin Gu
No generated summary available for this entry.
overview
Original abstract
We construct the entanglement entropy of a general scattering process between one particle species (denoted as $A$) and the rest of the final state. Assuming a pure initial momentum eigenstate, we show that the reduced density matrix in particle $A$'s Fock space is block-diagonal in zero-, one- and multi-particle states, and is diagonal in the momentum basis for the one-particle state. As a result, we could write down the Von Neumann entropy of particle $A$, $S_A$, in terms of scattering probabilities and differential cross sections, assuming no more than one particle $A$ is produced in the final state. $S_A$ contains the information of both the total scattering probabilities (or cross sections) and the differential distributions --- the latter depends on a phase-space resolution factor as a result of the infinite-dimensional momentum Hilbert space. Our result is general and model-independent since we consider the full final state from time evolution ($S|i\rangle$) rather than a specific outcome, and is applicable as long as the probability for producing multiple particle $A$ is subleading. We also obtain the $n\geq2$ Tsallis and Rényi entropies in our framework and find out that, at the leading order, they are proportional to the total scattering probability and carry no differential information.
arXiv·2026-10-07·Devashish Tupkary, Zhiyao Wang, Ernest Y. -Z. Tan
No generated summary available for this entry.
overview
Original abstract
Quantum Key Distribution (QKD) protocols typically involve two separate steps of error-verification and privacy amplification. Both steps involve the application of a hash function sampled from a suitable hash family to classical data. A potentially simpler alternative is to implement a single-step hashing procedure, announce and compare a fixed number of bits of its output for error-verification, and retain the remaining bits as the final output key. This reduces the complexity of classical postprocessing, the amount of classical communication, and the amount of randomness needed in the protocol. While this construction has appeared in the literature, a suitable mathematical justification is lacking. In this work, we show that the security of such protocols, under certain simple conditions, follows from a slightly modified notion of secrecy of the protocol without the final error-verification step. In particular, we show that for most entropy-based proofs, the combined protocol can be implemented with no change to the key rate, and a minor change to the security parameter.
No generated summary available for this entry.
overview
Original abstract
Piezoelectric nanomechanical resonators operating at gigahertz frequencies are a promising platform for quantum information processing and precision sensing, but phonon lifetimes have been limited to the microsecond range, widely attributed to the higher intrinsic loss of piezoelectric materials. Here we show that this limitation is not fundamental. Using a fabrication process informed by recent studies of defect-mediated loss in lithium niobate, we combine chemical restoration of ion-milled surfaces with a shadow-mask metallization process to produce lithium niobate phononic crystal resonators with inferred internal phonon lifetimes of up to 21 milliseconds at 3.6 gigahertz, corresponding to quality factors exceeding $4\times10^8$ ($f\cdot Q_i > 10^{18}$) at millikelvin temperatures. By systematically varying the electrode-to-resonator spacing, we demonstrate that the measured lifetime is set by external coupling between the device and the measurement circuit rather than material loss. This establishes that lithium niobate, once fabrication-induced surface damage is removed, achieves an intrinsic quality comparable to the best mechanical materials while remaining an intrinsically piezoelectric platform with strong electromechanical coupling.
arXiv·2026-10-07·Francesco Perciavalle et al.
No generated summary available for this entry.
overview
Original abstract
Accurately simulating chaotic quantum many-body dynamics remains a major computational challenge for classical methods, due to the rapid buildup and spatial spreading of entanglement during the evolution. This raises the question of whether machine learning can provide an effective alternative for predicting quantum dynamics. We address this question by formulating quantum dynamics as a time-series forecasting problem, using a few-qubit PXP chain, realizable with Rydberg-atom arrays, as a benchmark. By varying the initial state, the system spans dynamical regimes ranging from ergodic behavior to quantum many-body scarring, providing a controlled setting for testing forecasting models across qualitatively different dynamics. We compare two contrasting architectures: an expressive nonlinear Transformer and DLinear, a simple linear forecasting model. The Transformer accurately predicts dynamics in the more ergodic regime, but its performance progressively deteriorates as the initial state approaches the scarred limit. In contrast, DLinear remains accurate across the entire family of initial states, with its main deviations consisting of small high-frequency oscillations that have little effect on the overall prediction error. Remarkably, these results show that observables generated by complex quantum many-body dynamics can be forecast with high accuracy through a simple linear mapping from past to future observations. This reveals that the complexity of the underlying quantum evolution need not translate into an equally complex forecasting problem.
arXiv·2026-10-07·Aaron Sander et al.
No generated summary available for this entry.
overview
Original abstract
Quantum systems are rarely isolated from their surroundings. These hidden environments can retain information and return it later, producing correlated errors in quantum computers and complicating the interpretation of experiments.On a quantum processor, for example, one job can therefore leave an environmental trace that affects the next, even after the qubits themselves have been reset. Learning how this hidden influence persists and affects later behavior is therefore important, but the environment is often impossible to measure directly, and fully reconstructing its effects through tomography rapidly becomes impractical. Here, we introduce a response matrix that uses controlled interventions and observations of the system alone to reveal the temporal structure of environmental memory. The matrix records how future observations change across different controlled histories. Its spectrum characterizes how memory is structured and how it persists under specified system resets, while suitable linear combinations of its entries can rule out specified classical models of that memory. Because its history-future queries can be evaluated independently, numerical response matrices can be assembled in parallel. We establish the framework theoretically, characterize response spectra in an interacting spin process, and certify quantum memory in a two-qubit benchmark. This approach turns system observations into a probe of inaccessible environments and could support the diagnosis of correlated noise, tests of open system models, and memory-aware control design.
arXiv·2026-10-07·Biao Lian, Zhen Bi
No generated summary available for this entry.
overview
Original abstract
We study symmetric gapped ground states of one-dimensional spin $S$ chains with a continuous exponential symmetry $U(1)\rtimes\mathbb Z_2$ with integer base $q$, where the U(1) charge has a modulated unit of charge $q^{L-j}$ decaying exponentially with site $j$. The simplest model is a quantum breakdown model that can be viewed as a $q$-deformation of the XXZ Haldane spin chain. We show that the topology of their symmetric ground states crucially depends on $S$ and $q$. For integer $S$, odd $q$ allows a nontrivial $\mathbb Z_2$ Haldane-type symmetry-protected topological (SPT) phase with protected edge modes, while even $q$ allows no nontrivial SPT phase. For half-odd integer $S$, odd $q$ prohibits any unique symmetric gapped ground state due to a Lieb-Schultz-Mattis obstruction, whereas even $q$ enforces a novel symmetric gapped phase which we name as the ``half-SPT" phase. Unconventionally, the half-SPT phase only has a symmetry protected edge mode on one edge, and has half of the string orders of an SPT phase. Our results uncover a new type of symmetry-protected gapped phases beyond existing classification schemes.
arXiv·2026-10-07·Zhi-Qiang Gao et al.
No generated summary available for this entry.
overview
Original abstract
Superconductivity and intrinsic topological order can intertwine in ways that go beyond simple coexistence. Here we develop a classification framework for (2+1)D gapped superconductors with condensate charge $2ne$. By focusing on the topological properties of superconducting vortices, we precisely characterize this interplay. We obtain a classification with increasing levels of intertwinement, from the well known invertible superconductors without topological order, to untwisted and twisted SC$^\ast$, and finally to SC$^{\sharp}$. Our main finding is the family SC$^{\sharp}$, in which the elementary vortex carrying $h/(2ne)$ flux cannot be factorized into an invertible superconductor vortex dressed by bulk anyons, and every elementary vortex is necessarily non-Abelian. For such phases, we also obtain no-go results: the elementary vortex sector has quantum dimension at least $\sqrt{6}$ and cannot satisfy Fibonacci fusion rules. We develop a systematic algebraic framework to obtain all these superconducting phases through anyon condensation, allowing us to construct several infinite families of examples and make connections to anyon superconductivity. Finally, we introduce primitive SC$^\sharp$ phases for which factorization of every nontrivial vortex sector is obstructed, and argue that they cannot arise by disordering the relative phases of lower-charge superconducting condensates. Our classification scheme based on vortex properties allows us to uncover new distinctions between topologically ordered superconductors and constrain how they can be realized.
arXiv·2026-10-07·Winston Fu, J. Wilson Staples, Jeff D. Thompson
No generated summary available for this entry.
overview
Original abstract
Quantum error-correcting circuits are affected by multiple physical noise mechanisms, whose contributions to logical failure must be understood to evaluate code performance and guide improvements in hardware. The individual error budget contributions for an error type $i$ can be characterized by its logical sensitivity $ν_i = \frac{\partial p_L}{\partial p_i}$, which measures the response of the logical error rate $p_L$ to each physical noise parameter $p_i$. Normally, $ν_i$ is measured using linear fits such as finite differences, where $p_L$ is measured at two or more values of $p_i$ to calculate partial derivatives. In this paper, we develop a differentiable estimator to obtain all components of $\nabla_{\mathbf p}p_L$ simultaneously from a single Monte Carlo data set at one noise configuration, using information about the underlying fault configurations. In surface code simulations with circuit-level noise, the estimator agrees with conventional finite differences while requiring one to two orders of magnitude fewer shots to achieve the same variance. We apply this technique to quantify error budgets, resolve sensitivities at the individual qubit level, and infer effective code distance. Finally, we incorporate the sensitivities into Newton root finding to locate and trace threshold contours in multidimensional noise models. These results provide an efficient method for extracting and applying logical sensitivity information from standard quantum error correction simulations.
arXiv·2026-10-07·Boris A. Khanikati
No generated summary available for this entry.
overview
Original abstract
We show that the radial differential equation for a scalar field in an anti-de Sitter black brane background can be encoded in an exactly solvable semi-infinite spin chain independent of dimensionality. The radial coordinate emerges as lattice quasimomentum. Spin coherence encodes the geometry, while the spectrum and response recover gravitational observables and yield exact screening-mass sum rules. We implement the finite chain on a superconducting processor. At finite filling and low energies, the model yields a conformal field theory in a coordinate proportional to proper radial distance.
arXiv·2026-10-07·Furqan Nasir, Sher Jeel Ahmad
No generated summary available for this entry.
overview
Original abstract
Estimates of the quantum resources needed to run fault-tolerant algorithms are almost always reported as single numbers, even though they rest on uncertain hardware parameters and on cost models that disagree. We present an open, tool-agnostic framework that propagates evidence-based priors over fault-tolerant hardware parameters through five surface-code cost models, adds correlated-input sensitivity analysis, and evaluates the resulting intervals with a pre-registered three-layer protocol. Applied to RSA-2048, ECC-256, AES-256, and a Hubbard-model simulation on a superconducting surface-code architecture, it produces three coupled findings that together undermine the single-number convention. Propagating the error rates hardware has actually demonstrated, whose median across five large-array devices is about 4 x 10^-3 rather than the conventional 10^-3, widens the 90% physical-qubit interval to roughly forty times and lifts its median about 4.6 times above the conventional point estimate. Against the same inputs, five independently structured cost models, including two third-party estimators (the Azure Quantum Resource Estimator and Qualtran) that agree with each other to within about ten percent, disagree by a stable factor of two, a structural uncertainty that no single tool reveals. Most consequentially, both third-party estimators exceed their representable envelope for 80 to 100 percent of the evidence-based parameter space, and the AES-256 gate count overflows one tool's counter outright, so these workloads cannot be represented at measured error rates at all. The optimistic convention conceals every one of these effects. The uncertainty machinery we use is standard. The contribution is its evidence-based application, the pre-registered evaluation, and the finding that standard tools break down precisely where hardware operates.
arXiv·2026-10-07·A. B. Klimov, C. Muñoz, I. Sainz
No generated summary available for this entry.
overview
Original abstract
The apparent absence of a stabilizer-speci?c phase-space description for qubit systems is not fundamental, but arises from ?xing a state-independent discrete Wigner map. Allowing the phase-space representation to adapt to the state through a simple optimization procedure, we prove that every qubit stabilizer state admits an exact delta-function discrete Wigner representation for any ?xed phase-space partition. This optimization can be implemented directly at the level of measurement statistics by selecting maximal probabilities across mutually unbiased bases forming the partition. This construction naturally leads to a non-stabilizer witness de?ned by the optimized value of the Wigner function at the origin. Stabilizer states saturate the universal lower bound of this witness for pure states, whereas a value strictly larger than the bound certi?es non-stabilizerness. Although the witness is not a ?nite-size resource monotone, it becomes sharply concentrated and e?ectively invariant under random Cli?ord transformations in the large-qubit limit, suggesting an asymptotically linear growth law for broad families of non-stabilizer states. Our results restore a meaningful geometric phase-space characterization of qubit stabilizer structure and provide an operational diagnostic of non-stabilizerness.
arXiv·2026-10-07·Ahmed Hajr et al.
No generated summary available for this entry.
overview
Original abstract
Dynamical protection via strong driving can enable resilient quantum processing on imperfect physical hardware. However, the practical utility of such schemes is frequently limited by parasitic processes such as drive-induced dephasing and leakage. Here, we demonstrate that sub-GHz charge driving of superconducting Kerr oscillators (KOs) in the transmon regime circumvents this trade-off, simultaneously activating fast parametric interactions and protecting the encoded qubit from low-frequency noise. The key is the frequency dependence of the charge sensitivity: using the AC Stark shift as a probe, we find that the KO frequency sensitivity to a charge drive grows quadratically with both drive frequency and amplitude, making the oscillator weakly sensitive to $1/f$ charge noise yet strongly coupled to drives near 1~GHz. Exploiting this, we first demonstrate cooling and reset of the KO in 82~ns, to a residual population below $0.7\%$---lower than its $2.5\%$ steady-state thermal population. Next, using two KOs, we demonstrate logical control and dynamical protection of a dual-rail qubit with nearly fourfold erasure bias. Finally, using a single end-of-circuit erasure check, we achieve an error per Clifford of $5.6\times10^{-4}$, which falls to $1.5\times10^{-4}$ after post-selection, with 25~ns gates.
arXiv·2026-10-07·Rylan Malarchick
No generated summary available for this entry.
overview
Original abstract
A pulse-level quantum control program is written against a device whose limits are recorded, if at all, in vendor documentation and source code. A program that exceeds them can be refused at compile time. It can also be accepted and silently altered, or compile and then fail at the board. In the last two cases the experiment runs, and the data does not correspond to the program that was written. We present qconform, a checker that decides whether a pulse program is realizable on a device, given a versioned capability descriptor for that device. Every constraint in a descriptor cites the toolchain observation that established it. The checker is design-time, offline, and deterministic, and it uses no floating point. It reports a verdict, the rules it applied, and a coverage manifest that names what it did not check. We evaluate qconform by differential testing against the QICK and Qblox toolchains, on three QICK board configurations and one Qblox cluster. Over 1263 program runs of 969 distinct programs, the checker accepted no program that a toolchain refuses. On both vendors, a descriptor pinned to one toolchain release accepts programs that older releases refuse. The evaluation also found ten defects in the checker and its descriptors, all fixed.
arXiv·2026-10-07·L. F. Melo et al.
No generated summary available for this entry.
overview
Original abstract
Near-optimal binary coherent state discrimination can be achieved by performing a displacement operation followed by photon detection. This displacement serves as a control parameter that can be tuned to optimize a chosen figure of merit, which makes such receivers attractive beyond state discrimination. Here, we turn this discrimination strategy into a complete continuous-variable quantum key distribution (CV-QKD) protocol based on a binary alphabet of noisy coherent states (displaced thermal states) and displacement receivers. We develop a strategy for estimating the channel parameters with the same displacement receiver, since standard quadrature-based methods do not apply. While a key map can be obtained with on/off detection, we demonstrate that reliable parameter estimation requires photon-number-resolving detection with sufficient resolution. Finite detector resolution underestimates the observed noise and constitutes a potential security loophole, which we quantify and show to be mitigable with modest resolution. We analyze the protocol's security against entangling-cloner collective attacks in the asymptotic regime, for both direct and reverse reconciliation, and show that it can generate secret keys even under noisy state preparation and imperfect detection. Interestingly, we find that the displacement that minimizes the discrimination error probability also performs well for key generation, thus providing a useful and analytically tractable tuning strategy for the CV-QKD receiver. We evaluate the protocol's performance over a range of transmittances and noise parameters, showing that the displacement receiver can outperform conventional homodyne detection in experimentally relevant regimes. Together, our results point to displacement receivers as a promising alternative for CV-QKD implementations.
arXiv·2026-10-07·Qinhui Jiang et al.
No generated summary available for this entry.
overview
Original abstract
Pseudospin-1 Dirac systems exhibit unique physics distinct from conventional Dirac cones, such as flat-band crossings and non-Abelian characteristics, yet their topological transport properties have remained largely untapped in passive, time-reversal-invariant settings. Here we uncover an in-plane polarity of the Berry-curvature texture in a pseudospin-1 Dirac Hamiltonian, a previously unexplored geometric degree of freedom encoded in the sign-resolved distribution of Berry curvature despite zero net Berry flux, and reveal a new mechanics where Berry curvature induce pseudospin Hall behaviors in a system. We show that the oriented coupling between this momentum-space polarity and a real-space mass gradient governs a geometric selection rule that dictates the emergence of gapless pseudospin Hall modes. By engineering the intracell couplings of a four-site planar lattice, we independently program the Berry-curvature polarity and the spatial mass gradient without altering the host lattice symmetry. Acoustic experiments directly confirm this directional selection rule: reversing the mass gradient closes or reopens the dispersive gap, while pseudospin-selective source excitation launches counterpropagating pseudospin branches along arbitrary prescribed axes. Our work establishes quantum geometric polarity as a versatile tool for reconfigurable wave routing, sensing, and high-capacity quantum applications.
arXiv·2026-10-07·Matthias Werner, Artur García-Sáez
No generated summary available for this entry.
overview
Original abstract
A major application of analog quantum hardware is quantum simulation, where a system evolves over time according to a given Hamiltonian. One challenge when implementing the Hamiltonian on a programmable quantum simulator is the availability of distinct coupling types, many of which go beyond the conventional ZZ-couplings found in Ising Hamiltonians that are naturally implemented by various platforms. In prior work, we have developed a method based on domain wall encoding to simulate one-dimensional spin chains using only Ising Hamiltonians, which would otherwise require XX+YY-couplings as well. Here, we implement the method on a commercially accessible Rydberg atom quantum device, and simulate the time evolution of the Heisenberg XXZ model with various anisotropies. We successfully probe the XY and Ising phases of the model and reproduce the qualitative behavior of several one- and two-body observables in both phases, as well as at the critical point. Our work augments the toolbox to simulate canonical quantum many-body systems on analog quantum simulators.
arXiv·2026-10-07·Aiswarya Rath, Kalyan Ghosh, Pratap K Sahoo
No generated summary available for this entry.
overview
Original abstract
Self ion doping in ZnO nanorods offers a powerful route to dynamically control excitonic states and light matter interactions. Here, vertically aligned hexagonal ZnO nanorods were irradiated with 250 keV oxygen ions to establish a direct link between irradiation induced defects and excitonic and optical responses. Increasing ion fluence progressively quenches the near band edge emission at 380 nm, leading to a complete exciton OFF state, while thermal annealing restores the emission, yielding a reversible exciton OFF or ON response. This switching originates from defect mediated modification and thermal recovery of excitonic states. The defect band emission, between 400 to 750 nm, exhibits quasi periodic whispering gallery mode like resonances that are progressively suppressed as irradiation alters nanorod geometry and optical confinement. Low-temperature photoluminescence resolves D0X, FX 1LO, and FX 2LO transitions, whose temperature evolution follows the Bose Einstein model. The non-monotonic variation of excition phonon coupling strength reveals a competition among irradiation induced defects, lattice distortion, and exciton localization in determining exciton phonon coupling. These results establish Oxygen ion irradiation as a means to simultaneously engineer excitonic switching, exciton phonon interactions, and optical resonances, providing a pathway toward defect programmable ZnO nanophotonic and optoelectronic devices.
arXiv·2026-10-07·Lukas Theißinger, Thore Gerlach, Christian Bauckhage
No generated summary available for this entry.
overview
Original abstract
Differentiable quantum architecture search (DQAS) is a promising framework for the automated design of quantum circuits, particularly for variational quantum optimization algorithms. However, its practical deployment on quantum hardware is limited by the large number of circuit measurements required during optimization, making hardware execution costly. In this work, we show that for a broad class of combinatorial optimization problems and commonly used rotational gate parameterizations, the measurement cost of DQAS can be significantly reduced without changing the optimization objective. We derive the proposed measurement reduction scheme theoretically and validate it experimentally on 3-SAT and MaxCut benchmark problems. Our approach reduces the requested gradient measurement cost by about 39 to 41% while introducing only negligible classical post-processing overhead, lowering the practical cost of executing DQAS on quantum hardware.
arXiv·2026-10-07·Isaac L. Huidobro-Meezs, Rodrigo A. Vargas-Hernández
No generated summary available for this entry.
overview
Original abstract
Repeated measurements can dominate the resources required for quantum energy estimation, making the choice of which Pauli observables to measure together a central optimization problem for variational quantum algorithms. We formulate fully commuting measurement grouping as a classical binary optimization problem based on clique selection and construct non-overlapping groups using mixed-integer linear programming (MILP). For a benchmark of molecular Hamiltonians, groupings optimized with approximate covariances reduce the non-overlapping measurement requirement $\varepsilon^2M$ by $51.8\%$ on average relative to sorted insertion (SI). Using the MILP groups to initialize iterative coefficient splitting (ICS), denoted MILP-ICS, yields an average $24.3\%$ reduction relative to ICS initialized from SI (SI-ICS). The optimized groups also transfer across nearby molecular geometries while preserving substantial measurement savings. We further introduce O-clique, which directly optimizes overlapping commuting supports through candidate-clique selection and coefficient profiles. Although O-clique provides only modest additional reductions beyond MILP-ICS, it reduces the measurement requirement by $27.3\%$ on average relative to SI-ICS with 100 iterations, despite using only five final coefficient refinement iterations, indicating improved support quality. Finally, we extend the comparison to Fermi--Hubbard, Kitaev--Heisenberg--$Γ$, and XYZ lattice Hamiltonians, where MILP-based groupings substantially outperform the corresponding SI-based strategies. Together, these results show that variance-informed optimization of measurement-group structure can substantially reduce sampling costs across molecular and lattice Hamiltonians, with optimized non-overlapping groups providing strong, transferable initializations and direct overlapping optimization offering further gains.
arXiv·2026-10-07·Eike S. Eberhard et al.
No generated summary available for this entry.
overview
Original abstract
Machine-learned interatomic potentials (MLIPs) excel at in-distribution tasks, accelerating drug and material development, yet they struggle to generalize out-of-distribution. We propose to push the cost-accuracy Pareto frontier by designing observable-agnostic electronic ground-state descriptor models (GSMs) with computational costs situated between MLIPs and Kohn-Sham density functional theory (KS-DFT). We align the learning objectives and architectures of GSMs with the governing equations of KS-DFT by enforcing physical constraints and removing optimization pressure on unphysical or irrelevant degrees of freedom. In our size-extrapolation experiments from QM9 to QM40, our combined contributions OrthoNormal-Loss (ON-Loss) and Grassmann Restricted Occupied-Orbital Training (GROOT) reach a 79.1% energy and 83.4% force mean absolute error (MAE) reduction over previous state-of-the-art density GSMs. For Hamiltonian GSMs, ON-Loss and Residual Optimal-gauge Conditioning-aware KS-Eq. Training (ROCKET) together reduce the energy and force MAEs of the strongest baseline by 99.8% and 95.9%, respectively. Using a self-consistency rejection criterion, we filter out extrapolation errors on QMugs, rejecting fewer than 0.4% of predictions while reaching an energy MAE of 0.07 mHa. Finally, we demonstrate the efficiency of label-free self-consistency fine-tuning, and transfer GSMs to reactive chemistry in Transition1x, reaching energy errors below chemical accuracy.
arXiv·2026-10-07·Kazuki Hashimoto, Takuro Ideguchi
No generated summary available for this entry.
overview
Original abstract
Mid-infrared photothermal (MIP) measurement probes refractive-index changes induced by mid-infrared (MIR) absorption using visible or near-infrared light and has recently emerged as a powerful modality for MIR spectro-imaging in the life sciences. Reducing measurement noise allows the probe power to be lowered without compromising the signal-to-noise ratio (SNR), thereby mitigating the risk of sample damage. However, even in the absence of classical noise, the SNR of conventional MIP measurements using a classical coherent probe is fundamentally limited by shot noise. Here, we demonstrate sub-shot-noise MIP measurement using twin beams generated through seeded optical parametric amplification. Balanced detection of the twin beams suppresses the noise by more than 5 dB below the shot-noise level established using a coherent beam. As a proof-of-principle demonstration, we measure the MIP signal from liquid water using balanced twin-beam detection and achieve an SNR enhancement of more than 2 dB over the balanced coherent-beam detection.
arXiv·2026-10-07·Angelo Russotto et al.
No generated summary available for this entry.
overview
Original abstract
Deep thermalization indicates the emergence of universal ensembles of pure states in a subsystem after measuring its environment. We investigate this phenomenon in a free-fermion chain using local measurements that preserve Gaussianity and break particle-number conservation. Although the measurement outcomes provide partial information about local conserved charges within a finite subsystem, we argue that this information becomes negligible in the thermodynamic limit. This effective non-revelation underlies the emergence of a fermionic Gaussian Scrooge ensemble, determined by the subsystem's generalized Gibbs ensemble. We construct this universal ensemble directly at the subsystem level and provide numerical evidence that it describes the late-time projected ensemble at finite temperature. Our results extend the description of thermalization in non-interacting integrable systems beyond the reduced density matrix to universal statistics of conditional pure states.
arXiv·2026-10-07·Quentin W. Richter, Moritz Cygorek
No generated summary available for this entry.
overview
Original abstract
Non-Markovian open quantum networks are among the most challenging problems in quantum theory, as they suffer from both, the exponentially scaling many-body state space as well as long memory times when the sites are strongly coupled to structured environments. Recent efforts to address them by combining tensor networks with real-time path integrals, such as TEMPO and process tensors, were however limited to systems with rather weak system-environment couplings because strong couplings lead to large bond dimensions. Here, we devise a tensor network scheme (CTEMPO) resulting in particularly small bond dimensions for single-site problems. We then extend this to a practical scheme to simulate non-Markovian quantum networks by time-evolving a corresponding comb tensor network. Benchmarking the single-site algorithm on the spin-boson model we find orders-of-magnitude improvement over established methods. The multi-site algorithm is shown to solve the notoriously difficult problem of the 7-site Fenna-Matthews-Olson photosynthetic complex, whose spectral density contains 62 peaks. We then apply our approach to explore the scaling behavior of the superradiance of up to $N=20$ quantum dots individually coupled to super-Ohmic phonon baths. Our approach provides a turnkey solution to non-Markovian quantum networks and is compatible with more general tensor network topologies.
arXiv·2026-10-07·Yujin Song et al.
No generated summary available for this entry.
overview
Original abstract
Quantum libraries are now critical infrastructure for quantum algorithm development, yet their correctness remains difficult to test. Existing testing techniques mainly rely on failure-based or comparison-based oracles, exposing bugs only when executions fail, violate runtime checks, or disagree with another implementation. Their applicability is limited when suitable execution-based oracles are unavailable, leaving some silent bugs undetected. Such missed bugs can produce incorrect results that propagate into experimental conclusions, simulation studies, and algorithmic designs. Here we present QuSema, an autonomous testing agent for finding silent bugs in quantum libraries. QuSema uses constraints from quantum semantics and documentation as a source-level semantic oracle to assess whether implementation logic can produce invalid outputs from valid inputs. It operates through an agentic loop that repeatedly inspects library API documentation and source code, reasons about the intended behavior of quantum operations, identifies potential semantic deviations, and validates them by generating executable tests through library APIs. Guided by quantum-domain reasoning, QuSema turns high-level behavioral mismatches into concrete, user-triggerable bug reports, enabling it to uncover non-crash defects. We implement QuSema for Qiskit and PennyLane. On a benchmark of 20 historical silent bugs, QuSema achieves higher mean bug relocation counts than Claude Code and Codex, with the DeepSeek configuration costing less than Claude Code. QuSema also discovers 40 previously unknown bugs confirmed by the developers, including 30 silent bugs.
arXiv·2026-10-07·Carla Cotea, Stefan Balauca, Andreea Arusoaie
No generated summary available for this entry.
overview
Original abstract
Training parameterized quantum circuits requires balancing optimization progress with limited evaluation budgets and the statistical uncertainty of near-term quantum hardware. We present a modular benchmarking framework that separates quantum search-direction estimation from classical parameter-update rules, allowing their interactions and sensitivities to be examined independently. We evaluate a suite of gradient-based, stochastic, and derivative-free optimizers across combinatorial optimization using the Quantum Approximate Optimization Algorithm (QAOA), supervised quantum machine learning using Iris classification and a quantum convolutional neural network (QCNN) for binary MNIST classification, and quantum chemistry using the variational quantum eigensolver (VQE) for molecular hydrogen. By separating objective evaluations from sample-circuit costs under finite-shot simulation and physical execution on a 156-qubit processor, we compare optimizer behavior across workloads with different parameter counts and measurement requirements. Four selected simulator and hardware case studies report terminal and best observed objectives separately, alongside post-training classifier accuracies. The comparisons include selected MaxCut and hydrogen trajectories and illustrate workload-dependent objective changes and evaluation costs, while the simulator benchmark compares both peak and mean performance across three seeds. The hardware runs do not establish an optimizer ranking or isolate a causal effect of device noise.
arXiv·2026-10-07·Minbo Gao, Tianshi Yu, Lihong Zhi
No generated summary available for this entry.
overview
Original abstract
We construct an explicit binary linear system game that separates \(C_{qa}\), the closure of the set of finite dimensional quantum correlations, from \(C_{qc}\), the set of commuting operator correlations. The game admits a perfect commuting operator strategy, while every correlation in \(C_{qa}\) has a success probability strictly less than 1. This provides a concrete counterexample to Tsirelson's problem in its approximation form. The defining system has \(1{,}417{,}152\) equations in \(1{,}889{,}684\) variables, with exactly three nonzero coefficients per equation and a single nonzero entry on the right hand side. We also compute the classical value exactly. The complete system is specified in Lean~4, and the separation and exact classical value are formalized using Mathlib.
arXiv·2026-10-07·Lu Wei, Yufeng Wang, Haibin Ling
No generated summary available for this entry.
overview
Original abstract
Scientific dynamics forecasting is often framed as an architecture choice, although deployment is also determined by observed history, rollout feedback, compute budget, physical objective, and test distribution. We formulate protocol-dependent model selection and introduce ProtocolMatch, a compute-matched, validation-selected, and failure-preserving evaluation framework. On driven quantum-spin dynamics, we compare recurrent, patched-attention, causal-attention, and low-rank linear predictors across three independently generated datasets. The causal-attention--recurrence ordering reverses as the training set grows within a fixed two-spin task, while a linear predictor has the lowest mean error in the six-spin local-observable comparison. Restricting observed history worsens every refreshed-history view but improves every closed-loop view in the four-spin study. A latest-state MLP has lower error than persistence on every dataset under state refresh across all five cells, yet its closed-loop rank varies by system and includes finite explosive errors. Physical penalties improve targeted consistency without reliably improving prediction error, and in-distribution intervals lose most coverage after a driving-frequency shift. Thus scientific model selection should return a predictor with its protocol and report accuracy, physical validity, and shifted-distribution reliability separately.
arXiv·2026-10-07·M. Ibrahim, S. J. Anwar, K. Khan
No generated summary available for this entry.
overview
Original abstract
We investigate the dynamics of quantum ergotropy in a multipartite system of two-level atoms interacting with a quantized field. The role of multipartite quantum mutual information and quantum relative entropy is analyzed to understand how correlations and the distinguishability between the passive state and the product of local states affect the extractable work. Numerical results for systems containing two to five atoms show that the maximum ergotropy does not increase linearly with the system size, while the intervals of zero ergotropy are gradually modified and suppressed for larger systems. We also study the effect of the average thermal photon number and different initial atomic states. Increasing the thermal photon number mainly reduces the relative-entropy contribution, whereas the initial state strongly influences both the magnitude and persistence of ergotropy. Among the considered states, the partially entangled state provides the largest and more persistent extractable work, while the mixed GHZ state gives the smallest ergotropy. These results highlight the importance of multipartite correlations, thermal effects, and state preparation in controlling quantum work extraction and may be useful for future studies of quantum batteries and quantum power.
arXiv·2026-10-07·Linda Sansoni et al.
No generated summary available for this entry.
overview
Original abstract
Quantum sources of light are of paramount importance for the development of photonic quantum technologies. The growing demand for bright, efficient, and spectrally engineered photonic sources for applications in quantum sensing, spectroscopy, and imaging has motivated the development of tailored nonlinear crystals. Here, we report on the development and characterization of chirped, apodized KTP crystals specifically engineered for quantum spectroscopy. Our source exhibits an unprecedented bandwidth in a highly non-degenerate configuration, demonstrating its potential to support quantum spectroscopy protocols over broad spectral ranges while enabling significantly shorter measurement times.
arXiv·2026-10-07·Santanu Majhi, Nirupam Basak
No generated summary available for this entry.
overview
Original abstract
The security of a secret sharing protocol is compromised if one or more dishonest participants can reconstruct the secret by deviating from the prescribed protocol, particularly when such malicious behavior remains undetected. Semi-Quantum Secret Sharing (SQSS) is a variant of secret sharing in which the participants possess only classical capabilities, such as preparing and measuring qubits in the computational ($Z$) basis, while a quantum-capable third party assists the dealer in generating and distributing quantum shares of a classical secret. The limited quantum capabilities of the participants in SQSS protocols may introduce vulnerabilities to collusion attacks, enabling an assisting quantum third party, in collaboration with a dishonest classical participant, to jointly recover the secret even without detection. In this work, we propose a novel SQSS protocol that eliminates this vulnerability and achieves information-theoretic security against collusion attacks. We further prove that the proposed protocol is secure against a broad class of external and internal attacks. Finally, a comparative analysis demonstrates that our construction advances existing SQSS protocols by simultaneously optimizing qubit efficiency, involves a classical dealer, and resilience against DCNA attacks using basic Bell states.
arXiv·2026-10-07·Jin-Hyung Choi et al.
No generated summary available for this entry.
overview
Original abstract
Optically exciting a typical low-dimensional semiconductor produces a nodeless \(s\)-type exciton as its lowest-energy bound state. Here, we explain how Coulomb phase matching stabilises a quantum-vortex exciton as the lowest bound state in flat Chern bands. Using a prototypical Yin--Yang kagome lattice, we demonstrate that increasing the spin--orbit coupling drives a transition of the lowest exciton from a quantum-vortex state to a zero-winding state, while leaving the band Chern numbers unchanged. We trace this behaviour to a gauge-invariant combination of exciton phase differences and Bloch-overlap phases that can reduce the Coulomb energy. By comparing states with identical wavefunction amplitudes, we isolate this phase contribution and show that it is sufficient to drive the reversal in exciton ordering. We classify exciton topology by the momentum-space wavefunction winding relative to the conduction--valence Chern-number difference,connecting the competing states to circular-polarisation selection rules. We then show that the resulting reordering can be tracked directly in the optical absorption spectrum, through the transition from a dark vortex exciton to a bright zero-winding exciton. These findings establish a microscopic link between exciton topology, Coulomb binding, and optical response that extends beyond the information contained in the underlying electronic band Chern numbers.
arXiv·2026-10-07·Srijani Das et al.
No generated summary available for this entry.
overview
Original abstract
Any two orthogonal quantum states can be perfectly distinguished via local operations and classical communication (LOCC), yet whether all orthogonal multipartite pairs incur an identical operational cost remains an open question. Here, we address the resource consumption required for local state discrimination across multipartite pair of states. We demonstrate that distinct pairs of orthogonal multipartite maximally entangled states require unequal amounts of quantum resources to achieve local distinguishability. Extending our framework beyond individual pairs, we analyze larger sets of both locally distinguishable and indistinguishable multipartite orthogonal states, revealing a nontrivial hierarchy in their entanglement consumption. These results show that the resource cost of LOCC discrimination is state-dependent, providing insight into the fine-grained structure of multipartite nonlocality.
arXiv·2026-10-07·Ning Sun, Pengfei Zhang
No generated summary available for this entry.
overview
Original abstract
Understanding the non-equilibrium dynamics of quantum many-body systems plays a central role in modern many-body physics. Intriguing insights emerge from investigating how quantum resources, which are essential for achieving unambiguous quantumness, are generated and spread under chaotic quantum dynamics. In fermionic systems, non-Gaussianity constitutes an important resource beyond entanglement, characterizing the deviation of generic quantum states from free-fermion states. In this Letter, we propose using the \textit{replica twist entropy}, defined through the expectation value of a replica rotation operator with a tunable angle $α$, as a natural probe of non-Gaussianity in pure fermionic states. After deriving its behavior for typical many-body states, we establish a general framework for analyzing the replica twist entropy in solvable Sachdev-Ye-Kitaev models in the large-$N$ limit. Applying this framework to the dynamics of the thermofield double state, we uncover a novel dynamical phase diagram in the parameter space of $α$ and evolution time $t$, exhibiting spontaneous $Z_2$ symmetry breaking at $α=π/4$ and universal cusps as a function of $α$ in the long-time regime. Our results pave the way for studying non-Gaussianity in strongly correlated fermionic systems and reveal a new class of dynamical transitions probed by non-Gaussianity.
arXiv·2026-10-07·Pei-Han Lin, Roderich Moessner, Egor I. Kiselev
No generated summary available for this entry.
overview
Original abstract
Floquet engineering controls material responses via a time-periodic electromagnetic drive. An important task in practise is to reduce the driving strengths required to implement Floquet protocols.We show that in systems with strong phase-space constraints, where the response is dominated by a small region of momentum space, the relative impact of a resonant Floquet drive is enhanced. We demonstrate this idea on the example of the orbital Hall effect, where equilibrium occupations restrict the interband coherence to a narrow momentum interval $\hbarΔk$. The ratio $eE_0/(Ω_0\hbarΔk)$, where $Ω_0$ is the frequency of the drive, is considerable even at modest field amplitudes $E_0$, leading to a large relative change in the orbital Hall conductivity. Due to the non-trivial orbital texture, the circularly polarized drive induces an inverse orbital Faraday effect by magnetizing the electrons. We show that the corresponding susceptibility is controlled by the interband quantum metric that determines the resonant Floquet hybridization.
arXiv·2026-10-07·Matthieu Arnhem et al.
No generated summary available for this entry.
overview
Original abstract
Wigner negativity has been shown to be a resource in quantum computing, raising the question of how to efficiently produce states with a large Wigner negativity. Cubic Gaussian states, obtained when a cubic gate is applied to a Gaussian state, have been proposed as candidates for this purpose. We show that cubic Gaussian states with a large Wigner negativity $\mathcal N$ necessarily have a short decoherence time $τ$ that is bounded above by $\mathcal N^{-2}$. In other words, a large Wigner negativity comes at a cost: the decoherence time $τ$ of cubic Gaussian states decreases at least quadratically in the negativity $\mathcal N$. Maximizing $τ$ at fixed Wigner negativity $\mathcal N$, we show that this upper bound is reached by optimal cubic Gaussian states. They have the property that for large negativity, the optimal squeezing scales as $\ln\mathcal N$ and the optimal cubicity as $\mathcal N^{-1}$. Optimal cubic Gaussian states with large negativity can therefore be constructed with small cubicity, provided sufficient squeezing is applied. However, their decoherence time decreases with growing negativity. In addition, we show that their preparation is extremely sensitive to thermal noise. Finally, we compare, for each integer $n$, the optimal cubic Gaussian state with the $n$th Fock state that has the same negativity: despite their pronounced differences in photon number distribution and Wigner function, we show that they have similar, be it slightly larger, decoherence times and entanglement generating potential through a beam splitter.
arXiv·2026-10-07·A. D. Levin et al.
No generated summary available for this entry.
overview
Original abstract
Electron--hole plasma in two-dimensional systems has mainly been studied in two limiting cases: degenerate semimetals with parabolic bands and nondegenerate symmetric Dirac systems such as graphene. Here we investigate a different regime realized in a gapless HgTe quantum well: a multicomponent plasma where massless Dirac carriers coexist with thermally activated heavy holes from lateral valence-band valleys. Near charge neutrality, the resistance increases approximately as $T^2$, in sharp contrast to the nearly temperature-independent resistivity expected for a symmetric Dirac plasma. We show that once heavy holes are populated, charge neutrality pins the chemical potential above the Dirac point, leaving the Dirac electrons moderately degenerate while the heavy holes remain nondegenerate and obey Boltzmann statistics. The light electrons therefore scatter almost elastically from the heavy holes, allowing a relaxation-time treatment of interparticle transport. Using carrier densities from self-consistent band-structure calculations, we reproduce the data with a short-range electron--hole interaction in the weakly disordered limit, for which the conductivity scales as $T^{-2}$ and the excess resistivity is proportional to the heavy-hole density. In contrast, an unscreened Coulomb interaction would give a temperature-independent conductivity. The extracted interaction amplitude is of the expected Coulomb scale. These results establish near-critical HgTe quantum wells as a platform for interaction-driven transport in multicomponent systems combining degenerate massless and nondegenerate massive carriers.
arXiv·2026-10-07·D. B. Karki, Andrew K. Mitchell
No generated summary available for this entry.
overview
Original abstract
Hybrid metal-semiconductor quantum circuits offer a controlled setting for realizing and probing strongly correlated quantum matter. A largely open question that may be addressed by such simulators is whether coupled critical states can combine into new non-Fermi liquid (NFL) phases. Inspired by the recent realization of a two-site charge-Kondo circuit [W. Pouse \textit{et al.}, \href{https://www.nature.com/articles/s41567-022-01905-4}{Nat. Phys. \textbf{19}, 492 (2023)}], we uncover the fate of coupled Kondo anyons emerging from the two-channel-Kondo critical point at each site. Bosonization and quantum Brownian motion methods yield the full quasiballistic phase diagram and low-temperature transport properties, while numerical renormalization group calculations resolve the complementary weak-coupling limit. Together, these provide a unified description, and reveal robust NFL phases with continuously tunable transport and susceptibility exponents. Stronger inter-site coupling ultimately produces a screened Fermi liquid.
arXiv·2026-10-07·Alessio Maiezza, Fabrizio Nesti
No generated summary available for this entry.
overview
Original abstract
Many Quantum Field Theory models, either designed to improve the ultraviolet behavior via higher derivative terms or aimed at providing unified descriptions of Gravity, inevitably introduce negative-energy 'ghosts' states. These states raise fundamental questions regarding the stability of the theory. In this study, we investigate the time evolution of simplified quantum mechanical models consisting of two coupled normal and ghost subsystems. Although the full spectrum of these models is unbounded from below and, therefore, lacks a true ground state, we focus the time evolution of a 'would-be ground state': a zero-energy eigenstate of the decoupled system. By analyzing its metastability under interactions, we gain insights into the dynamics of ghost-like states. Contrary to the standard paradigm, our results demonstrate that, across a broad range of couplings, the would-be ground state does not decay and remains dynamically stable over long times. This provides evidence towards resolving the stability problems of Hamiltonians that are unbounded from below. We also discuss the connections with the corresponding classical and semiclassical dynamics.
arXiv·2026-10-07·Musung Kang
No generated summary available for this entry.
overview
Original abstract
We study continuous-time quantum walks on connected strongly regular graphs that are not complete, observed at a random time drawn from a freely chosen probability law. Uniform average mixing (UAM) asks for a law under which every averaged transition probability equals $1/n$, where $n$ is the number of vertices. On a strongly regular graph this is equivalent to two affine constraints on three cosine moments. We construct a bounded, compactly supported time density for every strongly regular graph with nonintegral eigenvalues. For integral spectra we give an exact finite Toeplitz criterion and its Hankel form. Every averaged mixing matrix of such a graph is realized by at most two observation times. Three elementary inequalities on the moment line, which also give a short proof of Chan's classification of complex Hadamard matrices in the Bose-Mesner algebra, lead to a determination of all strongly regular graphs that admit UAM. Apart from the conference graphs of nonsquare order and the graphs with instantaneous uniform mixing, these are the members of two infinite families of parameter sets and their complements, and for them we give explicit laws with two observation times. The Petersen graph and its complement are the smallest members. A strongly regular graph with UAM admits a bounded time density exactly when it has no instantaneous uniform mixing. We also correct the classification of instantaneous uniform mixing on strongly regular graphs by Godsil, Mullin and Roy. Its sign condition excludes the halved $5$-cube, which mixes uniformly at time $π/4$. With the order $4θ^2$ read literally, its parity condition also excludes the Clebsch graph and includes the parameters $(36,14,4,6)$, for which no time law gives uniform average mixing.
arXiv·2026-10-07·Laurence A. Jacobs, Guillermo R. Zemba
No generated summary available for this entry.
overview
Original abstract
A recent experiment by Roy et al. (Nat. Commun. 17, 2853 (2026)) demonstrated a robust half-integer thermal conductance plateau, κ_0 T/2, at a bipolar (ν,ν')=(2,-1) junction in bilayer graphene, produced not by non-Abelian topology but by full equilibration of co-propagating electron and hole edge modes. We prove a theorem that fixes when the two origins can be told apart: under full thermal equilibration, the two-terminal thermal conductance of a network of chiral edge segments joined at ideal floating contacts is a rational function of the net chiral central charges of the segments alone, quantities pinned by the gravitational anomaly and invariant under arbitrary local boundary kinetics. The corollary is an impossibility statement: whenever two realizations present the same anomaly data to the same network, no thermal-conductance measurement can distinguish them. That the equilibrated (2,-1) value equals the central charge of a chiral Majorana mode is an arithmetic fact about one filling combination, but wherever such a coincidence occurs it is beyond the reach of thermometry, and the separation must come from the charge sector, which is not anomaly-pinned at a superconducting boundary. We develop the topological insulator-superconductor interface as the application: a vortex carries fractional charge e/4 from the θ= πmagnetoelectric coupling, the boundary hosts a chiral Majorana mode of central charge 1/2, and a laterally adjacent integer quantum Hall (IQH) region supplies the kinetic realization. The Lorenz ratio (anomalous for the isolated Majorana boundary, L_0 / (1 + 4|ν_{IQH}|) in the composite device) and the excess shot noise (growing with B from e/4 vortex tunneling versus locked to IQH plateaus) together resolve the mechanism, provided the quantum Hall edge does not abut the superconductor.
arXiv·2026-10-07·Krisztina Tolotti, Riley Blank-Matthews, Arthur J. Parzygnat
No generated summary available for this entry.
overview
Original abstract
The joint expectation values of quantum observables measured by two parties typically depend on the causal structure of the measurement protocol. The two causal structures we investigate here are the direct-cause scenario, in which a single quantum state is measured twice in series with a general quantum channel between measurements, and the common-cause scenario, in which a shared bipartite quantum state is measured in parallel. Through a variety of examples of qubit channels with tunable parameters, we identify the full set of input states where the direct-cause joint expectation values of Pauli observables coincide with those obtained from a common cause, a situation that we call causal confusion. More generally, for arbitrary finite-dimensional quantum systems and light-touch observables, we prove that a channel exhibits causal confusion for some input state if and only if it is a positive-partial-transpose (PPT) channel, thereby endowing PPT channels with a new operational meaning in terms of causal confusion. Using this result, we characterize the set of qubit channels for which there exists an input state leading to causal confusion as the set of entanglement-breaking channels.
arXiv·2026-10-07·Manjet Rajak et al.
No generated summary available for this entry.
overview
Original abstract
We investigate how cotunneling affects passive-state ordering in a Photosystem II reaction center modelled as a nonequilibrium molecular junction. We use a full pigment excitation manifold, with excitonic and charge-transfer rates computed within a Nakajima-Zwanzig formalism using realistic spectral densities. Cotunneling is introduced through a microscopically constructed doubly reduced acceptor state obtained from relevant quinone-side two-electron configurations, while photoexcitation is allowed into the full excitonic manifold. Passive-state permutations are quantified through ergotropy and energetic capacitance. We find that thermodynamic smoothness in ergotropy and energetic capacitance can conceal microscopic state rearrangements. Cotunneling redistributes the extractable nonequilibrium energy among the quinone acceptor, the donor-pheophytin radical pair, and excitonic states with strong contributions from pigments on the inactive branch. At high Coulomb interaction, cotunneling produces no passive-state reordering. Piecewise-linear relations among ergotropy, energetic capacitance, and mean energy further reveal the population reorderings generated by cotunneling.
arXiv·2026-10-07·Jiayuan Zhang et al.
No generated summary available for this entry.
overview
Original abstract
Dissipation is generally regarded as detrimental to nonclassical-state generation, yet whether it can determine which quantum resource is emitted from an open hybrid quantum system remains largely unexplored. Here, we show that the symmetry of bosonic dissipation channels can select and switch quantum-emission pathways in a tripartite Mollow system, where a strongly driven two-level emitter simultaneously couples to cavity photons and motional phonons. In the Mollow regime, higher-order tripartite interactions generate resonant photon-phonon pair excitations, whose emitted quantum states are subsequently selected by dissipation. Under symmetric dissipation, the system produces strongly correlated photon-phonon pairs, enabling both single-pair emission and correlated multipair bundles with pronounced nonclassical correlations. Breaking the dissipation symmetry progressively suppresses the hybrid correlations and dynamically decouples the photonic and phononic degrees of freedom. In the strongly asymmetric regime, long-lived phonons accumulate in highly excited Fock states, while rapidly leaking cavity photons are converted into high-purity single-photon and two-photon bundles. The crossover between these distinct emission regimes is characterized through time-resolved correlation functions, Fock-state distributions, and Wigner quasiprobability distributions. Our results establish dissipation symmetry as a resource for steering quantum emission between hybrid and purely photonic nonclassical states, providing a route toward programmable hybrid quantum emitters and dissipative quantum-state engineering.
arXiv·2026-10-07·Lord Sen, Shyamapada Mukherjee
No generated summary available for this entry.
overview
Original abstract
Data reuploading---repeatedly encoding classical inputs at multiple layers of a parameterized quantum circuit---is a central mechanism for enhancing the expressivity of quantum neural networks (QNNs). Building on the Fourier-theoretic framework of Schuld et al.~\cite{schuld2021fourier}, we study the frequency spectrum of the general multivariate, $R$-reupload architecture (QDR). (i) We make explicit that the accessible frequencies form the set $K_R=S^{(R)}-S^{(R)}$, which equals the $R$-fold sumset $T^{(R)}$ of the difference set $T=S-S$ of the encoding spectrum, and we characterise it exactly: $K_R=\{k\in\mathcal L:\ \ell_T(k)\le R\}$, where $\mathcal L=\mathrm{span}_{\mathbb Z}(T)$ is an integer lattice and $\ell_T$ is word length in $T$. (ii) We show that the \emph{directions} of the spectrum stabilise already at $R=1$ (the real span of $K_R$ equals that of $\mathcal L$), whereas the spectrum itself never saturates: the maximal frequency grows linearly in $R$ and the number of frequencies grows polynomially, as $Θ(R^{m})$ with $m=\mathrm{rank}\,\mathcal L$. (iii) Using the spectrum size, we give a Rademacher-complexity bound on the capacity of QDRs of order $\sqrt{|K_R|/n}$. (iv) We report experiments on function approximation and classification with train/test splits, several seeds and parameter-matched classical baselines. The simulated spectra match the theory exactly. A single-qubit QDR beats a matched MLP on several smooth or periodic univariate targets and on the spiral task, but it is clearly worse on multivariate regression ($d\ge4$), where it is highly sensitive to the input-encoding scale; it beats the MLP only on equations with $d\le3$ inputs.
arXiv·2026-10-07·George Kourousias et al.
No generated summary available for this entry.
overview
Original abstract
Which execution details must a quantum computation retain, and to what precision, to support a declared comparison? We define a sufficient record by the largest Hellinger distance between outcome laws that share it. Our main result is a circuit-derived certificate for continuous recording precision: independent channel-mixture probabilities enter through the affinity of latent noise flags, while coherent rotation differences enter through conditional quantum fidelity. Their joint composition bounds whole record cells without simulating their outcome distributions. For four-qubit QAOA at depth one, a 13-bit comparison record guarantees distance below 0.05 throughout a declared continuous noise box, uniformly over programmed angles when comparisons hold the logical task fixed. A construction with observable noise flags attains the general bound. Exact tensorization of Hellinger affinity connects recording precision to the length of a future measurement transcript. On finite context classes, separation witnesses certify minimum-cost field retention; a four-field record is the unique minimum for 28 archived QAOA instances. Fresh six-qubit processor measurements establish different minimum label counts at one common tolerance: two labels are necessary and sufficient for raw laws, while one suffices after a fixed decoder for a synthetic image-segmentation task. These hardware conclusions are conditional on stationary independent shots and remain distinct from the analytic channel certificate. Shared task definitions and evidential archives are retained separately. The framework specifies which execution distinctions matter, how precisely to record them, and what evidence supports the resulting agreement guarantee.
arXiv·2026-10-07·Huang Xinyi, Zhang Xiang, Zhao Dongxing
No generated summary available for this entry.
overview
Original abstract
Normal-mode splitting reveals coherent cavity--magnon hybridization but does not certify finite-time quantum-state transfer. We describe quantum transfer in a passive, linear cavity--magnon system coupled to thermal reservoirs as a thermal-loss channel specified by its coherent transmissivity $η$ and output-referred thermal population $ν$. For single-rail qubits, we calculate the phase-corrected average fidelity and compare it with the deterministic measure-and-prepare benchmark of $2/3$. A Bell pair shared by the cavity and an isolated reference retains reference--magnon entanglement if and only if $η>ν$. An input squeezed vacuum of strength $r$ yields sub-vacuum magnon fluctuations if and only if $ν<η(1-e^{-2r})/2$. When the initial magnon and both reservoirs have the same occupation, an analytically determined peak-transmissivity time optimizes all three tasks. These task-dependent benchmarks show that a conventional linewidth-based strong-coupling criterion does not guarantee quantum-transfer performance. Conversely, entanglement or squeezing can survive below that spectroscopic reference when the added noise is sufficiently low. These benchmarks provide quantitative targets for transfer timing and thermal-noise control in intracavity-to-magnon quantum interfaces.
arXiv·2026-10-07·Jing Tang, Yuangang Deng
No generated summary available for this entry.
overview
Original abstract
Multipartite interactions provide a unique route to generate hybrid quantum states, yet their intrinsically weak nonlinear coupling limits the controllable manipulation of the resulting correlations. Here we show that cooperative double squeezing and cavity Kerr nonlinearity together enable controllable engineering of Kerr-filtered hybrid states in a tripartite spin-photon-phonon system. Double squeezing exponentially enhances the spin-mediated photon-phonon pair-generation channel, whereas the Kerr interaction selectively reshapes the photonic component while maintaining the underlying tripartite conversion process. This mechanism reconstructs the composition of the hybrid excitation and gives rise to a fourfold phase-space manifold associated with spontaneous $Z_{2}^{(a)}\times Z_{2}^{(b)}$ parity breaking. Our results reveal a strategy for engineering hybrid quantum states by combining interaction amplification with mode-selective nonlinear filtering.
arXiv·2026-10-07·Jing Tang, Yuangang Deng
No generated summary available for this entry.
overview
Original abstract
Directional quantum light requires asymmetric photon statistics without sacrificing coherence between propagation paths, a combination that remains difficult to achieve within a single quantum-optical platform. Here we identify a microscopic path-complementarity mechanism in hybridized cavity polaritons that reconciles these two requirements. In a Zeeman-split ring-cavity QED system, cavity backscattering hybridizes the counterpropagating modes, whereas the Zeeman splitting creates spectrally asymmetric excitation channels. Their interplay gives rise, under weak driving, to directional photon blockade coexisting with strong single-photon path entanglement: one input direction exhibits antibunching while the opposite direction is bunched. Remarkably, switching between the two one-photon polariton resonances reverses both the photon-statistical and intensity asymmetries while nearly preserving the path concurrence over a broad parameter regime. Our results establish path complementarity as a general design principle for directional nonclassical light with retained quantum coherence.
arXiv·2026-10-07·Shu He, Li-Wei Duan
No generated summary available for this entry.
overview
Original abstract
We show that an $N$-site quantum Rabi ring with matched giant-atom couplings has $2^N$ degenerate superradiant configurations as the atomic-to-cavity frequency ratio $η=Δ/ω$ tends to infinity. Each atom couples to two cavities two sites apart, and the photon hopping carries a phase $π/2$. Tuning the ratio of contact strengths to the photon hopping reduces the mean-field energy to a sum of single-site Rabi energies, with a common critical coupling for all momentum-pair sectors. The degeneracy survives quadratic quantum fluctuations despite a dispersive excitation spectrum. At finite $η$, second-order processes involving the local cubic anharmonicity generate a same-sublattice Ising coupling of order $ω/η$, selecting ferro- and antiferro-superradiant configurations. This quantum order-by-disorder effect has no classical counterpart. Four-site calculations retaining all spin states quantitatively support the predicted energy coefficients. The separation between the induced coupling and the excitation gap allows a broad temperature interval with macroscopic photon occupation and short-range correlations between displacement signs.
arXiv·2026-10-07·Roberto Ruiz et al.
No generated summary available for this entry.
overview
Original abstract
Inspired by quantum metrology, we propose a coherent consensus primitive to enhance the collaborative performance of independent quantum classifiers at the decision boundary. The basic idea consists of three steps: i) prepare a Greenberger-Horne-Zeilinger (GHZ) state on $n$ qubits; ii) apply a relative phase to each qubit, which encodes the output of one classifier; and iii) undo the GHZ preparation to collect all phases onto the first qubit. The signal is amplified by a factor of $n$, which reduces the sampling error by a factor of $\sqrt{n}$ relative to incoherent majority voting, that is, the direct combination of estimates from individual classifiers. Coherent consensus is valid for general estimation and classification of phases. We derive guarantees on the resources needed to estimate phases using this coherent consensus primitive as compared to majority voting. We implement both techniques on a trapped-ion quantum computer using a given ensemble of imperfect phase gates. We observe the expected $\sqrt{n}$ gain in precision of coherent consensus, with excess dispersion at the largest $n$ consistent with device drift. Coherent consensus can thus be understood as a form of sensing inside a quantum computer.
arXiv·2026-10-07·Sotirios Mygdalas
No generated summary available for this entry.
overview
Original abstract
Part I: Semiclassical Gravity Efficiently Solves $\mathsf{NP}$-Complete Problems Assuming the gravitational field is classical and that it couples to quantum fields via the semiclassical Einstein field equations (EFEs), we show that the weak-field dynamics of a massive and non-relativistic qubit can in principle be used to solve an $\mathsf{NP}$-complete problem in polynomial time. We attribute this vast computational power to the non-linear qubit dynamics afforded by the semiclassical EFEs. Consequently, the above two assumptions entail a violation of the Physical Extended Church--Turing Thesis, which we regard as evidence for the quantization of gravity. Part II: Spacetime Quasicrystals We generalize self-similar quasicrystals, such as the Penrose tilings, from Euclidean space to Minkowski spacetime. We construct the first examples of Lorentzian quasicrystals and identify their key novel features. We then explore possible connections to fundamental physics. First, we propose a speculative scenario in which our $(3+1)$D universe is embedded in a particularly symmetric $(9+1)$D torus $\mathbb{T}^{9,1}$, previously identified as the most symmetric toroidal compactification of the superstring. We suggest that this construction may shed light on the seesaw relation $M_{\rm Pl}M_{\rm vac} \approx M_{\rm EW}^{2}$ between the Planck, vacuum-energy, and electroweak scales. Second, we replace the random causal sets of causal set theory with ordered, highly symmetric quasi-crystalline causal sets. We find suggestive evidence that our quasicrystals outperform Poisson random sets in the number-volume correspondence in both $(1+1)$D and $(3+1)$D, where such behaviour has been conjectured to be impossible. Finally, extending hyperuniformity from space to spacetime, we show that our $(1+1)$D quasicrystal is the first demonstrated example of a spacetime-hyperuniform structure.
arXiv·2026-10-07·Philipp Strasberg
No generated summary available for this entry.
overview
Original abstract
There exist two different paradigms for records in isolated quantum systems: decoherent histories (which determines which past events leave formal records) and quantum Darwinism (which determines which current events get redundantly recorded). Neither one implies the other, and connections between the two are scarcely investigated. We unify quantum Darwinism and decoherent histories based on the insight that only redundant records about past events matter. The resulting framework of past redundancy encompasses quantum Darwinism when applied to events at the current time, and it connects redundancy to decoherence of histories and the probability sum rule via the Bhattacharyya coefficient (or fidelity). Importantly, various examples show that past redundancy is a more widespread phenomenon than the fine-tuned models necessary for quantum Darwinism suggest. We thus arrive at a richer picture in which redundancy can be caused by mechanisms different from quantum Darwinism (such as macroevents or cascade structures), which emphasizes that redundancy is necessary but not sufficient for objectivity, and which, overall, allows to realistically investigate the question: how generic is redundancy in nature?
arXiv·2026-10-07·Rahul Rana, Suman Kumar Roy, M Girish Chandra
No generated summary available for this entry.
overview
Original abstract
The Color-of-Money (CoM) problem is a financial optimization challenge in which enterprises must determine how to allocate and route funds across multiple accounts, currencies, and time periods while satisfying regulatory, operational, and liquidity constraints. As the number of assets, obligations, and planning periods increases, the decision space grows rapidly, making large-scale optimization increasingly challenging for classical approaches. In this work, we present a proof-of-concept quantum implementation of the CoM problem using IBM Quantum hardware. The original optimization problem is formulated as a constrained Mixed-Integer Linear Programming (MILP) problem and transformed into a Quadratic Unconstrained Binary Optimization (QUBO) representation suitable for quantum execution. We employ a Variational Quantum Algorithm (VQA) with Pauli Correlation Encoding (PCE), a qubit efficient encoding technique and apply error-mitigation technique to improve solution fidelity on noisy quantum hardware. A prototype instance consisting of 3 assets, 3 obligations, and 2 time periods was executed on real IBM quantum hardware and benchmarked against classical exact solver SCIP. The quantum approach successfully reproduced the same optimal solution obtained classically, validating the correctness and feasibility of the proposed methodology. While current noisy quantum hardware does not outperform classical optimization on the evaluated small instance, the results demonstrate the feasibility of executing treasury optimization workloads on current quantum hardware and provide a foundation for future investigations.
arXiv·2026-10-07·James T. Peat et al.
No generated summary available for this entry.
overview
Original abstract
Oblivious transfer (OT) is a fundamental cryptographic primitive that is useful for realizing any two-party computation. Since information-theoretically secure perfect OT is impossible classically and quantumly, research has focused on imperfect protocols, exploring how close to perfect one can get against unbounded dishonest parties. While current approaches often make use of pure quantum states, recent work suggests that mixed quantum states may improve performance. In this paper, we investigate the use of mixed quantum states in Rabin oblivious transfer, where a sender holds one bit and a receiver learns its value with a certain probability while the sender remains ignorant of whether the receiver learned it. We present three mixed-state protocols constructed with two distinct methods, extending an existing pure-state scheme and employing a probabilistic approach, and demonstrate improved performance compared to classical and quantum pure-state protocols across varying parameters.
arXiv·2026-10-07·O. A. Chuikin et al.
No generated summary available for this entry.
overview
Original abstract
This work is devoted to a theoretical study of the interaction of a quantum three-level ladder system with a continuous electromagnetic field in a one-dimensional open waveguide. We consider a situation closely resembling stimulated emission - the scattering of a single-photon exponential pulse by an excited three-level emitter. Using the real-space formalism, we obtain an analytical expression for the wavefunction of our system. We show that, for the low anharmonicity of a three-level system inherent to a transmon (the most common type of artificial atom), the influence of the third level can have a significant effect on the system's behavior. Namely, the presence of the third level largely suppresses the stimulated emission effect if the relative anharmonicity is lower than $| α_r | < 4\%$. However, for a three-level system, it is possible to obtain correlation effects such as photon bunching in the reflected field, which can also be 'switched off' by tuning the incident photon parameters.
arXiv·2026-10-07·Hyeongjun Jeon, Jeonghoon Lee, Taehyun Kim
No generated summary available for this entry.
overview
Original abstract
We present an automated method for reducing fault-tolerant circuits through fault-equivalent rewrites. Starting from a known fault-tolerant circuit, the search applies non-reducing enabling rules to expose Bell-pair reductions, each of which removes an ancilla preparation and a CNOT gate. Because every search transition preserves fault equivalence, the resulting circuits inherit the fault-tolerance properties of the input circuit. Candidate circuits are evaluated using circuit-level Monte Carlo simulation. For Shor-style syndrome extraction with the $[[7,1,3]]$ code, our method reduces one syndrome-measurement round from 30 to 18 ancilla preparations and from 54 to 42 CNOT gates. At a physical two-qubit error rate of $p = 10^{-3}$, the optimized circuit lowers the logical error rate by approximately 21% for both logical basis states. The reduction ranges from 13% to 23% over a range of $p$ spanning two orders of magnitude. We also apply the method to Steane-based dynamic syndrome extraction constructed from Goto's verified logical-$\lvert 0 \rangle$ preparation, in which the verification qubit serves as a flag. The search selects a circuit using four ancillas and 14 CNOT gates, matching the resource counts of the previous design but with an improved CNOT depth. Under depolarizing idle noise at $3p/10$ the selected circuit lowers the logical error rate by approximately 15% for both logical basis states, and by approximately $10%$ at $p/10$. These results demonstrate that automated fault-equivalent rewriting can identify circuits with lower resource costs or improved logical performance without separately verifying the fault tolerance of every candidate.
arXiv·2026-10-07·Ralf Otte
No generated summary available for this entry.
overview
Original abstract
Standard quantum mechanics takes the complex numbers as its scalar algebra. We ask whether this complex structure is algebraically fundamental or may instead form a distinguished embedded sector of a larger commutative and associative scalar algebra. Requiring the ordinary complex sector to remain intact while admitting an additional stable complex-like analytic sector turns the latter into a proper ideal, makes zero divisors unavoidable in finite dimension, and implies a lower bound of four real dimensions. The bicomplex algebra realizes this minimum, and under an additional compatibility assumption the four-dimensional realization is unique up to isomorphism. The resulting algebra exhibits two distinct decompositions: the canonical decomposition into orthogonal idempotent ideals and a decomposition adapted to the embedded complex sector and the additional ideal-valued sector. The ordinary complex scalars therefore lie diagonally across the canonical idempotent decomposition. The ideal sector supports Taylor series, oscillatory exponentials, Fourier-type kernels, and Schrödinger-type expressions, and carries a formal ideal-valued eigenvalue structure. Restricting the Born rule to the embedded complex sector recovers its standard form. Whether this dual scalar architecture has physical significance beyond the algebraic framework remains an open question.
arXiv·2026-10-07·M. Kalash et al.
No generated summary available for this entry.
overview
Original abstract
Multimode entangled states of light are key resources for high-dimensional photonic quantum technologies, particularly for continuous-variable quantum computing and quantum information processing. Exploiting their full capabilities requires detection strategies that can efficiently and simultaneously access a large number of modes and their quantum correlations. Multimode optical parametric amplification (MOPA) provides a promising approach by amplifying multiple quadratures prior to detection, rendering the measurement robust against subsequent optical losses while enabling broadband operation. Here, we demonstrate the spectral multimode capability of MOPA by simultaneously characterizing a broadband 60-node dual-rail continuous-variable cluster state. We reconstruct the cluster-state nullifiers across the spectral modes and observe nearly uniform squeezing ranging from -7.2 to -6.5 dB. Furthermore, by evaluating the van Loock-Furusawa criterion across all relevant bipartitions, we verify genuine multipartite entanglement throughout the 60-node state. These results establish MOPA as a promising platform for scalable high-dimensional quantum information processing in the spectral domain.
arXiv·2026-10-07·Boaz Micah et al.
No generated summary available for this entry.
overview
Original abstract
Quantum kernel methods are leading candidates for a practical quantum advantage in machine learning, but assessing that potential requires two quantities usually reported separately: how well a kernel performs on the task, and how far its geometry departs from the classical kernels available for the same problem. We introduce a fully unsupervised, multi-objective protocol that optimises simultaneously the normalised pseudo discrepancy (NPD), a label-free proxy for anomaly detection quality, and the geometric difference (GD) to a tuned classical reference kernel, selecting models from the resulting Pareto front. We apply it to malware beaconing detection in real network traffic, using a one-class support vector machine with fidelity and projected quantum kernels over four data encodings, on simulators and on IQM's 20-qubit Garnet processor. NPD-guided selection alone finds a fidelity kernel that beats the tuned classical baseline, but with a geometric difference too small to certify the gain as quantum. Projected kernels reach far larger geometric differences; the Pareto-selected one only marginally exceeds the baseline (AUC $0.782$ versus $0.765$, $g_{C\to Q}\approx 89>\sqrt{N}$ relative to that reference kernel), still below the NPD-selected fidelity kernel ($0.840$).
arXiv·2026-10-07·Bharti Garg et al.
No generated summary available for this entry.
overview
Original abstract
Quantum emitters in hexagonal boron nitride (hBN) are promising building blocks for solid-state quantum photonics because of their bright room-temperature emission. These emitters strongly interact with lattice vibrations, which partially underpins their excitation efficiency. Here, using complementary cathodoluminescence (CL) and photoluminescence (PL) spectroscopy, we demonstrate cavity-mediated interactions between hBN quantum emitters coupled to the same plasmonic Au void cavity at the room temperature. Cathodoluminescence measurements reveal that a vibronic transition of the 443 nm emitter hybridizes with the cavity mode, giving rise to a spectrally resolved splitting, while the neighboring 537 nm emitter remains in the weak-coupling regime despite spectral overlap. The energy split of the CL peak is at the order of 36.2 meV, whereas the PL-resolved peak is approximately 24.1 meV, which is due to the collective excitations of multiple emitters per electron excitation and their mutual interactions. Maxwell-Bloch simulations reproduce the experimental spectra and identify the observed splitting as the result of cavity-induced hybridization. Excitation-dependent PL further shows that the hybridized state can be accessed through phonon-assisted excitations below the zero-phonon transition. These results demonstrate that vibronic transitions provide an effective pathway for controlling interactions between multiple quantum emitters in hybrid plasmonic nanophotonic systems.
arXiv·2026-10-07·Maho Nakata
No generated summary available for this entry.
overview
Original abstract
Variational two-particle reduced-density-matrix methods impose hierarchies of semidefinite constraints. We ask whether a fixed level of such a hierarchy can recover even an elementary many-fermion spectrum, using the dispersion test, in which a value is accepted as an eigenvalue when the minimized dispersion vanishes. For an exactly solvable operator that counts fermions in one half of the spin orbitals, whose spectrum consists of integers, we determine the complete set of accepted values at every level of the full hierarchy of particle-hole semidefinite constraints. Besides the integers, this set contains an entire interval of noninteger values unless the hierarchy level grows linearly with the particle number, and we give the exact threshold. The proof constructs explicit pseudo reduced density matrices that are diagonal in the occupation basis, obtained by continuing the occupation probabilities of a fixed-particle-number state to a noninteger particle number. Classical semidefinite constraints on occupation correlations, supplemented by nonnegative occupation-pattern probabilities, suffice to establish fermionic positivity. For this counting model the two relaxations have the same dispersion zero set, not necessarily the same feasible states, and a converse argument shows that no other false eigenvalues occur. The limitation is specific to the hierarchy: two-body inequalities that encode the integer spectrum would remove every false value but are not generated at a fixed level. We also verify that the full semidefinite constraints and their complete projection onto two-particle reduced-density-matrix space are equivalent in finite dimensions, so that the result applies equally to the polar formulation.
arXiv·2026-10-07·Matthijs Vernooij, Melchior Wirth
No generated summary available for this entry.
overview
Original abstract
A KMS-symmetric quantum Markov semigroup is completely determined by the quadratic form in induces on the GNS Hilbert space. The quadratic forms that arise in this way are called quantum Dirichlet forms. In this article we give a complete description of bounded quantum Dirichlet forms in terms of derivations. In particular, we exhibit an explicit characterization of the bounded quantum Dirichlet forms on type I factors. We also show that any unbounded quantum Dirichlet form can be represented in terms of derivations. The key technical insight is that the modular group always restricts to a strongly continuous group on the domain of a quantum Dirichlet form such that the square root of the analytic generator is accretive with respect to the form norm.
arXiv·2026-10-07·Sainan Huai et al.
No generated summary available for this entry.
overview
Original abstract
Identifying and measuring topological invariants remains a fundamental challenge due to the non-local nature of momentum eigenstates in real space. Established approaches based on Bloch oscillations, quantum walks, charge pumping and quench dynamics, typically fail to provide direct momentum-dependent geometric information of each Bloch state. Here, we propose a novel framework for implementing direct band-topology tomography via momentum-selective measurements, and experimentally demonstrate it on a superconducting processor featuring a highly connected coupling architecture. Utilizing a ``star-like" geometry in which an auxiliary probe couples to a one-dimensional topological chain with spatially modulated coupling strengths, we selectively address the desired momentum states of the chain. This approach enables the direct and robust extraction of the winding phase that contributes to the associated topological invariant. Leveraging non-local couplers bridged by long tantalum airbridges, we realize an extended Su-Schrieffer-Heeger (SSH) model and map its full topological phase diagram. Through a nested Fourier analysis over time and space, we directly extract the winding phase across Brillouin zone and resolve quantized winding numbers of $ν=\{0,\pm1,2\}$ characterized by phase winding $\{0, \pm 2π,4π\}$. Our work establishes a versatile tool for probing topological characteristics and opens a new avenue for robust quantum computing architectures based on topological protection.
arXiv·2026-10-07·Adonai Hilário da Silva, Tanmoy Pandit, Francesco Cosco
No generated summary available for this entry.
overview
Original abstract
Superconducting qubits are often based on the first two energy levels of a physical anharmonic LC oscillator. Since the anharmonicity of such systems is usually much lower than the involved energy gaps, population can easily leak to higher energy states. This is what characterizes leakage errors, and it can have multiple sources: from coherent error induced by the control platform to incoherent thermal dissipation. In this work, we adapt an optimal control method based on sub-Riemannian geodesic search in the unitary group for a system consisting of two superconducting qubits with leakage levels. We use the $R_x(π/2)$ rotation for single-qubit operation analysis, and the $i$SWAP operation for two-qubit analysis. For the former, we find considerable performance improvement in average gate fidelity as well as in the reduction of leakage errors when comparing the obtained optimal pulses with Gaussian and DRAG pulses, especially for short duration pulses. For the $i$SWAP gate, although leakage error remains roughly the same, we manage to obtain considerably higher fidelities with the cost of requiring a slightly longer time evolution.
arXiv·2026-10-07·Masaya Kunimi, Taiki Haga, Masaya Nakagawa
No generated summary available for this entry.
overview
Original abstract
Hydrodynamic relaxation in open quantum many-body systems can be understood in terms of diffusive Nambu--Goldstone (NG) modes associated with strong-to-weak spontaneous symmetry breaking (SWSSB). Here, we find a common structure underlying weak ergodicity breaking in closed quantum systems and diffusive hydrodynamics in open quantum systems. We establish a spectral correspondence between the parent Hamiltonian of rainbow quantum many-body scar (RQMBS) states in closed systems and the effective Lindbladian of strongly dissipative open systems with strong $U(1)$ symmetry and local charge-dephasing Lindblad operators. For broad classes of spin, fermionic, and bosonic systems, we construct asymptotic RQMBS (ARQMBS) states. Within the enlarged scar subspace, the parent Hamiltonian admits a local Rokhsar--Kivelson-type frustration-free decomposition. A single-mode variational construction gives an $O(k^2)$ upper bound on its lowest excitation energy and yields states satisfying the defining ARQMBS criteria: orthogonality, vanishing energy variance, and characteristic entanglement scaling. Under vectorization, RQMBS states are mapped to maximally mixed infinite-temperature states in fixed-charge sectors, which exhibit long-range SWSSB order under finite-density conditions. Assuming uniformly bounded positive transition rates, the effective Lindbladian has the same local projectors as the parent Hamiltonian but with positive transition-dependent weights, yielding two-sided spectral bounds and the same system-size scaling of their gaps. For uniform rates, the two operators are proportional to each other and their eigenmodes coincide. Therefore, an exact quadratic parent-Hamiltonian branch maps directly to a diffusive NG mode. Our results connect different mechanisms of slow relaxation in closed and open quantum many-body systems.
arXiv·2026-10-07·Íñigo Aréjula-Aísa et al.
No generated summary available for this entry.
overview
Original abstract
Distributed quantum circuit simulation enables the execution of large-scale quantum algorithms by partitioning qubits across multiple computational nodes. However, inefficient qubit placement frequently leads to excessive inter-node communication, severely limiting performance and scalability. This work introduces a communication-aware qubit layout optimization framework that systematically minimizes data exchange among nodes while dynamically selecting the optimal number of computational resources. Integrated into the QuCSLO library, our approach supports dynamic node scaling, OpenQASM parsing, and seamless integration with the QuEST simulator. Extensive evaluations on both synthetic benchmarks and real-world QASMBench circuits demonstrate that optimized layouts significantly reduce communication cuts and yield runtime speedups of over 2x compared to identity layouts, particularly in highly entangled circuits. Our results underscore the critical impact of strategic qubit placement on distributed simulation efficiency and provide a practical, resource-scalable solution for quantum workloads.
arXiv·2026-10-07·Alberto Marchisio et al.
No generated summary available for this entry.
overview
Original abstract
Photonic quantum computing has recently emerged as a promising platform for hybrid quantum machine learning due to its native realization of linear-optical circuits and the computational complexity of boson sampling. However, despite growing interest in quantum methods for finance, the influence of photonic circuit design choices on predictive performance remains largely unexplored. Existing studies typically evaluate a single architecture, leaving the broader photonic design space unexamined. In this work, we present Q-PhotoMarket, a systematic design space exploration (DSE) framework for photonic hybrid quantum neural networks (HQNNs) applied to financial market prediction. We explore over 5,000 valid photonic configurations spanning input photon states, circuit architectures, entangling models, and measurement strategies across their compatible computation spaces, for U.S., Indian, and cryptocurrency markets. To improve search efficiency, the exhaustive exploration is complemented with Bayesian optimization. We further incorporate threshold calibration and prediction-collapse diagnostics to enable reliable evaluation under increasingly imbalanced return thresholds. Experimental results show that systematic exploration of more than 5,000 photonic HQNN configurations reveals consistent architectural patterns across financial markets, identifies robust high-performing designs, and demonstrates competitive performance relative to classical machine learning baselines.
arXiv·2026-10-07·Emanuele Casciaro et al.
No generated summary available for this entry.
overview
Original abstract
Anomaly detection on small and unbalanced datasets remains very challenging in machine learning, although this scenario is common in several domains, including healthcare, cybersecurity, finance, and energy. Data augmentation and generative AI may mitigate training-data scarcity, but they often fall short because anomalies are, by definition, unpredictable, rare, and highly diverse events compared to high-probability normal data. Overfitting to pseudo-anomalies, model collapse, high-dimensional data, uninterpretable black-box models, and validation challenges are typical issues limiting their practical applicability. In this context, quantum machine learning may provide a promising and more sustainable avenue because it can enable more interpretable models with far fewer trainable parameters and smaller datasets, implementable on energy-efficient quantum hardware. Here, we propose a novel two-step hybrid classical--quantum architecture for sequential data and test it on a realistic scenario in the global energy-transition domain, i.e., automated anomaly detection in large-scale photovoltaic plants. The achieved generalization capability and competitive prediction accuracy may pave the way for new hybrid learning models able to exploit the continuously increasing power of cloud-available and more sustainable quantum accelerators integrated with more traditional energy-hungry High Performance Computing resources.
arXiv·2026-10-07·Emanuele Casciaro et al.
No generated summary available for this entry.
overview
Original abstract
Quantum machine learning is rapidly emerging as a promising and potentially more sustainable approach that can complement traditional, energy-hungry HPC, AI, and GPU resources-particularly for the demanding global challenges the world urgently needs to address. In recent years, the first prototypes of quantum processors have reached the market, are sometimes available via the cloud, and distributed quantum computing is beginning to move from a largely theoretical concept to a demonstrated reality. However, these devices are still noisy and qubit-limited. Therefore, it is desirable to design quantum machine learning models with a reduced quantum register and a limited number of quantum gates, avoiding overly deep and wide quantum circuits. Here, we explore this idea by proposing a novel divide-et-impera-based training protocol that splits quantum neural networks into smaller components and better governs their optimization. We benchmark our approach on real data and real-world prediction tasks in intertwined energy and environmental domains, such as the status of charging stations for electric vehicles and the global air quality index. Our results suggest a design principle for quantum machine learning algorithms across a wide range of applications, which can be more feasibly tested on state-of-the-art quantum processors or within modular quantum architectures being developed for future hybrid infrastructures interconnected via high-speed communication links.
arXiv·2026-10-07·Sarah Mostame et al.
No generated summary available for this entry.
overview
Original abstract
Predicting anharmonic vibrational spectra is a complex computational task, which becomes quickly infeasible as molecular size and the number of vibrational basis functions increase, leading to an exponential growth of the underlying Hilbert space. Here, we employ a sample-based quantum diagonalization (SQD) framework to compute anharmonic vibrational energies and spectra. The approach combines quantum state preparation and sampling with configuration recovery, diagonalization of the Hamiltonian projected in a subspace of basis configurations, and calculation of transition-dipole moments to obtain both vibrational energies and infrared spectra. We investigate two approaches for sampling, namely, vib-LUCJ and vib-SqDRIFT and apply the method to study the polyyne molecules C$_2$H$_2$ and C$_4$H$_2$, reaching representations requiring up to 104 qubits. Beyond energies, transition-dipole calculations reveal that infrared intensities and excited-state composition continue to evolve with basis size through anharmonic mixing and intensity redistribution, even when low-energy eigenvalues appear converged. These results show that sample-based quantum subspace methods can capture spectroscopic information in vibrational spaces far beyond the regime of full diagonalization. Moreover, our simulation identify multi-state recovery and scalable projected-space treatment as central challenges for further scaling sample-based approaches.
arXiv·2026-10-07·Stuart Hadfield
No generated summary available for this entry.
overview
Original abstract
Classical approximation complexity asks what solution quality can be guaranteed with polynomial-time computation. The classes APX, PTAS, and FPTAS distinguish a fixed approximation ratio, approximation to any fixed accuracy, and approximation schemes whose running time is also polynomial in inverse accuracy. Their randomized counterparts are R-APX, R-PTAS, and R-FPTAS. We define bounded-error quantum counterparts BQ-APX, BQ-PTAS, and BQ-FPTAS. Membership requires a uniform quantum algorithm that, on every input, returns a feasible classical solution achieving at least the claimed approximation ratio with probability at least 2/3. Scores (objective values) must be efficiently classically computable. Running time includes parameter selection, preparation, measurement, decoding, and repetition. Many quantum optimization methods are used heuristically, and high benchmark scores alone do not establish these guarantees. We further establish a conditional hierarchy for logarithmic, polynomial, and exponential approximation factors. Assuming NP $\subsetneq$ BQP, the quantum classes form a strict hierarchy. Problems based on prime factorization and discrete logarithms give conditional quantum-classical separations. Certified Maximum Order has an exact quantum algorithm, while any randomized polynomial-time algorithm guaranteeing at least an inverse-polynomial approximation ratio on every input would yield efficient factoring. Discrete-Logarithm Fitting has an exact quantum algorithm and a deterministic one-half approximation, but any fixed improvement over one half would give a randomized polynomial-time algorithm for the safe-prime discrete logarithm problem. Our results show, under explicit complexity assumptions, that quantum computation can improve worst-case approximation guarantees. A quantum-classical gap for common problems such as MaxCut or MaxSAT remains open.
arXiv·2026-10-07·Stefan Kazmaier, Kaisa Laiho
No generated summary available for this entry.
overview
Original abstract
We produce degenerate photon pairs called signal and idler via parametric down-conversion (PDC) in a Fabry-Pérot waveguide resonator having close to a 2GHz bandwidth in the telecom C-band. Our PDC source is based on a type-II periodically-poled Lithium Niobate waveguide with high-reflecting end facets forming the resonator. We measure the strength of the photon-pair correlation between signal and idler after selecting a single resonator mode from the multimode PDC emission. Thereafter, we investigate their sub-nanosecond long pulse shapes, in other words the time bins, with standard photon counting. We find that the time-bin durations vary significantly from each other, which can be predicted by the different optical losses of the cross-polarized signal and idler. Further, we simulate the temporal properties of signal and idler via the Fourier transform of their joint spectral characteristics. Our results deliver empiric insight about the time bins of photon pairs and are relevant for driving future quantum networks at the edge to narrow bandwidths but nevertheless in the pulsed regime.
arXiv·2026-10-07·Kunal Kumar et al.
No generated summary available for this entry.
overview
Original abstract
We extend sample-based quantum diagonalization (SQD) to anharmonic vibrational spectra and use it to benchmark how vibrational ansätze scale on present-day hardware under a direct one-hot encoding (up to 72 qubits). Five particle-conserving circuits are warm-started through vibrational coupled-cluster (VCC) t1, t2 amplitudes: UVCCSD, the compact heuristic circuit (CHC), and three unitary-cluster-Jastrow ansätze introduced here, VLUCJ, Vg-uCJ, and VIm-uCJ. A self-consistent configuration-recovery loop reconstructs correlated states from hardware samples in the low-retention regime where naïve post-selection breaks down, enabling the calculation of ground-state energies for H$_2$O, CH$_2$O, and CH$_2$ClF (3-9 modes). We compare harmonic-oscillator and vibrational self-consistent-field (VSCF, "modal") reference bases. In the small-modal-basis regime relevant for near-term devices, the modal basis is typically more accurate than the harmonic-oscillator representation; empirically, it also yields substantially better-converged hardware sampling for deep circuits at these qubit counts. Across ansätze, we find a clear retention/accuracy tradeoff when scaling: the new VLUCJ circuit is the most hardware-robust, retaining the largest fraction of physically valid one-hot outcomes, whereas the more expressive uCJ variants and UVCCSD can recover more correlation when retention is sufficient. Finally, we extend the recovery protocol to excited states by targeting a chosen per-mode VSCF occupation and warm-starting it with a state-specific VCC calculation, and we demonstrate the calculation of one representative fundamental vibrational frequency per molecule on IBM QPUs.
arXiv·2026-10-07·Juuso Jaakola, Vlad Stirbu, Teiko Heinosaari
No generated summary available for this entry.
overview
Original abstract
Interactive quantum circuit simulators are increasingly used to support introductory quantum computing education for learners from varied disciplinary backgrounds. These environments can also generate detailed response logs of submitted circuits, but such data are rarely transformed into evidence that instructors can use for course redesign and development. We present a learning analytics framework for quantum circuit simulator tasks and report its task-level branch on anonymised logs from an introductory quantum computing course delivered in the TIM learning environment. The task branch characterises exercises through participation, completion, first-attempt accuracy, valid-attempt counts, sessionised active time, and observed answer-space reporting of common correct and incorrect constructions. The dataset covers the 2024-2025 cohort of 492 learners, 47,533 valid submissions, and 21 obligatory quantum circuit exercises. The framework identifies bottleneck tasks, broad solution spaces, and recurring wrong-answer patterns that are not visible from final scores alone. Its most distinctive output is a plain-text representation of the observed answer space, designed to make open-ended circuit submissions directly interpretable to instructors. We show how response logs can reveal actionable task-design issues and support concrete course redesign. A learner-level branch is retained only as an ongoing research extension and is not a central empirical contribution of the present paper.
arXiv·2026-10-07·Jake Hofgard
No generated summary available for this entry.
overview
Original abstract
We provide a geometric description of Lee-Yang tensors, building upon several recent results of Bravyi, Gosset, Liu, and Wong. By applying tools from complex Perron-Frobenius theory, we generalize one of their key lemmas to bound the spectral ratio of non-normal operators with Lee-Yang radius greater than one. As a direct consequence, we provide a local-to-global principle for bounding spectral gaps of Suzuki-Fisher Hamiltonians, a family of $2$-local Hamiltonians, using only the Lee-Yang radius of each local operator to bound the gap from below. On the other hand, we develop a simple perturbative technique to show that the Gibbs states of $k$-local Hamiltonians, $k \geq 3$, cannot have Lee-Yang radius at least one for all inverse temperatures $β\geq 0$. We apply this same method to conclude that Suzuki-Fisher Hamiltonians are precisely those Hamiltonians whose Gibbs states are Lee-Yang at all inverse temperatures $β\geq 0$.
arXiv·2026-10-07·Lu Wei, Yufeng Wang, Haibin Ling
No generated summary available for this entry.
overview
Original abstract
Several published comparisons of variational quantum optimizers time only runs that reach a target loss, or read the verdict at a single target. Either convention could decide whether an optimizer's costlier steps pay off. We measure how much each convention changes verdicts among Adam, simultaneous perturbation stochastic approximation (SPSA) and quantum natural gradient (QNG), on initializations held out from the selection of settings. We compute the exact metric that preconditions QNG, price every step in circuit evaluations and give every method the same budget. In a median pooled over circuit widths, cost families and a sweep of settings with common misses, SPSA needs more than twice Adam's evaluations to reach a loose target. Dropping the censored runs that miss the target hides this gap. On the global-cost family we hold fixed the settings selected for a strict target. QNG then usually reaches the loose target after Adam but the strict target first. QNG's strict-target lead disappears when the metric's simulator price, linear in the number of parameters, is replaced by an assumed hardware count quadratic in that number. We recommend charging every miss the budget and reporting verdicts across targets.
arXiv·2026-10-07·Weiwei Zhu et al.
No generated summary available for this entry.
overview
Original abstract
Conventional Chern insulators rely on breaking time-reversal symmetry via magnetic fields or synthetic gauge fields. Here we introduce a fundamentally different paradigm: a static lattice without any gauge field becomes a Chern insulator solely through the cooperation of two non-Hermitian ingredients: on-site loss and non-reciprocal coupling. Neither effect alone suffices; only their synergy opens a topological gap and gives rise to robust chiral edge states with a nonzero Chern number. The underlying mechanism originates from a non-Hermitian chiral molecule formed by the lossy sites, whose dynamically dominant mode carries an orbital angular momentum that effectively generates a synthetic flux after the fast-decaying degrees of freedom are eliminated. Our results establish non-Hermitian cooperation as a versatile resource for inducing Chern topology without external fields or temporal modulations, opening a new route to topological phases in open classical and quantum systems.
arXiv·2026-10-07·Xudong Zhang, Bin Guo
No generated summary available for this entry.
overview
Original abstract
Non-reciprocal lattices offer a flexible setting for directional wave transport, raising the question of how enhanced internal scattering translates into transmission between fixed external ports. We address this question for non-reciprocal Su--Schrieffer--Heeger (SSH) chains with staggered gain and loss by relating the reference-dependent insertion kernel $K_p=VG_pV$ to the coherent transmission intensity $T$. On a fixed finite graph, a strong-insertion expansion gives a contribution proportional to $γ^{1-d}$, whose coefficient is the signed sum of shortest directed paths of length $d$. When this sum is nonzero, it sets the leading behavior independently of fixed diagonal losses; when it cancels, those losses can enter the first surviving higher-order term. For a fixed cross-sublattice endpoint channel, transmission has a strictly negative slope at every nonzero differentiable stationary point of the kernel magnitude. In the weak-insertion regime, the reference-system coefficient $χ=-\mathrm{Re}\,\mathrm{Tr}[(G_{0p}Z)^2]$ predicts the initial transmission change for symmetric SSH ports, and $χ>0$ together with a strictly stable baseline guarantees local stable enhancement. Finite-chain calculations and driven dynamics connect these results to observable response and distinguish asymptotic convergence from transient settling. A strictly dissipative short-chain example exhibits local enhancement without net power gain. Together, these results separate graph-path structure, coherent port response, and dynamical establishment, providing channel-specific criteria for interpreting internal scattering.
arXiv·2026-10-07·Taehee Ko, Sungbin Lim, Sangkook Choi
No generated summary available for this entry.
overview
Original abstract
We develop an end-to-end framework for estimating canonical thermal properties of particle-number-conserving second-quantized Hamiltonians using quantum simulations. The framework integrates initial state preparation with mixed Dicke states, particle-number-preserving Trotterized simulation, and generalized quantum signal processing to estimate canonical partition functions and observables. Building on this canonical scheme, we introduce a grand-canonical reconstruction scheme in which the same quantum measurement data can be reused for arbitrary chemical potentials through classical reweighting, thereby avoiding repeated quantum circuit executions as the chemical potential is varied. We prove the existence of system-size-independent temperature regimes in which both the canonical and reconstructed grand-canonical schemes have lower asymptotic time complexity than classical Lanczos methods, up to polynomial factors, for physically relevant Hamiltonians. We numerically validate our theoretical results for the two-dimensional Hubbard model in both weak- and intermediate-coupling regimes.
arXiv·2026-10-07·Jiyuan Liu, Joel Bierman, Yuan Liu
No generated summary available for this entry.
overview
Original abstract
We introduce a non-orthogonal amplitude amplification (NOAA) method for hybrid continuous-variable- discrete-variable (CV-DV) quantum processors, where the available CV-assisted projector is not perfectly se- lective for the target state. We establish a bound on the achievable target-state fidelity, which is determined by the initial target-state amplitude and the selectivity of the accessible reflection operator. This bound limits the performance of NOAA in hybrid CV-DV systems. To mitigate this limitation, we propose using a squeezed CV ancilla to reduce the overlap between relevant CV states and a hybrid quantum signal processing (HQSP) filter to suppress errors arising from imperfect knowledge of the target eigenenergy. Numerical simulations show that, for small initial target-state amplitudes, our protocol achieves higher fidelity and efficiency than the repeat-until-success (RUS) method despite the presence of non-orthogonality. For large initial amplitudes, RUS is already efficient, and amplitude amplification provides little additional advantage.
arXiv·2026-10-07·Bohan Lu, Kenneth R. Brown
No generated summary available for this entry.
overview
Original abstract
We construct CSS codes with three logical qubits whose logical CCZ gate is implemented by transversal physical $T/T^{\dagger}$ gates and whose distance is at least $3$. These codes start with $8$-divisible $X$-stabilizers defined by projective geometry, which guarantees $d_Z\geq 3$. A SAT solver then finds three $X$-logical operators compatible with the transversal CCZ. We build codes at thirteen block lengths from $n=48$ to $n=496$, with $d_Z=3$ or $4$, and illustrate the method with the $[[48,3,3]]$ code $Q_{48}$. Additionally, we prove that no CSS code with three logical qubits, $Z$-distance at least $3$, and a quasi-transversal CCZ gate (transversal $T$ with a diagonal Clifford correction) exists below $n=39$. The $[[47,3,3]]$ code of Jacinto et al. serves as an upper bound, leaving $39\leq n\leq46$ open.
arXiv·2026-10-07·Joaquin Chung et al.
No generated summary available for this entry.
overview
Original abstract
We present a comparative analysis of two open-source quantum network simulators, QuISP and SeQUeNCe, focusing on cross-validation of basic networking tasks to ensure consistency and accuracy in simulation outputs. Although both simulators are designed to study quantum network management policies and their dynamics under complex noise models, their differing underlying assumptions can lead to variations in simulation results. We highlight the discrepancies in how the two simulators handle connections, internal network node processing time, and classical communication, resulting in significant quantitative and qualitative differences in the time required to perform basic network tasks such as entanglement generation, purification, and swapping. We simulate common scenarios between the simulators to compare both the latency of resource distribution and the fidelity of the distributed resources. Our findings indicate that while the simulators differ in the time required to complete network tasks---a constant factor difference attributable to their respective connection models---they agree on the fidelity of the distributed resources under identical error parameters. This work demonstrates a crucial first step towards enhancing the reliability and reproducibility of quantum network simulations, as well as leading to full protocol development. Furthermore, our benchmarking methodology establishes a foundational set of tasks for the cross-validation of simulators to study future quantum networks.
arXiv·2026-10-07·Francesco Buscemi
No generated summary available for this entry.
overview
Original abstract
Can an agent's predictions reveal whether its reasoning is based on a classical or a quantum model? Using known results on matrix factorizations, here we show that quantum Bayesian retrodiction can produce one-step-ahead forecasts incompatible with every classical Bayesian explanation based on learning about a fixed but unknown sampling law from conditionally independent observations. The separation has a sharp threshold in the number of outcomes: for any measurement with at most four outcomes, the quantum predictions admit a classical realization, irrespective of the prior state and the finite Hilbert-space dimension, whereas a five-outcome measurement on a single qubit already violates an explicit classical bound. This bound holds for arbitrary classical latent states, prior probabilities, and sampling laws, and involves only the agent's initial and updated predictions. Thus, in this setting, quantum Bayesian retrodiction is strictly more expressive than classical Bayesian learning, and this difference can be witnessed without observing or specifying the agent's internal description.
The Quantum Insider·2026-10-06·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Xanadu and GlobalFoundries have entered a multi-year partnership to develop and manufacture photonic components for utility-scale quantum computing. The collaboration will focus initially on industrializing Xanadu ’s superconducting nanowire single-photon detectors and ultra-low-loss silicon nitride photonics through GF’s 300 mm production line in Malta, New York. The companies plan to use the manufacturing platform for future photonic quantum modules and Xanadu ’s fault-tolerant quantum computing demonstrators. PRESS RELEASE — Xanadu Quantum Technologies Limited (“ Xanadu “; NASDAQ/TSX: XNDU), a leading photonic quantum computing company, today announced a strategic multi-year partnership with GlobalFoundries (GF), a leading semiconductor manufacturer, to address the high-volume production required for utility-scale quantum computing. This partnership combines Xanadu’s existing expertise in ultra-low loss photonic design and process development with GF’s industry-leading photonics manufacturing prowess to accelerate the development and manufacturing of advanced photonic components, including ultra-low loss silicon nitride (SiN) photonics and Superconducting Nanowire Single-Photon Detectors (SNSPDs), through GF’s 300 mm production line in Malta, New York. The initial focus of the Xanadu and GF partnership is on the industrialization of Xanadu’s SNSPDs and its ultra-low-loss SiN platform. In photonic quantum computing, where information is carried by photons, reading calculation outputs requires photon number resolving (PNR) detectors, which are advanced optical sensors that determine the number of photons in a single light pulse. Xanadu has adopted SNSPDs, widely recognized as the most reliable PNR technology, as its PNR platform for utility-scale quantum computing. The adoption of SNSPDs is expected to dramatically increase the speed of Xanadu’s quantum computing systems and considerably reduce the chip overheads needed to deli
The Quantum Insider·2026-10-06·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief The Netherlands’ new quantum strategy targets technological leadership by 2035 through commercial development, reduced foreign dependencies and protection against quantum-related security threats. Building on 614.9 million euros previously allocated to Quantum Delta NL , the government plans to support research, financing and early procurement, with further ambitions subject to available budgets. The strategy calls for completing post-quantum cryptography migration for high-risk government uses by 2030 and medium-risk uses by 2035. Photo by engin akyurt on Unsplash The Netherlands plans to turn its quantum research strengths into commercial products while preparing government systems for computers that could defeat widely used encryption. A new governmentwide quantum strategy sets a 2035 goal for technological leadership, greater independence from suppliers outside the European Union and resilience against quantum-related security threats. It combines support for research, investment and public procurement with a timetable for replacing vulnerable cryptography. The government said Economic Affairs and Climate Minister Heleen Herbert and Willemijn Aerdts, state secretary for digital economy and sovereignty, submitted the Cabinet-approved strategy to the House of Representatives. It was developed with ministries responsible for defense, foreign affairs, finance, infrastructure, justice, education, health and other government functions. The plan builds on 614.9 million euros previously made available to Quantum Delta NL through the National Growth Fund, according to the government statement. That funding supports the development of the Dutch quantum sector. The strategy does not establish a new, fully funded spending program for all its ambitions. Its actions are already underway or are to be accommodated within existing departmental resources. Further assessments could identify a need for additional funding, but the document says ambitions will be adjust
Quantum Computing Report·2026-10-06·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Florida Atlantic University (FAU) received a $200,000 NIST grant to establish a quantum cybersecurity workforce consortium in South Florida. This initiative, in collaboration with D-Wave Quantum Inc., will focus on integrating quantum computing, cybersecurity, and critical energy infrastructure protection. The program will utilize FAU's new D-Wave Advantage2 quantum system and aims to train a workforce to secure critical infrastructure against emerging post-quantum threats. The post Florida Atlantic University Receives NIST Grant to Build South Florida Quantum Cybersecurity Workforce Ecosystem appeared first on Quantum Computing Report .
Phys.org Quantum Physics·2026-10-06
No generated summary available for this entry.
overview
Original abstract
The world would look radically different without rulers and measuring tapes that fit into a pocket. Carpenters, fashion designers and engineers rely on these trusty tools to check the size of everything from a wooden board to a fabric swatch. But physicists who work with light lack that same convenience for one of the basic measurements of their craft. They routinely need to measure and compare the frequencies—colors—of the light waves they are using.
Quantum Computing Report·2026-10-06·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Zapata Quantum has joined the IBM Quantum Network to accelerate enterprise application development by integrating IBM's superconducting QPUs with Zapata's Quantum Pilot platform. This partnership aims to bridge the quantum application gap and develop mission-critical quantum software workflows for various industries. Their collaboration builds on previous research, including a generative model study for cancer mutation inhibitors and foundational work on variational quantum factoring. The post Zapata Quantum Joins IBM Quantum Network to Accelerate Enterprise Application Development appeared first on Quantum Computing Report .
IonQ·2026-10-06
No generated summary available for this entry.
overview
Original abstract
IonQ researchers combine cat states and classical scheduler codes to speed up qLDPC error correction: up to 74x faster Clifford and 5x faster Toffoli gates.
Phys.org Quantum Physics·2026-10-06
No generated summary available for this entry.
overview
Original abstract
Creating a quantum device often begins by intentionally damaging a crystal. Scientists fire an ultrafast laser pulse into a material, knocking atoms out of place and leaving behind tiny imperfections called vacancies. Far from being flaws, these vacancies can behave as qubits—the fundamental building blocks of quantum information.
The Quantum Insider·2026-10-06·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief University of Illinois researchers developed an on-chip quantum memory that stored photons for more than 1 microsecond while preserving quantum information with high fidelity. The device uses erbium atoms in thin-film lithium niobate to temporarily hold multiple photons, offering potential compatibility with large-scale chip manufacturing. Practical use in quantum computers and communication networks will require improved photon retrieval efficiency and longer storage times. Image: Pictured left to right: Priyash Barya, Daren Chen, Elizabeth Goldschmidt. (University of Illinois Urbana-Champaign) PRESS RELEASE — For highly fragile quantum information systems, the ability to store quantum information is vital — but also challenging. Quantum information is transported in particles of light called photons, which often must be temporarily paused (or “stored”) while other, slower quantum operations catch up. This storage must be performed on microchips as small as one centimeter — a distance covered by light in a few trillionths of a second. Storing photons for a microsecond would represent a massive leap forward for the capabilities of quantum chips. New research from The Grainger College of Engineering at the University of Illinois Urbana-Champaign addresses this challenge by developing an integrated on-chip nanophotonic platform for longer-term storage of photons. Led by physics professor Elizabeth Goldschmidt and published in Nano Letters , the group’s integrated platform leverages the versatility of spectral hole burning and the scalability of thin-film lithium niobate, giving it potential for scalable manufacturing, with implications for both classical and quantum photonics. “No one else has stored light on a chip in a platform like this, with this potential for scalability,” said Priyash Barya, an electrical engineering graduate student and the paper’s co-first author. “Our technique is the only way of doing this, and we’re
The Quantum Insider·2026-10-06·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief India’s Startup Policy Forum launched DeepVerse to support deep-technology sectors, including quantum technology, through policy research, industry collaboration and consultations. The platform brings together an 18-member advisory board and 10 venture capital firms, alongside founders, government representatives, academics and technology companies. DeepVerse builds on an initiative that identified 100 Indian deep-technology startups and plans to publish policy recommendations across its focus sectors. India’s Startup Policy Forum launched a center to give deep-technology companies, including quantum startups, a sustained role in shaping national policy, according to a news release . The industry alliance said its Centre for DeepTech Innovation, called DeepVerse , will bring together investors, founders, government representatives, technology companies and academics to address barriers facing businesses built around scientific and engineering advances. The platform has an 18-member advisory board and participation from 10 venture capital firms, according to SPF’s announcement. It will focus on policy discussions, research and industry collaboration, with a report outlining recommendations across its technology sectors expected to follow. Quantum technology is among its priorities, alongside semiconductors, space technology, defense, biotechnology and health technology, clean energy, drones and aerospace, electric vehicles, advanced manufacturing and robotics. Quantum technology’s inclusion on the list likely gives the field a place in DeepVerse’s policy work. “India has the founders and, increasingly, the capital for world-class deeptech. Policy has to catch up. When companies take a decade to build, founders and investors need rules they can plan around, and a say in making them. DeepVerse institutionalises that voice,” said Shweta Rajpal Kohli, SPF’s president and CEO. Deep technology generally refers to businesses built on substantial scientif
The Quantum Insider·2026-10-06·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief PQShield has appointed Hal Conklin as Chief Commercial Officer and Gemma Ungoed-Thomas as Sovereign Advisor as the company expands its post-quantum security business. Conklin will lead PQShield ’s global commercial strategy, with a focus on US operations, partnerships and adoption of post-quantum cryptography. Ungoed-Thomas will advise on government, critical infrastructure and national resilience issues, drawing on her experience in UK cyber policy and national security. PRESS RELEASE — PQShield , a global leader in post-quantum cryptography (PQC), is strengthening its leadership team with two major hires, as demand for quantum-safe security accelerates across governments, critical infrastructure and major technology providers. Hal Conklin, joins as Chief Commercial Officer bringing more than 30 years of experience turning emerging technologies into scalable businesses. He has led go-to-market for five technology companies later acquired by Arm, Synopsys, Autodesk, Ansys and Cellebrite, with experience spanning early market traction, strategic partnerships and scaling revenue organisations. Hal will lead PQShield ’s global commercial strategy across sales, partnerships and go-to-market execution, with a particular focus on growing the company’s US operations and customer base while accelerating adoption of post-quantum cryptography (PQC) globally. At the same time, Gemma Ungoed-Thomas joins as Sovereign Advisor, bringing deep experience at the intersection of emerging technology, national resilience and government. As former Director for State Threats, Cyber and Technology in the UK Cabinet Office, Gemma advised the Prime Minister and Cabinet on cyber security, AI and emerging technology, led delivery of the UK’s £2bn National Cyber Strategy, and previously led national cyber incident response at the National Cyber Security Centre. Her appointment strengthens PQShield ’s ability to support governments and critical infrastructur
The Quantum Insider·2026-10-06·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Jani Kivioja will become Vice President of VTT’s Quantum Technologies research area on November 1, 2026, bringing experience in quantum research and corporate technology leadership. Kivioja will focus on connecting quantum technology research with R&D, piloting, innovation and commercial applications at VTT. VTT’s quantum technology work spans quantum computing, sensing, communications and manufacturing, with Kivioja highlighting Finland’s expertise in low-temperature technology, microelectronics and quantum research. PRESS RELEASE — “Finland already has strong scientific expertise in quantum technologies. What is still needed is determined R&D, piloting and innovation to accelerate commercialisation,” says Jani Kivioja, who has been appointed Vice President of VTT’s Quantum Technologies research area from 1 November 2026. Kivioja brings experience in both quantum technology research and corporate research and technology leadership. Jani Kivioja, DSc (Tech), is an experienced research and technology leader specialising in quantum and nanotechnology. He began his career at VTT as a researcher in micro- and nanoelectronics after completing his doctorate on superconducting quantum circuits at the Low Temperature Laboratory of Helsinki University of Technology (now part of Aalto University). He later held leadership positions at Nokia and Picosun, part of Applied Materials. In his new role, he will draw on this experience to bridge the gap between research and technology-driven business. “Alongside commercialisation, quantum technologies require strong, long-term research because the field is highly research-intensive. VTT will continue to create science-based innovations and turn them into commercial breakthroughs. As Vice President of the research area, Jani Kivioja will drive this work forward with our researchers, partners and customers,” says Erja Turunen , Executive Vice President of VTT’s Digital Systems business area. Quantum Computer
Phys.org Quantum Physics·2026-10-06
No generated summary available for this entry.
overview
Original abstract
A research team led by the University of Osaka has directly observed, for the first time, an unusual heavy-fermion state forming at the boundary between a one-atom-thick material and a metal. Such states are closely linked to exotic quantum phenomena, including unconventional superconductivity, and the finding opens new possibilities for designing quantum materials through their interfaces.
Quantum Computing Report·2026-10-06·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Pasqal has launched the operational phase of Q-PLANET, a €50 million initiative to develop a European supply chain for neutral-atom quantum computing chips. Leading a 28-partner consortium, Pasqal aims to industrialize chip-scale components, including integrated laser sources and atom chips, over three years. This project will standardize manufacturing processes to accelerate the deployment of quantum technologies in Europe. The post Pasqal Transitions €50 Million Q-PLANET Pilot Line into Execution Phase for European Neutral-Atom Chips appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-06·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Four South Korean quantum startups, as part of the KIST Global Bridge Program, expanded their U.S. commercial strategy across Wisconsin and Illinois after Quantum World Congress 2026. The delegation engaged with various organizations to foster cross-border technology partnerships and market entry. This initiative is part of South Korea’s Deeptech Incubator Project for Startups (DIPS). The post KIST Connects South Korean Quantum Startups to Midwest Ecosystem Across Wisconsin and Chicago appeared first on Quantum Computing Report .
Phys.org Quantum Physics·2026-10-06
No generated summary available for this entry.
overview
Original abstract
Black holes, despite their extreme nature, are described by surprisingly few basic parameters: their mass, charge and spin. Two black holes may have formed for completely different reasons and passed through very different histories, yet still end up in the same final state. John Wheeler summarized this idea with the famous phrase "black holes have no hair."
Quantum Computing Report·2026-10-06·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
QuantumGate and NEC GCC are partnering to implement sovereign post-quantum cybersecurity solutions across critical infrastructure and telecommunications in the UAE. The collaboration will deploy QuantumGate's cryptographic software, including QSphere, with NEC GCC leading systems integration. This initiative supports national quantum security directives to protect government, energy, transport, and telecommunications sectors. The post QuantumGate and NEC GCC Partner to Deploy Sovereign Post-Quantum Cybersecurity Across UAE Critical Infrastructure appeared first on Quantum Computing Report .
No generated summary available for this entry.
overview
Original abstract
Insider Brief Researchers found that chaotic quantum systems retain a persistent imprint of their initial state, a “quantum birthmark” that broadens the concept of quantum scarring. In a stadium-shaped model, the quantum system remained at least twice as likely, on long-term average, to return to its initial condition as to occupy another comparable state. The findings could improve understanding of quantum equilibrium and the emergence of classical behavior, with potential implications for quantum simulators and nanoscale electronics. Image: A quantum “wave packet” (in the middle) launched from the same kind of starting point behaves differently. Even after bouncing around for a very long time, faint filament-like patterns (bright glow) are still visible, a tattoo tracing back to its early history. This lingering imprint is the “quantum birthmark” described in the study. (Joonas Keski-Rahkonen, Tampere University ) PRESS RELEASE — Even the most chaotic quantum systems keep a permanent mark of their own past – a “quantum birthmark” – that never fades. Researchers from Tampere University , Harvard University , and TU Dresden discovered the feature in their recent study. Their findings shed new light on the elusive relationship between classical and quantum mechanics. Looking ahead, these quantum birthmarks, along with related phenomenon known as “scars,” could eventually be harnessed to power next-generation nanoelectronics. Stir a drop of milk into a cup of tea and it is gone for good. The swirl blurs, spreads and evens out, and no amount of staring at the cup will tell you where the drop first landed. Physicists refer to this kind of unpredictable, memory-erasing behavior simply as chaos , and it underpins much of how we explain the everyday world: heat spreading through a room, smoke filling the air, a pinball rattling away from wherever it was launched. A new study shows that the quantum realm – the worl
Quantum Computing Report·2026-10-06·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Infleqtion, in partnership with Honeywell Aerospace and UC Santa Barbara, has developed a chip-scale silicon nitride optical cavity. This prototype aims to miniaturize lasers and optical stabilization systems for quantum hardware. This innovation enables volume manufacturing and paves the way for field-deployable quantum systems like atomic timing devices and compact quantum computers. The post Infleqtion, Honeywell Aerospace, and UC Santa Barbara Develop Chip-Scale Silicon Nitride Optical Cavity for Handheld Quantum Hardware appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-06·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
SEALSQ has invested $10 million in WISeSat.Space through a PIPE financing, acquiring shares at $10.79 each. This investment, completed on October 1, 2026, aims to accelerate the deployment of WISeSat.Space’s LEO satellite constellation and integrate SEALSQ’s post-quantum cybersecurity infrastructure. Both companies operate as subsidiaries of WISeQey Corp, with the collaboration focusing on securing satellite-to-terrestrial IoT data links against future quantum computing threats. The post SEALSQ Leads $10 Million PIPE Investment in WISeSat to Accelerate Post-Quantum Space Cybersecurity Infrastructure appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-06·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
The HybriQCS project, led by Dr. Kai Voges at Leibniz University Hannover, has secured €5.8 million to develop hybrid quantum computing architectures. This 5-year project, running until February 2031, aims to combine ultracold polar molecules for quantum memory with Rydberg atoms for fast multi-qubit gate operations. The primary goal is to execute the first two-qubit quantum logic gate operations using this hybrid system. The post Leibniz University Hannover Launches €5.8 Million ($6.53 Million USD) HybriQCS Project to Develop Hybrid Molecule-Rydberg Quantum Systems appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-06·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
RapidFort and SpaceWERX have partnered to secure U.S. Space Force systems against AI vulnerabilities and post-quantum cryptographic risks through a Cooperative Research and Development Agreement (CRADA). This collaboration will focus on mitigating AI software risks, accelerating Authority to Operate (ATO) approvals, and preparing for post-quantum cryptographic transitions. The partnership aims to deploy hardened, quantum-resilient software across mission-critical Space Force infrastructure. The post RapidFort and SpaceWERX Enter CRADA to Secure U.S. Space Force Systems Against AI Vulnerabilities and Post-Quantum Cryptographic Risks appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-06·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief QuantWare has appointed Bart Filius as Chief Financial Officer and a member of its Board of Directors, effective October 12, 2026. Filius brings more than two decades of financial and executive experience, including leadership roles at Galapagos and Sanofi. The appointment comes as QuantWare expands production of its VIO quantum processors following a $178 million Series B and the development of its KiloFab facility in the Netherlands. PRESS RELEASE — QuantWare , the industrial quantum processor company, today announced that Bart Filius will join the company as Chief Financial Officer (CFO), effective 12 October 2026. Filius will also join the Board of Directors of QuantWare, as the company scales the industrial production of VIO quantum processors and expands its commercial footprint worldwide. The appointment comes during a period of rapid growth for QuantWare . The company has closed a $178M (€152M) Series B in May 2026, is building KiloFab, its industrial-scale fabrication facility in the Netherlands, and has grown its commercial footprint to 50+ customers across 20 countries. Filius brings more than two decades of financial and executive leadership in high-growth, science-driven companies. During nearly nine years at Galapagos, he served as CFO, COO and President. There he managed the company’s substantial growth and financing, including its IPO on Nasdaq and subsequent follow-on financings, and led the negotiation of its $5bn R&D collaboration with Gilead. Before Galapagos, he spent 13 years at Sanofi, where he was CFO of Sanofi Europe and Vice President of Mergers & Acquisitions. He currently chairs the audit committee of ProQR Therapeutics (Nasdaq: PRQR). His experience in building a deeply technical company into a global, commercial-stage business closely parallels the path ahead for QuantWare . That path involves long-horizon R&D, significant capital requirements, and strategic partnerships with some of the world’
Quantum Computing Report·2026-10-06·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Xanadu and GlobalFoundries have partnered to mass-produce photonic quantum computing components. This collaboration will transition Xanadu's designs for ultra-low loss Silicon Nitride optical circuits and Superconducting Nanowire Single-Photon Detectors (SNSPDs) to GlobalFoundries' 300 mm commercial semiconductor fabrication facility. This aims to scale up the manufacturing of these components for fault-tolerant quantum computers and future quantum data centers. The post Xanadu Partners with GlobalFoundries to Scale Photonic Quantum Component Manufacturing on 300 mm Semiconductor Lines appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-06·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief QuantumGate and NEC GCC have entered a strategic collaboration focused on post-quantum security , sovereign cybersecurity and cyber resilience for critical infrastructure and telecommunications in the UAE. The companies will work across cryptographic asset inventory, post-quantum readiness planning, phased migration programs and sovereign cyber resilience deployments. NEC GCC will support deployment and integration while QuantumGate provides post-quantum and cybersecurity technologies for identity, networks and endpoints. QuantumGate , a quantum-safe cybersecurity firm based in Abu Dhabi and a subsidiary of VentureOne, has entered a strategic collaboration with NEC Corporation’s GCC branch, the companies announced. The partnership is focused on accelerating the rollout of post-quantum security, sovereign cybersecurity, and cyber resilience solutions for organizations operating in critical infrastructure and telecommunications across the United Arab Emirates. The joint effort targets two categories of risk, according to the announcement . One is the long-term threat posed by quantum computing, data encrypted today with long confidentiality requirements could become vulnerable once cryptographically relevant quantum computers arrive. The other is the current threat landscape, where state-sponsored actors, AI-driven malware, and organized hacktivist campaigns are actively targeting government, energy, telecommunications, transport, and other critical sectors. VentureOne operates as the venture builder of the Advanced Technology Research Council (ATRC), Mid-East.info reported . Four Priority Areas The collaboration between QuantumGate and NEC GCC covers four areas of focus, as outlined in the announcement: Cryptographic asset visibility and inventory : The two companies will work on identifying, mapping, and evaluating cryptographic assets across networks, applications, devices, and data to determine an organization’s quantum-risk exposure base
Quantum
·2026-10-06
·Gian Luca Spitzer, Ion Nechita
·doi
No generated summary available for this entry.
overview
Original abstract
Quantum graphs have been introduced by Duan, Severini, and Winter to describe the zero-error behaviour of quantum channels. Since then, quantum graph theory has become a field of study in its own right. A substantial source of difficulty in working with quantum graphs compared to classical graphs stems from the fact that they are no longer discrete objects. This makes it generally difficult to construct insightful, non-trivial examples. We present a collection of non-trivial quantum graphs that can be thought of in discrete terms, and that can be expressed in the diagrammatic formalism introduced by Musto, Reutter, and Verdon. The examples arise as the quantum graphs acted on by increasingly smaller classical matrix groups, and are parametrised by triples of matrices ( A , B , C ) . The parametrisation reveals a clean decomposition of quantum graph structure into classical and genuinely quantum components: A and C are described by a classical weighted graph called the strange graph, while B provides a purely quantum contribution with no classical analogue. Based on this model, we give exact formulas or establish bounds for quantum graph parameters, such as the number of connected components, the chromatic number, the independence number, and the clique number. Our results provide the first large, parametric families of quantum graphs for which standard graph parameters can be computed analytically.
Quantum
·2026-10-06
·Scott Aaronson, Phillip Harris, Freek Witteveen
·doi
No generated summary available for this entry.
overview
Original abstract
We study the limitations of black-box amplification in the quantum complexity class Q M A . Amplification is known to boost any inverse-polynomial gap between completeness and soundness to exponentially small error, and a recent result (Jeffery and Witteveen, 2025) shows that completeness can in fact be amplified to be doubly exponentially close to 1. We prove that this is optimal for black-box procedures: we provide a quantum oracle relative to which no Q M A verification procedure using polynomial resources can achieve completeness closer to 1 than doubly exponential, or a soundness which is super-exponentially small. This is proven by making the oracle separation from (Aaronson, 2009) between Q M A and Q M A 1 quantitative, using techniques from complex approximation theory.
PRX Quantum
·2026-10-06
·Anonymous
·doi
No generated summary available for this entry.
overview
PRX Quantum
·2026-10-06
·Anonymous
·doi
No generated summary available for this entry.
overview
Quantum Science and Technology
·2026-10-06
·SOKEA SANG et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract Separator-based divide-and-conquer QAOA can address graphs wider than the qubit capacity of one circuit, meaning the number of physical qubits usable by that circuit, but the Large Graph Partitioner (LGP) in DC-QAOA aborts when no small vertex separator exists. We introduce Frozen Large Graph Partitioning (FrozenLGP), a three-phase extension of this specific pipeline. It first runs standard LGP (Phase 1); after failure, it freezes a minimum node cut of each selected residual graph, conditional on the first budget-feasible separator (Phase 2); and it uses a deterministic width-feasible split as Coverage-Preserving Partitioning (CPP) for a final fallback (Phase 3). For a fixed frozen spin assignment, removed Ising couplings are folded exactly into local fields; assignment selection, QAOA, truncated reconstruction, and fallback ranking remain approximate. On the pooled high-connectivity partition benchmarks (n ≤ 1000), the scalable driver achieves 89.8% separator-based coverage without the CPP fallback at freeze budget B_f = 3, compared with 4.6% for standard LGP alone. In the 100-instance end-to-end benchmark, FrozenLGP's Phase 2 increases coverage without CPP from 76 to 91 instances in the selected best-restart outcomes. The deterministic CPP fallback handles the remaining nine. CPP-inclusive coverage is 100%, including all tested partitioning instances up to 10^4 vertices. This is a termination guarantee, not a measure of freezing-based recovery. When Phase 1 succeeds, both methods follow identical seeded circuit paths and attain identical approximation ratios. Compared with QAOA-in-QAOA, FrozenLGP achieves higher mean approximation ratios at each measured size, at the cost of more invoked subcircuit solves and greater aggregate quantum work. Under two simulated noise channels, the coverage extension persists while the reported output distributions of every method degrade under the stronger channel. In simulation, these results support FrozenLGP as a topology-robust front end for separator-based divide-and-conquer QAOA.
Quantum Science and Technology
·2026-10-06
·Yusuf Turek, Ming-Yan Sun, Xiao-Xi Yao
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract We introduce a programmable optical parametric amplifier (OPA) synthesizer that, under a heralded photon-number-resolving framework, generates high-fidelity cubic phase states and amplifies Schrödinger cat states. By systematically exploring both the catalytic configuration, where the idler input and output contain the same number of photons (m = n ), and non-catalytic configurations ( m = n), we discover two qualitatively different functionalities. First, with a coherent-state signal input, our protocol generates cubic phase states with fidelity exceeding 0.99 across a broad range of (m, n) configurations. Second, using a Schrödinger cat state as the signal input, the same framework amplifies the cat state: an input cat with amplitude αin ≤ 1 is transformed into an output squeezed cat with αout ≥ 2 while maintaining fidelity above 0.99. The catalytic configuration preserves the input parity and restores the idler state, whereas non-catalytic configurations enable parity-flipping amplification with higher success rates. Moreover, the amplified output can serve as a seed for subsequent amplification rounds, offering a self-seeding pathway to progressively larger cat states. Our protocol requires only moderate-gain OPA operation and low-order photon-number-resolving detection, providing a flexible and experimentally accessible platform for cubic phase state preparation and amplified squeezed cat state generation.
npj Quantum Information
·2026-10-06
·Hao Wu et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract Non-orthogonal quantum states cannot be distinguished with complete certainty, making their underlying physical parameters difficult to resolve. In frequency spectroscopy of two closely spaced electromagnetic fields, this challenge has traditionally been associated with the Fourier-transform-limited linewidth, implying that the measurement time required to resolve a frequency difference Δ ω diverges as Δ ω → 0. Here, we show that this linewidth does not fundamentally limit the resolution of two closely spaced frequencies when each signal has sufficient amplitude for efficient detection. We propose and experimentally demonstrate a broadband quantum harmonic oscillator protocol for super-resolution spectroscopy in the radio-frequency and microwave domains. A Quantum Fluctuation Suppression (QFS) sequence encodes Δ ω into the oscillator state while suppressing parameter-independent shot noise. We resolve two randomly chosen electric fields near 100 MHz separated by 5 Hz, measuring 5.0(1.6) Hz with a 1ms probe time, 200 × beyond the conventional spectral-resolution limit. The method reduces acquisition time by more than five orders of magnitude and, through the motional Raman framework, is applicable across a broad frequency range.
arXiv·2026-10-06·Quentin Stein et al.
No generated summary available for this entry.
overview
Original abstract
Collective molecular excitations govern energy transport in light-harvesting and optoelectronic materials. Theory predicts that excitonic band topology can generate edge-confined states, offering a route to direct energy flow in molecular systems, yet experimental evidence is lacking. Here we use scanning tunnelling microscopy-induced luminescence to image Frenkel excitons in two-dimensional zinc phthalocyanine molecular crystals with nanometer resolution. By varying cluster size, we observe the transition from discrete quantum-confined excitations to collective excitonic bands and directly resolve their real-space wavefunctions. We identify an excitonic state localized at the crystal perimeter and show, through comparison with microscopic theory, that it originates from the momentum-resolved non-trivial topology of the bulk excitonic bands. Our results establish molecular crystals as a platform for engineering topological excitonic states and provide a strategy for controlling energy transport through excitonic band engineering.
arXiv·2026-10-06·Bibhas Adhikari, Ramya Srinivasan
No generated summary available for this entry.
overview
Original abstract
We present a hybrid quantum-classical framework that detects affinity and romance-investment fraud by modelling the cognitive biases in a manipulative conversation. In our proposed framework, cognitive biases central to this fraud class are carried by dedicated qubits in a structured parameterized quantum circuit, together with a frame qubit makes the encoding sensitive to the temporal order of manipulative reframing, and a narrative qubit that aggregates co-occurrence through a trainable entanglement layer. The circuit parameters are trained jointly with a classical reinforcement-learning agent that decides, turn by turn, whether to flag the conversation, modeled as an optimal stopping problem. We evaluate the model's performance on synthetic conversations that include hard negatives, legitimate but urgent, and legitimate but pushy sales conversations.
arXiv·2026-10-06·Yueying Wu
No generated summary available for this entry.
overview
Original abstract
Can two cavities have equal mean photon numbers whenever at least one of two binary controls is off, and unequal means only when both controls are on? We give an elementary construction using a two-pump beam-splitter interaction whose strength is proportional to the product of the controls. A phase-coherent single-excitation state yields mean occupations $(1/2,1/2)$ for inputs $00$, $01$, and $10$, and $(1,0)$ for input $11$. This realizes the desired AND condition exactly at the level of population means. It also makes the communication resource explicit: the interaction acts after the inputs are supplied and changes local statistics with the remote input. For any no-signalling distribution with finite means, the corresponding exact-mean score is at most $3/4$ under uniform inputs. We give a robust consistency inequality, a finite-sample counting protocol, and a coherent-state realization showing that this mean response does not require entanglement. The construction provides a concrete example for distinguishing controlled interactions from nonlocal-game resources.
arXiv·2026-10-06·Aleksandre Merabishvili, Ebubechukwu O. Ilo-Okeke
No generated summary available for this entry.
overview
Original abstract
In a thermally occupied multimode trapped ensemble, mode-dependent detunings can strongly suppress Ramsey contrast even when the underlying dynamics remains coherent. We develop a weak-axis-resolved Hamiltonian theory in which collective mode spins experience longitudinal detunings and overlap-dependent exchange interactions. Without exchange, the distribution of detunings across thermally occupied modes produces coherent phase mixing and an algebraically decaying Ramsey-contrast envelope in the many-mode continuum regime. At the mean-field level, exchange generates a self-consistent restoring field that reduces phase dispersion and restores collective contrast. The crossover is governed by the competition between the collective exchange scale and the thermally induced detuning spread: when the late-time contrast is expressed in terms of their ratio, results at different temperatures collapse onto a common trend, and the crossover coupling follows the predicted inverse-square thermal scaling, with a numerical exponent of 2.06. Weak irreversible pure dephasing limits, but does not eliminate, this recovery, demonstrating that exchange refocuses coherent inhomogeneous phase mixing but cannot reverse irreversible phase noise.
arXiv·2026-10-06·Gerónimo J. Caselli et al.
No generated summary available for this entry.
overview
Original abstract
Geometric heat pumping is the transfer of energy between reservoirs at equal temperature where the heat exchanged in an adiabatic cycle depends only on the driving contour in parameter space. We implement this mechanism on a superconducting quantum processor using a collision model, where a driven qubit interacts repeatedly with two ancilla qubits that are prepared in thermal states and emulate the reservoirs. Energy measurements before and after each interaction provide a calorimetric record of the heat exchanged with each reservoir. By reversing the driving contour, we extract a heat contribution associated with pumping. Its dependence on the period and on the contour follows exact simulations of the collision model, without adjustable parameters, and approaches in the slow-driving regime the geometric limit of the corresponding Lindblad dynamics.
arXiv·2026-10-06·Joseph M. Ryan, Katherine Jonas, Christopher Monroe
No generated summary available for this entry.
overview
Original abstract
The motion of a particle in a finite-depth confining potential, such as that of an electromagnetically trapped atom or ion, is approximately harmonic at low energy and softens as the escape energy is approached. When the particle is driven by a stochastic force, the heating and escape times depend sensitively on the noise power spectrum. We study escape times of particles in softening potentials driven by power-law colored noise. We identify two nested conditions for weak noise: the particle must execute many oscillations before escape, and noise forces must be small relative to forces exerted by the trap so as not to tilt the potential appreciably. In this regime, we derive expressions for the mean escape time using stochastic averaging techniques and compare them with Monte Carlo simulations of the full equations of motion. We also examine the crossover to regimes where these conditions are not met and large quasi-static forces give rise to additional escape mechanisms. Applying these results to an experimental measurement of lifetimes in a microfabricated ion trap, we find that spectral color alone cannot account for the rapid escape rates observed, whereas quasi-static barrier tilting by a stray field of plausible magnitude could. These results are relevant to the heating and escape of trapped atoms due to noisy force fields, as well as to other nonlinear oscillators subject to colored noise.
arXiv·2026-10-06·Animesh Shaw
No generated summary available for this entry.
overview
Original abstract
Organisations deciding which assets to migrate to post-quantum cryptography first, and how that work competes with a backlog of classical findings, lack a common unit: post-quantum scores are dimensionless and quantum-only, while classical risk is annualised loss. We express both threats as a cost of delay in currency per year on the same asset. The quantum term is the rate at which deferring migration commits irreversible harvest-now-decrypt-later loss, computed from required confidentiality duration, recordable traffic share and data turnover, using a quantum-arrival law fitted in closed form to published expert anchors. A competing-risks factor couples the two terms so the same loss is not counted twice. We prove that the construction is not a weighted sum of a classical and a quantum score, give a dominance threshold on the classical hazard that is independent of asset value, and show that the induced order is optimal for sequencing work under constant loss rates. We verify the implementation by simulation, adaptive quadrature and a second implementation. On four public systems with parameters assumed from public documentation, the quantum term reorders the asset list beyond input uncertainty for one system only (signal-to-noise 1.36 against 0.14-0.46), moves specific long-lived, quiet, recordable assets decisively, and otherwise changes magnitudes. Asset value and turnover explain 73-91% of the uncertainty in the quantum term; the arrival date explains 3-17%. The case studies are illustrative and are not validated against outcomes.
arXiv·2026-10-06·Nada Ali, Mark Hillery
No generated summary available for this entry.
overview
Original abstract
Alice and Bob each have a qubit, and they would like to perform a two-qubit gate on them with the assistance of Charlie. The action of this gate depends on a parameter, which either Charlie knows, will receive later as classical information, or is encoded in a program state. We discuss both the case in which Alice and Bob send Charlie their qubits, which he entangles with his state, and the case where Alice and Bob use teleportation to entangle their states with Charlie's state. All of these procedures depend on the ability of Alice and Bob to apply local correction operations that depend on the results of measurements that Charlie makes, and we discuss under what conditions such operations are possible.
arXiv·2026-10-06·Jonas R F Lima, Guido Burkard
No generated summary available for this entry.
overview
Original abstract
Valley excitations are considered one of the biggest challenges for a coherent spin shuttling in Si/SiGe heterostructures. In this work we theoretically investigate the valley dynamics during spin shuttling in a Si/SiGe heterostructure by considering a two-level system given by the two low-lying valley states of the mobile quantum dot. We assume that the electron is initially in the valley ground state and analyze the evolution of this state during shuttling. We find that, depending on the shuttling velocity, the system can be in three distinct regimes. In one of these regimes, the quantum information is preserved even in the presence of the valley excitations, allowing for coherent spin shuttling independently of the shuttling distance. This regime is obtained for a shuttling velocity of tens of m/s, a desired regime where dephasing mechanisms, such as spin-valley hotspots and spatially varying spin splitting, can be suppressed. This result is in accordance with recent experimental work that obtained a high spin shuttling fidelity after a fast and long shuttling. We also propose strategies based on the Partial Landau-Zener model to enhance the valley shuttling fidelity, which was found to be much more efficient than previously proposed strategies based on the standard Landau-Zener model.
arXiv·2026-10-06·Chien-Chang Chen, Hsi-Sheng Goan
No generated summary available for this entry.
overview
Original abstract
We investigate the effects of initial states on the dynamics of a quantum spin-boson model using an efficient variational polaron master equation approach. The transformation of a factorized system-environment initial state into the variational polaron frame introduces inhomogeneous terms in the master equation, essential for accurately describing non-Markovian dynamics beyond the weak coupling regime. To efficiently account for these effects, we formulate the dynamics in an extended auxiliary Liouville space, converting the resulting integro-differential equations into coupled ordinary differential equations. We further introduce a simplified variational polaron technique for computing the time evolution of expectation values of general observables, including those that do not commute with the polaron transformation, overcoming a major limitation of previous approaches and enabling the unified treatment of coherence and population dynamics. The effects of transformed initial states generated from arbitrary factorized initial states are systematically characterized through expectation values and trace-distance analysis, providing insight into the associated bath-relaxation dynamics over a broad range of tunneling amplitudes, temperatures, and coupling strengths. Comparison with the weak-coupling master equation reveals a delay phenomenon associated with multi-bath-quanta processes, pronounced at intermediate coupling strengths and tunneling amplitudes. We further show that coherent superposition initial states induce stronger nonequilibrium effects than localized states, with inhomogeneous terms playing a crucial role in the short-time dynamics. The proposed formalism applies to both undriven and resonantly driven spin-boson models, providing a computationally efficient framework for open quantum-system dynamics with arbitrary factorized initial states and general physical observables.
arXiv·2026-10-06·Vishal Singh, Zixin Huang, Mark M. Wilde
No generated summary available for this entry.
overview
Original abstract
In quantum reading, classical messages are encoded in sequences of quantum channels and recovered by probing the channels and processing their outputs. We study the reading capacity of a finite family of finite-dimensional channels under an average constraint on the probing energy, allowing arbitrary adaptive operations between channel uses. Using an input-dependent chain rule for the Belavkin-Staszewski relative entropy, we derive a converse bound expressed as an optimization involving channel Choi operators and the operator relative entropy. This formulation admits semidefinite approximations and reduces, without an energy constraint, to a channel information radius. To obtain achievable rates, we construct bilinear semidefinite lower approximations to a standard non-adaptive reading bound. Alternating optimization produces feasible probe states and encoding distributions, whose Holevo information gives a directly evaluable achievable rate. For jointly classical-quantum channels, we derive a separate converse based on the Umegaki relative entropy. Without an energy constraint, this converse matches a non-adaptive achievable rate, recovering a recent result of Pascual Abraldes and Winter: non-adaptive protocols suffice to achieve the unconstrained reading capacity of jointly classical-quantum channels.
arXiv·2026-10-06·Mikhail Mamaev et al.
No generated summary available for this entry.
overview
Original abstract
While a Fabry-Perot (FP) cavity interferometer is a standard tool in modern optics, analogous physics can also be observed with matter waves such as Bose-Einstein condensates (BECs). Interatomic collisions in BECs can induce nonlinear features such as multi-valued transmission spectra for interferometry experiments. Observation of interaction effects in the matter-wave analogue of FP interferometry has not yet been experimentally achieved, mostly due to broadening of transmission peaks by interaction-induced shifts of cavity resonances. In this work, we theoretically show that this limitation can be overcome by engineering a momentum chirp in a BEC wavepacket. By balancing this chirp against the dynamical mean-field energy shift of the cavity during transmission, we predict enhanced resonant spectra and bistability features due to interaction-assisted tunneling that would be otherwise inaccessible. We show that this physics is readily observable with quasi-one-dimensional BECs of cold atoms colliding with a pair of light-induced Gaussian potential barriers forming the cavity. We also benchmark the requisite optimum chirp needed and characterize the contrast of near-discontinuous FP transmission spectra at an interacting resonance. Our findings enable the realization of technologies like matter-wave switching protocols, and high-precision velocity measurements; estimates of achievable sensitivity for the latter are provided.
arXiv·2026-10-06·Shuan Wang, Kevin Singh
No generated summary available for this entry.
overview
Original abstract
Recently, neutral atom arrays have become known for their promising potential in quantum information processing. High-fidelity entangling operations are typically achieved by exciting atoms to high-lying Rydberg states through two-photon processes. To improve the performance of these systems at the hardware level, dual-species strategies have been applied to enhance readout, error correction, and reloading in neutral atom systems. However, the influence of laser crosstalk arising from two-photon excitation for dual-species systems has remained largely unexplored in the literature. Here, we develop a model that incorporates the influence of crosstalk in inter-species Rydberg gates with two-photon driving. We demonstrate that the influence of this crosstalk can be suppressed to arbitrarily small levels through appropriate gate design, with gate fidelities greater than $99.8\%$ achievable with conservative experimental parameters in the near-detuned case of an $^{85}$Rb/$^{87}$Rb system. We also outline how this fidelity can be further enhanced through improvements to the Rydberg excitation.
arXiv·2026-10-06·Dina Sokolova et al.
No generated summary available for this entry.
overview
Original abstract
Semiconductor-superconductor hybrid systems form the basis for a broad range of quantum phenomena, such as Andreev bound states, topological superconductivity, and hybrid quantum Hall states. The performance of these hybrid systems can strongly benefit from the exceptional electronic properties of heterostructures with deeply buried quantum wells. However, establishing high-quality superconducting contacts to such quantum wells remains challenging. Here, we address this problem with an edge-contact approach that combines anisotropic dry etching to access the quantum well followed by wet etching for interface preparation. Josephson junctions fabricated using this approach consistently exhibit near-unity interface transparency, while quantum point contacts show strong Andreev enhancement, with the first conductance plateau approaching $4e^2/h$, the limit of perfect Andreev reflection. In superconducting quantum point contacts, the high contact quality is further manifested by quantized supercurrent. These results establish the combination of dry and wet etching as a robust strategy for integrating deeply buried quantum wells into superconducting hybrid devices.
arXiv·2026-10-06·Junyi Cao, Eduardo Fradkin
No generated summary available for this entry.
overview
Original abstract
We study zero modes bound to charge-conjugation defects in fractional quantum Hall-superconductor (FQH-SC) heterostructures built from Abelian and non-Abelian FQH states. Although the associated defects are well described by $G$-crossed braided tensor categories, a local operator description of their zero modes is not generally known. We generalize the bulk-to-boundary construction of localized zero mode operators to FQH-SCs with non-Abelian parent topological orders, mapping bulk Wilson operators in the folded theory to localized zero mode operators in the one-dimensional FQH-SC theory. This construction distinguishes zero mode anyons from the local zero mode operators that act on the defect Hilbert space and yields a generalized zero mode algebra. It also determines the fusion-channel dependence of tunneling: tunneling of zero mode operators probes bulk monodromy, while direct zero mode anyon transfer probes $G$-crossed associativity data. Applying this framework, we recover the $\mathbb{Z}_{2m}$ parafermion zero mode structure of fermionic Laughlin FQH-SCs at filling $ν=1/m$, obtain a $\mathbb{Z}_2^{(n)}\times\mathbb{Z}_N$ structure for generalized Moore-Read states at filling $ν=1/m$, with $N=2m$ for fermionic states and $N=m$ for bosonic states, and find a $\mathrm{Fib}\times\mathbb{Z}_N$ structure for the $k=3$ Read-Rezayi state at filling $ν=3/(3M+2)$, with $N=2(3M+2)$ for fermionic states and $N=(3M+2)/2$ for bosonic states. In the Read-Rezayi case, zero mode operator tunneling and direct zero mode anyon transfer yield distinct universal amplitude ratios between the neutral fusion channels, providing a characteristic signature of the underlying Fibonacci defect structure.
arXiv·2026-10-06·Simon Grosse-Holz
No generated summary available for this entry.
overview
Original abstract
I propose a simple visualization for pure two-qubit states, constructed from three components: two Bloch balls for the marginal qubits (the mixed states obtained by ignoring the other qubit, respectively) and an entanglement component consisting of a rotoreflection and a contraction. I prove that this picture accurately captures the local and global structure of the relevant state space without gaps or degeneracies: the underlying parametrization is a global diffeomorphism onto the state space. Finally, I use this picture to visualize conditional states, the entanglement degree(s) of freedom, and single qubit rotations.
arXiv·2026-10-06·Roi Vence-Nogueira
No generated summary available for this entry.
overview
Original abstract
Quantum numerical algorithms often encode a positive solution $q$ in the amplitudes of a quantum state, while the required scientific output is a normalized linear functional of $q$. Basis measurements produce probabilities determined by squared solution values, while the functional uses the solution values themselves. We study the complexity of this output-interface problem for $F_φ(q)=\intφq\,\mathrm dν/\int q\,\mathrm dν$ and identify a target-dependent susceptibility $χ_φ$ that governs the amount of copies of the solution state needed. For a fixed positive reference state and a neighborhood around it, the optimal number of unknown-state copies is $Θ\!\left(χ_0\varepsilon^{-2}\log(1/β)\right)$, where $\varepsilon$ is the absolute error tolerance and $β$ is the allowed failure probability. We show that two fixed single-copy measurements attain the same rate. We then analyze how this baseline changes when the interface retains classical information, uses adaptive allocation, supplies coherent access, or restricts the allowed solution family. Therefore $χ_φ$ quantifies a central cost of using a solution encoded in an $L^2$-normalized quantum state to estimate an $L^1$-normalized linear observable.
arXiv·2026-10-06·Stefano Pirandola
No generated summary available for this entry.
overview
Original abstract
A gap between achievable rates and converse bounds persists for energy-constrained bosonic communication in the presence of excess noise. We derive a unified adaptive weak-converse bound for thermal attenuation, noisy amplification, and additive Gaussian noise under an unconditional mean transmitted-photon-number constraint. The bound applies to arbitrary adaptive protocols with quantum memories and constrains the two-way quantum, entanglement-distribution, private, and secret-key capacities. It vanishes throughout the entanglement-breaking region and approaches the corresponding PLOB bound at infinite energy. At finite energy, it improves the evaluated Gaussian squashed-entanglement and PLOB bounds in relevant parameter regimes, while comparison with hashing rates quantifies the remaining gap to achievability. The result provides a common energy-dependent benchmark for noisy bosonic Gaussian channels and extends finite-energy converse methods beyond the quantum-limited setting.
arXiv·2026-10-06·Lucas V. Pupim, Mathias S. Scheurer
No generated summary available for this entry.
overview
Original abstract
In two-dimensional (2D) flat-band systems, as engineered, for instance, by stacking and twisting van der Waals materials, the momentum dependence of the Bloch states is a key factor in determining the interaction-induced emergence of different phases. Hence, methods of probing this form of ''quantum geometry'' are crucial to understanding these systems. Yet, extracting the momentum dependence of the underlying quantum geometric tensor from measurements is challenging in 2D. Here, we propose employing a quantum twisting microscope (QTM) with a sublattice-polarized tip to fill this gap. We show how expectation values of sublattice Pauli matrices can be probed across the scanned momentum path. This allows for the direct measurement of crucial symmetries characterizing the different candidate instabilities in graphene-based moiré systems. We furthermore show that the quantum metric component along the scan direction can also be extracted; the full quantum geometric tensor is also accessible, given that more than one sublattice polarization can be used. Our work illustrates the potential and extends the versatility of the QTM approach. If implemented in future experiments, this would provide unprecedented access to the symmetry signatures of the correlated phases and to the underlying quantum geometry in twisted bilayer graphene and related systems.
arXiv·2026-10-06·Han-Ze Li et al.
No generated summary available for this entry.
overview
Original abstract
The Mpemba effect challenges the intuition that states closer to equilibrium must relax faster. We ask whether an analogous magic-ordering reversal can occur in the generation of quantum magic (nonstabilizerness), a key resource for universal quantum computation: can a state with less initial magic overtake one with more and reach its asymptotic value sooner? Here, we uncover interaction-induced dephasing as a distinct mechanism for this magic Mpemba effect, requiring neither transport nor conventional thermalization. For tilted product states in an interacting $\ell$-bit model, a random-phase analysis predicts a reversal of the magic ordering: states with less initial magic attain higher saturated magic, independent of their spatial pattern. Exact simulations of the $\ell$-bit model and localized spin chains further show that these states also saturate earlier. We observe both features on IBM superconducting quantum processors. An effective $\ell$-bit implementation accesses long dephasing times at fixed circuit depth by encoding time in gate angles, while a microscopic spin model exhibits the reversal universally across initial patterns in the localized regime but only selectively in the ergodic regime. These results establish interaction-induced dephasing as a route to anomalous quantum-resource relaxation beyond transport-driven thermalizing dynamics.
arXiv·2026-10-06·Bristi Ghosh et al.
No generated summary available for this entry.
overview
Original abstract
The photon-drag effect is a nonlinear optical phenomenon in which the finite momentum carried by incident photons is transferred to charge carriers, thereby generating a dc photocurrent even in systems with inversion symmetry. Within the density-matrix formalism in the velocity gauge, and accounting for nonvertical optical transitions driven by finite photon momentum, we derive the nonlinear injection and shift conductivities that characterize the photon-drag photogalvanic response. We investigate these photon-drag responses in unconventional $p_x$-wave and $d_{x^2-y^2}$-wave magnets in the presence of Rashba spin-orbit coupling (RSOC), highlighting the distinct roles of symmetry and quantum geometry in shaping their nonlinear optical behavior. The key finding of our work is that, despite the broken inversion symmetry, the conventional photogalvanic response vanishes identically in the $q=0$ limit after Brillouin-zone integration in both unconventional magnetic phases, resulting in a nonlinear dc photocurrent entirely photon-drag driven. The two unconventional magnets exhibit qualitatively distinct responses governed by their symmetry properties: the $p$-wave magnet supports only linear injection and circular shift conductivities, whereas the $d$-wave altermagnet, which simultaneously breaks time-reversal and inversion symmetries, admits all linear and circular components. Our findings establish altermagnets as a promising platform for controlling symmetry-selective nonlinear photocurrents and may enable applications in polarization-sensitive photodetection, nonlinear optoelectronics, and quantum geometric photogalvanics.
arXiv·2026-10-06·Yujie Zhang
No generated summary available for this entry.
overview
Original abstract
In recent work Phys. Rev. X 16, 031057 (2026), we proposed a self-consistent approach to entanglement certification based on generalized noncontextuality. It requires no prior characterization of the measurement devices and, given access to all local measurements, can certify every entangled state in a Bell circuit. Here, we study the complexity of this protocol in a finite experiment. At fixed local dimension $d$, we show that the optimal number of distinct local effects needed to reach a trace-distance \textit{entanglement resolution} $γ$ is $Θ_d(γ^{-(d-1)})$. This scaling is necessary even when the measurements are tailored to the target state. Independent Haar-random projective measurements instead require $Θ_d(γ^{-(d-1)}\log(1/γ))$ effects. Finally, we show that, once the exact operational identities are known, $Θ_d(γ^{-2}\log(1/δ))$ copies of the target state are necessary and sufficient for certification with error probability at most $δ$. Determining the optimal sample complexity when those identities must instead be inferred from the same finite target-state data remains open.
arXiv·2026-10-06·Ravishankar Ramanathan
No generated summary available for this entry.
overview
Original abstract
Characterizing the set of quantum nonlocal correlations through information-theoretic constraints is a central problem in quantum foundations. We show that the convex hull of no-signalling behaviors in a bipartite Bell experiment satisfying a common-overlap no-disturbance-without-uncertainty condition is exactly the finite-dimensional quantum set whenever one party has two binary measurements and the other has an arbitrary finite number of settings, each with an arbitrary finite number of outcomes. In the simplest binary input-output Bell scenario, this characterizes the full eight-dimensional set of quantum behaviors, including the local marginals. The proof constructs a quantum realization directly from the conditional probabilities and no-signalling. The characterization also reduces optimization of any linear Bell expression in these scenarios to maximization over a one-parameter family of second-order cone programs. The results establish a connection between local uncertainty-disturbance constraints and quantum nonlocality, mediated by no-signalling and shared classical randomness.
arXiv·2026-10-06·Rafael A. Macedo, Rafael Chaves
No generated summary available for this entry.
overview
Original abstract
Physical many-body quantum systems typically interact locally, giving rise to ground states where entanglement grows with the area of the region being probed. Beyond entanglement, non-stabilizerness (or "magic") has been established as another crucial resource linked to quantum complexity and the properties of error-correcting states. Unlike entanglement, non-stabilizerness typically behaves with a volume-law scaling in ground states, indicating inherent computational complexity. In this work, we show that under a recent classification of quantum states, area-law states split into two distinct classes. Entanglement-dominated states obey an area-law for non-stabilizerness and admit efficient quantum algorithms for entanglement manipulation. Conversely, magic-dominated states exhibit a a faster-than-area growth of subsystem non-stabilizerness and require non-efficient algorithms for entanglement manipulation tasks. Within this context, we introduce the concept of the stabilizer regime, a restricted quantum phase that admits efficient entanglement manipulation and hosts area laws for both magic and entanglement.
arXiv·2026-10-06·Erfan Amidi, Ali Asadian, Ali Hamed Moosavian
No generated summary available for this entry.
overview
Original abstract
We prove that unknown pure fermionic states prepared from disjoint-branch fixed-particle-number blocks can be reconstructed after general quadratic evolution, including pair creation and annihilation. For a fixed particle cap per block, adaptive or nonadaptive single-copy Gaussian measurements yield classical input and circuit descriptions with prescribed fidelity and confidence, using polynomial resources in system size and inverse infidelity. The adaptive procedure has the sharper copy guarantee. Connected quartic correlations and a covariance-compatible commutant identify the hidden blocks; local states are recovered from fresh measurements or a predetermined bounded-degree moment table. Stable branch recovery gives valid preparation descriptions. Neither particle-number conservation nor block homogeneity is required; no lower bound on branch weights or covariance gaps is assumed. A certified variant returns a passive preparation whenever one exists within the promised family, without advance membership information. On the full Gaussian orbit of paired magic states, quartic measurements alone suffice, with an explicit bound converting observable error into state error.
arXiv·2026-10-06·Zheyu Shen et al.
No generated summary available for this entry.
overview
Original abstract
Polynomial transformations are basic primitives in quantum algorithms: quantum signal processing and singular value transformation compile univariate polynomials into circuits with query complexity essentially set by degree. Multivariable transformations of noncommuting matrices, however, lack a comparable synthesis theory. We develop a complete constructive theory under joint block access for all polynomials contractive on the prescribed matrix domain. Given a compact finite-state description of a degree-$D$ polynomial $P$ and $0<τ<1$, we synthesize $P$ with $(1+τ)$-optimal normalization using $O(D/\sqrtτ)$ queries, and exactly $D$ under row-block access, matching a degree lower bound. The complete circuit realization is classically computable in polynomial time with polylogarithmic dependence on accuracy. The key to our construction is a finite algorithmic Schur--Agler theorem: the coefficient recurrence defines a polynomial-dimensional continuation space supporting a complete semidefinite certificate for contractivity on the prescribed domain. Factoring this certificate yields the contractive realization underlying the query algorithm. Beyond matrix transformations, our framework lifts multivariable polynomial synthesis to quantum channel transformations. Given coherent Kraus access $K=\{K_a\}_a$, we synthesize any finite jointly contractive family of noncommutative polynomial maps $K\mapsto\{F_b(K)\}_b$ as completely positive operations, allowing coherent interference among Kraus histories. Furthermore, channel-level transformations specified by causal Choi data can be synthesized explicitly as fixed-order quantum combs. Collectively, these results point to a broader program: multivariable approximation as a language for multi-operator quantum algorithms and higher-order quantum information processing.
arXiv·2026-10-06·Abhaya S. Hegde, Songbo Xie
No generated summary available for this entry.
overview
Original abstract
Entanglement sudden death (ESD), explored through a series of works by Yu and Eberly, supports the notion of entanglement vanishing abruptly and completely at a finite time, even when the underlying open-system dynamics remain smooth. In this article, we revisit the development of ESD from bipartite origins to genuine multipartite entanglement. We first illustrate the canonical mechanism of ESD with two independently damped qubits, for which the concurrence vanishes at a finite time while populations and coherences remain nonzero. We next present our results on multipartite entanglement for generalized GHZ states under depolarization. Global and independent local depolarizing dynamics can be chosen to produce identical reduced evolution for every individual qubit, yet they yield different genuine-multipartite-entanglement sudden death times, whose ordering can reverse with the initial state. For N-qubit GHZ states, this distinction becomes asymptotically stronger since the ESD time scales as 1/N under independent local depolarization, whereas under global depolarization it approaches a finite value in the thermodynamic limit. Echoing a central lesson of Prof. Eberly's work, we report the lifetime of multipartite entanglement is not fixed by the local dynamics, but rather depends on the evolution of the joint quantum state.
arXiv·2026-10-06·Marius Bothe, Patrick Schoepf, Nick S. Blunt
No generated summary available for this entry.
overview
Original abstract
Recent advances in algorithms for simulating Lindblad dynamics have clarified their theoretical potential for state preparation, but their practicality in the early fault-tolerant regime and beyond remains uncertain. In this work, we address this by investigating the cost of preparing ground states of the fermionic Hubbard model, following the single-ancilla approach of [Phys. Rev. Research 6, 033147 (2024)]. We derive rigorous error bounds including constant prefactors, and compare to empirical error behavior and practical convergence parameters obtained from circuit-level simulations. We find that empirically chosen parameters can reduce the required resources by orders of magnitude, resulting in an estimated $7.7 \times 10^8$ T gates to perform one unit of time evolution targeting the low-energy subspace of a 36-site fermionic Hubbard model. We identify the accurate filtering of energy transitions as the main source of this cost.
arXiv·2026-10-06·M. A. Rajabpour
No generated summary available for this entry.
overview
Original abstract
Local-basis Shannon entropies of critical wave functions contain universal subleading information, but the Shannon point of the critical transverse-field Ising chain is singular in the conventional Rényi approach. We treat it directly at $n=1$ by representing the complete computational-basis Born distribution as the odd-degree boundary of independent long-range Bernoulli edges. The Shannon chain rule separates the entropy into explicit independent-edge and conditional cycle-space terms. For the periodic chain this isolates the analytic edge anomaly and organizes the remaining constant by linked vertex support. Conditional on the stated finite-part matching and forest assumptions, every nonvanishing linked coefficient is represented by an explicit finite-dimensional integral, giving an all-orders analytic hierarchy; the four-vertex term is evaluated in closed form, and the first few linked sectors already nearly saturate the established periodic constant, which is also reconstructed independently from the exact finite-size distribution. For an interval, the exterior reduces exactly to one ghost vertex and the explicit squared logarithms cancel, leaving the analytic edge contribution $γ_E=\log2/4-1/16$. The conditional cycle term has an exact all-support decomposition into physical-line and ghost-linked sectors; conditional on closure of the boundary forest subtraction, these sectors define an all-orders hierarchy of renormalized line and monomer--dimer boundary periods for the remaining logarithmic coefficient. The first complete augmented linked coefficient is evaluated in closed form, with an exact cancellation between its line and ghost boundary-layer anomalies; an independent reconstruction from exact finite-size probabilities recovers the established coefficient $γ_1=0.060020(3)$.
arXiv·2026-10-06·Michael Feldmeier et al.
No generated summary available for this entry.
overview
Original abstract
Superconducting circuits have emerged as one of the most promising and scalable platforms for quantum com- puting, with substantial industrial adoption driving qubit counts steadily upward. Yet the layout of the corresponding chips is still primarily performed manually, consuming multiple days or weeks of expert effort, even for moderately sized designs. Existing automation approaches sidestep this bottleneck by simplifying the underlying problem and relaxing physical constraints. Therefore, they fall short of fabrication-ready results. To overcome this scalability wall without such compromises, we first introduce a formal abstraction that translates physical device characteristics into a rigorous geometric problem formulation. This abstraction bridges physical realization and design automation. Building upon this abstraction, we then propose a three-stage design automation flow comprising geometry-aware global partitioning, ILP-based port assignment, and a hierarchical routing pipeline. Evaluations conducted by our interdisciplinary team of design au- tomation researchers and superconducting hardware experts con- firm that the resulting flow produces complete, manufacturing- ready layouts that comply with the physical design rules at the push of a button. That is, it operates fully automatically within seconds to a few minutes, and solves complex instances up to 25x faster than the state of the art. All methods are released as the fully open-source tool mqt-scpd as part of the Munich Quantum Toolkit, providing the first readily usable, end- to-end design flow for planar superconducting quantum chips that explicitly addresses the underlying physical characteristics and requirements.
arXiv·2026-10-06·Teodor Iličin, Rok Žitko
No generated summary available for this entry.
overview
Original abstract
An Andreev spin qubit stores a single unpaired spin, yet its coupling to the superconducting phase can be dominated by coherent virtual quasiparticle pairs. We develop a continuum variational description of the odd-parity doublet in a quantum-dot Josephson junction with Coulomb interaction and spin-dependent background tunneling. Retaining configurations with up to two Bogoliubov quasiparticles provides compact analytical expressions for energies and wavefunctions. We benchmark the results against numerical renormalization group calculations and identify sources of error. We obtain closed-form expressions for the conventional and spin-dependent Josephson couplings. Despite their small probability, two-quasiparticle configurations, through coherence with the zero-quasiparticle component, supply exactly half of the leading spin-dependent Josephson coupling even without Coulomb repulsion and dominate it as the repulsion grows. Spin-orbit-induced spin transfer between the dot and the leads produces a Josephson-current contribution that is common to both qubit states and finite at zero phase bias when the dot and lead Zeeman energies differ. We also map the localization of the virtual quasiparticles and the spin density in the leads. The results connect strongly correlated quantum-dot models to effective Hamiltonians used for Andreev-spin-qubit circuits and clarify how the wavefunction structure determines their couplings.
arXiv·2026-10-06·Vinícius Salem, Edilberto O. Silva, Fabiano M. Andrade
No generated summary available for this entry.
overview
Original abstract
Whether the spin-1/2 Aharonov-Bohm Hamiltonian supports bound states has remained controversial since Hagen concluded that no such states exist for a Dirac particle. Here, we show that Hagen's solution corresponds to a particular member of the one-parameter family of self-adjoint extensions that describe the singular Zeeman interaction, and we identify which member the microscopic physics selects. Matching the extension parameter to a finite-radius flux tube yields $ν=0$ precisely at $g=2$, and it does so in every flux sector. The critical $g$ factor is therefore universal, $g_c=2$, and depends on neither the flux sector nor the regularization radius. The flux sector controls the depth of the bound state energy, and we obtain a closed-form expression showing that binding deepens markedly with the integer part of the flux. Hagen's conclusion is thus confirmed and sharpened: it is not a statement about one arbitrary member of a family of extensions, but about the member that the physics selects when the magnetic moment takes its Dirac value, and an anomalous moment is a necessary and sufficient condition for binding in the singular channel.
arXiv·2026-10-06·Avraham Kreindel, Aryeh Lev Zabokritskiy
No generated summary available for this entry.
overview
Original abstract
We determine the least Greenberger-Horne-Zeilinger (GHZ) extractability compatible with a Mermin-Ardehali-Belinskii-Klyshko (MABK) Bell score for every number of parties greater than two. Extractability is the largest squared overlap with a GHZ state obtainable by separate local quantum channels. Between the biseparable bound and the quantum maximum, the exact minimum is the affine interpolation from one half to one. The bound holds for normal states on tensor products of arbitrary local dimension and arbitrary binary measurements. We settle the previously unresolved range of six or more parties with an analytic proof that is uniform from four parties onward. We also determine the exact minimum when every local system is a qubit, and show that it lies strictly above the unrestricted bound at every interior score. One qutrit and qubits at all remaining parties attain every point of the bound with measurements fixed as the score varies. For at least four parties and strict interior scores, we classify all states attaining the bound with the minimum product of local support dimensions. For at least four parties on one qutrit and qubits elsewhere, we also prove that, when the extractability excess above the affine minimum is small, the trace-norm distance from the attaining mixture, up to local unitaries, is bounded by a constant times the square root of that excess. The exponent $1/2$ is optimal, and the constants are independent of the number of parties on every fixed interior interval of normalized scores.
arXiv·2026-10-06·Sudip Chakrabarty
No generated summary available for this entry.
overview
Original abstract
Gaussian steering sets a sharp threshold for creating Wigner negativity at a distance. A measurement by Bob can make Alice's part of a shared Gaussian state Wigner negative only if Alice can steer him with Gaussian measurements. We ask whether multiple copies, ancillas, or catalysts can lift this requirement when Alice is restricted to Gaussian operations. We introduce the steered negativity, a multiplicative monotone whose logarithm equals the Gaussian steerability for Gaussian states. It bounds the negativity that Bob can herald and rules out activation by copies, by ancillas of Bob, and by catalysts without remote negativity of their own. For a strictly unsteerable Gaussian state and a single round of feed-forward to a Gaussian unitary of Alice, we further prove that even a Wigner-negative or steerable catalyst cannot help if it is returned exactly. Gaussian steering thus remains a barrier to remote Wigner negativity beyond the single-copy setting.
arXiv·2026-10-06·Benjamin Fuller et al.
No generated summary available for this entry.
overview
Original abstract
Based on the analysis of moiré superlattice characteristics and interlayer hybridisation in small-angle twisted graphene multilayers with a monolayer hexagonal boron nitride (hBN) spacer, we predict spectral features and quantum transport effects in these systems. Here, we consider both a twisted bilayer and double bilayers with a spacer, discuss double bilayers in two stacking orders - with and without inversion symmetry - and also compare the results obtained with self-consistent Hartree calculations with and without in-plane periodic charge distribution, offering computationally efficient models for these graphene/hBN/graphene moiré systems. We note parametric intervals where the appearance of minibands can be enhanced by tuning with an out-of-plane displacement field, and identify the miniband edges and van Hove singularities across a broad range of densities and displacement fields. These system host Lifshitz transitions at which the Fermi lines form a network across moiré Brillouin zones, and to which Brown-Zak oscillations converge at low magnetic field and elevated temperatures. We analyse interlayer hybridisation across the same parameter space, discuss how hybridisation affects in-plane magneto-transport in ultra-high-mobility structures, and predict that semiclassical magneto-oscillations of interlayer hybridisation can lead to 1/B-periodic quantum oscillations of resistivity persistent to high temperature.
arXiv·2026-10-06·Gonçalo Sousa, Duarte Magano
No generated summary available for this entry.
overview
Original abstract
Clustering is a fundamental task in unsupervised learning. The goal is to partition unlabeled data into clusters such that similar elements are assigned to the same cluster, while elements in different clusters are dissimilar. We propose a quantum Monte Carlo approach to density estimation, a key routine in density peak clustering. Building on this approach, we develop quantum algorithms for the full clustering problem and three related tasks: decision clustering, cluster counting, and heavy cluster counting. For each one, we establish a polynomial quantum query speedup under assumptions on the scaling of dataset-dependent parameters. Numerical experiments suggest that these conditions are satisfied for several practically relevant settings.
arXiv·2026-10-06·Victor Barizien et al.
No generated summary available for this entry.
overview
Original abstract
Quantum memories are key ingredients for future quantum networks. Developing methods for their certification is therefore an important, yet challenging, problem. In this work, we present a general framework for certifying quantum memories and quantifying their performance in an operational and efficient manner, taking advantage of developments in the theory of quantum channels. We start by giving a pedagogical introduction to these concepts and tools and illustrate their natural application to quantum memories. Specifically, we quantify the fidelity of a quantum memory via the notion of average channel fidelity, which can be estimated precisely in an experiment via a finite set of probe states forming a so-called $2$-design. We then present a number of witnessing techniques for certifying this quantity, and show that it gives access to other important properties of the channel, such as its dimensionality and its capacity to transmit quantum information. We consider mostly a simple prepare-and-measure scenario, but discuss also the case of an entanglement-based setup, as well as a semi-device-independent approach. Finally, we apply these methods to a solid-state quantum memory experiment, certifying an average channel fidelity of 98.6%. Our certification methods can be readily applied to other quantum devices, such as fibers, transducers and gates.
arXiv·2026-10-06·Janarbek Yuanbek, Zelalem Abebe Bekele, Zhi-qiang Liu
No generated summary available for this entry.
overview
Original abstract
We investigate how post-selected von Neumann measurements modify the nonclassical properties of two-mode entangled coherent states (ECSs). From the conditional pointer state, we characterize squeezing, photon statistics, intermode correlations, entanglement, fidelity, and post-selection probability. Anomalous weak values with moderate coupling enhance squeezing, antibunching, sub-Poissonian statistics, intermode correlations, and bipartite entanglement, while fidelity captures the crossover from weak perturbation to strong distinguishability. These results demonstrate post-selection as a tunable approach to engineering ECSs.
arXiv·2026-10-06·Fabio Bagarello, Emanuele Balistreri, Sergey Kuzhel
No generated summary available for this entry.
overview
Original abstract
We propose an unified view to three well known quadratic Hamiltonians widely considered in quantum mechanics, i.e. those of the harmonic oscillator, of the inverted harmonic oscillator, and the Berry-Keating Hamiltonian. We describe an unified approach to determine the discrete spectrum of these operators, and to deduce their (generalized) eigenstates. We also look at these Hamiltonians as the generators of $\mathfrak{su}(1,1)$, and of a generalized version of it relevant in presence of non Hermitian generators.
arXiv·2026-10-06·Niklas V. Lausti et al.
No generated summary available for this entry.
overview
Original abstract
We report a 3D-printed microwave-resonator Paul trap that operates at the GHz frequencies required for electron confinement while preserving an open geometry suitable for laser access and imaging ion Coulomb crystals. The resonator exhibits moderate quality factors of approximately 1000, enabling large confining electric-field amplitudes at low input power, and is in good agreement with finite-element-method (FEM) predictions despite manufacturing imperfections, which we experimentally characterize. The validated FEM model is then used to calculate the electromagnetic fields in the trapping region. These field distributions, together with surface-roughness measurements, are incorporated into a model of electron spin-qubit decoherence to estimate the coherence time. Our analysis predicts that electron spin-qubit coherence times on the order of 10 ms should be achievable under the assumption that motional heating is dominated by Johnson noise, making such systems relevant for quantum information processing. The method of obtaining the coherence time is applicable to any electron Paul trap.
arXiv·2026-10-06·Minghui Yu, Xian-Hui Ge
No generated summary available for this entry.
overview
Original abstract
We develop a computational framework for the quantum relative entropy based on the replica trick and apply it to analyze the evaporation process method of Jackiw-Teitelboim black holes. We show that the relative entropies between the exact radiation state and the Hawking saddle state and the replica wormholes saddle state quantify information-theoretic costs inherent to coarse-grained semiclassical descriptions. During evaporation, the relative entropy for the Hawking saddle increases monotonically, reflecting a progressively higher thermodynamic cost of sustaining the Hawking description. Conversely, the relative entropy associated with the replica wormholes saddle decreases, which indicates that the description of connected geometries becomes progressively more accurate. Moreover, the sign of the difference between the two quantities reverses precisely at the Page time, providing an information-theoretic diagnosis for the transition between competing gravitational saddles. Our results recast the Page transition as a flow of relative entropy costs between competing semi-classical descriptions, revealing an information-theoretic structure underlying the emergence of effective irreversibility in coarse-grained black hole evaporation.
arXiv·2026-10-06·Sharoz Schezwen, Yijie Shen
No generated summary available for this entry.
overview
Original abstract
Space-Time Wave Packets (STWPs) have enabled numerous nontrivial properties, such as tunable group velocities, nondiffraction and nonlocal spin textures in optical fields. However, this has not been properly studied in matter waves. Here, we investigate free-electron STWPs, which are propagation-invariant and group-velocity-tunable matter wave packets, constructed by constraining the spatiotemporal spectrum of the electron wavefunction in momentum space. Due to the unique dispersion of free-electrons, the electron STWP can carry two different topologies, and host both meron and skyrmion topological textures in momentum space. We demonstrate the topological phase transitions and tunable skyrmion numbers by spectral geometry tuning. We also show the topologically robust propagation of the electron pulses and corresponding real-space skyrmionic expectation value textures encoded within each single electron wavefunction. Our results open a platform for topological free-electron wavepackets uses in sensing and information transfer.
arXiv·2026-10-06·Roman Makarevych et al.
No generated summary available for this entry.
overview
Original abstract
In this report we analyze charasteristics of structural symmetry of small AkBlCm nanoclusters (A - Rb, Cs; B - Pb, Sn, Bi; C - Cl, Br, I), binding energies, stability, and, ultimately, applicability as building blocks for construction of larger-size nanoclusters. Preliminary spatial modeling of ternary compound nanoclusters has been carried out on the basics of geometrical approach, namely interatomic distances taken as a sums of corresponding ionic radii. The geometry optimization and binding energies of the modeled structures have been determined through quantum-chemical calculations. Geometry optimization has been performed with Gaussian09 software package using Density Functional Theory (DFT) within the generalized gradient approximation of the Perdew-Burke-Ernzerhof (PBE) and hybrid approximation of the Becke-3-Lee-Yang-Parr (B3LYP) exchange-correlation functionals. The Stuttgart/Dresden (SDD) and Los Alamos National Laboratory 2 Double Zeta (LANL2DZ) scalar-relativistic effective basic potentials were employed throughout the calculations. As a result of these calculations, a clear relationship between the atomic radii, their ratios within the nanoclusters and their stability has been obtained and analyzed.
arXiv·2026-10-06·Xingkun Song
No generated summary available for this entry.
overview
Original abstract
For perfect state transfer (PST) on unweighted mixed graphs, we classify the normalized transfer times of complete PST classes. A finite set $Λ\subset\mathbb R/\mathbb Z$ containing zero occurs at a nonstationary periodic vertex if and only if $\cos(2π(x-y))\in\mathbb Q$ for all $x,y\inΛ$. Every admissible set has a connected oriented realization. We also classify the possible return phases of oriented realizations at the minimum vertex period. Transfers at rational multiples of the common minimum vertex period partition a complete class into sets of size at most six, or at most three in an oriented graph with return phase $-1$; both bounds are sharp. We construct complete classes of every finite size, including classes in which all transfers between distinct vertices occur at irrational multiples of the period and no switching automorphism maps a class vertex to a distinct class vertex. We also characterize simultaneous realization in connected oriented graphs with prescribed relative minimum vertex periods and return phases. The proof combines an imaginary quadratic field restriction with an unweighted construction that selects the complete target set.
arXiv·2026-10-06·Weslei B. Fontana, Fabrizio G. Oliviero, Yi-Ping Huang
No generated summary available for this entry.
overview
Original abstract
We study the interplay between symmetry defects insertion and the phenomena of quantum many body scarring. We exploit a class of models obtained from an embedding mechanism that defines a stochastic matrix form hamiltonian, hosting zero energy many body scarred states. Such models display an interesting playground to explore the consequences of dualities, half-gauging operations and so on. We first show that inside this class of models, what are the conditions to still have scared states after defect insertion. The main result of our work is a detailed analysis of half-gauging in such chains, which introduces a non-trivial interface in our system, leading to scarred states protected by the underlying symmetries. The conclusions for half-gauged scarred systems are general and may lead to fruitful directions for higher dimension scarred physics and their robustness.
arXiv·2026-10-06·Mohammadreza Khellat et al.
No generated summary available for this entry.
overview
Original abstract
Pauli decomposition underpins Trotterization, phase estimation, sparse-Hamiltonian simulation, and variational observables, at exponential naive cost. From the character theory of $(\mathbb{Z}_2)^n$, characters $χ_z(v)=(-1)^{\langle v,z\rangle}$ are the diagonal Pauli strings, so any diagonal operator is already Pauli-decomposed. A general operator still needs the shifts: each $X^{\otimes x}$ couples to a character $χ_z=Z^{\otimes z}$, and the products $X^{\otimes x}Z^{\otimes z}$ -- up to phases in $\{\pm 1,\pm i\}$ -- form the Pauli group, the central extension of $(\mathbb{Z}_2)^n\times(\mathbb{Z}_2)^n$ by that phase group fixed by the symplectic pairing. A section of that extension remains a choice: the bare products $X^{\otimes x}Z^{\otimes z}$, or the genuine operators that insert $Y=iXZ$ at every qubit where $x$ and $z$ overlap. As Fourier analysis on an abelian shift-character lattice (a natural DFT), this formulation is not qubit-bound: $(\mathbb{Z}_p)^n$ recovers Heisenberg-Weyl qudits. The fast algorithm is the FFT for the group at hand; on $(\mathbb{Z}_2)^n$ that FFT is Walsh-Hadamard, at cost $O(n\cdot 4^n)$. paulikit is a memory-bounded realization of that qubit transform: peak usage need not materialize the dense $2^n\times 2^n$ operator, unlike prior codes whose $O(1)$ extra sits on that buffer, checked beyond a billion oscillator terms against Work-Span and bandwidth ceilings.
arXiv·2026-10-06·Lu Zhang et al.
No generated summary available for this entry.
overview
Original abstract
We proposed to boost the photon bunching effect of classical light via a modified Fabry-Pérot cavity with one of the cavity mirrors being replaced by a spatial light modulator, through which multiple independent transverse modulations, each was to encode independently spatially correlated phase on the wave front of the light field, was cascaded in sequence in the longitudinal propagation direction in the cavity. The two-photon bunching peak and the three-photon bunching peak of the generated superbunching light field were measured to be $36.9\pm2.0$ and $\rm (2.46\pm0.12)\times10^{3}$, respectively, which, as compared to those of thermal light, were improved by one-order and three-order of magnitude, respectively. Correspondingly, the ghost image visibility reconstructed with the superbunching light was demonstrated experimentally to be improved by $\sim 40$ times as compared to that with the pseudo-thermal light. Such classical superbunching light field is of essential importance not only for fundamental physics but also for potential applications such as correlated imaging, ghost interference and nonlinear optics.
arXiv·2026-10-06·Karol Sajnok, Fabio Costa
No generated summary available for this entry.
overview
Original abstract
Non-classical dynamics in open quantum systems can be hidden in temporal correlations that are invisible to standard state- and channel-based tests. We define coherence for multi-time quantum processes and show that access to intermediate times can reveal coherence absent from all corresponding pairwise channels. Incoherent processes are fixed points of dephasing on all input and output spaces, and their coherence is quantified by relative entropy. As a proof of principle, we use an Ising model in which all three pairwise channels are incoherent while the full three-time process remains coherent. We observe this multi-time coherence on a superconducting quantum processor using a coherence witness and full process tomography.
arXiv·2026-10-06·Julián Ferreiro-Vélez et al.
No generated summary available for this entry.
overview
Original abstract
We introduce an inertial counterdiabatic (CD) protocol that reformulates shortcut-to-adiabaticity design as a moving-frame diagonalization problem. The method employs the Magnus expansion to construct a variational propagator generated by an accessible CD ansatz. In the new rotating frame, the controls are optimized to suppress the off-diagonal Hamiltonian terms, and the CD terms are defined to counteract the corresponding inertial contribution. The propagator generated with the Magnus expansion naturally exploits additional control directions generated through its nested commutator, while the sequential design of the propagator introduces temporal nonlocality into the optimization. We benchmark the method on a two-qubit system and on the one-dimensional quantum Ising chain, where it consistently outperforms variational CD protocols based on action minimization. The largest improvements are observed near gap-closing regions, demonstrating the advantage of combining temporal and algebraic nonlocality for suppressing diabatic excitations.
arXiv·2026-10-06·Jianyong Hu, Wei Li
No generated summary available for this entry.
overview
Original abstract
Conventional compressed sensing (CS) has a measurement lower bound of M = Ω(K log(N/K)) under non-adaptive measurements. Recent experiments on quantum compressed sensing (QCS) have reported numbers of measurements below this classical lower bound. In this work, we establish lower bounds on the measurement complexity of QCS from an information-theoretic and quantum-physical perspective. QCS exploits quantum parallelism, enabling a unitary domain-alignment evolution to act on a superposition of all N basis states and map the sparse basis onto the measurement basis in a one-to-one manner. Consequently, the locations of nonzero components are explicitly carried by measurement-index labels. If only basic statistical information about the K nonzero components is required, the total number of effective index samples satisfies the coarse necessary condition Ms = Ω(K). Under independent single-index projective measurements, when the support is unknown, the nonzero probabilities satisfy pn = Θ(1/K), and exact support recovery is required with a fixed success probability, the sampling-coverage requirement leads to Ms = Θ(K ln K). If each nonzero amplitude coefficient is further required to achieve a coordinate-wise relative root-mean-square error ε, the optimal effective index sample complexity is Ms = Θ(K ln K + K/ε2), which reduces to Θ(K ln K) for fixed ε. Multimode photon-number-resolving detection can reduce the number of experimental rounds but not the total effective index sample complexity. These results show that quantum parallelism is not only a core resource for quantum computing but can also play a transformative role in measurement science.
arXiv·2026-10-06·Junkai Wang, Jin-Peng Liu
No generated summary available for this entry.
overview
Original abstract
Quantum automated learning (QAL) trains quantum models by directly updating quantum states, offering an approach to quantum machine learning that avoids optimizing variational circuit parameters. However, post-selection constrains the probability of obtaining the final learned model. We develop a post-selection-free QAL algorithm that organizes a complete training path into a coherent quantum circuit and uses fixed-point amplitude amplification to increase the probability of obtaining the learned model. We provide theoretical guarantees on output error and learning loss, and identify conditions under which additional coherent resources reduce the cost of restarting failed trajectories. The construction gives QAL a coherent implementation with explicit learning guarantees and resource costs, enabling a model with certified learning quality and controlled output error to be obtained with high probability.
arXiv·2026-10-06·Srikar Alla, Ali Shiri Sichani, Chi-Ren Shyu
No generated summary available for this entry.
overview
Original abstract
Multimodal vision-language systems typically fuse image and text embeddings through classical operators such as concatenation, attention, bilinear pooling, or tensor interactions. We propose Quantum Entangled Multimodal Fusion Networks (QEMFN), a hybrid quantum-classical framework that introduces parameterized entanglement as a structured inductive bias for multimodal fusion. Pretrained visual and textual features are projected into compact latent spaces, encoded as angle-parameterized quantum states, processed through intra-modal and paired cross-modal entangling circuits, and measured to produce fused representations for retrieval. Under matched parameter budgets and identical frozen CLIP backbones, QEMFN outperforms classical fusion baselines on COCO-5k and Flickr30k, including multilayer perceptron, tensor fusion, FiLM, cross-attention, compact transformer, and a dequantized paired-topology analogue. An ablation suite isolates the quantum module's contribution from the surrounding classical projections, and quantum-centric analyses report Meyer-Wallach entangling capability, expressibility, gradient variance against barren-plateau bounds, and entropy-performance correlation under controls for training progress alongside an intervention study on the entangling component. QEMFN is executed under shot-based estimation, a noise-modeled fake backend, and a real superconducting device with zero-noise extrapolation. This work does not claim quantum computational advantage; the contribution is the framework together with a controlled empirical and quantum-centric evaluation that positions trainable entanglement as an interpretable, hardware-executable fusion mechanism at scales accessible on contemporary devices.
arXiv·2026-10-06·Bishal Kumar Das, Lakshya Priyadarshi
No generated summary available for this entry.
overview
Original abstract
A client who rents a cloud quantum processor cannot easily tell whether the bitstrings it receives came from a quantum device. Certification by random circuit sampling runs on present hardware, but scoring each returned sample costs the client time $O(2^n)$. We give a protocol in which the client scores each round in time $O(n)$, built on degenerate concordant ensembles. When a concordant state has a degenerate spectrum, every concordance-preserving gate factorizes as $G_t=U_tP_tB_tU_{t-1}^\dagger$, and the block factor $B_t$, which commutes with the state, cancels from the ensemble while entangling each pure component. The client holds a secret parity whose cosets are the degenerate sectors of every layer, so that it builds the circuit and predicts the ensemble with one inner product per layer. The secret never leaves the client. Inputs are sent uniformly at random, and the client attaches to each round, in its own bookkeeping, the eigenvalue of that input in the hidden state; both verification statistics, an input--output agreement test and a weighted collision test, then compare the server's samples with the non-flat output distribution of the concordant computation. We prove completeness, client efficiency, and soundness in an ideal model in which the compiled circuit reveals nothing about the secret, and we show that the secret must stay hidden: a classical server that holds it passes. For the explicit construction we prove that the single-qubit symmetry test used in efficient simulations of concordant computation fails on non-product inputs with unbiased marginals, and we measure that the local-basis finder of Cable and Browne halts on every layer we tested, that the transmitted component saturates the maximal Schmidt rank, that the circuit is not Clifford, and that matrix-product spoofers are rejected. Soundness of the explicit construction is stated as a conjecture.
arXiv·2026-10-06·Yury Belousov, Dim Safin
No generated summary available for this entry.
overview
Original abstract
We derive the density matrix of a nonstationary system in the adiabatic representation and obtain the corresponding Liouville equation. This representation is particularly suitable when the standard interaction representation is inapplicable. We illustrate the approach with two identical, spatially separated spin-1/2 particles coupled by a magnetic dipole-dipole interaction in a slowly varying external magnetic field. Specifically, we analyze the spin polarization of pseudo-qutrit states in regimes where the states become entangled. The application of the adiabatic representation to calculate the dependence of observed physical quantities on time for quantum systems is illustrated. Our results show that entangled states can significantly modify the behavior of these observables and provide additional opportunities for their control.
arXiv·2026-10-06·Stefano Gherardini, Paolo Solinas
No generated summary available for this entry.
overview
Original abstract
In this paper, we introduce the concept of quasi non-signaling in time (QNSIT), which extends non-signaling in time (NSIT) to quasiprobability distributions. QNSIT requires that the marginals of the quasiprobability distribution under consideration at intermediate times remain unperturbed by the measurement back-action induced by a sequence of quantum measurements. Associated with QNSIT, we propose a quasiprobabilistic characterization of macrorealism, ${\rm MR}_{\rm qp}$, which requires that both the QNSIT conditions are satisfied and the quasiprobability distribution constructed from the measurement outcomes is positive. We prove that ${\rm MR}_{\rm qp}$ implies NSIT, whereas the converse does not hold because of hidden superposition paths generated or preserved by the system dynamics. We also prove that, for a two-level system, the ${\rm MR}_{\rm qp}$ and NSIT conditions coincide. ${\rm MR}_{\rm qp}$ therefore provides a more sensitive tool for testing macrorealism and can be implemented experimentally through a quantum non-demolition measurement scheme.
arXiv·2026-10-06·Jingsong Ao, Julio I. de Vicente, Alexander Streltsov
No generated summary available for this entry.
overview
Original abstract
A central goal in quantum information science is understanding which physical states can be converted into others. The ideal scenario would be a totally ordered system, where every state can be ranked by a single value, and a higher-ranked state can always be converted into a lower-ranked one. Such an ordering would provide a complete description of state convertibility, making the resource structure maximally simple to characterize and compare. We prove that such a simple ordering is fundamentally impossible for any quantum system with dimension larger than 2. The underlying properties of quantum mechanics guarantee that some states will always be incomparable. Furthermore, we show this is a uniquely quantum phenomenon by constructing classical systems of any size that can be perfectly ranked. This establishes a rigorous and striking divide between quantum and classical state transformations.
arXiv·2026-10-06·Jamal Slim
No generated summary available for this entry.
overview
Original abstract
A spin one-half driven only by total-spin operators generates a renewal process in which one interevent time $n^\ast$ is forbidden while all others occur. No classical hidden Markov model reproduces it with fewer than $1+\sqrt{n^\ast}$ states, an unbounded separation whose only resource is one relative phase of $π$. With $K$ amplitudes the same interference yields $K(K{+}1)/2$ decay channels, and for positive weights and generic rates the classical cost is exactly $K(K{+}1)/2$ states. Both are realized by a depth-three circuit whose parameter count does not grow with the register.
arXiv·2026-10-06·Alessandro Cestelli et al.
No generated summary available for this entry.
overview
Original abstract
We demonstrate a compact, practical all-fiber source of non-degenerate telecom-band polarization-entangled photon pairs assembled from off-the-shelf components. The compact fiber-integrated architecture is designed to be affordable, straightforward to assemble and align, and compatible with existing optical-fiber infrastructure. Photon pairs are generated through type-0 spontaneous parametric down-conversion in a pigtailed periodically poled lithium-niobate waveguide embedded in a Sagnac interferometer. At 0.5 mW pump power, quantum-state tomography yields a Bell-state fidelity $F_{Φ^-}=0.850$, purity $P=0.836$, and concurrence $C=0.782$. A separate CHSH measurement gives $S=2.3301\pm0.0075$. The measured Bell-state fidelity is sufficient for the reconstructed polarization state to support qubit teleportation above the classical fidelity limit under ideal protocol operations. Analysis of the density matrix shows that approximately 96.7% of the population remains in the desired $|HH\rangle$-$|VV\rangle$ subspace, with a normalized coherence of approximately 0.86. A residual relative-phase offset indicates that local phase compensation could increase the Bell-state fidelity to approximately 0.8865. We further characterize the brightness--quality trade-off and obtain a corrected pair-rate slope of $(0.918\pm0.040)$ Mcps mW$^{-1}$. The broadband emission and fiber interfaces offer a route to multiuser entanglement distribution through off-the-shelf multichannel wavelength-division multiplexers with passbands matched to the signal and idler wavelengths.
arXiv·2026-10-06·Shiroman Prakash
No generated summary available for this entry.
overview
Original abstract
We study cyclic triorthogonal codes in prime dimension $p$, on which a transversal third-level diagonal gate acts as a logical non-Clifford gate. For odd $p$, we use a definition of triorthogonality that does not require self-orthogonality. For cyclic codes of length coprime to $p$, triorthogonality reduces to a sumset condition on the spectral support, which makes exhaustive search feasible: for two natural constructions, we enumerate all maximal codes of this kind for $p=3$ up to length $121$ and $p=5,7$ up to length $96$. For qubits, we prove that a cyclic code of odd length is triply even if and only if it is classically triorthogonal, giving a complete description of triply-even cyclic codes, and we determine all such codes up to length $763$. For qudits, we find codes such as $[[19,1,3]]_3$ and $[[7,1,3]]_7$, which improve on the shortest Reed-Muller and Reed-Solomon codes in both overhead exponent and distillation threshold. The latter is the first member of an infinite family of $[[p,1,2\lfloor p/6\rfloor+1]]_p$ codes.
arXiv·2026-10-06·Andrey S. Aleksandrov, Anatoly V. Masalov
No generated summary available for this entry.
overview
Original abstract
The possibility of generating light in a squeezed quantum state during saturated light amplification in a semiconductor amplifier is theoretically analyzed. Due to four-wave mixing process during amplification, weak components of the spontaneous emission of the medium with symmetric frequency shifts relative to the strong amplified wave acquire the quantum properties of two-mode squeezed light. The squeezing of quadrature components occurs in the range of frequency shifts of several GHz ($\sim$ the inverse relaxation time of the charge carrier density) and can reach 10 dB or more under optimal conditions. The formation of a two-mode squeezing phase facilitates the observation of the squeezing effect, in which a strong wave, playing the role of a local wave, exhibits quadrature noise suppression without additional homodyne detection.
arXiv·2026-10-06·Reyhaneh Khasseh, M. A. Rajabpour
No generated summary available for this entry.
overview
Original abstract
A local measurement of a critical many-body state produces exponentially many microscopic outcomes, each defining a different conditioned quantum state. We ask how much information from one such outcome is actually needed to predict the entanglement that remains between two unmeasured regions. We show that, in critical quantum chains, the universal outcome-resolved Rényi entropy is asymptotically determined by a single compact conformal coordinate extracted directly from the measurement record. Compact-boson theory explains this compression: the universal entropy is insensitive to all spatially varying components of the boundary profile, retaining only a single relative compact zero mode. At the free-fermion XX point, exact lattice identities expose the microscopic structure underlying the decoder, while large-scale outcome-by-outcome calculations confirm its scaling prediction across different subsystem geometries and Rényi indices. Numerical calculations in interacting XXZ chains further show that the same microscopic coordinate continues to decode the conditional entropy without interaction-dependent retuning. Thus an exponentially large space of measurement outcomes is reduced, for this universal observable, to a single conformal degree of freedom, revealing an emergent Luttinger-liquid mechanism for outcome-resolved postmeasurement entanglement.
arXiv·2026-10-06·Jorge Benito Díaz et al.
No generated summary available for this entry.
overview
Original abstract
First-generation quantum repeaters are essential in distributing entanglement over long distances since they could mitigate losses in optical fiber. Repeaters split the total distance into shorter, easier to generate links. Then, entanglement swapping establishes long range entanglement by performing local measurements at the repeaters and heralding their results. In this work, we develop an analytical model that estimates the impact of decoherence during heralding for a given protocol. Furthermore, we identify a competition between two phenomena: as repeater count increases, so does entanglement generation, but the additive impact of memory decoherence on final entanglement rate increases too. Therefore, we find that an optimal number of repeaters exists. These findings could lead the design of future quantum networks, both in the inter-repeater distance and swapping timings.
arXiv·2026-10-06·Federico Settimo, Dariusz Chruściński
No generated summary available for this entry.
overview
Original abstract
We study divisibility of finite-dimensional quantum dynamics in the Heisenberg picture when the dynamical maps need not be invertible. Heisenberg divisible dynamics determines unique reduced propagators on the accessible operator systems, and Heisenberg CP-divisibility is shown to be equivalent to an operator-norm monotonicity. Although each reduced propagator admits a unital completely positive extension, independently chosen extensions need not satisfy a composition law. Generalized inverses restore this law algebraically, but do not, in general, preserve complete positivity. We characterize the resulting obstruction and give a sufficient construction based on unital completely positive projections onto the accessible operator systems. It is shown that for qubit dynamics Heisenberg CP-divisibility always guarantees a completely positive generalized-inverse propagator. Finally, we analyze time-local generators at singular times and identify the associated gauge freedom on dynamically inaccessible directions.
arXiv·2026-10-06·Sooshin Kim et al.
No generated summary available for this entry.
overview
Original abstract
How a mobile impurity exchanges momentum and energy with a many-body environment is a central question in nonequilibrium quantum physics. This exchange becomes particularly complex when the impurity moves rapidly and is strongly coupled to its bath. Here, we realize an interaction-tunable cold-atom collider with fermionic $^{40}$K impurities immersed in a $^{23}$Na Bose--Einstein condensate. A species-selective Raman pulse simultaneously launches the condensate and quenches the interspecies scattering length, producing an initial relative speed 36 times the condensate speed of sound. We track the ensuing relative motion as the interspecies interaction is tuned from weak coupling to resonance. At weak and intermediate coupling, the impurity dynamics are well described by a finite-energy two-body collision model. Near resonance, however, the early-time impurity acceleration is markedly suppressed relative to the two-body prediction, corresponding to a strong enhancement of the apparent dynamical inertia. The enhancement is observed near two distinct Feshbach resonances. These observations provide evidence for a polaronic response in the strongly coupled, supersonic regime of a degenerate Bose--Fermi mixture.
arXiv·2026-10-06·Kashif Ammar Yasir
No generated summary available for this entry.
overview
Original abstract
Black holes are usually described either as classical geometries on which quantum fields propagate or as objects whose complete quantum description lies beyond semiclassical gravity. Hawking radiation already shows, however, that a black hole is not an exactly isolated system: the horizon carries a thermal scale and, after coarse graining, may be associated with fluctuations, dissipation and environmental correlations. Whether this horizon-scale openness can be encoded directly in the gravitational background, before any stochastic treatment of the metric, remains an open question. Here we answer it by introducing, for the first time, a conserved Hawking-scale anisotropic source representing the coarse-grained near-horizon atmosphere and solving the Einstein equations for a static black hole at fixed ADM mass. The dressed geometry has a renormalized mass function, a self-consistently shifted horizon and a modified surface gravity. Because the same lapse governs the horizon and timelike geodesics, the thermal response is accompanied by a correlated orbital restructuring: the effective potential is renormalized, the ISCO moves inward and the near-horizon residence time increases. The construction adds no Langevin force to a fixed Schwarzschild background; rather, it defines a deterministic dressed mean geometry, providing a controlled background on which stochastic metric fluctuations may subsequently be treated in the Einstein-Langevin framework. This establishes the deterministic mean-field sector as the necessary first step for future stochastic gravity programs addressing horizon-scale openness.
arXiv·2026-10-06·Shiqing Tang et al.
No generated summary available for this entry.
overview
Original abstract
We study how a parity--time-symmetric photonic environment changes the charging of Dicke and Tavis--Cummings quantum batteries. For atoms prepared in the collective ground state the excitation number grows as the square of the charging time, with a coefficient set by the initial mean photon number; the counter-rotating terms of the Dicke model add one to four times that number. Conservation of the total excitation number turns this into an exact ceiling on the stored Tavis--Cummings energy, the transition energy times the smaller of the photon and atom numbers, met numerically to within two per cent, which the Dicke terms overshoot by a few per cent at ultrastrong coupling. We then couple a battery to a lossy--gain pair, keeping the parity--time symmetry intact by putting an identical battery in each cavity; the closed moment system puts the exceptional point at the loss rate. Below it the gain cavity fills and the gain-side battery charges while the lossy-side one stays empty; above it photons are shuttled away and dissipated. Solving the full Lindblad equation with batched Monte--Carlo wave functions, we find that the gain-side battery gains thirty-nine, twenty-six and twenty-eight per cent in stored energy, power and ergotropy in the broken phase and loses sixty-five, thirty-five and sixty-five per cent deep in the unbroken phase, where the lossy-side battery overtakes it. Restoring the counter-rotating terms leaves all of this unchanged within the statistical error; what they add is a reactive oscillation at twice the transition frequency that does no net work but nearly doubles the peak of the instantaneous power. The extra energy is of lower quality, the recoverable fraction dropping from about ninety-eight to ninety per cent. The optimum sits on the broken side, close to but not at the exceptional point.
arXiv·2026-10-06·J. Czarnecki et al.
No generated summary available for this entry.
overview
Original abstract
We propose a microscopic mechanism for the negative charging energy in LaAlO$_3$/SrTiO$_3$ quantum dots, arising from the electrostatic image charge associated with the paraelectric response of SrTiO$_3$. Using a self-consistent configuration-interaction approach that accounts for both Coulomb repulsion and image-charge interactions, we find a robust regime of electron pairing whose strength is tunable through the confinement potential and the effective image-charge distance, set by the thickness of the interfacial two-dimensional electron gas. Our results establish dielectric image-charge effects as a route to controllable electron pairing in oxide quantum dots and other materials with a strong dielectric response.
arXiv·2026-10-06·Wangjun Lu
No generated summary available for this entry.
overview
Original abstract
A ruler reads an unknown length against a calibrated scale. The quantum data ruler reads a matrix element of an unknown state against the signal of a known reference, from their ratio. It is exact for any Hamiltonian and any time, since transition operators change by a state-dependent constant times one function of time, removing the vanishing-signal limit. The readout is unbiased under dephasing and amplitude damping, and recovers the coherent ergotropy of a quantum battery that two-point measurement erases. The structure survives the classical limit as action--angle Fourier modes.
arXiv·2026-10-06·Xuan Tang, Z. Y. Ou
No generated summary available for this entry.
overview
Original abstract
Quantum telescopy, proposed by Grottesman et al., uses spatially entangled single-photon states to modify HBT stellar interferometry, potentially surpassing Michelson interferometry in resolution without baseline limits. However, finite source bandwidth, non-unit efficiency, detector response times, and celestial light bandwidth all affect its effectiveness. In this work, we consider a spatially entangled singe-photon state generated by beam-splitting a practical anti-bunched photon source from resonance fluorescence, which is a common method of generating single-photon states, and evaluate the signal level in quantum telescopy with inclusion of imperfection of detection system and finite bandwidth of celestial light. Here, given the incoming light, we optimize the parameters of the anti-bunched photon source and the detector system for the best signal-to-noise ratio (SNR), which can match that of the Michelson method in the ideal case but is always smaller in the realistic case. Alternatively, weak coherent states from heavily attenuated lasers can replace the entangled single-photon state but suffer low signal level, similar to HBT method. We find that the SNR with a realistic anti-bunched source for producing the reference fields can still beat the SNR of the coherent state scheme in the weak incoming field limit. The optimized parameters for the anti-bunched source and detection system will be a guide for future experimental endeavor.
arXiv·2026-10-06·Shunichiro Kinoshita et al.
No generated summary available for this entry.
overview
Original abstract
We show that Hawking radiation spontaneously generated by dynamical black-hole formation can be realized in a local quantum spin model. Starting from the ground state corresponding to the early-time vacuum, with no initially prepared excitations, we follow the dynamics induced by the evolving geometry. In the corresponding continuum quantum field theory, Hawking particle creation is associated with nontrivial Bogoliubov mixing between the in- and out-mode decompositions. We derive the resulting renormalized local energy density in the continuum quantum field theory, which corresponds to an energy-weighted integral of the Hawking spectrum, and identify its counterpart as a local spin observable whose expectation value quantitatively reproduces the continuum prediction, including its dependence on the surface gravity. The agreement persists over a finite time window whose duration grows logarithmically with system size, revealing the crossover from universal continuum Hawking physics to lattice-cutoff dynamics. These results establish a microscopic route to quantum simulation of quantum field theory in curved spacetime, connecting field-theoretic particle creation directly to experimentally accessible many-body observables.
arXiv·2026-10-06·Ye Zhou, Daniel Keren
No generated summary available for this entry.
overview
Original abstract
The eigenstate quantum-mechanical bootstrap can converge to the physical moment set while remaining nonexact at every finite order. We prove this for a one-dimensional quasi-exactly solvable sextic oscillator at explicitly known eigenvalues, including excited levels. At every finite order, the lower and upper bounds on $u^2$ remain strictly below and above its physical value, even after adjoining arbitrary finite polynomial Gram tests and all eigenstate-annihilator relations visible in the retained moment space. Hence neither side of the centered observable admits a finite sum-of-squares certificate modulo the eigenstate annihilator. The gap persists under any finite set of additional localizing constraints whose weights are strictly positive on polynomial vectors. We then prove convergence for polynomial Schrödinger operators satisfying explicit sum-of-squares confinement and derivative bounds. The eigenstate relations give moment estimates uniform in the truncation order; these yield a regular Schrödinger representation supported on the prescribed eigenspace. Finally, a four-mode extension combines this fixed-observable obstruction with feasible position moments having no positive representing measure at every finite order. At level three, this construction yields nonphysical feasible points with strictly positive definite moment matrices.
arXiv·2026-10-06·Leonardo A. Navarro-Labastida, Gerardo G. Naumis
No generated summary available for this entry.
overview
Original abstract
At a discrete set of ``magic'' twist angles, twisted bilayer graphene develops two bands at charge neutrality that are almost perfectly flat. We present a unified theory of this phenomenon within the chiral continuum model. The central object is the square of the chiral Hamiltonian, a $2\times2$ Schrödinger operator for an electron moving in a non-Abelian $SU(2)$ pseudo-magnetic field generated by the interlayer tunneling. From it we derive an energy sum rule in which the interlayer coupling splits into a bounded overlap channel and an unbounded current channel; their different scaling with the coupling $α$ explains why the first magic angle is qualitatively different from the rest. The asymptotic rule $α_{m+1}-α_m\to3/2$ follows from a rescaling of the moiré potential together with its three-cell magnetic periodicity, with the two parity families of zero modes each repeating with period $3$ and interleaved with each other. Near the AA point the zero-mode problem becomes a lowest-Landau-level problem in an effective field $B_{\rm eff}=3α$, so that the high-order zero modes are coherent Landau states of width $1/\sqrt{3α}$ whose guiding centres converge to $\pm(π/3) q_μ$, with kinetic and confinement energies in equipartition. Deforming the coupling into an Abelian one removes the magic-angle sequence, which shows that the non-Abelian structure is essential. Between consecutive magic angles, band inversions at $Γ$ and $M$ produce phases with Chern numbers $C=\pm2$, and the quantum metric reaches a sharp maximum at $θ\approx0.43^\circ$, identifying a promising regime for correlated and topological phases beyond the first magic angle.
arXiv·2026-10-06·Nils Herrmann et al.
No generated summary available for this entry.
overview
Original abstract
Fragment molecular orbital (FMO) quantum chemistry offers a natural route to parallel quantum computing: large molecular calculations can be decomposed into smaller quantum subproblems that can, in principle, run concurrently. Their practical benefit on real quantum hardware, however, has remained unclear. We demonstrate parallel FMO calculations on three room-temperature diamond-based 'Quoll' quantum computers installed on-site at the Oak Ridge Leadership Computing Facility. Helium clusters (He$_{n}$, $n=2,4,8,10,14$) served as a testbed for total energy calculations using the Quantum Wave Function Sampler (QWFS), a selected configuration interaction (SCI) approach. We compare two execution modes: synchronous shot-parallel execution, in which quantum processors jointly sample QWFS circuits and combine their SPAM-corrected counts into a single probability distribution; and asynchronous fragment-parallel execution, in which processors independently evaluate FMO fragments using device-specific optimized circuits. Both modes increase quantum sampling throughput without systematic loss of accuracy. The three-QPU shot-parallel workflow reaches a parallel efficiency of $93.60\%$, while the fragment-parallel workflow achieves a measured efficiency of $75.01\%$, increasing to $95.17\%$ when excluding the non-useful idle time associated with non-interruptible submitted jobs. In both cases, the assembled FMO-QWFS energies remain chemically accurate compared to the classical ideal. These results provide a proof-of-concept demonstration that parallel quantum execution can improve the practical throughput of quantum chemistry workflows on prototype hardware, motivating the development of future HPC environments with many fault-tolerant quantum processors operating as a distributed resource for molecular and materials simulation.
arXiv·2026-10-06·Yu Wang
No generated summary available for this entry.
overview
Original abstract
Finding useful variational quantum circuits requires more than representational capacity: training must also have access to directions that improve the objective. We study how discrete CNOT routing shapes both capacity and local accessibility. For circuits built from CNOT and arbitrary one-qubit gates, we separate binary routing matrices from continuous rotations to relate global capacity to local tangent accessibility. An exact finite-field formula for the operator Schmidt rank of a CNOT block and cumulative multiblock bounds yield capacity constraints and a Bell-pair fidelity obstruction. Locally, routing propagates generators into a routing-dependent tangent space, so all parameter gradients can vanish even when the ambient objective gradient is nonzero; frame bounds distinguish loss of gradient coverage from poor conditioning. A routing-conditioned identity insertion preserves the current unitary, state, loss, and existing gradients while adding new tangent directions. Candidate-only and incremental projection scores provide local criteria for ranking insertions. Exact-statevector tests show strong short-horizon score-descent correlations on controlled Bell tasks and effective equal-cost selection on connected Heisenberg chains up to twelve qubits, with complementary TFIM selector controls. A broader TFIM routing ensemble exhibits routing-dependent near-stagnation. Together, these results connect representational capacity, local accessibility, and same-point repair through a common discrete routing description. An architecture need not remain fixed during training: task-dependent geometric information can guide the opening of new descent directions while preserving the learned circuit at insertion. This provides a concrete local approach to a broader problem: how useful quantum circuits can be discovered from the information a task supplies.
arXiv·2026-10-06·Alexader S. Ivlev et al.
No generated summary available for this entry.
overview
Original abstract
Fault-tolerant quantum computation requires increasing the qubit count while maintaining high performance and connectivity. Semiconductor qubits have demonstrated high-fidelity operation, but growing the system size at sufficient connectivity remains challenging, such that scaling mainly occurred in one spatial direction to preserve access for control lines in the other. Here, we realise an approach that relaxes the requirements on fabrication and demonstrate a 6$\times$6 quantum dot array, defined by a shared barrier gate and individual plunger gates. The quantum dots are tuned through coherent spin shuttling over distances up to 5.2um into a sparse configuration of 10 simultaneously operated qubits, leaving space for shuttling connections. We reduce crosstalk by 42$\times$ in this separated regime, enabling high-fidelity simultaneous single-qubit control, while control-Z operations can be implemented through shuttling and plunger-only control. These results promise high-connectivity quantum circuits, enabled by scaling to two-dimensional geometries and exploiting shuttling.
arXiv·2026-10-06·Lu Qi et al.
No generated summary available for this entry.
overview
Original abstract
Dipole-phonon quantum logic (DPQL) offers novel approaches for state preparation, measurement, and control of quantum information in molecular ion qubits. Here we report the first experimental demonstration of DPQL as a spectroscopic tool using the shared motional mode of a CaO$^+$-Ca$^+$ ion chain to measure the frequency splitting of the ground $Ω$-doublet of CaO$^+$. By comparing the dipole-phonon signal across three trap-frequency ramp ranges, we determine the splitting to be $ω_{mol}=2π\times454\pm1$ kHz and place a lower bound on the effective dipole-phonon coupling. The rate of observation is limited by the low thermal population in the molecular ground rotational state.
arXiv·2026-10-06·Giorgio Vimercati, Nicola Piovella
No generated summary available for this entry.
overview
Original abstract
Subradiant states of a finite subwavelength atomic chain in free space offer a powerful resource for photon storage. Yet their preparation and control remain challenging experimentally. A standard technique is to drive the atoms by a laser and observe the florescence light of the long-lived subradiant modes of excitation after the laser is switched off. However, these modes are highly degenerate and form an almost continuous band in the subradiant manifold. Here we propose a new method of exciting a given subradiant state by coupling atoms to a surface plasmon wave propagating along the interface with a metallic film. By controlling the chain/surface distance we may load, store and release photons in the atoms, making them a promising tool for future quantum memories.
arXiv·2026-10-06·Tran P. H Don, Lan Nguyen Tran, Le Bin Ho
No generated summary available for this entry.
overview
Original abstract
Quantum Darwinism explains classical objectivity through redundant environmental records of a system's pointer states. We show that these records can be established through an intermediate measurement apparatus without direct system--environment interactions. Using exact analytical solutions of quantum circuit models, we compare system monitoring with apparatus monitoring, where the environment interacts only with the apparatus. During encoding, system--apparatus correlations decrease as system--environment correlations grow. Without noise, both models yield identical accessible pointer information and redundancy, while the discord accounts for their different mutual information. The reliability of these records depends on where noise acts. Apparatus bit flips introduce errors shared by successive records, limiting the information recoverable even from the complete environment. In contrast, larger fragments can mitigate independent noise on environment qubits after encoding. Dephasing in the pointer basis leaves the record information unchanged in the model considered. These results extend the description of quantum Darwinism to indirect measurements and clarify the conditions for reliable environmental records.
Quantum Computing Report·2026-10-05·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
D-Wave Quantum Inc. has partnered with the University of Arkansas's Supply Chain Management Research Center to create the Quantum Supply Chain Initiative Support Fund. This collaboration aims to advance quantum optimization tools for global supply chains, focusing on complex logistics and operations challenges. The initiative will leverage quantum annealing and hybrid quantum-classical solvers to address issues like dynamic transportation routing and real-time decision-making during supply chain disruptions. The post D-Wave Partners with University of Arkansas to Establish Quantum Supply Chain Initiative appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-05·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief DecaQ announced Cloud Beta 2, which it says supports 400 logical digital qubits, six quantum algorithm families and up to 200,000 digital oracle gates on general-purpose hardware. The platform uses a Digital Quantum Oracle to run supported workloads without physical qubits or quantum processors, offering oracle evaluation, phase estimation, energy estimation and optimization capabilities. Researchers, developers and enterprise R&D teams can request beta access, with reference workloads covering local-field energy, encoded delay readout and wireless-channel partitioning. PRESS RELEASE — DecaQ today announced the availability of DecaQ Cloud Beta 2, bringing 400 logical digital qubits, six quantum algorithm families, and up to 200,000 digital oracle gates to its cloud platform. DecaQ is deterministic digital quantum computation powered by a Digital Quantum Oracle. Supported workloads run on general-purpose hardware without physical qubits, a quantum processing unit (QPU), or quantum hardware noise. The platform is not a quantum simulator, a state-vector simulator, or a tensor-network simulator. Cloud Beta 2 brings together oracle evaluation, phase estimation, and energy and optimization capabilities in a single cloud platform for researchers, developers, and enterprise R&D teams. Six Families, Three Areas of Capability Oracle evaluation: Bernstein–Vazirani (BV) and Deutsch–Jozsa (DJ) support parity-mask identification and function classification, providing capabilities for examining oracle logic, parity relationships, and constant-versus-balanced function behavior. Phase estimation: Iterative Phase Estimation (IPE) and Quantum Phase Estimation (QPE) provide sequential phase-bit and phase-word readout, supporting the investigation of phase information and eigenvalue-related properties in supported models. Energy and optimization: The Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization Algorithm (QAOA) support local-ener
Phys.org Quantum Physics·2026-10-05
No generated summary available for this entry.
overview
Original abstract
Many complex quantum systems rapidly lose the recognizable patterns of their initial states as their components interact. To describe patterns of regular and chaotic motion in specific systems, physicists can construct a mathematical map called an effective phase space.
The Quantum Insider·2026-10-05·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief planqc won the Commercialising category at the Made in Europe Award 2026 for its work developing and commercializing quantum computing technology in Europe. planqc is building a 100-qubit neutral-atom quantum computer for DLR and a 1,000-qubit system for LRZ, with both systems expected to come online in 2027. The company is developing quantum computing applications with partners including Airbus, ESA, BMW and Fraunhofer while maintaining research, engineering and supply-chain activities in Europe. PRESS RELEASE — planqc has been honored at the Made in Europe Award 2026 in the Commercialising category, presented last night in Berlin by Thomas Jarzombek, Parliamentary State Secretary at the Federal Ministry for Digital Affairs and State Modernisation. The award recognizes planqc’s work for Europe: turning fundamental research into products and technological excellence, ushering in the next era of computing, and keeping that capability sovereign on European ground. Europe doesn’t need to import the next era of computing. It can build it. We turn fundamental research into quantum computers and put them to use for European industry and science. This award shows that a sovereign European path in quantum technology is not just possible, it is already underway. Dr. Alexander Glätzle, CEO and Co-Founder of planqc planqc ‘s first machines are taking shape. For the German Aerospace Center (DLR), planqc is building a 100-qubit neutral-atom quantum computer; for the Leibniz Supercomputing Centre (LRZ), a 1,000-qubit system that runs as a co-processor within its HPC infrastructure. Both are due to come online next year, and the first hardware for the LRZ system arrived earlier this month. Just as important is the path into real use: through partnerships with companies such as Airbus, ESA, BMW and Fraunhofer, planqc is already developing the applications these systems will run. Industry and science are the ones who will ultimately put quantum
Quantum Computing Report·2026-10-05·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
QNu Labs, BISAG-N, and IIT Gandhinagar successfully conducted India's first 5.56 km free-space Quantum Key Distribution (QKD) link. This trial, utilizing QNu Labs' PAT optical system, achieved a secure key rate of 230–260 bps and integrated with BISAG-N's Vedic Kavach platform for enhanced security. This breakthrough establishes a baseline for future multi-node optical mesh networks and satellite-to-ground quantum communications. The post QNu Labs, BISAG-N, and IIT Gandhinagar Demonstrate India’s First 5.56 km Free-Space QKD Link appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-05·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Leaders from across classical and quantum computing met to accelerate the path to fault tolerant quantum computing and integration with high performance computing and AI infrastructures. The second QDA highlighted the fast approaching horizon of commercial use of quantum computers, with examples of partnerships and deployments today. Speakers from NVIDIA , IBM , Coherent , Equinix , Quantinuum , Atom Computing , DSIT, Nu Quantum , and more presented lessons learned from real world commercial deployments and projects and discussed outstanding challenges. Image: Panel for Where Are We Today: QPU-HPC Deployments (Nick Beard) PRESS RELEASE — The second international Quantum Datacenter Alliance (QDA) Forum highlighted the progress towards commercial deployments and acceleration of distributed quantum computing architectures, while also outlining the next critical areas of focus for progress. At the iconic Battersea Power Station, London, the QDA brought together technical, business, and government leaders to address one of the most pressing technical and ecosystem challenges: how to integrate emerging quantum hardware into existing and future data center infrastructure. The agenda explored how quantum systems are moving from lab-scale demonstrations toward commercial deployment, highlighting that system level architecture, control, error correction, interoperability and power consumption have become as critical as the qubits themselves. Attendees also emphasised the importance of open sharing, interoperability, and collective thinking about the direction and future uses of quantum technologies. Dr. Carmen Palacios-Berraquero, Founder and CEO of Nu Quantum said, “As quantum computing moves towards large-scale utility, collaboration becomes critical. The QDA brings the industry together to tackle the shared challenges of building quantum computing as infrastructure — scalable, interoperable, reliable and efficient — and ultimately making quantum compute
The Quantum Insider·2026-10-05·Resonance
No generated summary available for this entry.
overview
Original abstract
The Quantum Insider joined more than 2,500 participants in Berlin for Bitkom’s AI, Data & Quantum Summit, where AI kept turning up inside quantum. Berlin became the meeting point for Europe’s AI and quantum communities on 22 and 23 September, when Bitkom’s AI, Data & Quantum Summit (AIDAQ) returned to the bcc Berlin Congress Center. The 2026 edition brought together more than 2,500 participants, 220 speakers and 140 sessions across four stages, workshops, masterclasses and startup pitches, under the patronage of Germany’s Federal Ministry of Research, Technology and Space. The organisers framed both days around one question: how can technological potential be turned into real economic and societal impact? We were pleasantly surprised that quantum’s answer to that question came up in more sessions, and from more kinds of organisations, than we expected. AI is already doing work for quantum The biggest surprise of the summit was how much of the quantum progress on show depended on AI. “AI & Quantum Synergies” was the most common session label on the day-one programme, and the theme kept returning to the stage. NVIDIA’s Dr Kevin Mato spoke on scaling quantum computing with AI supercomputing, in a fault-tolerance block alongside Quantinuum and Leibniz University Hannover, while Leibniz-Rechenzentrum covered telemetry for running quantum systems inside HPC centres. Security was where the overlap felt most urgent. Bundesdruckerei’s Dr Wadim Wormsbecher presented work on AI swarms that halved the quantum resources needed to break ECDSA, which brings Q-Day closer and leaves post-quantum migration plans less wiggle room. Google’s Dr Thomas Pöppelmann and evolutionQ CEO Dr Michele Mosca followed on post-quantum cryptography and cryptographic resilience. Germany’s quantum ecosystem showed its depth German organisations covered the full quantum stack in Berlin. Research came from Forschungszentrum Jül
Quantum Computing Report·2026-10-05·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Quantinuum and The University of Western Australia (UWA) have partnered to advance Australia's quantum-AI-HPC ecosystem. This collaboration grants UWA access to Quantinuum's 98-qubit Helios trapped-ion system and focuses on co-designing hybrid workflows for critical Australian sectors like minerals, energy, agriculture, and healthcare. The agreement also includes plans for a university-wide quantum computing applications center and workforce development through Quantinuum's global Q-Net network. The post Quantinuum and The University of Western Australia Partner to Advance Australia’s Hybrid Quantum-AI-HPC Ecosystem appeared first on Quantum Computing Report .
Nature: Quantum Information·2026-10-05
No generated summary available for this entry.
overview
The Quantum Insider·2026-10-05·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Quantinuum and the University of Western Australia signed an MOU to expand access to quantum computing, develop quantum talent and explore practical quantum applications in Australia. UWA researchers, students and entrepreneurs will gain cloud-based access to Quantinuum ’s quantum computing platform, including its Helios system. The organisations will explore a university-wide quantum computing applications centre focused on use cases across critical minerals, energy, agriculture and healthcare. PRESS RELEASE — Quantinuum (NASDAQ: QNT ), a leading quantum computing company, today announced the signing of a Memorandum of Understanding (MOU) with The University of Western Australia (UWA) to advance Australia’s quantum capability by expanding access to advanced quantum computing, developing quantum talent, and accelerating the development of practical applications that integrate quantum computing, AI, and high-performance computing (HPC). Through the collaboration, UWA-affiliated researchers, students, and entrepreneurs will gain cloud-based access to Quantinuum ‘s full-stack quantum computing platform, including Helios, the company’s latest-generation quantum computer. The partnership is designed to provide hands-on experience with advanced quantum technologies while creating new opportunities to explore how quantum computing, artificial intelligence, and high-performance computing can work together to address complex real-world challenges. The organisations will also explore opportunities to expand UWA’s Quantum and AI research ecosystem through a university-wide quantum computing applications centre that would bring together academic, industry, and government stakeholders to identify and develop high-value use cases in critical sectors for Australia’s economy, including critical minerals, energy, agriculture, and healthcare. “Australia has set an ambitious vision for quantum, and it is making meaningful pr
The Quantum Insider·2026-10-05·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Contrivian has launched Contrivian Government Solutions, a division focused on secure, mission-critical connectivity for US federal and defense customers. The division combines multi-network connectivity with government-specific service models, including post-quantum-ready encryption across satellite and terrestrial networks. Contrivian Government Solutions initially targets the US federal market and is developing additional cybersecurity capabilities for government and defense environments. PRESS RELEASE — Contrivian, a technology company providing intelligent mission-critical connectivity, has launched Contrivian Government Solutions, a dedicated division focused on delivering secure, mission-critical connectivity for US federal agencies and defense organizations. The division has been established in response to growing interest from defense and other federal customers following the launch of Contrivian Constellation, its multi-constellation LEO solution. The new division addresses the distinct requirements of federal and defense customers, including different service models, procurement requirements and heightened security considerations. While Contrivian already supports state and local government organizations across emergency response communications, federal customers require a different approach, particularly in defense-related environments. This includes post-quantum-ready encryption over active-active satellite and terrestrial networks, designed for distributed operations in denied, degraded and disrupted environments. Contrivian Government Solutions provides federal customers with access to the company’s multi-network connectivity capabilities alongside government-specific service models and support. The division is initially focused on the US federal market, with particular emphasis on defense-related requirements. “Federal customers operate in environments where connectivity cannot be allowed to bec
The Quantum Insider·2026-10-05·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief planqc and the LOGIQC consortium have been selected as one of six consortia competing in Germany’s Quantum Computing Competition to advance error-corrected quantum computing. LOGIQC, coordinated by planqc , will develop an error-corrected quantum computer based on neutral ytterbium atoms with partners including MPQ, LMU, the University of Tübingen , Forschungszentrum Jülich and TOPTICA Photonics. The competition plans up to €640 million in funding and requires selected consortia to meet technical entry criteria by March 31, 2027, before further selection after 30 months. PRESS RELEASE — planqc and the LOGIQC consortium have been selected as one of six consortia to compete in Germany’s Quantum Computing Competition (QCC). The QCC is a major initiative of the Federal Ministry of Research, Technology and Space (BMFTR) to advance error-corrected quantum computing in Germany. With up to €640 million in funding planned, the competition aims to advance different technological approaches towards at least two error-corrected quantum computers at the European technological frontier by 2030 and make them accessible for industrial applications. The six selected consortia span three technology platforms: neutral atoms, trapped ions and superconducting circuits, with two consortia selected for each approach. Building An Error-Corrected Quantum Computer with Neutral Atoms LOGIQC – Logical Operations, Gates and Infrastructure for Quantum Computing – is coordinated by planqc and has its roots in the Munich Quantum Valley. The consortium brings together leading research and industry partners, including the Max Planck Institute of Quantum Optics (MPQ), Ludwig Maximilian University of Munich (LMU), the University of Tübingen , Forschungszentrum Jülich (FZJ), and TOPTICA Photonics. “The selection of LOGIQC is a strong validation of our technological approach and the capabilities of the entire consortium.” Dr. Sebastian Blatt, Co-Founder and CTO of planqc The project
Quantum Computing Report·2026-10-05·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Germany's Federal Ministry of Research, Technology and Space (BMFTR) is investing €640 million in a quantum computing competition to develop fault-tolerant quantum processing units by 2030. Six consortia, two each in neutral atoms, trapped ions, and superconducting circuits, have been selected. Notable projects include LOGIQC, led by planqc, focusing on neutral ytterbium atoms, and NFQC-1k, led by AQT Germany, developing a trapped-ion microtrap system with a €122 million budget. The post Germany Advances Key Consortia in €640 Million ($717.2 Million USD) Fault-Tolerant Quantum Computing Competition appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-05·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief WISeSat.Space, a sister company of SEALSQ , completed its business combination with Columbus Acquisition Corp. and began trading on Nasdaq under the ticker SAIQ on October 2, 2026. The transaction establishes WISeSat.Space as a separately listed company focused on post-quantum-secure satellite communications and IoT connectivity. WISeSat.Space plans to combine satellite communications with digital identity, secure semiconductors and post-quantum technologies for connected devices and other applications. PRESS RELEASE — SEALSQ Corp (NASDAQ: LAES) (“ SEALSQ ” or “Company”), a company that focuses on developing and selling Semiconductors, PKI, and Post-Quantum technology hardware and software products, today announced that its sister company, WISeSat.Space Holdings Corp. (“WISeSat.Space”) (Nasdaq: SAIQ), as space technology company and a subsidiary of WISeQey Corp. (formerly known as WISeKey International Holding AG, “WISeQey”) (SIX: WIHN; Nasdaq: WKEY), a global quantum cybersecurity and space IoT company, has completed its previously announced business combination with Columbus Acquisition Corp. (“CAC”). Effective today, October 2, 2026, WISeSat.Space ordinary shares have commenced trading on the Nasdaq Capital Market under the ticker symbol “SAIQ.” The completion of the transaction establishes WISeSat.Space as a separately listed public company focused on post-quantum-secure satellite communications and Internet of Things connectivity. CAC shareholders approved the business combination at an extraordinary general meeting on September 30, 2026, and the transaction closed on October 1, 2026. The Nasdaq listing supports WISeSat.Space’s ambition to expand its space infrastructure while leveraging WISeQey’s expertise in cybersecurity, digital identity and secure semiconductors. WISeSat.Space aims to extend trusted connectivity beyond terrestrial networks, enabling connected devices to communicate securely through satellite infr
Quantum Computing Report·2026-10-05·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
The Midwest Quantum Collaboratory (MQC) has expanded to include UIC, Northwestern, Indiana University, Washington University in St. Louis, and The Ohio State University, bringing its total to eight universities focused on quantum research and development. The post Midwest Quantum Collaboratory Expands to Eight Universities with Addition of UIC, Northwestern, and Regional Partners appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-05·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief D-Wave and the University of Arkansas’ Supply Chain Management Research Center are collaborating on quantum computing research for complex supply chain problems. The collaboration establishes the Quantum Supply Chain Initiative Support Fund to support research, education and industry engagement across retail, transportation and national defense. The initiative will explore quantum optimization for routing, logistics network design, inventory allocation, scheduling and supply chain decisions under disruption. PRESS RELEASE — D-Wave Quantum Inc. (NASDAQ: QBTS) (“ D-Wave ”), the only dual-platform quantum computing company providing annealing and gate-model systems, software and services, and the Supply Chain Management Research Center in the Sam M. Walton College of Business at the University of Arkansas ( SCMRC ) today announced a collaboration to explore quantum computing’s impact on complex supply chain problems. The collaboration establishes the Quantum Supply Chain Initiative Support Fund with the SCMRC, which is intended to advance thought leadership, education and independent research focused on the application of quantum computing to supply chain management across retail, transportation and national defense. In addition, D-Wave has joined the partnership program of the SCMRC, which currently has more than 25 industry partners. Supply chain decision-making often requires organizations to coordinate routes, inventory, facilities, schedules and workforce while balancing cost, speed, service and resilience. As these networks become more complex and disruptions become more consequential, quantum and hybrid-quantum computing approaches are emerging to complement established methods. Announced during CSCMP EDGE 2026, a leading conference and exhibition hosted by the Council of Supply Chain Management Professionals, the collaboration between D-Wave and the SCMRC will explore foundational and applied research in quantum optimization for a variety of
The Quantum Insider·2026-10-05·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Researchers from the Fermilab-led SQMS Center identified material and fabrication features associated with variations in superconducting qubit performance. The study examined 22 superconducting transmon qubits using seven materials-characterization techniques alongside quantum coherence measurements. Researchers identified oxide thickness, etched sidewall angles and trench depth as key features linked to performance differences, with the three factors accounting for up to a twofold variation among the studied qubits. This story is based directly on reporting published by Fermilab on the SQMS study. PRESS RELEASE — Understanding why some superconducting qubits outperform others remains one of the most important challenges in quantum computing. As long as the quantum state in a qubit maintains its coherence and does not decay, information can be held and potentially processed in advanced calculations far beyond the capabilities of current computers. “Advancing quantum information science is fundamentally tied to our ability to control matter at the atomic level.” Bindu Nair, U.S. Department of Energy While over the past decade researchers have identified many possible coherence-limiting defects in the materials used to make the qubits, establishing which microscopic features explain why identically designed qubits may perform differently has remained a challenge. Now, researchers from the Fermi National Accelerator Laboratory-led Superconducting Quantum Materials and Systems Center, or SQMS, have completed one of the most comprehensive studies ever conducted, linking materials and their structures — including surfaces, interfaces and geometries — to variations in quantum device performance. This research provides new insights that directly connect to device fabrication, an important step on the path toward building practical and reliable quantum computers. In a large-scale study involving Fermilab , Northwestern University, Rigetti Computing, Ames
PRX Quantum
·2026-10-05
·Anonymous
·doi
No generated summary available for this entry.
overview
Quantum Science and Technology
·2026-10-05
·Sung Won Yun, Thi Ha Kyaw, Joonwoo Bae
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract In this work, we present constructions of quantum circuits to implement general measurements on quantum hardware. Firstly, we investigate a quantum circuit ansatz by following the Naimark extension with a universal set of gates, such as controlled-NOT and single-qubit gates; we call it a {\it Naimark measurement}. We present a circuit ansatz framed by the Naimark extension, leaving single-qubit gates with parameters, and apply a classical optimizer to determine their parameters to approximate a desired quantum measurement. Secondly, we relax the Naimark measurement with quantum neural-network (QNN) circuits, employing parameterized quantum circuits. We present hybrid Naimark-QNN measurements by incorporating QNN circuits into Naimark measurements. Thirdly, we also consider fully QNN measurements with shallow parameterized circuits. Then, we compare the constructed measurement circuits, Naimark, hybrid Naimark-QNN, and fully QNN measurements, for strategies of state discrimination, such as minimum-error and maximum-confidence measurements. We demonstrate that QNN circuits can efficiently and effectively achieve near-optimal quantum measurements with fewer training iterations.
arXiv·2026-10-05·Quentin Pitteloud, Jacopo Masotti, Luca Frediani
No generated summary available for this entry.
overview
Original abstract
We present a method to obtain the proven exact 2-component (X2C) method, normally applied to Gaussian-type fixed Hilbert bases, in an adaptative non-uniform grid basis of the Hilbert space, namely Multiwavelets. The X2C method manages to block-diagonalise the Dirac Hamiltonian restricted to the subspace of the basis, in an energy-independent manner. The method takes inspiration from the success of the atomic mean-field X2C method on the Gaussian bases to represent the coupling operator as a projector onto the small components of the eigenstates of the constituent atoms of the system.
arXiv·2026-10-05·Sarai Dery Folkestad, Henrik Koch
No generated summary available for this entry.
overview
Original abstract
We introduce a simple coupled cluster approach for multireference and open-shell systems. In the restricted active space coupled cluster framework, the cluster operator only includes excitations from doubly occupied to virtual orbitals, and this ensures the individual operators commute among each other. The ground and excited states are obtained by diagonalisation of the coupled cluster similarity transformed Hamiltonian in a restricted active space. We demonstrate the framework for the RAS-CCSD model, where single and double excitations are included in the cluster operator, and likewise for a complete active space. We consider systems with multireference character and open-shell systems in a spin-adapted manner. The approach captures significantly more dynamical correlation than without the coupled cluster similarity transformation.
arXiv·2026-10-05·Shirabe Endo, Yuta Hamada
No generated summary available for this entry.
overview
Original abstract
We study quantum algorithms for finding a vacuum with a small cosmological constant in the toy model for string Landscape proposed by Arkani-Hamed, Dimopoulos, and Kachru. First, we construct a function-value oracle and use it for Grover search with query complexity $\mathcal{O}(2^{N/2})$, where $N$ is the number of scalar fields. Then, we point out that, by exploiting the linearity of the vacuum energy, the problem can be reduced to a collision problem between two blocks of the bit string. With this structure, we construct two quantum algorithms with query complexity $\mathcal{O}(2^{N/3})$. Compared with the pseudo-polynomial classical algorithm of Denef and Douglas, the quantum algorithms yield a large reduction in computational cost for the physically motivated parameter values.
arXiv·2026-10-05·Seunghyun Park et al.
No generated summary available for this entry.
overview
Original abstract
Twisted van der Waals (vdW) systems provide a powerful platform for exploring emergent correlated phenomena, including superconductivity, magnetism, and topological phases. The twist angle offers a continuous tuning parameter for modifying the underlying Hamiltonian, however, precise and reproducible control remains challenging. Existing approaches are limited by single-use device architectures, restricted angular precision, or vertical probing geometries. Here we introduce a reconfigurable graphene-based moiré platform in which two independently fabricated layers are mechanically assembled and rotated in situ using a micro-electromechanical system (MEMS). Raman spectroscopy confirms the formation and robustness of the twist-induced moiré potential and enables continuous, deterministic control of the twist angle. The moiré potential folds the electronic band structure and activates the longitudinal optical (LO) phonon mode, allowing us to map its dispersion and directly visualize the moiré momentum. Angle-dependent electronic band hybridization is resolved through the evolution of the double-resonant 2D mode. Near \(0^\circ\), an emergent asymmetry of the \(Γ\)-point G-mode phonon reveals phonon band folding and hybridization driven by the moiré superlattice potential and interlayer relaxation. Our platform provides a reproducible Raman reference for twisted bilayer graphene while eliminating device-to-device variability. More broadly, it establishes the twist angle as a deterministically controllable parameter for systematic studies of correlated and topological phenomena in moiré quantum materials.
arXiv·2026-10-05·Sougato Bose et al.
No generated summary available for this entry.
overview
Original abstract
In this white paper, we highlight the importance of the ($1-10~{\rm Hz}$) frequency range for laboratory tests of the quantum nature of gravity using the quantum gravity-induced entanglement of masses (QGEM) protocol. QGEM requires matter-wave interferometers with masses ($m\sim10^{-15}-10^{-14}~{\rm kg}$), brought within separations ($d\sim30-50~μ{\rm m}$), while maintaining spatial superpositions of ($1-20~μ{\rm m}$) and coherence for ($τ\sim 0.1 - 1~{\rm s}$). These requirements make low-frequency environmental noise a central experimental challenge and place QGEM in a regime closely related to the low-frequency goals of the Einstein Telescope (ET) and the Cosmic Explorer (CE). In particular, QGEM is sensitive to relative acceleration noise (RAN) and to gravity-gradient noise (GGN) generated by seismic and other environmental mass-density fluctuations. For representative parameters $m=10^{-14}~{\rm kg}$, $Δx=10~μ{\rm m}$, and $τ=1~{\rm s}$, the differential acceleration-noise amplitude spectral density must be suppressed well below the $10^{-15}~{\rm m\,s^{-2}/\sqrt{Hz}}$ level to keep acceleration-induced dephasing below the relevant experimental scale. Achieving this level of low-frequency noise suppression is therefore a key requirement for QGEM and closely parallels the seismic and gravity-gradient noise challenges that ET and CE address.
arXiv·2026-10-05·HRL Quantum Team et al.
No generated summary available for this entry.
overview
Original abstract
Exchange-only quantum computing benefits from high fidelity and straightforward control afforded by the exchange interaction. However, independently controllable qubits must be encoded into subsystems of at least three electron spins, restricting computation to only a fraction of the available spin Hilbert space. The remaining states are treated as leakage and used only transiently in gate sequences. By contrast, a quantitative, system-wide measure of exchange-only performance can exploit the full available Hilbert space, including states conventionally treated as leakage. Here, we apply this approach to arrays of up to 48 electron spins, accessing a total-spin-zero Hilbert space with dimension exceeding $2^{40}$. Measurements of out-of-time-order correlators (OTOCs) reveal rich scrambling dynamics and demonstrate access to regimes relevant to quantum computational advantage. Using generalized forms of cross-entropy and mirror randomized benchmarking, we also assess the aggregate performance of the full exchange-only system per fundamental two-body interaction: the two-spin exchange. We obtain an effective system-level error of $3 \times 10^{-4}$ per exchange, incorporating the complete experimental control sequence and all associated noise sources. This value is up to an order of magnitude lower than those reported from comparable benchmarks on other platforms at the time of writing.
arXiv·2026-10-05·Gastón F. Scialchi, Augusto J. Roncaglia, Diego A. Wisniacki
No generated summary available for this entry.
overview
Original abstract
In recent years, Krylov space approaches have emerged as a useful framework for characterizing dynamical chaos in a wide variety of physical systems. However, the connection between Krylov dynamics and the established structures of classical chaos remains largely unexplored. Classical chaos is characterized by exponential stretching and mixing. For quantum maps with a classical limit, we show that these two signatures are encoded in different structures within Krylov space: stretching is encoded in the geometry of the Krylov operators as determined by the Lyapunov exponent, while mixing manifests itself as an exponential decay of the Arnoldi sequences in agreement with the Ruelle-Pollicott resonances.
arXiv·2026-10-05·Arka Prabha Das, Abram Magner
No generated summary available for this entry.
overview
Original abstract
Learning with data in the form of quantum states is of current interest and has led to a variety of problems that boil down to interaction with the available data via quantum measurement and classical post-processing of observed classical outcomes. In quantum measurement PAC learning, one is given a sequence of unknown, prepared quantum states and classical labels, along with a hypothesis class of candidate measurements. The task is to select a measurement from the hypothesis class that minimizes a fixed notion of error in prediction of the classical labels via measurement of a new state by the selected hypothesis. In this work, we consider the advantage of interacting with the given data in the measurement learning framework using learning rules given by measurements that cannot be implemented using local operations and classical communication (LOCC), as opposed to single-copy learning rules. We provide a construction showing that there exist learning scenarios wherein single-copy learning rules are asymptotically suboptimal compared to optimal ones. We then show that learning rules based on entangled measurements enjoy at most a polynomial sample complexity advantage over single-copy learning rules in the PAC learning setting (under a natural joint measurability covering assumption).
arXiv·2026-10-05·Adam Rutkowski, Katarzyna Siudzińska
No generated summary available for this entry.
overview
Original abstract
We construct a dimension-dependent family of generalized equiangular measurements that gives explicit steering witnesses in every prime dimension $d\geq5$. The construction consists of $d-1$ mutually unbiased measurements and an additional normalized family of $2d-1$ Hermitian operators depending on a parameter $τ$. Positivity of the latter family is the main technical problem. We show that the noncentral operators reduce to three-dimensional invariant blocks, while the remaining central operator is exactly solvable in a two-dimensional subspace. Two unitarily equivalent $3\times3$ matrix representations describe the same active spectrum, but yield different Gershgorin enclosures because Gershgorin bounds are basis dependent. Combining the stronger endpoint from each representation gives a fully analytic asymmetric interval for $τ$ that guarantees a valid POVM. Combining this POVM with the $d-1$ MUMs yields an explicit GEAM. Finally, using a maximally entangled realization and the local-hidden-state bound previously derived for generalized equiangular measurements, we obtain an explicit steering inequality and a sufficient criterion guaranteeing quantum violation in every prime dimension $d\geq5$.
arXiv·2026-10-05·Debadrita Saha et al.
No generated summary available for this entry.
overview
Original abstract
Recent publications have introduced the concept of quantum-like (QL) bits, along with their associated QL-states and QL-gate operations, emerging from the dynamics of complex synchronized networks. The present work builds on this framework to present a simulation of quantum dynamics in spin systems. We focus on the transverse field Ising model, a widely studied Hamiltonian for interacting spin systems. We show how circuits, built using the QL analog of quantum gates, can be used to prepare an arbitrary initial wavepacket and simulate the time evolution of the resulting state for extracting physical observables such as magnetization. Beyond the statevector dynamics, we introduce a set of metrics that characterize how QL-circuit operations transform the underlying graph connections. These metrics quantify the microscopic coupling, phase coherence, and effective inter-block coupling generated by the circuit. These graph-level quantities provide constraints and design targets for potential physical implementations, indicating where interconnection resources, phase control, and effective coupling strength must be engineered in a hardware realization. Overall, this study demonstrates how classical resources can be harnessed to simulate quantum systems and we discuss the advantages and limitations.
arXiv·2026-10-05·Markus Frembs, Andreas Döring
No generated summary available for this entry.
overview
Original abstract
The 'unreasonable effectiveness of mathematics in the natural sciences' may at times give the impression that natural science, especially modern theoretical physics, is all but a formal apparatus. However, a key challenge of physics remains to align everyday notions of experience -- be it directly or mediated through instruments of arbitrary sophistication -- with their mathematical formalisation. This applies in particular to quantum theory, arguably the most successful theory of physics ever invented. One of its core assumptions postulates: $Observables\ correspond\ with\ self-adjoint\ operators.$ Here, we argue that already this most basic premise about the quantum formalism falls apart under careful scrutiny, at least when understood for all observables at once. In other words, we challenge the role of the noncommutative algebra of bounded operators as an adequate formalisation of the 'algebra of observables', understood as (equivalence classes of) measurement procedures that admit a coherent empirical interpretation.
arXiv·2026-10-05·Beilei Jiang et al.
No generated summary available for this entry.
overview
Original abstract
The Minimum Vertex Cover (MVC) problem is a fundamental NP-hard combinatorial optimization problem with applications in network analysis and resource allocation. Grover's algorithm provides a quadratic reduction in query complexity for unstructured search, but existing Grover-based MVC formulations can incur substantial quantum resource overhead due to costly vertex-counting circuits and complex oracle constructions. We develop and evaluate several encoding and oracle-design strategies for reducing the qubit count, circuit depth, and gate complexity of Grover-based MVC search. First, we construct a Dicke-Parallel formulation that restricts the search to fixed-cardinality subsets, eliminating explicit vertex counting, together with a parallel edge-verification oracle that reduces feasibility-checking overhead. We then develop an Edge-Counting formulation that replaces per-edge auxiliary storage with a logarithmic-size counting register, substantially reducing ancillary-qubit requirements. Finally, we propose an Edge-Centric encoding that represents endpoint selections directly and derives vertex-selection states through incident-edge Boolean operations, enabling more depth-efficient oracle construction. Our resource analysis reveals complementary trade-offs among qubit width, circuit depth, gate count, and Grover iteration count. Edge-Counting is particularly attractive under tight qubit constraints, while Edge-Centric can reduce both circuit depth and Grover iteration count when the graph has a moderate edge count and sufficient representation multiplicity. Dicke-Parallel provides a more robust choice when such multiplicity is limited or graph density makes the edge-based search space large. These results provide practical guidance for selecting Grover-based MVC formulations according to hardware constraints and graph structure.
arXiv·2026-10-05·Ryder Carlson et al.
No generated summary available for this entry.
overview
Original abstract
GHZ-based conference key agreement distributes a shared key to $N$ parties in one network use, whereas pairwise BB84 needs $N-1$. The survival of that advantage has been studied against party number, loss, and topology, but almost always with the channel fixed at depolarizing. Simulating both protocols exactly for $N = 3, 4, 5$ under dephasing, amplitude damping, and depolarizing noise, we find the crossover is set by the channel's Pauli error composition, not its identity: normalized to average infidelity, amplitude damping and depolarizing agree to within about 1\% at each group size, while dephasing can tolerate roughly $2.4\times$ more at $N = 3$. We derive a closed-form rate for arbitrary per-party Pauli noise and use it to prove that concentrating a fixed noise budget on one arm is strictly worse than spreading it, and that giving the dealer role to the cleanest arm improves the rate by roughly 18\%. One structural fact drives every result: the phase-error term is a product over all $N$ arms, while the bit-error term stays local to a pair.
arXiv·2026-10-05·Javiera Canales, Jose Ortega, Maximiliano Araya
No generated summary available for this entry.
overview
Original abstract
Identity impersonation fraud may emerge only after digital account opening, requiring an early post-onboarding approach based on behavioral and transactional signals observed shortly after activation. Confirmed cases remain rare, creating extreme class imbalance and material operational risk for digital banks. We evaluate quantum machine learning (QML) against classical one-class methods in this setting using a real 2025 cohort of 3,419 digital account openings from Banco de Creditos e Inversiones (BCI), Chile, including 8 confirmed impersonation-fraud cases (0.23% prevalence). The data were provided through an industry-research collaboration between BCI and CoreDevX LABTAV under operational constraints. The best-performing configuration used only 2 qubits and was executed on CoreDevX's SpinQ Triangulum II, a 3-qubit nuclear magnetic resonance (NMR) device, enabling hardware validation beyond classical simulation. The quantum one-class classifier based on Automatic Quantum Feature Mapping (AQFM) achieves 88% recall (7 of 8 frauds detected) and 9.21% precision, corresponding to approximately 70% fewer false positives than the best-performing classical baseline at comparable recall. When its 2025-calibrated decision threshold is applied unchanged to the independent 2026 cohort, AQFM detects 20 of 31 frauds (64.5% recall) with 8.81% precision and remains the best-performing model among those evaluated.
arXiv·2026-10-05·Achal Vinod, Da-Wei Luo, Ting Yu
No generated summary available for this entry.
overview
Original abstract
We investigate how photon loss and environmental memory affect probe selection and measurement sensitivity for estimating the dispersive coupling strength in a cavity qubit system. Using density operator and quantum state diffusion approaches, we examine the quantum Fisher information for representative separable and entangled initial states in Markovian and non Markovian regimes. The results show that closed system generator variance alone does not determine open system performance. The survival of parameter sensitive coherences and the influence of environmental memory also play important roles. Within the single photon preparations examined, a separable probe can outperform the entangled family considered. Comparisons of selected coherent and squeezed vacuum preparations at equal mean photon number further illustrate how photon number statistics and qubit preparation affect sensitivity. For the parameters studied, finite environmental memory can enhance and prolong sensitivity and yield nonzero QFI for a probe whose Markovian QFI vanishes. We also numerically identify a fixed Hermitian observable whose error propagation uncertainty remains close to the quantum Cramer Rao bound over a prescribed coupling interval in the Markovian regime. These findings clarify the interplay between probe preparation, environmental dynamics, and measurement choice in dispersive quantum metrology.
arXiv·2026-10-05·Suhas Suresh Bharadwaj
No generated summary available for this entry.
overview
Original abstract
Strain engineering is a leading route to control valley-selective transport in monolayer transition metal dichalcogenides. Whether this quantum effect survives inside a fully contacted device remains an open question. Quantum transport models capture the underlying valley deflection but are limited to isolated nanoscale fragments, leaving it unclear if a full device registers strain-induced valley sorting in the bulk, at the contacts, or at all. Here, the quantum valley-deflection tensor of strained monolayer MoS$_2$ is embedded directly into a macroscopic Poisson-drift-diffusion model, extending this physics to a complete, contact-inclusive device. Applying this framework to a 300~nm monolayer MoS$_2$ transistor with a 3~nm HfO$_2$ gate dielectric at 77~K, under a localized 6.14~T pseudo-magnetic strain field, shows the resulting 63.6\% suppression of the ON-state current is not a bulk property. It is set almost entirely by the source and drain metal-semiconductor interfaces. The full suppression is reproduced when only the 15~nm contact regions are strained and nearly vanishes when the channel interior alone is strained, identifying the metal contact as the dominant site of strain-induced valley physics. Observing it requires tunneling-transparent, degenerately-doped contacts, since classical Ohmic barriers overwhelm the topological signal. A transmission-line analysis reduces this behavior to a single valley-topological contact resistance ($R_{c,V}$) and a predictive inverse-length scaling law. This framework applies to any strain-engineered 2D-material heterostructure and can be tested with standard multi-length contact structures. Ultimately, these results identify the metal-semiconductor interface as the decisive location for engineering and detecting valley-selective transport in real 2D-material devices.
arXiv·2026-10-05·Gaoyuan Wang, Jerry Tan, Mark Gerstein
No generated summary available for this entry.
overview
Original abstract
Variational autoencoders are powerful representation learning models that map complex data into low-dimensional latent spaces, enabling the discovery of interpretable and disentangled factors. Such representations can facilitate the interpretation and controllable generation of data describing complex scientific systems. Understanding how these factors are organized and encoded in latent space is therefore important for developing reliable representation learning models. Recently, quantum variational autoencoders (QVAEs) have been proposed as quantum representation models, demonstrating informative latent representations and improved latent-space occupancy through quantum regularization. However, it remains unclear whether and how QVAEs can learn disentangled and interpretable latent factors. A key challenge in investigating quantum latent factors is that a small number of qubits spans an exponentially large Hilbert space, making the notion of an individual quantum latent dimension nontrivial. Here, we investigate what constitutes an individual quantum latent dimension and whether it can encode a distinct factor. We develop theoretical insights into quantum latent dimensions and support them with empirical studies on representative synthetic problems, including MNIST variants. Across three datasets, we demonstrate that QVAEs can discover factorized and semantically interpretable latent representations, with individual qubits functioning as meaningful latent factors. These results establish a foundation for understanding quantum latent spaces and their potential for structured and interpretable representation learning.
arXiv·2026-10-05·Suhas Suresh Bharadwaj
No generated summary available for this entry.
overview
Original abstract
Controlling valley degrees of freedom with mechanical strain is a promising approach for solid-state information processing. Current theoretical literature routinely predicts strain-tuned valley splitting at the microscopic level but rarely evaluates whether these quantum predictions remain statistically recoverable in realistic macroscopic devices. This manuscript establishes a fully classical, partial differential equation-constrained multiscale inverse framework for quantifying the device-level identifiability of predicted strain-tunable valley effects in two-dimensional magnetic heterostructures, demonstrated here for a molybdenum disulfide and chromium tribromide heterostructure. First-principles structural relaxations confirm a chiral $C_3$ point-group symmetry which mathematically reduces the relevant exchange-strain coupling tensor to a single scalar. A partial differential equation-constrained adjoint-state architecture successfully bridges continuum elastodynamics to valley-resolved anomalous Hall transport. Density functional theory yields a coupling estimate of $η\approx -0.07$ meV whose 95% confidence interval is consistent with zero. Evaluating this specific coupling magnitude against established thermal noise and velocity saturation limits defines a safe operating window bounded between 262.0 and 22,337.6 V/cm. Rather than asserting a confirmed nonzero material property this bounded operational window functions as a precise diagnostic threshold. Deploying this rigorous statistical identifiability framework provides a necessary mathematical filter to determine the true experimental viability of theoretically predicted two-dimensional materials before complex physical fabrication.
arXiv·2026-10-05·Abhisek Sahu
No generated summary available for this entry.
overview
Original abstract
Generalized entanglement wedges (GWs), proposed by Bousso and Penington for gravitating regions in general spacetimes, share many properties of ordinary entanglement wedges, including nesting, monotonicity and strong subadditivity of their generalized entropies. In AdS/CFT, the corresponding properties of entanglement wedges are consequences of the structure of the dual CFT. In this paper we ask whether the properties of GWs have a similar origin. We explore this question in vacuum AdS$_3$ at leading order in $G$. We first show that every GW on a static slice is a union of geodesically convex regions. Each such region is an intersection of ordinary entanglement wedges, so every GW is built from unions and intersections of entanglement wedges. We then use the Crofton formula of integral geometry to write the perimeter of a convex region as the measure of the set of geodesics that intersect it. In AdS$_3$ every geodesic is the Ryu--Takayanagi surface of a boundary interval, so this measure can be written in terms of the von Neumann entropies of CFT intervals. Strong subadditivity of the CFT entropy guarantees that the measure is positive. Monotonicity and strong subadditivity of GWs then follow from simple inequalities between sets of geodesics. The strong subadditivity of GWs is therefore a direct consequence of strong subadditivity on the boundary. Our results further suggest that GWs correspond to subsystems of the CFT that are more general than boundary subregions.
arXiv·2026-10-05·Peize Ding, Andrew J. Millis, Yongxin Zeng
No generated summary available for this entry.
overview
Original abstract
The experimental observation of the fractional quantum anomalous Hall effect in rhombohedral graphene multilayers has raised questions about the nature of the fractional Chern insulator (FCI) states and the role of the moiré potential. In this Letter we develop a composite fermion (CF) description and discuss how moiré modulation and Coulomb interactions stabilize the FCI ground states. Under a flux-attachment transformation and mean-field approximation, the CF spectrum forms Landau levels that are further split by the moiré potential. At moiré filling fractions in the Jain sequence, an integer number of CF bands are occupied, resulting in an incompressible ground state with fractionally quantized Hall response. Remarkably, when the attached flux opposes the Berry curvature of the conduction band of rhombohedral graphene, the CF Landau levels are widely spaced in energy and delocalized across layers, leading to a reduced density of states that helps protect the CF mean-field state and amplifying effects of the moiré potential acting on the layer away from the doped electrons. Interactions between CFs further enlarge the moiré-induced band gap and stabilize the FCI ground state. Our work sheds light on the nature of the FCI states in rhombohedral graphene and provides a new theoretical framework for further studies.
arXiv·2026-10-05·Sahinur Reja
No generated summary available for this entry.
overview
Original abstract
Designing expressive quantum circuits for the variational quantum eigensolver (VQE) is a central challenge in simulating interacting many-body systems. Even symmetry-preserving (SP) circuits need not access the full many-body symmetry sector. We demonstrate this explicitly for the spin-$1/2$ XXZ and Hubbard models, where Hamiltonian-inspired nearest-neighbor (NN) SP circuits generate restricted dynamical Lie algebras (DLAs). While these restricted manifolds can accurately represent the ground state near the free-fermion limits, $J_z=0$ for XXZ and $U=0$ for Hubbard, interactions expose inaccessible many-body directions and severely limit VQE performance even at large circuit depth. Remarkably, a minimal modification of the generator connectivity can reconstruct the full orthogonal DLA within all relevant symmetry sectors studied in this work. For XXZ model, the addition of {\it only} one SP next-to-NN single-excitation connection triggers this dramatic reconstruction, whereas the Hubbard case requires a SP correlated double-excitation;--showing that the relevant connectivity can extend from the spatial lattice to many-body configuration space. This reconstruction enlarges the tangent space and accessibility of the energy-lowering Hamiltonian direction, leading to near-unit ground-state fidelity in VQE simulations. Our results establish a direct link between generator connectivity and variational accessibility and suggest a broader circuit-design principle: identify minimal symmetry-preserving generators that enlarge the accessible many-body space rather than increasing circuit depth alone. This perspective may have broader relevance for quantum many-body simulation at the interface of condensed-matter physics and quantum computing.
arXiv·2026-10-05·Paweł Cieśliński
No generated summary available for this entry.
overview
Original abstract
Quantum magic is a necessary resource for fault-tolerant quantum computing, capturing the departure of quantum states from the classically simulable stabiliser set. Motivated by its role in quantum information processing, we investigate the correlation structure of states that maximize the Rényi stabiliser entropies, focusing on the T-type and Hoggar states. Inspired by their distinctive properties, we explore the notion of Pauli flat states, defined as N-qubit states whose expectation values on all Pauli strings are equal in absolute value. These states reproduce the correlation structure of highly magical states, which could also be interpreted as a mixed variant of Pauli covariant N-qubit symmetric informationally complete (SIC) Weyl-Heisenberg fiducial states, while not necessarily possessing nontrivial quantum magic. We investigate their existence and possible constructions, including examples both inside and outside of the stabiliser polytope. To identify the latter, we examine a magic witness tailored to the introduced family of states. Finally, we discuss their entanglement and Bell nonlocality, providing a broader characterization of their quantum properties. For completeness, we find pure states with a relaxed condition on the Pauli expectations, which forces unequal elements to zero, and discuss their non-stabiliserness. Our results offer a new perspective on the relation between quantum magic and Pauli correlation structures. They hold relevance to geometrical approaches to quantum mechanics, entanglement and magic detection, as well as estimation tasks.
arXiv·2026-10-05·Tudor D. Stanescu, Sumanta Tewari
No generated summary available for this entry.
overview
Original abstract
One-dimensional SM-SC hybrid nanowires with Rashba spin-orbit coupling and applied Zeeman field can support Majorana zero modes (MZMs) at the ends of the wire. In finite-length systems, residual wave-function overlap between the end modes produces an energy splitting. In a two-sided tetron qubit, composed of a pair of parallel Majorana wires coupled by a trivial SC backbone in the middle, this splitting limits the parity lifetime associated with Majorana pairs involving both wires and the coherence of the qubit, adversely affecting measurement-based braiding and readout operations. Here, we propose a one-sided tetron made of four parallel Majorana wires connected at a common end by an SC backbone. In the topological phase, the free wire ends host four MZMs that define the topological qubit, while the Majoranas localized near the opposite ends hybridize through the backbone and acquire finite energy. To study the basic hybridization mechanism, we consider a simpler two-wire subsystem, i.e., half of a one-sided tetron, which we call a doublon. In a doublon, the backbone, or bridge, strongly hybridizes the two Majorana modes at the connected end and shifts them away from zero energy, while the modes at the free ends form a near-zero energy fermion. We show that the splitting of the surviving MZM pair can fall by about two orders of magnitude compared to the splitting energies in a two-sided tetron, thereby dramatically increasing the parity lifetimes. Thus, the one-sided tetron ensures a suppression of the Majorana overlap comparable to doubling the length of the corresponding two-sided tetron.
arXiv·2026-10-05·Mauricio Bustamante
No generated summary available for this entry.
overview
Original abstract
Interpreting neutrino oscillation measurements requires computing the probability that a neutrino born with one flavor is detected with another. In vacuum and in matter of constant density, this probability has exact formulas. Where the density varies along the path, as in the Earth, the Sun, or a supernova, it does not. There, the usual approaches either replace the profile by constant-density steps, whose error falls only as the square of their width, or integrate the evolution equation with a general-purpose solver, which must shorten its steps to meet a tighter tolerance. Both become slow at high accuracy, yet an analysis needs the probability at many energies, directions, and parameter values. Each new experiment or model often requires writing and validating a new solver. We present Magnus, an open-source Python code that avoids these limitations. It uses the Magnus expansion, whose error falls as a high power of its step width and whose cost is set by how fast the density varies, not by how many oscillations the path holds. Magnus accepts any density profile, any number of flavors, and any Hermitian Hamiltonian, such as those of non-standard interactions, sterile neutrinos, Lorentz-invariance violation, and pseudo-Dirac neutrinos. Where a cheaper route exists, it takes it automatically. For example, where the density varies slowly, as in the Sun, it follows the instantaneous eigenstates and applies the expansion only at resonances. Besides oscillating probabilities, Magnus returns phase-averaged ones, which describe solar and astrophysical neutrinos. A typical probability takes a few milliseconds, and batched scans are one to two orders of magnitude cheaper per point. Among the public codes we compared, Magnus is the fastest at high accuracy on a varying profile. Magnus shifts the effort of studying a new experiment or model from writing a solver to specifying its physics.
arXiv·2026-10-05·Melissa Will et al.
No generated summary available for this entry.
overview
Original abstract
Floquet topological order (FTO) extends topology beyond equilibrium, giving rise to phenomena, such as the dynamical transmutation of anyons. Here, we realize $\mathbb{Z}_N$ FTO in a generalized Kitaev honeycomb model with clock degrees of freedom using a three-step periodic drive. The driven system admits an emergent description in terms of constrained parafermions coupled to conserved $\mathbb{Z}_N$ gauge fields. At the boundary, the drive generates chiral parafermionic Floquet edge modes. We resolve their propagation through correlation functions, characterize their fractional quantum-information transport through the radical chiral unitary index, and use their dynamics to probe exchange statistics. In the bulk, we explore the dynamical anyon transmutation with a non-equilibrium loop order parameter. At a Floquet sweet spot, where the drive becomes Clifford, these phenomena can be accessed using stabilizer simulations. Short-time matrix-product-state simulations away from this point show that the chiral edge response persists at accessible times. Our results establish $\mathbb{Z}_N$ Kitaev models as a setting for exploring intrinsically non-equilibrium topological phenomena on qudit-based quantum processors.
arXiv·2026-10-05·Roopayan Ghosh, Sougato Bose
No generated summary available for this entry.
overview
Original abstract
Exponentially small spectral gaps are the central obstacle to adiabatic quantum annealing, yet whether such bottlenecks demand correspondingly complex entanglement remains unclear. We show that gap scaling and entanglement complexity need not be linked. Conventional first-order transitions combine exponentially small gaps with bounded $O(1)$ bipartite Schmidt rank, even though the critical states retain global multipartite correlations, while continuous transitions combine polynomially closing gaps with logarithmically growing entanglement. We show that each pairing can also be inverted: in a known first-order transition in a staggered-field antiferromagnetic Ising chain the gap closes polynomially despite bounded Schmidt rank, while we construct a mirror-twin manifold model whose gap closes exponentially even as its entanglement entropy grows logarithmically with system size. We derive bounds connecting Schmidt rank to Hamming-space geometry, and identify manifold density and connectivity as the ingredients that determine which combination occurs. These results show that entanglement complexity alone cannot characterize annealing difficulty, and point toward a broader search for quantum resources that capture the geometry of state evolution in Hilbert space.
arXiv·2026-10-05·Rustem Sharipov et al.
No generated summary available for this entry.
overview
Original abstract
We construct a family of chaotic brickwork quantum circuits exhibiting superdiffusive transport with dynamical exponent $z=3/2$ in the full Kardar--Parisi--Zhang (KPZ) universality class. This is enabled by the equilibrium current associated with a inhomogeneous conserved density having a nontrivial dependence on the chemical potential. Using nonlinear fluctuating hydrodynamics, we derive the propagation velocity, broadening scale, and universal scaling form of the charge correlation function from microscopic equilibrium properties. Tensor-network simulations of a two-site spin-$1$ (qutrit) circuit reproduce these parameter-free predictions, including the full stationary KPZ profile. We further construct a three-site spin-$\frac12$ (qubit) circuit, where transport varies from diffusive to superdiffusive with the chemical potential, while long-lived coherent quasiparticles delay the convergence of the profile to the KPZ scaling form. Our results establish that KPZ superdiffusion in quantum systems is not restricted to fine-tuned integrable models.
arXiv·2026-10-05·Thomas Décultot, Ronan Gautier, Mazyar Mirrahimi
No generated summary available for this entry.
overview
Original abstract
Bosonic quantum error correction represents a route towards significant hardware overhead reduction for fault-tolerant quantum computation. However, controlling quantum harmonic oscillators that encode the quantum information comes with its own challenges. In many platforms such as superconducting circuits and trapped ions, the bosonic degree of freedom is controlled by an ancillary qubit whose decay during a qubit-oscillator gate propagates to the oscillator as a continuous error. Such errors generally lie beyond the scope of errors that the bosonic code is capable of correcting. We introduce the continuous-variable flag: an auxiliary oscillator coupled to the ancilla whose phase-space position encodes the continuous error corrupting the storage mode. After the gate, a heterodyne measurement of the flag estimates this continuous-variable error and a subsequent feedback control undoes it up to a bosonic code stabilizer. The scheme requires no new ingredients, as the flag is driven by the same dispersive coupling, displacements and rotations that implement the gates it is supposed to protect. We construct sequences protecting conditional rotations to all orders in ancilla decay with one flag, and conditional displacements to first order with one flag and to all orders with two. Simulations with realistic circuit-QED parameters predict more than three orders of magnitude fewer logical errors for the parity measurement of a four-component cat code, and a finite-energy GKP logical lifetime near its noiseless-ancilla bound. By discretizing continuous-variable errors, the flags introduced in this work are a useful tool for any hybrid oscillator-qubit processor, and open the route towards fault-tolerant simulation and computation with bosonic modes.
arXiv·2026-10-05·Ezekiel Cochran, Atul Mantri
No generated summary available for this entry.
overview
Original abstract
We prove optimal query bounds for recovering a single qubit from black-hole radiation in the Haar random oracle model, when the remaining black hole contains at most one sixteenth of the system's qubits. Recovery with any constant Haar-averaged advantage over trivial decoding requires queries proportional to the Hilbert-space dimension of the remaining black hole. The lower bound is unconditional for decoders chosen independently of the sampled unitary, allows arbitrary computation between queries, and access to $U, U^\dagger, U^*, U^\mathsf T$ along with the controlled variants. An existing decoder using only forward and inverse queries attains a matching bound. The proof uses a path recording oracle to compare real and maximally mixed states. As applications, we obtain an efficiently preparable, statistically far, computationally indistinguishable (EFI) pair and quantum commitments relative to a public Haar oracle, as well as prove a tight linear rank lower bound for Uhlmann transformation on a fixed-target family.
arXiv·2026-10-05·Osman Orçun Keskin, Özgür E. Müstecaplıoğlu
No generated summary available for this entry.
overview
Original abstract
Quantum batteries store energy in nonequilibrium quantum states. The ergotropy sets the work extractable by an arbitrary global unitary, but a device usually exchanges energy through a single local port. It remains unclear how much stored work such a port can deliver, and whether topological edge modes help. We study a dimerized spin chain of Su-Schrieffer-Heeger (SSH) type. Excited two-level ancillas charge it at one end by repeated collisions, and an initially empty two-level load discharges it at the same site. An exact free-fermion mapping yields a bound on the load work for all number-conserving quadratic extraction protocols. The load gains extractable work only if a single-particle mode of the battery holds more than half an excitation. Resonant charging fills the topological edge mode above this threshold. A single boundary pulse then delivers 98.6% of the maximal load work allowed by the bound for representative parameters. Under the same six-collision controls, the trivial-phase load remains passive. Within the protocol that selects the load pulse for maximum delivered work, cycle power peaks at a finite collision number while delivered work continues to increase over the scanned range. Over the tested range, the advantage survives hopping disorder, which preserves chiral symmetry. On-site disorder breaks this symmetry and leaves a finite fraction of loads passive. Topology thus supplies a localized access channel, while spectral matching and symmetry decide whether stored energy becomes usable local work.
arXiv·2026-10-05·Chiu Fan Bowen Lo et al.
No generated summary available for this entry.
overview
Original abstract
Braiding and fusing anyons are fundamental to topological quantum computation, yet existing circuit protocols often employ ancillas and measurements. We determine the minimal circuit resources for performing such anyon operations in quantum double models of generic finite groups. Our approach braids anyons through a sequential unitary circuit without ancillas. Intuitively, this is obtained by deforming the underlying graph on which the anyons live. More generally, we introduce graph rewiring, a diagrammatic calculus that assigns a geometric interpretation to individual two-qudit gates and tracks their action on stabilizers. For fusion, we prove a general no-go theorem excluding purely unitary protocols for fusing unknown anyon types without introducing ancillas. Remarkably, we show such "input-agnostic" fusion is enabled by simply using a qudit reset. Hence, contrary to folklore, ancilla resources are not needed to braid or fuse non-Abelian anyons (non-Abelions). This work has implications in experimental efforts in error correction: our fusion protocol highlights reset as an underutilized primitive for error correction without the spacetime-overhead of ancillas and measurements.
arXiv·2026-10-05·Bartosz Regula et al.
No generated summary available for this entry.
overview
Original abstract
The measures of distance frequently used in quantum information, such as trace distance or fidelity-based purified distance, are the smallest extensions of the corresponding distance measures in classical information theory. However, this way of extending classical distances is not unique, and a whole spectrum of other extensions can be defined. Here we study the question of how quantum information processing tasks are affected by a change of the error metrics to the maximal extensions of the classical distance measures, imposing more demanding error requirements on operational tasks. We find that the performance of some tasks, such as channel coding or quantum resource distillation, is not affected whatsoever by this change. However, for other tasks such as channel simulation and quantum resource dilution, we show that the rates are now given not by functions of the standard (Umegaki) quantum relative entropy, but ones based on the Belavkin-Staszewski relative entropy. Our results connect the Belavkin-Staszewski relative entropy with operational tasks and reveal that known reversibility results in quantum information, including the reverse Shannon theorem and the asymptotic reversibility of quantum resource transformations, no longer hold under maximal distance measures.
arXiv·2026-10-05·Tam{á}s Havas, Hsuan-Yin Lin, Eirik Rosnes
No generated summary available for this entry.
overview
Original abstract
We investigate converse bounds on the average decoding error probability in finite-blocklength classical-quantum channel coding. We first present a lower bound for multiple quantum hypothesis testing in terms of pairwise trace distances and derive a corresponding fidelity bound. We then obtain a spectrum-based converse that depends only on the a priori probabilities and spectra of the states. We show that the converse bound remains tight for the quantum depolarizing channel under suitable conditions. For codes with product-state outputs, this converse takes an explicit form involving products of output-state eigenvalues. We apply it to binary codes over the quantum amplitude damping channel using the input states $\vert+\rangle$ and $\vert-\rangle$. For this setting, we also discuss a normal approximation to the spectrum-based converse in the large blocklength regime. In all numerical examples considered, the spectrum-based converse is tighter than the other converse bounds at low noise levels.
arXiv·2026-10-05·Yifei Qi, Rahul Sarkar
No generated summary available for this entry.
overview
Original abstract
An important question in quantum information theory asks whether every gate in the Clifford hierarchy is semi-Clifford or not, as such gates admit resource-efficient implementations via gate teleportation. Extending recent results for prime dimensions~\cite{silva_clifford_2025}, we prove that every hierarchy gate on a single qudit of dimension \(d\) is semi-Clifford, if and only if \(d\) is square-free. In composite dimensions, \(\mathbb{Z}_d^2\) is a symplectic module rather than a vector space, motivating a distinction between four types of gates. Semi-Clifford gates ($\mathcal{SC}$) are the ones that become diagonal under left and right multiplication by Clifford gates, while a broader class $\mathcal{N}$ admits a permutation diagonal form, under left and right multiplication by Cliffords. Lagrangian semi-Clifford gates ($\mathcal{LSC}$) conjugate some maximal abelian Pauli subgroup to another, whereas generalized semi-Clifford gates ($\mathcal{GSC}$) map some maximal abelian Pauli subalgebra to another under conjugation. In square-free dimensions, we have \(\mathcal{SC}=\mathcal{LSC}\) and \(\mathcal{N}=\mathcal{GSC}\), but when \(d\) is not square-free, these equivalences can fail, as Lagrangian submodules can become non-free. We also show that every third-level gate of the one-qudit Clifford hierarchy is a generalized semi-Clifford in arbitrary dimensions.
arXiv·2026-10-05·Shalev Ben-David, M. H. Ebtehaj
No generated summary available for this entry.
overview
Original abstract
Quantum query complexity enjoys a variety of pleasing joint computation properties: for example, a composition theorem asserting $Q(f\circ g)=Θ(Q(f)Q(g))$ for all Boolean functions $f$ and $g$; a direct sum theorem asserting that computing $k$ copies of a function (or search problem) costs $Ω(k)$ times as much as the cost of computing one copy; and a direct product theorem asserting that for Boolean functions, even succeeding at the direct sum problem with exponentially small probability still requires $Ω(k)$ times the cost of computing one copy to bounded error. However, all of these results are strictly for worst-case quantum query complexity. For example, if we have a fixed distribution $μ$ over inputs, the direct sum theorem says nothing about the quantum query complexity of computing $k$ copies of $f$ when the input comes from the product distribution $μ^k$ instead of being worst-case. (Note that while a standard Yao-type minimax theorem guarantees a hard distribution for the direct sum problem, there's no guarantee that this hard distribution is a product distribution.) A similar problem occurs for the direct product theorem and the composition theorem: none of these results respect distributions. In this work, we give distributional joint computation lower bounds for the composition, direct sum, and direct product problems. Along the way, we introduce some new tools for handling quantum query lower bounds, including (a) a new ``multiplicative'' variant of the $γ_2$ norm (which we use in place of the multiplicative adversary method for proving the direct product theorem), and (b) a new ``Shaltiel-free'' measure of quantum query complexity, which we show characterizes the composition behavior of distributional quantum query complexity and satisfies pleasing properties.
arXiv·2026-10-05·Stefano Pirandola
No generated summary available for this entry.
overview
Original abstract
We determine the two-way quantum, entanglement-distribution, private, and secret-key capacities of the pure-loss bosonic channel under an unconditional mean transmitted-photon-number constraint. For transmissivity $η$ and mean photon number $N$, all four capacities coincide and are given by $g(N)-g((1-η)N)$, where $g$ is the entropy of a thermal mode. This resolves the longstanding finite-energy capacity problem by establishing the optimality of the reverse-coherent-information rate introduced in 2009. Our central tool is sector teleportation simulation, which we develop specifically to transfer the input-energy constraint to the shared entanglement resource, thereby preserving the constraint throughout converse arguments for general adaptive protocols. For every $N>0$, we further show that the corresponding strong-converse thresholds coincide with the unconstrained value $-\log_2(1-η)$. For parallel protocols with a hard total-photon-number cutoff, the same finite-energy capacity formula instead satisfies an exponential strong converse. Together, these results establish a unified finite-energy framework for adaptive bosonic communication and reveal how energy constraints fundamentally reshape both attainable rates and converse bounds.
arXiv·2026-10-05·Rohan Mehta et al.
No generated summary available for this entry.
overview
Original abstract
Magic state cultivation is a promising method for preparing high-fidelity non-Clifford resource states - a central component of fault-tolerant quantum computing - with low spacetime overhead. In benchmarking cultivation, existing resource estimates assume access to noiseless transversal measurement of the output magic state to allow for postselection during the final escape stage of the cultivation process. However, such measurements would destroy the magic state and are therefore unavailable during computation. We develop an open-boundary postselection method, Caliper, that uses only nondestructive mid-circuit syndrome information and substantially outperforms existing methods operating under these constraints. In some regimes, our postselection method uniquely recovers the resource efficiency of prior estimates. However, in other cases, we observe a tradeoff. At spacetime costs reported in previous works, the achievable logical error rates can be orders of magnitude higher, and recovering the reported logical error rate requires substantially larger codes and longer escape stages. Our results highlight how practical considerations involving mid-circuit postselection can impact the design and performance of magic state cultivation protocols.
arXiv·2026-10-05·Christine Li, Natalie Parham
No generated summary available for this entry.
overview
Original abstract
We identify a barrier that helps explain why proving stronger quantum state-preparation lower bounds has been so difficult. In particular, we establish a quantum analogue of the Razborov-Rudich natural proofs barrier for state-preparation lower bounds. We call a property of quantum states \emph{natural} if it holds for a sufficiently large fraction of Haar-random states and can be efficiently tested when given all of the state's amplitudes. Under a standard cryptographic assumption, we show that no natural property can prove superpolynomial state-preparation lower bounds even against a fixed level of the Magic Hierarchy. We show that several existing state-preparation lower-bound techniques are natural in our sense, including arguments based on approximate degree, not being a unique ground state of a local Hamiltonian, and mutual information.
arXiv·2026-10-05·Jong Yeon Lee
No generated summary available for this entry.
overview
Original abstract
Efficient fault-tolerant quantum computing architectures benefit from low-weight logical operators. However, reported canonical bases for high-rate, high-distance codes can be several times heavier than the code distance, and fundamental obstructions can prevent minimum-weight logical operators from forming a complete canonical basis. To address this issue, we develop design principles for group-valued quantum error-correcting codes with low-weight full regular canonical logical bases, generated by translating a set of seed operators. We introduce frame width $f$, the smallest weight cutoff that permits a complete canonical logical basis, as an additional code parameter alongside distance $d$ and check weight $w$. Cataloguing these parameters together with explicit logical bases can inform resource estimates and the compilation of fault-tolerant logical operations. First, we identify a structural obstruction: for fully populated binary monomial CSS checks over a group of odd order, full regularity forces distance two, while for groups of power-of-two order, full row rank of both check matrices after replacing every group element by $1$ guarantees full regularity. Second, we demonstrate our principles through explicit high-rate lifted-product (LP) and pair-partition (PP) codes: an $[[1088,128,22]]$ LP code with $f=22$ and an $[[1024,256,24]]$ PP code with $f \leq 27$, both at $w=10$. At $w=11$, our PP constructions attain either $d=25$ with $f \leq 27$ or $d=24$ with the proved optimum $f=25$, demonstrating both a tradeoff among these parameters and a strict separation between distance and frame width. Finally, we propose a method combining symmetry reduction and stabilizer-based pruning for exhaustive distance certification, and use it to efficiently establish exact distances for LP examples with more than a thousand qubits.
arXiv·2026-10-05·Pulkit Sinha, Benjamin Lovitz
No generated summary available for this entry.
overview
Original abstract
We prove that every pure state of stabilizer rank at most $k$ has stabilizer extent at most $2^{O(\sqrt{k\log(k+1)})}$, and establish the analogous bound for the squared Clifford coefficient norm of Clifford-rank-$k$ operators. This implies stabilizer fidelity at least $2^{-O(\sqrt{k\log(k+1)})}$, resolving the quantitative conjecture of (Mehraban-Tamasbi, STOC, 2025), and proves an $Ω(n^2/\log n)$ lower bound for the approximate stabilizer rank of tensor powers of any non-stabilizer qubit state. The latter result generalizes the best-known lower bound for tensor powers of $T$-states (Mehraban-Tamasbi, STOC, 2024) to arbitrary non-stabilizer qubit states, including magic states. As a consequence of the Clifford rank--norm inequality, we obtain an $Ω(n^2/\log n)$ lower bound for exact representations of $n$-bit AND function by quadratic phases, improving the previous best-known linear bound. Further consequences rule out pseudorandom state and unitary ensembles with approximate stabilizer and Clifford rank $O((\log n)^2/\log\log n)$, respectively, a $\log n$ improvement over prior work (Kalra-Sinha, Quantum, 2026). We also obtain tomography algorithms for states of stabilizer rank at most $k$, with $poly(n)2^{O(\sqrt{k\log(k+1)})}$ time and copy complexity, a nearly square-root improvement in the exponent over the best-known algorithm.
arXiv·2026-10-05·Levente Raikovich et al.
No generated summary available for this entry.
overview
Original abstract
We study the spectral gap of recently discovered families of KMS-detailed-balanced Gibbs-sampler Lindbladians for the mean-field Heisenberg model on $n$ spins. We show that the spectral gaps of these natural families of Lindbladians admit the same phase diagram: the gap is constant above the critical temperature (i.e., in the disordered phase), scales as $1/\sqrt{n}$ at the critical temperature, and as $1/n$ below the critical temperature (i.e., in the ordered phase). Our result builds on and extends the recent work of Basso et al.~(2026) which characterized this phase diagram for the GNS-detailed-balanced Davies generator, but only partially resolved the gap scaling at the critical temperature.
arXiv·2026-10-05·Sriram Bharadwaj, Di Luo, Leo Zhou
No generated summary available for this entry.
overview
Original abstract
We study a Continuous-Variable Quantum Approximate Optimization Algorithm (CV-QAOA) for high-dimensional continuous optimization. Our formulation extends an earlier CV-QAOA proposal with a variationally optimized initial state and recovers the convergence guarantees of Quantum Hamiltonian Descent (QHD) in the high-depth limit. We prove rigorous performance guarantees of CV-QAOA on several families of cost functions. First, we show $d$-step CV-QAOA minimizes any $d$-dimensional strictly convex quadratic function with $2d$ quantum queries to the cost function. We then analyze a family of nonconvex "Rotated Double Well" (RDW) functions with $2^d$ local minima introduced by arXiv:2311.00811. While prior work showed QHD reaches its global minimum with $\tilde O(d^3)$ queries, we prove that 1-step CV-QAOA solves RDW with just two quantum queries. Although general-purpose classical solvers need superpolynomial time for RDW and structure-awareness can reduce the cost to polynomial time, we show that the 1-step CV-QAOA protocol can be efficiently dequantized, and that a gradient-aligned line search succeeds with $O(d)$ queries, nearly matching the information-theoretic $Ω(d/\log d)$ query lower bound. To move beyond the dequantizable regime, we introduce a ``Rotated Square Well'' (RSW) problem, whose globally flat landscape suppresses useful local gradient information. For this family, we show that an adiabatic evolution simulated by CV-QAOA can reach the global minimum using $d^{o(1)}$ queries. On the other hand, any classical algorithm that learn the hidden rotation in RSW provably requires $Ω(d^2/\log d)$ queries, a bound we nearly match with an explicit $Θ(d^2\log d)$-query classical algorithm.Numerical simulations on deflected corrugated spring and Easom functions illustrate the promising performance of CV-QAOA on more general problems.
arXiv·2026-10-05·Shiv Akshar Yadavalli et al.
No generated summary available for this entry.
overview
Original abstract
Publicly accessible fault-tolerant quantum computers must preserve scientific utility while limiting cryptanalytic power. We propose the restricted model of computation, 1/2BQP_1: a quantum server provides random computational-basis inputs, revealed only after execution, and one designated output bit. This interface permits arbitrary circuits and system sizes. We conjecture that a classical client making polynomially many adaptive requests cannot efficiently factor RSA moduli. The model subsumes the well-known one-clean-qubit model DQC1, retaining its applications to infinite-temperature multi-time correlations, out-of-time-order correlators, and suitably normalized partition functions. We propose a candidate for separating 1/2BQP_1 from DQC1 based on testing classical predictions of quantum spin dynamics. We argue security in two steps. First, we show that one-bit readout makes the quantum stages of standard factoring algorithms classically simulable, even when their preparation and postprocessing are redesigned within a broad family around a single arithmetic-oracle call. This covers the quantum stages of Shor, Ekera-Hastad, Kitaev, and Regev factoring constructions. Second, we examine the workaround of coherently implementing rational reconstruction to release a factor bit. Random inputs obstruct this straightforward attack: known techniques accommodate logarithmic-depth classical circuits, but rational reconstruction has resisted such parallelization for decades. Therefore, we show that security of our protocol is built on not only classical hardness for factoring, but also conjectured circuit lowerbounds for rational reconstruction.
arXiv·2026-10-05·Serban Cercelescu, Mark Koch, Arthur Pesah
No generated summary available for this entry.
overview
Original abstract
We show that every intermediate state of a broad class of non-Clifford quantum error-correction circuits is a third-order phase-polynomial state, even under stochastic Pauli noise. The class includes magic state distillation and cultivation, code switching and gauge fixing, transversal non-Clifford gates with syndrome extraction, and injection of diagonal magic states. Third-order phase-polynomial states strictly generalize stabilizer states, and we prove that they are exactly the stabilizer states of the diagonal-Clifford-and-Pauli (DCP) stabilizer formalism that we introduce. We characterize these states and show that their representations can be updated in polynomial time. This yields an exact polynomial-time simulation algorithm for these circuits and, more broadly, a framework for reasoning about their internal states and about magic states in general. We provide an open-source implementation, \texttt{merlin}, and benchmark it against existing non-Clifford simulators on distillation, cultivation, and code switching circuits. The benchmarks demonstrate improved runtime and memory scaling as the number of logical outputs grows in Bravyi-Haah distillation, and simulation of a code switching circuit beyond the reach of all other tested simulators.
arXiv·2026-10-05·Alvan Arulandu et al.
No generated summary available for this entry.
overview
Original abstract
We study agnostic tomography of pure bosonic Gaussian states: given copies of an arbitrary $n$-mode bosonic state $ρ$, the goal is to output a pure Gaussian state whose infidelity with $ρ$ is at most $\mathrm{opt} + ε$, where $\mathrm{opt}$ is the minimum infidelity achievable by any pure Gaussian state. We give efficient protocols achieving this in both the high and low fidelity regimes. When $\mathrm{opt}$ is below some universal constant, our protocol has runtime and copy complexity which is strongly polynomial in $n, 1/ε$ and $\log \log E$, where $E$ is the energy of the closest pure Gaussian state. For arbitrary $\mathrm{opt}$, our protocol uses $(n+1)^{\mathrm{poly}(1/ε)} \mathrm{poly}\left(1+\log\log(E)\right)$ copies and runtime. As a corollary, we obtain the first truly tolerant Gaussianity testing protocol for distinguishing whether $\mathrm{opt} > c + ε$ or $\mathrm{opt} < c - ε$, for any threshold $c\in(0,1)$. We also prove $\mathrm{poly}(n,1/ε)$ runtime is impossible, unless $\mathrm{NP}\subseteq\mathrm{BQP}$. Our protocols follow a shared paradigm: first, we iteratively use general Gaussian measurements combined with techniques from classical robust statistics to obtain a good warm start estimate, then we leverage non-Gaussian measurements to refine this warm start using convex and non-convex optimization methods. Interestingly, we prove that non-Gaussian measurements are necessary to match the strong agnostic guarantees we obtain, and in fact these guarantees are provably superior to what is possible for robustly estimating classical Gaussians.
arXiv·2026-10-05·Dutch Hansen, Jerry Li
No generated summary available for this entry.
overview
Original abstract
We consider the problem of quantum 1-PCA: given copies of an unknown $n$-qubit mixed state, recover a classical description of its leading eigenvector. Our goal is to do so using non-adaptive and single-qubit measurements. For an $n$-qubit state with top eigenvalue $λ$ and spectral gap at least $Δ> 0$, we give an algorithm that recovers the leading eigenvector to fidelity at least $1 - \varepsilon$ with high probability using $\tilde{O}\left( {2^n \cdot η^2} / {Δ^3 \varepsilon^3}\right)$ copies and $\tilde{O}((2^n/Δ\varepsilon) \cdot \operatorname{poly}(η/Δ\varepsilon))$ time, where $η= \max (1 - λ, \varepsilon)$. All of our measurements are non-adaptively chosen, and performed in single-qubit Pauli bases. When the spectral gap is constant and the desired accuracy is comparable to the noise level, i.e. $\varepsilon = Ω(η)$, our runtime and copy complexity become $\tilde{O} (2^n / \varepsilon)$. This generalizes the guarantees of Grewal et al. [arXiv:2601.04444], who achieved similar rates, but under the assumption $η= 0$, i.e., that the state was pure. Our results show that the same rates hold in the presence of state misspecification, up to polylogarithmic factors. From a technical perspective, our algorithm works by recursively constructing low-dimensional subspaces that approximately preserve the target eigenvector. To achieve nearly linear runtime dependence on the dimension of the Hilbert space, we develop a novel structured Pauli sampling scheme that enables fast batched computation of exponentially many projected Pauli matrices.
arXiv·2026-10-05·Alexander Schmidhuber, Alexander Zlokapa
No generated summary available for this entry.
overview
Original abstract
The Sachdev-Ye-Kitaev model is a strongly interacting fermionic system that has been well-studied in condensed matter and high energy physics. It is highly quantum: Gaussian states are far from the thermal state (Hastings and O'Donnell, STOC'22) and representing the thermal state requires large polynomial-size quantum circuits (Anschuetz et al., QIP'25). Very recently, it was nonetheless proven that classical algorithms can estimate local thermal expectations at sufficiently high temperature in quasipolynomial time (Zlokapa, FOCS'26). We show that classical algorithms can in fact estimate local observables at all constant temperatures in polynomial time. Our techniques also extend straightforwardly to classical systems: we resolve an open question about computing thermal expectations of a classical spin glass up to its phase transition (Bencs et al., STOC'26). Our proof develops a fully rigorous quantum cavity method. Due to the success of the classical cavity method in optimization, sampling, inference and learning, we expect the quantum cavity method to find further applications of independent interest. As an example, we give a quantum algorithm that learns SYK Hamiltonians from the Gibbs state at any constant temperature with polynomial time and sample complexity.
arXiv·2026-10-05·Andris Ambainis, András Gilyén, Martins Kokainis
No generated summary available for this entry.
overview
Original abstract
We study hybrid quantum-classical algorithms in the query model. The computation consists of quantum subroutines that make at most $q$ oracle queries; between subroutines, all qubits are measured and discarded. We prove matching upper and lower bounds for several problems in this model: (i) (Unbiased) Phase estimation up to a precision $ε$ requires $Θ(\frac{1}{q ε^2})$ queries; (ii) (Unbiased) Amplitude estimation up to a precision $ε$ requires $Θ(\frac{p(1-p)}{q ε^2})$ queries; (iii) Search among $N$ items requires $Θ(\frac{N}{q})$ queries; (iv) Two level AND-OR tree (AND of $m$ ORs, with $n$ inputs to each OR) requires $Θ(\frac{nm}{q})$ queries. All of these bounds are optimal up to a constant factor, for all $q$ from 1, corresponding to the classical complexity, to $Q(f)$, the unrestricted quantum query complexity of the respective problem. We also derive a hybrid lower bound for distinguishing two distributions specified by a state-preparation unitary; this bound is tight up to a logarithmic factor. Besides specific lower bounds, an important contribution is developing methods for proving lower bounds on hybrid quantum algorithms (which have been very ad-hoc up to now). The first two bounds follow from a common framework: we analyze probability distributions over measurement transcripts and bound a progress measure that captures their distinguishability. The AND-OR bound requires a more delicate argument, combining two progress measures that track the information available to the algorithm classically and in quantum form, respectively.
arXiv·2026-10-05·Ricardo Faleiro et al.
No generated summary available for this entry.
overview
Original abstract
Nonlocal games offer a conceptually clear way to reason about Bell nonlocality. However, we show that as originally defined, and most commonly used, i.e. with a deterministic predicate, they cannot be complete witnesses of nonlocality. Concretely, we prove the existence of nonlocal behaviours which do not violate any such nonlocal game. Furthermore, we also show that quantum mechanics can produce these game-classical nonlocal behaviours. We prove that this phenomenon exists in every bipartite scenario $(X,Y,A,B)$ with $X,Y\geq2$ and $A,B\geq4$.
arXiv·2026-10-05·Jiayu Shen et al.
No generated summary available for this entry.
overview
Original abstract
We use an instanton-based analysis to show that Path Integral Stochastic Gradient Descent (PISGD), a classical optimization algorithm instantiated from path integral Monte Carlo (PIMC), can inherit the quantum tunneling mechanism. Quantum tunneling is the phenomenon in which a quantum particle passes through a potential barrier that a classical trajectory cannot cross in the same way. This mechanism can contribute to the performance of quantum optimization algorithms, since a common bottleneck in optimization is that the solution becomes trapped in a local minimum, separated from better solutions by a potential barrier. Classical noise-driven optimizers, such as stochastic gradient descent (SGD), have escape times that scale exponentially with the potential barrier height. For quantum tunneling, the escape time is instead exponential in the bounce action, which equals twice the Agmon distance between the two basins. When the barrier is tall but thin, quantum tunneling can allow escaping local minima faster than such classical methods. Remarkably, this scaling is not exclusive to algorithms with genuine quantum dynamics. For PISGD applied to classical nonconvex global optimization, we adapt Kramers' escape-rate theory to path space and obtain the same exponential scaling as quantum tunneling, in terms of the bounce action rather than the barrier height. We confirm this scaling numerically by implementing PISGD for both separable and nonseparable potentials. That said, PISGD retains only incoherent tunneling, since coherence among multiple tunneling paths is absent. Our analysis therefore does not rule out a potential quantum advantage for quantum-tunneling-based algorithms over classical ones in general.
arXiv·2026-10-05·Jop Briët et al.
No generated summary available for this entry.
overview
Original abstract
Bosonic and fermionic Gaussian quantum states are families of quantum states that play a central role in quantum physics and quantum information processing. We study the problem of testing whether a given state is either Gaussian, or has bounded overlap with any Gaussian state. Previous analyses of this testing problem led to tests that require a number of copies of the state that scales with the number of modes (the system size). In this work we show that a constant number of copies of the state suffices. We derive these results based on the symmetries of identical copies of Gaussian states, and by bounding the distance to the set of Gaussian states through a gradient flow and a spectral bound studied previously for the Kac random walk on a sphere.
arXiv·2026-10-05·Saulius Alminas, Domantas Burba, Gediminas Juzeliūnas
No generated summary available for this entry.
overview
Original abstract
We propose a four-level scheme for generating a uniform imaginary magnetic field for ultracold atoms using Raman coupling and state-dependent particle losses. Eliminating two lossy auxiliary states and subsequently projecting onto one of the two remaining Raman dressed atomic states, the atomic motion is affected by an imaginary vector potential with a constant curl corresponding to a spatially uniform imaginary synthetic magnetic field. We analytically derive the Gaussian wavepacket dynamics for atoms in such a synthetic magnetic field and study the width-dependent transport, which is unique to non-Hermitian systems. We find numerical agreement between the two-level non-Hermitian Hamiltonian and the adiabatic projection description, confirming the applicability of the latter adiabatic approach.
arXiv·2026-10-05·Maor Shutman et al.
No generated summary available for this entry.
overview
Original abstract
Recent work has shown that syndrome information obtained during error-corrected quantum computation can be utilized for logical error mitigation (LEM), yielding exponential reductions in runtime overhead compared to external'' LEM methods, which do not make use of syndrome data. However, these syndrome-aware LEM methods (SALEM) generally require adaptive circuit operations based on real-time processing of syndromes. Here, we introduce syndrome-based offline logical error mitigation (SOLEM), a framework that utilizes syndrome data entirely in post-processing, without any modification to the given error-corrected circuit. In this sense, SOLEM is built into'' error-corrected circuits, and is in fact simpler to implement than external LEM protocols. The basic idea of SOLEM is to use naturally occurring syndrome-conditioned logical error channels in place of deliberate circuit modifications. We develop unbiased and heuristic estimators within this framework, including offline logical versions of probabilistic error cancellation (PEC) and zero-noise extrapolation (ZNE), as well as a global-regression estimator. SOLEM's fully offline nature leads to three significant advantages. First, SOLEM can post-process syndromes with a more powerful decoder than the one used in real time. Second, multiple estimators can be constructed from the same measured data and optimized using empirical statistical errors and related performance metrics. Third, logical error characterization is needed only in post-processing, allowing characterization data to be collected during circuit execution and reducing sensitivity to hardware drift. Remarkably, SOLEM estimators can achieve these advantages while attaining a runtime overhead which is exponentially lower than that of external LEM and is comparable to that of corresponding SALEM estimators.
arXiv·2026-10-05·Silas R. Beane, Roland C. Farrell
No generated summary available for this entry.
overview
Original abstract
Elastic scattering can generate entanglement and non-local magic between the spins of the two outgoing particles. The amount of entanglement and magic produced is encoded in the S-matrix; a unitary quantum gate that acts on the joint Hilbert space of the two spin-J particles. Previous work derived the entanglement power in terms of the scattering phase shifts for rotationally invariant S-matrices with J=1/2,1,3/2. In this paper, a closed form solution is derived for all J. We further prove that a broad class of non-local quantum resources depend to leading order only on the squared projective Hilbert-Schmidt distance from the nearest non-entangling gate. This holds for the entanglement power and non-local magic power, and the choice of resource simply changes the overall normalization. This universality establishes a common geometric origin for the leading resource-generating capacity of scattering, independent of the details of the interaction.
arXiv·2026-10-05·Mark Bun et al.
No generated summary available for this entry.
overview
Original abstract
We study the one-way communication complexity of the $f$-Boolean Hidden Partition problem. Here, Alice is given an $n$-bit string and Bob is given $Ω(n)$ disjoint blocks of its indices together with a string of labels. Under the promise that the evaluations of $f$ on these blocks either agree with all of the labels or disagree with all of them, Bob must determine which is the case using a single message from Alice. This problem generalizes the Boolean Hidden Matching and Hidden Hypermatching problems, which capture the special case where $f$ is the parity function. We establish classical and quantum communication bounds for $f$-Boolean Hidden Partition in terms of the sign degree $d$ of $f$, proving a conjecture of Doriguello and Montanaro (TQC 2020). Their prior work gave logarithmic communication upper bounds for classical protocols when $d \le 1$ and quantum protocols when $d \le 2$, as well as polynomial lower bounds for certain structured functions with larger sign degree. We show that for every $f$ of sign degree $d \ge 2$, the randomized classical communication complexity of this problem is $Θ(n^{1-1/d})$ while its quantum communication complexity lies between $Ω(n^{1-2/d})$ and $\bO{n^{1-1/\lceil d/2 \rceil} \log n}$. This completely characterizes the functions $f$ admitting polynomial quantum advantage as those for which $d \ge 2$, with a new infinite family of exponential separations given by the case $d = 2$.
arXiv·2026-10-05·Takeru Utsumi et al.
No generated summary available for this entry.
overview
Original abstract
The information-theoretic approach to entanglement typically relies on arbitrarily many input copies and unboundedly complex operations; however, the available resources are constrained in reality. This motivates the study of entanglement theory with limited resources. One of its central questions is which quantities characterize entanglement manipulations, and so far, only the idealized case of pure states has been well explored. In this work, we address entanglement distillation from mixed states and identify the Rényi coherent information as the quantity determining the optimal rate in the worst case under two distinct resource constraints. We first characterize the sample-efficient regime, in which unbounded computational power is allowed. Our universal protocol achieves this rate without knowledge of the input state under certain polynomial rank constraints. This rate is optimal among universal protocols: we construct states whose distillable entanglement is nearly extensive, yet from which no universal sample-efficient protocol attains a rate above their Rényi coherent information. We then push this characterization to the computationally efficient frontier: the same bound holds for any efficient protocol even when the input state is known, and another universal protocol achieves this rate efficiently under additional polynomial constraints on the marginal ranks. Overall, our results give the Rényi coherent information a novel operational meaning in two computational settings: universal distillation with limited copies and efficient distillation even with knowledge of the input state.
arXiv·2026-10-05·Zhenning Liu et al.
No generated summary available for this entry.
overview
Original abstract
Closure phase enables imaging with ground-based interferometric arrays by canceling telescope-dependent phase errors due to atmospheric fluctuations. It can be obtained by measuring fringe phases on individual baselines forming a triangle and summing them. We show that closure phases can be measured more accurately with fewer photons by performing joint measurements on multiple photons. We first establish that at least three photons from the same atmospheric temporal phase-stability window are required for closure-phase information to survive the unknown telescope-dependent phase noise, and show that joint three-photon measurements already provide an advantage over single-photon measurements in the minimal three-telescope setting. We then turn to large arrays and consider estimating all bispectra---complex quantities whose phases are the closure phases---under a global mean-square error criterion. Although an $m$-telescope array contains $Θ(m^2)$ independent triangle bispectra, we show that physical constraints on the visibilities make the total information content grow only nearly linearly with $m$ at fixed accuracy. Exploiting this structure, we construct an efficient protocol using at most three-photon joint measurements with photon cost $\tilde{O}(m)$, whereas any sequential single-photon protocol requires $Ω(m^2)$ photons. When the number of detected photons per temporal stability window scales linearly with the array size, this allows the required exposure time to remain independent of $m$ up to logarithmic factors. We further analyze the complementary high-precision regime using multiparameter quantum metrology and find a similar advantage for collective measurements. Overall, our results show that quantum information processing techniques can substantially improve the sensitivity and robustness of optical interferometry.
arXiv·2026-10-05·Sabee Grewal et al.
No generated summary available for this entry.
overview
Original abstract
We give a shadow tomography algorithm that uses $O(\log(m) \log(m/δ) / \varepsilon^2)$ copies of the input state. Specifically, given a quantum state $ρ$ and observables $O_1,\ldots,O_m$, the algorithm outputs estimates of $\mathrm{tr}(O_iρ)$ for all $i\in[m]$ that are all accurate to within $\pm\varepsilon$, except with probability at most $δ$. The key idea is to work in the average-case setting: for a random state drawn from a known prior, a pretty good measurement on $O(\log(m)/\varepsilon^2)$ copies gives a constant-error guarantee on all but a small fraction of the prior. Boosting this guarantee gives an average-case shadow tomography algorithm, and the minimax principle then (non-constructively) implies the existence of a measurement with the same worst-case guarantee. We also identify an obstruction to further improvement with this approach. While pretty good measurements amplify success over the randomness of the prior, they do not amplify success over the randomness of measurement. This issue appears to be inherent, and gives rise to the remaining $\log(m)$ factor separating the complexity of the quantum problem from its classical counterpart.
arXiv·2026-10-05·H. W. Shawn Liew, Patrick Rebentrost
No generated summary available for this entry.
overview
Original abstract
The seminal Kyle model offers a framework to understand the price impact of an informed trader in a market model for a single asset. We study variants in which the asset's future value is modeled by a classical random walk and by a continuous-time quantum walk, respectively. With these assumptions, we analytically approximate and numerically identify the market equilibrium between risk-neutral market maker and informed trader. In the classical equilibrium, the informed trader possesses a linear strategy, whereas the market maker's pricing rule resembles a logistic curve. The informed trader's profit is also identified to grow sub-linearly with time t. In the quantum equilibrium, the informed trader's strategy forms multiple clusters and the pricing rule exhibits multiple jumps correspondingly. Despite the increasing non-linearity of the equilibrium, the informed trader's profit grows linearly with time t.
arXiv·2026-10-05·Yabo Li et al.
No generated summary available for this entry.
overview
Original abstract
Fault-tolerant quantum computation typically relies on a fixed set of logical primitives, while realizing other desired operations can require substantial resources. We introduce irrep surface codes (ISCs), two-dimensional topological quantum error-correcting codes engineered to transversally implement a prescribed set of logical gates. The engineered gates only need to satisfy two conditions: (i) they generate a finite group, which, up to global phases, is forced by the Eastin-Knill theorem, and (ii) they are irreducible, meaning that any operator commuting with the set of gates must be proportional to the identity. This accommodates arbitrary finite groups of diagonal gates and arbitrary reversible classical gates, since each can be embedded into a larger irreducible finite group of gates. It also enables logical gates outside every finite level of the Clifford hierarchy. To incorporate these operations into surface-code computations, we further develop lattice-surgery protocols to transfer the encoded information between surface codes and ISCs obeying either of two sufficient conditions. Together, these results establish a systematic method for tailoring topological codes to desired logical operations and integrating them into conventional computations.
arXiv·2026-10-05·Giorgio Facelli et al.
No generated summary available for this entry.
overview
Original abstract
We establish general conditions for the rapid convergence of propagation algorithms for computing expectation values of local observables in quantum many-body systems, covering both spin and fermionic systems. Our results apply to evolutions that are sufficiently contractive, providing a general mechanism by which contractivity controls the growth generated by local interactions and enables efficient classical simulation. As a first application, we consider noisy time evolution generated by local Hamiltonians on arbitrary interaction graphs. We show that the dynamics can be efficiently simulated when the noise strength $λ$ is sufficiently large compared to the degree of the interaction graph. More generally, for systems with an interaction strength $u$, our bounds determine a time horizon $t_{\text{max}}$ as a function of the interaction strength $u$, the noise strength $λ$, and the interaction structure below which the algorithm is efficient. In the noiseless limit, $λ=0$, our analysis extends the efficiently simulable time scale from $\log(1/u)$ proved in Facelli, Fawzi, and Fawzi (2026) to $t_{\text{max}} \sim 1/u$ matching the recent improvement by Zhao, Marvian and Tong (2026). As a second application, we apply the same framework to the computation of local observables in Gibbs states of local Hamiltonians. We consider a pseudo-Lindbladian whose steady state is the Gibbs state and show that, at sufficiently high temperature, its propagation algorithm converges rapidly. In particular, for weakly-interacting systems with interaction strength $u$, our result applies up to inverse temperatures $β\sim\log(1/u)$.
arXiv·2026-10-05·Berta Casas, Diego García-Martín, Yuxuan Zhang
No generated summary available for this entry.
overview
Original abstract
Clifford and matchgate circuits are canonical families of classically simulable quantum circuits. Their intersection, the matchgate-Clifford group, plays an important role in randomized fermionic protocols and in matchgate synthesis. Its adjoint action is isomorphic to the group of unit-determinant signed permutations of $2n$ Majorana modes, and we study optimal exact synthesis in this group. That is, given a target unitary and a gate set, output an $n$-qubit circuit implementing the target using the fewest operations. We show that the complexity of this problem strongly depends on the gate set. In particular, we study gate sets consisting of Majorana braids with different connectivity graphs. For path and complete graphs, we prove that the problem is classically solvable in $\mathcal{O}\left(n^2\right)$ time, and we provide explicit gate-optimal compilers. In addition, we prove that when the connectivity graph is a tree, the decision version of the optimal synthesis problem becomes NP-complete. Finally, we benchmark our optimal compiler on chains of up to $n=80$ qubits against those of \texttt{Qiskit} and \texttt{Tket}, obtaining circuits with constant factor improvements $\times2.57$ and $\times2.28$ in the total number of gates, respectively.
arXiv·2026-10-05·Timothee Hoffreumon, Mischa P. Woods
No generated summary available for this entry.
overview
Original abstract
In a previous work, we showed that real quantum theory (RQT) cannot be experimentally distinguished from ordinary quantum theory (QT). In this paper, we investigate whether this indistinguishability survives two natural extensions of the setting: allowing separated measurements to be represented by commuting rather than tensor-product observables, and imposing superselection rules, as in fermionic information theory. We show that it does in both cases. Our first result is a positive answer to the Tsirelson problem in RQT: commuting and tensor-product measurements generate the same finite-dimensional correlations. This is surprisingly not a trivial consequence of the standard complex proof, as it does not carry over to the reals. The proof obstruction becomes particularly relevant in the presence of superselection rules, which is why we first establish the equivalence in RQT before extending the framework to superselected RQT. Our second result is a local, real quantum formulation of superselected theories. We extend the RQT framework to accommodate a representation of superselection over the reals and show, in particular, that it admits a fermionic version whose predictions are experimentally indistinguishable from those of fermionic information theory. More generally, the construction extends to all superselected QTs.
arXiv·2026-10-05·Simon Becker, Cambyse Rouzé, Robert Salzmann
No generated summary available for this entry.
overview
Original abstract
We derive rates of exponential relative-entropy decay for a broad class of infinite-dimensional quantum Gibbs samplers. A key technical ingredient is a perturbative stability theory for hypercontractive estimates and logarithmic Sobolev inequalities. For suitably chosen dissipative couplings, we obtain exponential entropy decay for full multimode Bose-Hubbard samplers with arbitrary hopping and repulsive density interactions. For harmonically confined quantum Coulomb gases and molecular systems, we prove exponential entropy decay for every fixed finite-rank low-energy truncation of the interaction. Finally, we exhibit a periodic charging model with a positive spectral gap but no finite-time $L^2$-to-$L^p$ bound for any $p>2$.
arXiv·2026-10-05·Sabee Grewal, Saachi Mutreja, Kabir Tomer
No generated summary available for this entry.
overview
Original abstract
We exhibit a classical oracle relative to which QMA \neq QMA(2). The separation is based on a separable Hamiltonian problem defined by signed edge constraints on a graph. The YES instances have zero-energy product states, while the NO instances, constructed using the antisymmetric subspace, have entangled zero-energy states but no low-energy product states. For the QMA lower bound, we use compressed-oracle techniques to track the information learned by a quantum computation making few queries to a YES instance. The key step is to map the resulting superpositions of partial oracle records to the NO family without significantly changing the verifier's behavior.
arXiv·2026-10-05·Farzin Salek et al.
No generated summary available for this entry.
overview
Original abstract
We study collective state preparation and channel encoding in fermionic systems under parity superselection and composition governed by the canonical anticommutation relations. For a two-mode Gaussian state $τ$, we obtain the exact entanglement of formation, $E_{\mathrm F}^{\mathrm{phys}}(τ^{\otimes m})=\lceil m/2\rceil\log2$ for every $m\geq1$. Two copies have the same formation value as one, violating additivity and strong superadditivity, while regularization halves the single-copy value. For an associated Gaussian channel, we determine the minimum output entropy and Holevo information at every blocklength and prove nonadditivity of both. Together, these results give exact answers to the fermionic counterparts of the four additivity questions associated with Shor and Hastings. One physical use carries no classical information, whereas two uses transmit one bit perfectly. The unassisted classical and zero-error classical capacities both equal one half bit per mode. A sharp finite-block bound gives a strong converse: the decoding success probability vanishes at every rate above capacity. These optimizations cover all physical pure-state decompositions and channel inputs, with Gaussian ensembles and classical codes attaining the optima. The formation and minimum output entropy formulas hold for every Rényi order $α\in(0,\infty]$. We also determine the unassisted quantum and zero-error quantum capacities, both equal to one half logical qubit per mode, and prove a strong converse: entanglement fidelity vanishes at every rate above capacity. For a noisy Gaussian family, we determine the one- and two-copy formation values and prove strict nonadditivity at full rank. For $τ$, Bell violation under local parity-preserving measurements first appears at three copies.
arXiv·2026-10-05·Alexander Kulpe et al.
No generated summary available for this entry.
overview
Original abstract
Self-testing certifies quantum states and measurements from observed correlations alone, without requiring a description of the devices that produce them. In this work we establish, to the best of our knowledge, the first robust self-test of the full continuous family of measurements generated by Majorana operators. We achieve this by showing that the Grothendieck game, a two-player nonlocal game in which the players receive directions on a sphere and return binary answers, is a self-test of Majorana observables. That is, any near-optimal performance certifies an entire continuously parameterized family of quantum measurements. We further extend this certification to products of Majorana observables, obtaining a robust self-test of the spin representation of the continuous pin group.
arXiv·2026-10-05·Rahul Arvind, Nicholas Hunter-Jones
No generated summary available for this entry.
overview
Original abstract
We study the emergent randomness in projected ensembles generated by dual-unitary circuits. Specifically, we consider evolution by solvable dual-unitary brickwork circuits followed by measurements on part of the system, which induce an ensemble of states on the unmeasured subsystem. Previous work has established that this projected ensemble of states forms a quantum state design in the limit where the bath size is large, but the rate of convergence at finite bath size has not been rigorously established. Under three inverse-polynomial assumptions, local permutation mixing, a bound on recurrent backward motion, and contraction at the measured boundary, we fill this gap and prove that a bath of polynomial size suffices to form approximate $k$-designs. In establishing our results, we develop a microscopic transport interpretation of emergent randomness in the projected ensemble, in which deviations from local permutation operators appear as defects, and make connections with the theory of quantum walks.
arXiv·2026-10-05·Rhik Mazumder, Pradeep Niroula
No generated summary available for this entry.
overview
Original abstract
Decoded quantum interferometry (DQI) uses classical error correction to solve optimization problems, but it is hard to tell which problems could give it a quantum advantage. We develop soundness rules that screen candidate problems by their code parameters, decoding guarantees and classical baselines. For the standard objective of counting satisfied constraints, we prove that under worst-case Hamming decoding DQI's guarantee can exceed Prange completion by at most $(\sqrt{2}-1)/2$. Optimal polynomial intersection (OPI) attains this margin cap asymptotically, so no candidate in this setting can exceed OPI's margin. We also derive a performance law for real-valued objectives: the objective fixes both the solution quality and which errors the decoder must correct. An AI-agent search guided by these rules found two candidate applications. Alternant max-agreement on McEliece-type public keys tests what a secret decoder is worth to DQI against classical solvers that see only the public instance. Multiplicative polynomial intersection, a knapsack-type problem built from discrete logarithms, pairs a cosine objective with a public decoder for signed errors. For both we prove decoding guarantees and finite-length comparisons with Prange restarts, and on the larger instances we tested, DQI's expected quality exceeds what our classical solvers reach within fixed budgets.
arXiv·2026-10-05·Nishad Maskara et al.
No generated summary available for this entry.
overview
Original abstract
Quantum low-density parity-check (qLDPC) codes offer a promising route to reducing the qubit overhead of fault tolerance, with recent ultra-high-rate constructions achieving encoding rates above one half. In this work, we develop fast and parallel logical computation methods for ultra-high-rate codes. We first utilize the group symmetries of the codes to partition the logical qubits into orbits, and then apply parallel surgery methods to implement group-invariant collections of logical Pauli-product measurements. These measurements are highly programmable, as we may arbitrarily couple logical orbits as long as each measurement is repeated across the whole orbit(s). To reduce the space and time overheads, we develop a technique called chain-map convolution, which uses the group structure to boost both the spatial and temporal distances of our protocol in a highly efficient manner. As case studies, we construct distance-preserving parallel measurement gadgets for the [[256, 68, 12]], [[576, 148, 18]] pair-partition codes, and a [[1152, 580, 12]] rate-$1/2$ code, with only around $2.5\times$ space overhead and 3-4 rounds of syndrome extraction each. The same methods also enable parallel injection of cultivated magic states into high-rate codes. Finally, we extend programmability through subgroup restrictions, revealing a tradeoff between logical control and the spacetime resources required for fault tolerance and highlighting the crucial role structured parallelism plays in reducing overhead. These results provide new methods for designing qLDPC logical operations with low spacetime overhead, opening a route toward more efficient fault-tolerant quantum architectures.
arXiv·2026-10-05·Patrick Hayden et al.
No generated summary available for this entry.
overview
Original abstract
We study a variant of Schumacher compression. The task asks for the minimal memory cost for compressing many copies of a density matrix with known spectrum and unknown eigenbasis, without preserving its purification. For fixed dimension and distinct positive eigenvalues, we obtain the cost through its additive constant. Achievability uses a generalization of Werner's cloning map to $\mathrm{GL}(d,\mathbb C)$ irreducible representations, with finite trace-distance bounds controlled by highest-weight differences and row gaps. The matching converse follows from a quantitative form of Koashi--Imoto incompressibility for irreducible group orbits under a spectral-gap assumption. We also identify the relation between this quantum minimum description length and universal lossless coding overhead, and its connection to free entropy is explained in a companion letter. We provide a Lean certificate for our proofs.
arXiv·2026-10-05·Patrick Hayden et al.
No generated summary available for this entry.
overview
Original abstract
In free probability, Voiculescu's free entropy counts matrix microstates that approximate an operator. It is a non-commutative analog of the Shannon entropy, distinct from any quantum entropy of a density operator, but it has had no physical meaning in quantum theory. We define a finite-dimensional physical free entropy at finite resolution and show that it directly characterizes, up to an explicit constant, the minimal quantum memory needed to program many copies of a state with known eigenvalues and unknown eigenbasis. This task is a variant of Schumacher compression, and we call its optimal cost the quantum minimum description length. We briefly discuss how free entropy differs from quantum entropies and its potential applications in quantum physics.
arXiv·2026-10-05·Alper Cakan et al.
No generated summary available for this entry.
overview
Original abstract
Since the introduction of the complexity class QMA as a quantum-verifier analogue of NP (Kitaev, 1997), many have wondered whether quantum proofs are necessary or classical proofs suffice - that is, whether QMA = QCMA or QCMA != QMA (Aharonov and Naveh, 2002; Aaronson and Kuperberg, CCC '07). This longstanding question was recently answered by works of Bostanci, Haferkamp, Nirkhe, and Zhandry (STOC '26) and Bostanci, Huang, and Vaikuntanathan (FOCS '26), which showed that quantum proofs are more powerful than classical ones in the classical-oracle setting. However, it remains unclear what exactly makes quantum proofs more powerful than classical ones. In the information-theoretic setting, a family of quantum states is not classicalizable if and only if it is unclonable. Indeed, these recent works also explicitly highlight the unclonability of their quantum proofs as a key mechanism behind their separations, and their arguments crucially rely on this property. This raises the question of whether unclonability is necessary for quantum proofs to be more powerful than classical ones. In this work, we show that even clonable quantum proofs can be more powerful than classical ones relative to a classical oracle by constructing a classical oracle O such that QCMA^O != ClonableQMA^O. This resolves the open question of Nehoran and Zhandry (ITCS '24), who established the analogous separation relative to a quantum oracle. We also show a classical-oracle separation between BQP/clonableqpoly and BQP/poly, and give applications of our results to quantum cryptography.
arXiv·2026-10-05·Adam Bene Watts et al.
No generated summary available for this entry.
overview
Original abstract
We consider the computational task of anti-symmetrization of an unknown mixed quantum state: Given iid copies of a rank-$r$ qudit state $ρ=\sum_{i=1}^r λ_i |\varphi_i\rangle\!\langle\varphi_i|$, prepare a copy of the state proportional to $Π_{\mathrm{anti}}^r (|\varphi_1\rangle\otimes \ldots\otimes|\varphi_r\rangle)$, with $Π_{\mathrm{anti}}^r$ the anti-symmetric subspace projector. We first give a simple algorithm for anti-symmetrization that uses $\widetilde{O}(r / λ_{\min})$ copies of $ρ$, where $λ_{\min}$ is the minimum non-zero eigenvalue of $ρ$. This algorithm works even in the streaming setting with small working memory, and it uses only simple quantum operations like controlled-SWAPs and constantly many layers of single-qubit gates. As an application of this streaming anti-symmetrization procedure, we give a reduction from gapped mixed-state one-way state generators to pure-state one-way state generators. Then, using tools from Schur-Weyl duality, we give and analyze a second (non-streaming) anti-symmetrization procedure that uses $O(r / λ_{\min})$ copies of $ρ$, which then serves as a building block in new algorithms for weak Schur sampling and unitary Schur sampling, outperforming existing approaches in some regimes of number of copies $n$ and local dimension $d$, as well as in an algorithm for optimal purity amplification for qudit states.
arXiv·2026-10-05·Marcin Kotowski et al.
No generated summary available for this entry.
overview
Original abstract
Partial distinguishability affects multiphoton interference, which is central to large-scale photonic experiments such as Boson Sampling and to applications of multiphoton states across quantum technologies. Characterizing the internal degrees of freedom responsible for this behavior is challenging: in many scenarios they cannot be accessed directly and even their dimension or physical nature may be unknown \emph{a priori}. Here we introduce Gram-matrix tomography for independently prepared photons with pure or nearly pure internal states. For pure states, the Gram matrix contains all information required to predict the statistics of experiments that are insensitive to the internal degrees of freedom. We reconstruct this matrix, up to physically irrelevant phase choices, from a quadratic number of measurable Bargmann invariants (quantities encoding overlap magnitudes and collective phases). We access these quantities using two complementary approaches: targeted Fourier interferometers and two- and three-body photon-number correlations measured in a single random interferometer. We derive explicit error bounds that control the total-variation distance between predicted and actual outcome distributions for any subsequent experiment that is insensitive to the internal states. These guarantees account for finite sampling and deviations from purity. Crucially, the total sample complexity of the protocol is independent of the internal Hilbert-space dimension and polynomial under mild assumptions on overlaps of internal states. Our protocol uses standard interferometric measurements and turns them into a robust and operationally grounded characterization of partially distinguishable photons.
arXiv·2026-10-05·Katherine Van Kirk, Craig Gidney
No generated summary available for this entry.
overview
Original abstract
A major practical obstacle to Regev's factoring algorithm is its large space usage. In particular, the algorithm was believed to be incompatible with "qubit recycling," which streams the control qubits in phase estimation rather than storing them all simultaneously. We show how to fix this streaming problem. We build on the construction of Ragavan and Vaikuntanathan, which used Fibonacci accumulators to reduce the qubit count from $O(n^{1.5})$ to $11.32n$. We make two key improvements. First, we use superposition masking to prevent unwanted information from entering the accumulators, removing the need for uncomputation. Second, we show how to perform phase estimation using Fibonacci powers of a unitary operation rather than powers of two. This avoids various encoding conversions required by the construction of Ragavan and Vaikuntanathan. After these improvements, the phase-estimation qubits are used only once in the circuit, allowing them to be streamed. Our improvements reduce the space usage of Regev's factoring algorithm to $n+M(n)+O(\sqrt{n})$, where $M(n)$ is the space required for an in-place multiplication. For example, using the in-place multiplier of Luo et al. (2026), Regev's algorithm can factor an $n$-bit integer using $4n+O(\sqrt{n})$ qubits. Although our construction still falls short of the $n/2+εn$ qubits sufficient for leading implementations of Shor's algorithm, it is the lowest-space instantiation of Regev's algorithm to date and suggests that Regev's algorithm is still far from fully optimized.
arXiv·2026-10-05·Arpit Dua et al.
No generated summary available for this entry.
overview
Original abstract
The Eastin-Knill theorem rules out a universal set of transversal logical gates on any code that detects single-qubit errors. The theorem constrains one partition of the qubits at a time. We show that depth-one layers of few-qubit gates, each respecting its own partition, can together generate a universal logical gate set on an error-correcting code. Each logical gate generator is then a single depth-one layer followed by error correction of the same stabilizer code, with no magic-state distillation, code switching, gauge fixing, lattice surgery, or other gadgets. We show that such codes can be found by applying an entangling circuit to a lower-distance "seed" code admitting a depth-one non-Clifford gate and an appropriate "kernel" code. We construct 47 codes with depth-one generating sets that tolerate at least one faulty gate per layer, including a [[37,1,7]] and a [[59,1,9]] code, both of check weight at most eight.
arXiv·2026-10-05·Nadezhda Voronova
No generated summary available for this entry.
overview
Original abstract
How can random order change the role of quantum memory in streaming? Later classical input can restore the usefulness of a quantum state consumed by earlier queries. We call this replenishment. We construct an artificial problem based on Hidden Matching, with repeated coordinate data and online matching requests. It admits a one-pass quantum algorithm using polylogarithmic space in uniformly random order, but unconditionally requires polynomial space both classically in random order and quantumly when all updates precede the requests. To prove the quantum lower bound, we strengthen the consumability bounds of Gilboa, Jain, and McClean for Multiple Hidden Matching. Without prior entanglement, any quantum encoding supporting $r$ independent matching requests requires $Ω(r)$ qubits for $r\le N^{1/2-δ}$ and every fixed $δ\in(0,1/2)$, even with simultaneous revelation and arbitrary joint decoding. For sequential requests, the linear bound extends through $r=Θ(\sqrt N)$. We also adapt Kallaugher's triangle-counting algorithm to uniformly random streams in which every edge is repeated equally often. Rebuilding the quantum sketch and resampling the classical estimator improve its expected-space bound in suitable parameter regimes. Finally, we extend the robust Noisy Gap Cycle framework of Assadi and Sundaresan to quantum streaming. A quantum communication lower bound for Block Hidden XOR yields an $Ω(n)$ space lower bound in random edge order for large enough cycles, with consequences for several graph problems. Thus random order can enable replenishment of small quantum representations, while substantial space requirements persist for other tasks.
arXiv·2026-10-05·Yaroslav Herasymenko et al.
No generated summary available for this entry.
overview
Original abstract
The no-cloning theorem is a cornerstone result in quantum mechanics that forbids copying of general quantum information. More quantitatively, even given $N$ copies of an unknown state, any channel producing an $(N+1)$-copy state incurs a nonzero trace-distance error on some inputs. Turning this around, one can ask about the sample complexity of approximate $N\rightarrow N+1$ cloning: for a desired small error $ε$, what $N$ suffices? For arbitrary pure states on a Hilbert space $H$, the answer is $N\simeq \dim H/ε$ - astronomically large for most $H$ of interest. What if the input is promised to lie in a structured family? We examine a range of families fundamental to many-body physics and quantum information: $n$-mode fermionic Gaussian and Slater states, $n$-mode bosonic Gaussian states, and qudit phase states. For fermions, we construct optimal cloning channels, reducing the complexity from exponential to polynomial in $n$. For bosonic Gaussian states, we construct an explicit cloner that certifies polynomial complexity, without any constraint on the energy of the state; this channel, however, is not optimal in general. The fermionic and bosonic results follow from a single representation-theoretic framework, which generalizes previous work by Werner and by Chiribella and Yang; it also yields the cloners' unitary implementation. Furthermore, we explain why for many families the cloning complexity is linear in the dimension of the family manifold, via a controlled saddle-point evaluation of the frame potential at high $N$. The same calculation accounts for the analogous scaling of tomography complexity. The above framework does not cover phase states; for these we give an independent construction of a channel with optimal cloning fidelity. Our work complements recent results on cloning stabilizer states.
arXiv·2026-10-05·Oxana Shaya
No generated summary available for this entry.
overview
Original abstract
Measurement incompatibility enables quantum advantages in communication and state discrimination. It is also necessary for Bell nonlocality, which is used in device-independent protocols for quantum key distribution and private randomness generation. Classical communication can influence the receiver's outcome and must therefore be accounted for when certifying measurement incompatibility. We introduce union maximal leakage, which quantifies the information needed for a common classical explanation of all observed probabilities and is computed from them by a linear program. If a message of at most $k$ bits precedes the receiver's independent measurement choice, compatible measurements for each message give union maximal leakage at most $k$. This bound holds with any input-independent nonsignalling shared resource. In quantum theory, a violation also implies that the initially shared state is entangled. Conversely, union maximal leakage determines the minimum classical communication needed to reproduce the observations with compatible measurements and arbitrary nonsignalling assistance. For a fixed shared quantum state and receiver measurements, a violation is possible exactly when, for some message value, the receiver's measurements are Bell-nonlocal against two-outcome sender measurements on that state. For binary receiver outcomes, we show that a violation also certifies randomness private from the sender, even when the receiver's measurement depends on the sender's message and the sender retains quantum side information. We quantify this privacy through an explicit conditional entropy bound and establish composably secure randomness extraction in sequential protocols with device memory.
arXiv·2026-10-05·Keshav Bhateja, Mehdi Esmaili, Atul Mantri
No generated summary available for this entry.
overview
Original abstract
Random circuit sampling experiments, the leading demonstrations of quantum computational advantage, are tested with the linear cross-entropy benchmark (XEB), which scores outcomes by their ideal probabilities. We study what a high XEB score certifies about an untrusted quantum device. In the quantum query model, we show that the honest sampler's ideal score acts as a Tsirelson bound for efficient devices and certified randomness. First, exceeding the ideal score by a constant requires $Ω(N^{1/3})$ queries for the Haar and Fourier oracle ensembles with $N$ outcomes, and this bound is tight; this proves an earlier conjecture for Haar-random states and extends it to Fourier sampling. Second, for Fourier sampling and for Haar-random states accessed through the canonical state-preparation oracle, the $n$-bit output of a device that makes polynomially many queries and scores within $o(1)$ of the ideal score has $n-O(\log n)$ bits of smooth min-entropy, even against an adversary who is entangled with the device and later learns the oracle; this is nearly optimal. As a corollary, sampling the collision distribution, which is proportional to the square of the ideal distribution, has query complexity $Θ(N^{1/3})$, and a coherent version of the same algorithm approximately prepares quantum Hadamard products of states with uniform amplitude magnitudes. Both lower bounds rest on progress measures that bound the excess over the ideal score and increase only slightly with each query. For Fourier sampling the measure is the norm of the coherent amplitudes for removing pairs in a purification of the random function, combining the polynomial method with the compressed oracle technique; for Haar-random states it is the square root of the average level in an expansion in Dirichlet orthogonal polynomials, controlled by an exact identity for the effect of one observation.
arXiv·2026-10-05·Weiyuan Gong et al.
No generated summary available for this entry.
overview
Original abstract
Learning the Hamiltonian of a many-body system from its dynamics is a central task in quantum science, yet the algorithms with the strongest provable guarantees assume some level of quantum control--fast, arbitrary single-qubit gates interleaved with time evolution, and measurements in arbitrary bases--that is beyond the capabilities of near-term analog quantum simulators. Motivated by analog atom- and ion-based platforms, we study Hamiltonian learning under minimal access models. Uniform state preparation and measurements: We first consider the setting where in every experiment, one can rotate each qubit to the same state, perform short-time evolution, and measure every qubit in the same basis. Surprisingly, we show that for generic 2-local Hamiltonians on any interaction graph, all of the parameters can be reconstructed from such experiments. Computational basis state preparation and measurements: We then consider a similarly constrained setting, but where state preparation and measurement are restricted to the computational basis. For nearest-neighbor Hamiltonians with only Pauli $X/Z$ interactions, a class which captures contemporary Rydberg atom platforms, we show that over 1D and 2D rectangular lattices, all of the parameters can be reconstructed from such experiments up to unavoidable gauges. Our protocols introduce new techniques for solving structured polynomial systems over an extensive number of parameters. Taken together, our results suggest that one can learn a great deal from the dynamics of quantum many-body systems even under the most stringent experimental constraints.
arXiv·2026-10-05·Shyam Dhamapurkar et al.
No generated summary available for this entry.
overview
Original abstract
We consider the following data compression problem. Given a string $x \in \{0,1\}^m$ of Hamming weight at most $n$, compress it into a shorter string $y \in \{0,1\}^s$ so that any bit $x_i$ of $x$ can be retrieved without any error using at most $t$ quantum queries to the standard oracle encoding of $y$. If queries are allowed to be adaptive we show how optimal compression up to a logarithmic factor can be achieved. If the queries are required to be made non-adaptively, we show schemes whose space is optimal in its dependence on $m$ except for a logarithmic factor, and is at most quadratically worse when compared to the optimum in its dependence on $n$.
arXiv·2026-10-05·Andrew Huang, Akshar Ramkumar, John Wright
No generated summary available for this entry.
overview
Original abstract
A major open problem in quantum complexity is the question of unitary synthesis---namely, is it possible to efficiently implement any unitary, given the ability to evaluate any classical function in superposition? Inspired by a recent work by Brakerski and Yuen (CRYPTO 2026), we propose an ``average-case'' unitary synthesis problem, which asks whether it is possible to efficiently implement a Haar random unitary given access to a random Boolean function. We then demonstrate a superpolynomial query lower bound, establishing that unitary synthesis in this model is impossible. Along with our main result, we settle in the negative a question Brakerski and Yuen pose, of whether scalable pseudorandom unitaries (PRUs) can be implemented in the ROM-PRU model. In particular, we show that in the ROM-PRU model, no $Ω(N^{1+γ})$ unitary design on $n$ qubits, where $N=2^n$, can be efficiently achieved for any $γ> 0$. On the other hand, we construct an $O(N)$-design in $\text{poly}(n)$ queries in the same model, surpassing the previously best known results which constructed $O(\sqrt{N})$-designs.
arXiv·2026-10-05·Junaid Aftab
No generated summary available for this entry.
overview
Original abstract
The Clifford hierarchy plays a central role in fault-tolerant quantum computation, but its higher levels remain only partially understood. Recent work on quantum higher order Fourier analysis characterizes membership in the Clifford hierarchy using quantum derivatives, but does not provide an explicit description of the individual levels. In this work, we address this problem by showing that the collection of quantum derivatives of a unitary operator forms a non-abelian \(1\)-cocycle, and conversely that every such \(1\)-cocycle arises from a unitary operator. This yields a recursive cohomological characterization of the Clifford hierarchy. We then specialize this framework to the third level and decompose the cocycle data into symplectic, affine, and phase components, each admitting a cohomological interpretation. As applications, we give a new proof that every two-qudit gate in the third level of the Clifford hierarchy is semi-Clifford, and prove for the first time that every three-qudit gate in the third level is semi-Clifford.
arXiv·2026-10-05·Shubham Kumar Balaganchi A. Bhargava et al.
No generated summary available for this entry.
overview
Original abstract
Preparing stabilizer-code states with shallow circuits is an important primitive for near-term quantum error correction in superconducting circuits, where logical-state initialization requires four-body stabilizer correlations from native one- and two-body controls. We introduce a digital-analog method for the preparation of surface-code ground-state manifolds. The method exploits a structural property of the adiabatic gauge potential, mapping stabilizer-local counterdiabatic terms to digital-analog blocks on the superconducting layout using fixed-angle two-qubit \(XY\) gates, single-qubit rotations, and analog exchange-interaction evolutions. The dressed blocks generate higher-order operators used as the variational ansatz to determine the counterdiabatic terms within the Sels-Polkovnikov adiabatic-gauge-potential framework. We benchmark checkerboard plaquette-stabilizer grids up to \(4\times4\), the square-grid instances correspond to rotated surface codes, while the rectangular cases probe the scaling of the method. For all grids, the proposed method generates the dominant four-body counterdiabatic basis and, at short evolution times substantially improves the ground-state preparation as compared with bare adiabatic evolution. We further generalize the construction to \(n\times m\) stabilizer lattices and show that digital-analog synthesis can reduce the entangling depth by an order of magnitude. Together, these results establish a direct connection between stabilizer geometry, the structure of the counterdiabatic gauge potential, and digital-analog control for measurement-free preparation of stabilizer-code states on near-term superconducting architecture.
arXiv·2026-10-05·Aleksander Cząstkiewicz, Paweł Scharoch, Krzysztof Gawarecki
No generated summary available for this entry.
overview
Original abstract
In this paper, we theoretically study the electron and hole $g$-factors in inorganic lead-halide perovskites for the reference cubic phase. We employ an 18-band $k \cdot p$ model and determine its parameters using target band structures obtained from DFT calculations. We use the linear response theory to calculate the $g$-factors and investigate their dependence on external strain. We then perform real-space calculations of the electron and hole $g$-factors in perovskite nanocrystals. We show that the bulk $g$-factors can be tuned over a wide range by external strain. In some cases, strain can be used to tune the $g$-factor through zero. By contrast, the carrier $g$-factors in CsPb$X_3$ nanocrystals are considerably less sensitive to strain due to quantum confinement.
arXiv·2026-10-05·Pablo Sala et al.
No generated summary available for this entry.
overview
Original abstract
We develop an operational approach to strong-to-weak spontaneous symmetry breaking (sw-SSB) of a non-Abelian symmetry group G. We formulate it as the decoding task of distinguishing two strongly symmetric states that differ by a pair of inserted irreps, after both are corrupted by strongly symmetric decoherence. For finite G, this task is dual to distinguishing logical states of the quantum double D(G) under pure-charge noise. We derive a hierarchy of statistical mechanics models describing optimal decoding from the fusion outcomes measured on successively larger nested regions. As for maximum-likelihood decoders of Abelian codes the measured irreps act as quenched disorder obeying a Nishimori-like condition. Strikingly, because local irreps do not determine how they fuse globally, the strong $G\times G$ symmetry is realized only nonlocally, and irreps trivially charged under Z(G) (the center of G) can hide inside noise-generated ones. As a result, the strong symmetry spontaneously breaks down to Z(G), times the weak symmetry. The only transition at nonzero error rate is then an ordering of the center, whose threshold cannot decrease as the hierarchy is ascended. This conclusion holds at any finite level of the hierarchy for non-nilpotent groups. We confirm these predictions with tensor-network calculations for $S_3$ and SU(2). At the first level, the $S_3$ model, whose center is trivial, shows no transition, and the fidelity correlations of all irreps provably decay to non-zero values. The SU(2) model exhibits a $Z_2$ transition consistent with the Nishimori-Ising universality class, where the fidelity correlations of spin-$1/2$ irreps become long-range. The threshold rises from the first to the second level of the hierarchy by $16\%$. Our results provide a systematic framework for studying non-Abelian sw-SSB and for constructing decoders for non Abelian topological codes.
arXiv·2026-10-05·Mutsumi Shimomura, Kohei Kawabata
No generated summary available for this entry.
overview
Original abstract
The Hohenberg-Mermin-Wagner theorem motivates the expectation that continuous symmetries remain unbroken in one-dimensional quantum ground states. Here, contrary to this expectation, we demonstrate the spontaneous breaking of U(1) spin-rotation symmetry and the emergence of an interacting quantum critical point in lattice spin-$1/2$ and spin-$1$ chains. Using subsystem Binder scaling, we locate the critical point and determine the correlation-length critical exponent as $ν= 0.60 \pm 0.02$, distinct from the Gaussian value $0.5$ but consistent with the perturbative renormalization-group prediction. We further analyze the finite-size scaling of the lowest neutral excitation gap and obtain the dynamical critical exponent $z=1.986 \pm 0.005$. The result $z < 2$ is incompatible with microscopic realizations of this critical theory by frustration-free models, implying a mechanism for continuous symmetry breaking in one-dimensional quantum ground states distinct from frustration freeness.
arXiv·2026-10-05·Zhong-Xia Shang, Yufei Wang, Daniel Stilck França
No generated summary available for this entry.
overview
Original abstract
Provable guarantees for preparing quantum Gibbs states, such as rapid mixing or gapped coherent preparation paths, are known only for restricted Hamiltonian families and usually must be re-derived for each new family. Building on homomorphic polynomial transduction, a generalization of decoded quantum interferometry (DQI) and Hamiltonian DQI (HDQI), we show how relative decoding transfers such a guarantee from a source Hamiltonian $H_A$ to a target $H_B$. Writing each Hamiltonian as a sum of $m$ Pauli terms, the subsets of terms whose product is proportional to the identity, its relations, form a binary linear code, $K_A$ for the source and $K_B$ for the target, with the Pauli-label matrix as parity-check matrix as in DQI. Starting from the canonical thermofield double (TFD) of $H_A$, a Bell transform, a reversible label map, and a coherent decoder for the quotient code $K_B/K_A$ prepare an approximate TFD of $H_B$, and hence its Gibbs state. Because this decoder only resolves target relations absent from the source, the reachable inverse temperature is set by the relative distance $d_{\rm rel}$, the fewest terms in any such relation. It can far exceed the ordinary distance $d_{\rm ord}$, the fewest terms in any target relation, which bounds the uniform exact decoding radius of DQI and HDQI. We show that linear $d_{\rm rel}$ with efficient decoding at linear radius certifies a constant inverse temperature. As an example, starting from a nearest-neighbor spin chain whose TFD is known to be preparable at every finite temperature, a sparse classical parity-check matrix yields bounded-degree, geometrically nonlocal, noncommuting targets with $d_{\rm ord}=3$ and $d_{\rm rel}=Θ(m)$. To our knowledge, this gives a new class of efficiently preparable TFDs.
arXiv·2026-10-05·Chon-Fai Kam, Kai-Wen Wong
No generated summary available for this entry.
overview
Original abstract
Time reversal $Θ$ squares to $-1$ on a half-integer spin, so every state is orthogonal to its time reverse. This sign has been read only from quantum objects. The equilibrium state loses it, but the classical record keeps it. For a detector that resolves handedness, the probabilities that one stretch of record is followed by the time reverse of another measure the cohomology class of time reversal, $Θ^2=\pm1$. Their matrix carries this sign in its signature, a topological integer that survives equal emission and absorption losses. A programmed emitter on quantum processors reads it in about $10^3$ shots.
arXiv·2026-10-05·Eric Chitambar, Yujie Zhang
No generated summary available for this entry.
overview
Original abstract
A quantum channel is called incompatibility-breaking if it always destroys the incompatibility of quantum measurements. On the other extreme are incompatibility-preserving channels, which never destroy incompatibility. This work studies both types of channels through the mathematical framework of zonotopes and zonoids, an approach that provides a complete characterization of compatibility for dichotomic measurements and is particularly powerful in the qubit setting. Using the language of zonoids, we present necessary and sufficient conditions for when a qubit unital channel is incompatibility-breaking, which are also sufficient for nonunital channels. As one of our main results, we demonstrate the superactivation phenomenon of two incompatibility-breaking qubit channels that are no longer incompatibility-breaking when used in parallel. Translating this result into the task of quantum steering, it says that two copies of a two-qubit Werner state can be steered at noise threshold $1/2$, even though this is impossible using just one copy. For the problem of incompatibility preservation, we prove that a quantum channel with matching input and output dimensions will preserve general incompatibility if and only if it is a unitary transformation. When the output dimension is larger, this result no longer holds, and we offer a conjectured form of a general incompatibility-preserving channel.
arXiv·2026-10-05·Advait Deshpande, Luciano Baresi, Arosha K. Bandara
No generated summary available for this entry.
overview
Original abstract
Despite the promise and potential of quantum computing, most of the current day developments of quantum computing have several limitations for relevant practical use. As a result, hybrid classical-quantum computing has emerged as a viable solution. This paper discusses the software aspects of hybrid classical-quantum computing solutions to understand and examine how hybrid computing solutions can be expected to work in practice. This paper examines existing software solutions (cloud applications, middleware frameworks, and API gateways) that can enable classical and quantum computing to work together. For practitioners the paper provides a curated list of algorithms, full stack libraries, simulators, and cloud service providers that are likely to be central to the development of any hybrid computing solutions. We conclude by identifying an agenda for future research on classical-quantum hybrid software engineering, and some near-term priorities for development of functional, robust hybrid software systems. The paper argues that due to the deep dependency of quantum execution on classical pre- and post-processing, hybrid computing may represent a near-permanent outcome of classical-quantum computing rather than a transitional workaround.
arXiv·2026-10-05·Juan Cruz-Benito
No generated summary available for this entry.
overview
Original abstract
Building on our earlier program-evolution workflow guided by large language models (LLMs), we study weight-five bivariate bicycle (BB) and perturbed bivariate bicycle (PBB) codes. The resulting catalogue contains 1,142 distinct code proposals, including 1,081 nonbaseline proposals attributable to LLM-generated programs. Across the catalogue, we certify connected Calderbank--Shor--Steane (CSS) realizations [[96,4,10]], [[140,6,10]], and [[180,4,14]]. A post-search comparison certifies seven imported Lin--Pryadko archive constructions. For leading parameter triples also represented in that archive, we provide exact distance evidence, explicit bivariate presentations, and verified component reductions. A basis-independent connectivity analysis identifies 409 of the 1,142 catalogue entries as disconnected and shows that 73.1\% of the classes with exact distance certificates contain repeated connected components. Algebraic analysis organizes the connected CSS classes into order-3, order-7, and order-15 cyclotomic-kernel strata. The strongest exact connected PBB parameter point is [[216,4,10]], attained by two distinct component classes. Among the 936 distinct CSS proposals from the LLM-guided campaign with a recorded positive distance, 816 (87.18\%) are certified at $d\geq5$. For comparison, three random-search controls each sample 6,444 CSS code proposals uniformly without replacement, using the same per-lattice and encoded-dimension sample counts as the LLM-guided campaign. In these controls, 4,672--4,785 proposals (72.50--74.26\%) meet the same criterion. The LLM-guided campaign has the higher certified yield, while the random controls cover more connected classes. Together, these results extend LLM-guided discovery to a more constrained code family and provide a reproducible structural and exact-distance account of its strongest candidates.
arXiv·2026-10-05·Yaocheng Chen
No generated summary available for this entry.
overview
Original abstract
GPU-based optimization faces two communication bottlenecks: coordinating frequent requests and delivering dense models that exceed device memory. We present a discrete simulated bifurcation (dSB) architecture that addresses both through NVIDIA DOCA GPUNetIO. For resident models, a persistent service receives field updates, executes each solve within one GPU thread block, and returns the result. Exact integer coupling sums, GPU work queues, and batched transmission keep the receive--solve--reply path on the device without a dedicated CPU data-path core. In comparisons with socket-based servers using the same solver, the largest latency gains occur under concurrent load. As the offered load increases from 400 to 800 thousand requests per second, median round-trip latency rises by only 6\%. At the highest tested load, median and 99th-percentile latencies are 189 and 218~$μ$s, compared with 288 and 609~$μ$s for the tuned persistent CPU proxy across repeated runs. For models larger than device memory, a streaming solver retains dynamical state on the GPU and reuses incoming coupling tiles across replicas. It evaluates ten-million-variable dense binary matrices at approximately 307~Gb/s, consuming a 12.5-TB logical matrix through a 64-MiB packet buffer. Ground-state recovery on planted instances and agreement with reference executions verify the computation. Together, the two modes scale dSB to concurrent requests and dense models beyond GPU memory.
arXiv·2026-10-05·Sijia Yu, Yifan Zhou
No generated summary available for this entry.
overview
Original abstract
Global condition-number dependence can substantially overestimate the difficulty of preparing normalized quantum linear-system solutions. Many existing beyond-conditioning approaches are favorable when globally ill-conditioned directions have limited relevance to the target solution. Here we study a harder regime for time-evolution quantum Krylov linear solving (QKS), where a vanishing eigenvalue remains solution-relevant and must be retained. We identify a QKS regime in which the solution-relevant spectrum is compressed into a compact reduced space where the ill-conditioning is concentrated along a soft direction aligned with the solution, so that normalization removes the divergent amplification along that direction and leaves only a bounded transverse response. Consequently, the normalized-state complexity need not inherit the divergence of the global condition number. Our contributions are threefold: (1) We show that the solution-relevant information admits a compact and stable QKS representation, with bounded subspace dimension, evolution time, and reconstruction overhead as the relevant eigenvalue vanishes. (2) We show that normalized-state difficulty is governed by whether inverse amplification changes the solution direction, rather than by the small eigenvalue alone; even an arbitrarily ill-conditioned reduced system can remain directionally stable when the amplification is solution-aligned. (3) We prove that this stability persists under finite projected-system errors and transfers to the actual QKS output, yielding an end-to-end complexity bound without inverse dependence on the retained small eigenvalue. An explicit separation family further shows that a full inverse-amplification criterion can diverge while the corresponding QKS quantities remain bounded.
arXiv·2026-10-05·Michael Zurel
No generated summary available for this entry.
overview
Original abstract
We present a discrete analogue of geometric quantization over finite fields which, when applied to certain classical error-correcting codes, yields quantum error-correcting codes. This provides a physical interpretation for a previously known quantum-classical correspondence in coding theory.
arXiv·2026-10-05·Sayam Sethi et al.
No generated summary available for this entry.
overview
Original abstract
Estimating the logical error rate (LER) of a quantum error-correcting (QEC) code by Monte Carlo sampling takes $O(p^{-\lceil d/2 \rceil}/\varepsilon^2)$ samples at physical error rate $p$, code distance $d$ and relative error $\varepsilon$, which becomes intractable at large distances and low error rates, and especially for concatenated codes, whose distance grows as $d^{\ell}$ with the number of levels $\ell$. The fail fast method reduces this cost by sampling the failures of each weight separately, but it only works for unconcatenated codes, and does not model the soft information that the levels of a concatenated code pass to each other. We propose a predictor that takes the stabilizers, the minimum-weight logical operators and, for odd $d$, the logical operators of weight $d + 1$ of a code, and computes, without sampling, the leading monomial $c\,p^{o}$ of the LER when expressed as a polynomial in $p$, at every level of concatenation, in time polynomial in the code parameters and linear in $\ell$ for fixed budgets. We prove that our prediction is exact for any unconcatenated stabilizer code, for every logical observable and arbitrary per-qubit error rates, whenever no budget is exhausted. Furthermore, for concatenated codes, we construct a recursive approach that computes the leading monomial exactly in exponential time, and our predictor approximates this approach. Our predictions match exact enumeration at level 1 on every code we evaluate, and up to three levels for the iceberg code. Using our predictor, we evaluate and compare $37$ code configurations under four noise biases in $48$ core-hours, where Monte Carlo sampling would need more than $10^{12}$ shots at $p = 10^{-3}$ for $113$ of these $148$ cases.
arXiv·2026-10-05·Marco Pompili, Mirjam Weilenmann
No generated summary available for this entry.
overview
Original abstract
Information causality (IC) was introduced as a physical principle that imposes constraints on the non-local correlations between two parties (Alice and Bob) in a Bell scenario. Specifically, it states that the information that Bob can gain about an $n$-bit database held by Alice is bounded by the information she communicates to him. To date, the question whether IC for any $n \in \mathbb{N}$ singles out the set of quantum correlations remains open, meaning that it is unknown whether for any number of inputs $m$ and outputs $d$ of the two parties the set of correlations that satisfy IC exactly coincides with the quantum correlations. In this work, we answer this question in the negative. Firstly, we show that for any finite database length $n \geq 2$, there is a bipartite set of correlations that satisfies IC for all compatible protocols and that exhibits post-quantum correlations in the Bell scenario with $n+1$ inputs and $2$ outcomes per party. This result relies on constructing an entropic proof of IC for GPTs that may be of independent interest. We further show that in the Bell scenario with $n+1$ inputs and $2$ outcomes per party, our constructed sets of correlations lead to neither a superset nor a subset of the quantum correlations. Secondly, we construct a set of correlations in the Bell scenario with $3$ inputs and $2$ outputs per party that satisfies IC (for all database sizes $n \in \mathbb{N}$) and that includes post-quantum points. Consequently, all known formulations of information causality fail to fully characterize the bipartite set of quantum correlations, already in the $3$-input, $2$-outcome Bell scenario.
arXiv·2026-10-05·Sabri Meyer et al.
No generated summary available for this entry.
overview
Original abstract
Increasing capacity can induce a machine learning model to generalize worse until it perfectly interpolates the training data, and better once it moves beyond interpolation. This inversion, known as \emph{double descent}, is well understood for independent features. For correlated features, its shape is governed by the spectrum of the feature covariance, but existing analyses typically yield only implicit equations. We first close this gap for classical linear regression, analytically characterizing the entire risk curve through two quantities, namely the condition number of the feature population covariance and a spectral measure of correlation strength. Then, we apply this theory on quantum models, focusing on quantum extreme learning machines (QELMs). We show that three tunable design knobs, \textit{i.e.,} encoding strength, input reuploads, and measurement shots, each regularize the QELM output covariance, and derive conditions under which the interpolation threshold remains stable. Finite measurement shot noise can be leveraged to guarantee this stability. Numerical experiments confirm each prediction, yielding concrete design principles for QELMs that generalize well beyond interpolation.
arXiv·2026-10-05·Hidetaka Manabe, Feng Pan
No generated summary available for this entry.
overview
Original abstract
We introduce contraction tree boundary matrix product states (CT-bMPS), a scalable approximate contraction method for general closed tensor networks. CT-bMPS represents the boundary tensor and its complementary environment at each edge of a contraction tree as matrix product states. This representation allows local compression based on a reduced transition matrix to incorporate environment information along arbitrary contraction trees, while keeping the time and memory costs polynomial in the network size and bond dimension. We benchmark the method on a variety of models and applications, including Ising partition functions, random tensor networks, kicked Ising dynamics, and quantum error correction decoding. These benchmarks demonstrate improved accuracy and computational efficiency over existing general-purpose approximate contraction methods, together with the ability to handle larger and more complex networks. Optimized contraction trees and environment updates substantially improve accuracy without increasing the bond dimension. These results establish CT-bMPS as a general and scalable approximation framework with flexible contraction orders and environment-based compression for a wide range of applications.
arXiv·2026-10-05·Chenfeng Cao
No generated summary available for this entry.
overview
Original abstract
Mid-circuit measurements with feedforward reduce the optimal worst-case quantum depth for exact $n$-qubit unitary synthesis from $Θ(n)$ to $O(1)$, using arbitrary one- and two-qubit gates and unrestricted ancillary space. Measurements and resets without feedforward remain subject to the circuit causal-cone bound. Our deterministic construction uses single-qubit measurements, $O(1)$ rounds of parity feedforward, and $O(n4^n\log(n+2))$ total qubits, with all ancillas starting and ending in $|0\rangle$. Classical processing is not counted in quantum depth. We teleport only the matrix error of an approximation by Nehoran and Yuen. An exactly prepared ancillary state encodes this error, whose action is added back by coherent interference. At operator-norm error $2^{-n}$, one step of amplitude amplification suffices. Coherent fanout circuits achieve the same constant-depth bound, while circuits using only one- and two-qubit gates attain depth $Θ(n)$ with $O(4^n\log^2(n+2))$ gates. Generic targets require $Ω(4^n/(h+1))$ qubits at depth $h$, even under unrestricted classical control. Our depth-width trade-offs meet this bound within a factor $O(n^2)$ for $1\le h\le2^n$.
arXiv·2026-10-05·Michael Jarret
No generated summary available for this entry.
overview
Original abstract
I present a short approach to discretizing continuous unitary evolution. It gives a correspondence in both directions between continuous unitary evolutions and products of unitaries in finite dimensions, and I use it to reduce discrete adiabatic theorems to continuous ones. At fine steps, holding truncated samples of a regulated Hamiltonian on a suitable finite partition gives an approximating product. Conversely, rounding the clock identifies a product of $T$ unit-step samples with a continuous evolution, up to two half-step phases. I bound its operator-norm distance from the original evolution by $O(1/T)$ through cancellation within each time step. This assumes bounded first and second derivatives, bounded spectral width, and eigenvalue differences bounded away from nonzero multiples of $2π$, uniformly in $T$. For a unitary walk with these derivative bounds, a fixed common free spectral arc supplies a Hermitian logarithm path satisfying the comparison hypotheses. Continuous simulation guarantees then transfer to the phase-corrected product, and continuous adiabatic bounds to the product itself, with an explicit additive $O(1/T)$ error and each adiabatic theorem's hypotheses retained. For positive definite quantum linear systems of condition number $κ$, this comparison and continuous adiabatic theory give a rescaled qubitized walk with $O(κ/δ)$ steps for leakage $δ$, matching the scaling previously obtained through a discrete adiabatic theorem. These products need no discrete adiabatic theorem.
arXiv·2026-10-05·Shubham P. Jain, Adam Wills, Shraddha Singh
No generated summary available for this entry.
overview
Original abstract
Magic-state distillation is a major resource cost in fault-tolerant quantum computing. The cost of a magic-state factory depends strongly on its failure rate, which grows with the number of input magic states. Although symmetry-restricted methods have recently made distance two searches tractable, distance three and above have remained elusive at moderate input counts. We develop symmetry- and AI-assisted methods to search this regime. We present a unified binary-matrix formulation encompassing both triorthogonal-code and direct circuit searches. We show that distance at least three is equivalent to nonzero, pairwise distinct syndromes, separating the choice of syndromes from the search for compatible output gates. We restrict the syndrome search using group symmetry and language-model agents, followed by deterministic solving and independent verification. Our searches yield 699 factory classes, including 564 new ones. These include factories for pure-T states and factories with entangled outputs comprising combinations of T, CS, and CCZ magic states. The pure-T factories [[63, 11, 3]] and [[850, 128, 6]] achieve the lowest overhead exponents we know among protocols with at most 100 and 1000 inputs, respectively, with $γ= 1.589$ and $γ= 1.057$. Our [[1715, 287, 6]] factory, with $γ= 0.998$, is the smallest known pure-T factory with $γ< 1$. We also provide a context directory of search briefs and campaign notes with which readers can train their own agents and tailor the search to their requirements. With these results, we begin constructing an active, open-source repository of magic-state distillation protocols for the quantum community, supplemented by our methods and data, for the practical fault-tolerant quantum computing regime.
arXiv·2026-10-05·Itamar Lorian, J. E. Avron
No generated summary available for this entry.
overview
Original abstract
We present a generalization of the Mermin-Peres magic square game to $N$ players, in which the square is replaced by an $N$-dimensional hypercube. We show that the winning probability of the optimal classical strategy remains $8/9$ for all $N$, while for $N \ge 3$, a generalization of the quantum strategy for $N = 2$ achieves a winning probability between $1/3$ and $3/4$. This loss of quantum advantage for $N \ge 3$ is a consequence of monogamy.
arXiv·2026-10-05·Guocheng Zhen, Ranyiliu Chen, Xin Wang
No generated summary available for this entry.
overview
Original abstract
We give a closed-form finite-dimensional construction of quantum channels with real algebraic entries exhibiting arbitrarily large violations of minimum-output Rényi entropy additivity uniformly above any prescribed positive Rényi order, using a different finite realization based on direct products of free groups and fixed-field high-girth graphs. More precisely, for every $p_0>0$ and $g>0$, we construct one channel and one Bell input for which the additivity gap is greater than $g$ simultaneously for all $p\in[p_0,\infty]$. With $r=\lceil2g\rceil$, the construction uses $15r$ output qubits and $O(r2^{30r}+r^2(1+p_0^{-1}))$ input qubits. Compared with the stated parameters of Shou and Gorshkov \cite{ShouGorshkov2026}, our construction uses fewer output qubits for every target gap and has a smaller asymptotic input-qubit bound as the gap grows with the positive cutoff fixed. At the von Neumann order, a separate specialization gives an explicit channel with gap greater than $1/1024$ using $37608898$ input qubits and $8$ output qubits.
arXiv·2026-10-05·Youngrong Lim
No generated summary available for this entry.
overview
Original abstract
Photon loss makes Gaussian boson sampling easier to simulate classically. A standard approach replaces the lossy input by classical light, and it stays accurate while the mean number of surviving photons grows no faster than the square root of the number $N$ of squeezed inputs at fixed squeezing and accuracy. We prove that this scale is a limit of replacement by classical light. For explicit interferometers, no state with a nonnegative Glauber--Sudarshan $P$ representation, Gaussian or not and however correlated, keeps the error in the photon count distribution small beyond this scale. We then surpass this limit by approximating the detection instead of the input. The sampler evolves the state exactly between detections and, after each detection, replaces the conditional state by a Gaussian with the same covariance. For every interferometer its total variation error is $O(Nη^3)$ at polynomial expected cost, where $η$ is the photon survival probability. The mean surviving photon number can therefore grow as $N^{2/3}$ at fixed accuracy. A separate pair construction reaches $N^{3/4}$ when every input mode is equally squeezed.
arXiv·2026-10-05·Thomas J. Elliott
No generated summary available for this entry.
overview
Original abstract
What makes one quantum process more complex than another? We adopt an operational approach inspired by classical complexity science, which characterises structure through the memory required for causal generation. We develop a fully-quantum extension of computational mechanics for quantum space series: Sequences of quantum outputs that do not return to interact with their generator. For stationary, memoryful quantum space series admitting finite-dimensional, primitive causal models, we show that a memory-minimal model can be chosen to generate the outputs isometrically, without a discarded environment. The resulting canonical matrix product state representation determines both the minimum memory dimension and the minimum memory entropy. The latter is precisely the entanglement entropy across the past-future bipartition, giving entanglement an operational interpretation as irreducible memory for causal generation. Within this class, we further establish a vanishing fundamental entropy rate, the absence of causal asymmetry, and infinite quantum Markov order. These results establish an operational framework for quantifying intrinsic quantum structure, revealing deep connections between causal generation, complexity, memory, entropy, and entanglement.
arXiv·2026-10-05·Laura Mančinska
No generated summary available for this entry.
overview
Original abstract
We identify a structural mechanism by which perfect play in a nonlocal game requires and self-tests a specific non-maximally entangled state. To this end, we construct a Flagged Magic-Square game by extending the standard Magic-Square game with an additional ``flag'' outcome and two additional questions for each player. The game admits a perfect strategy using a state with Schmidt coefficients proportional to $(1,\sqrt{2},\sqrt{2},\sqrt{2},\sqrt{2})$. We give a direct algebraic proof that maximally entangled strategies have winning probability bounded away from one, independently of dimension. Moreover, the game self-tests this state, providing an example of a two-party pseudo-telepathy game that certifies a specific non-maximally entangled state. Our construction illustrates how adding suitable constraints to a rigid measurement geometry can enforce specific Schmidt ratios and provides a modular route to further self-tests based on other rigid pseudo-telepathy games. We establish a general game-to-channel reduction that transfers separations in the game model to one-shot zero-error communication over classical channels. Applied to the Flagged Magic-Square game, it yields a classical channel for which entanglement permits the zero-error transmission of ten messages in a single use, whereas any finite-dimensional maximally entangled resource permits at most nine. Thus, maximally entangled states are not a universally optimal entanglement resource for zero-error communication over classical noisy channels.
arXiv·2026-10-05·Hanna Salamon et al.
No generated summary available for this entry.
overview
Original abstract
Photonic quantum technologies require the integration of high-quality quantum light sources with programmable photonic circuitry to enable on-chip quantum information processing. Semiconductor quantum dots have emerged as a leading platform for quantum light generation, yet their monolithic integration with cryogenic-compatible, programmable photonic circuitry remains challenging. Here we demonstrate a programmable quantum photonic platform that enables simultaneous control of highly coherent quantum dot-based single photon emitters and reconfigurable optical elements at cryogenic temperatures. System-level integration enables individual electrical and optical addressing of active components on a single chip, allowing their concurrent operation while preserving coherent non-classical light emission. We demonstrate multiple quantum-photonic functionalities, including pure single-photon generation, two-photon interference, and resonant transmission and reflection measurements of integrated emitters. These results mark a step from isolated quantum-optical devices towards programmable quantum-photonic hardware platforms capable of combining coherent quantum emitters with large-scale photonic functionality.
arXiv·2026-10-05·Jannis Ehrlich et al.
No generated summary available for this entry.
overview
Original abstract
The Variational Quantum Eigensolver (VQE) has become a central hybrid quantum-classical method for addressing electronic structure and materials science problems on near-term quantum hardware. As researchers across physics, chemistry, and quantum information engage with VQE, they encounter a wide range of algorithmic choices, including problem encoding, ansatz construction, classical optimization, and measurement strategies to choose from. This article provides a structured overview of these components and discusses practical factors that influence VQE performance in real settings, such as noise characteristics, available error-mitigation techniques, and hardware-dependent circuit considerations. Drawing partly on our early experiences, we highlight aspects that may be especially relevant for newcomers and outline common challenges observed in practical workflows. Our aim is to offer an accessible entry point for researchers approaching VQE-based quantum simulation and to support informed decision-making as the method and underlying hardware continue to evolve, which we support by discussion of examples from physics and quantum chemistry.
arXiv·2026-10-05·Daniel Holst, Patrick Potts, Peter Samuelsson
No generated summary available for this entry.
overview
Original abstract
We derive a quantum master equation in Lindblad form for the open quantum Rabi model in the perturbative deep strong coupling regime, where the spectrum is close to degenerate and harmonic. The Lindblad form is obtained by combining secular and singular-coupling approximations, working in a Schrieffer-Wolff transformed frame. We benchmark our equation against a Bloch-Redfield one, analyzing the time-evolution and steady state properties of several observables and find excellent agreement. Analytical results are obtained in limiting cases.
arXiv·2026-10-05·Rongbiao Thomas Wang, Bobby Zixuan Zhang
No generated summary available for this entry.
overview
Original abstract
We study semi-Clifford and generalized semi-Clifford structures in the Clifford hierarchy as a function of hierarchy level $k$ and qubit number $n$. We show that $\mathcal{C}_k(n)$ is semi-Clifford if and only if $k\le2$, $n\le2$, or $k=3$ and $n\le6$. We also establish that $\mathcal{C}_k(n)$ is generalized semi-Clifford when $k\le4$ or $n\le3$ and construct counterexamples when $k,n \geq 5$. For $n=4$ and $k\ge5$, we show that every gate defined over $\mathbb{Q}(i)$ up to a scalar is generalized semi-Clifford, reduce the general case to a single level, and propose a strategy to prove our conjecture that $\mathcal{C}_k(n)$ is generalized semi-Clifford if and only if $k\le4$ or $n\le4$. Lastly, we go beyond this structure by introducing $n_c$-generalized semi-Clifford gates, which we show are exactly the gates of the form $\sum_x|π(x)\rangle\langle x|\otimes V_x$ up to Clifford gates on both sides, where $π$ permutes the computational basis states of $n_c$ control qubits. We conjecture that for $k\ge3$ every gate in $\mathcal{C}_k(n)$ has this form for some $n_c\ge1$ with every $V_x\in\mathcal{C}_{k-3}(n-n_c)$, refining the conjecture of Zeng, Chen, and Chuang.
arXiv·2026-10-05·Fabio Auriemma, Mikkel Ejrnaes
No generated summary available for this entry.
overview
Original abstract
We develop a combinatorial and Bayesian framework to quantify the information gained by increasing the local photon-number resolution of multiplexed detection systems based on superconducting nanowire single-photon detectors (SNSPDs). Motivated by recent studies that attribute photon-number resolving capabilities to a single SNSPD overcoming the typical on/off detection mechanism, we generalize the existing formulation for the binary devices by deriving the probability response tensor of multiplexed systems based on SNSPDs with an arbitrary number of resolvable states. We include finite efficiency through binomial loss convolution and, separately, assess the impact of dark counts. From this response tensor we derive a generalized N-photon detector fidelity, a Bayesian photon-number reconstruction, and the corresponding reconstruction fidelity. We particularize this formulation to study 2-, 3- and 4-state multiplexed systems with different numbers of detectors and show that increasing local photon-number resolution systematically improves both detector fidelity and Bayesian photon-number reconstruction. This substantially relaxes the quadratic scaling between detector number and resolvable photon-number required by purely binary multiplexed arrays. These results provide a quantitative value-of-information assessment for multi-state photon-number-resolving detector arrays.
arXiv·2026-10-05·Sankar Das Sarma, Haining Pan
No generated summary available for this entry.
overview
Original abstract
We investigate the effects of quenched disorder on two-dimensional electron solids using Hartree-Fock theory and classical molecular dynamics. Increasing disorder weakens crystalline correlations, broadens the structure factor, and reduces the measured coherence length toward the pristine lattice spacing. This evolution is consistent with the Imry-Ma and Larkin picture: random pinning disrupts translational order on sufficiently long scales, and stronger disorder reduces the distance over which crystalline organization survives. Classical simulations further show that stronger pinning raises the temperature for particle rearrangement even after crystalline order has disappeared. Disorder thus suppresses structural coherence while stabilizing an amorphous solid against thermal rearrangement.
arXiv·2026-10-05·Raj Alexandru Guţoiu, Bogdan-Călin Ciobanu, Pantelimon George Popescu
No generated summary available for this entry.
overview
Original abstract
Unstructured database search is a fundamental problem that requires finding one or more elements satisfying a specific property within a set of candidates. While Grover's algorithm provides a quadratic speedup for finding a marked element when the number of solutions is known, finding all solutions when their number is unknown presents additional challenges. In this paper, we thoroughly analyze this problem by considering all the different regimes of combinations of classical, Grover and generalized fixed-point quantum search instances. We unify these into an adaptive Bayesian approach that maximizes the expected success probability per unit execution time at each searching instance. For a problem with a known number of solutions, much lower than the database size, we prove that our proposed approach is asymptotically optimal within the considered search model. Furthermore, we prove that for any probability distribution characterizing the likely number of solutions, in regimes where the classical verification time is at most 25% of the quantum amplitude amplification time, hybrid classical and Grover approaches are preferred to generalized fixed-point. Outside of this regime, we derive an upper bound on the maximal improvement achievable by fixed-point search compared to the best Grover-based score. Additionally, we determine the optimal transition point between classical sampling and quantum searching using an integral approximation of the probability distribution of the number of solutions. The analytical results are also supported by numerical simulations of the proposed algorithm and by comparisons between the generalized fixed-point and Grover-based search policies.
arXiv·2026-10-05·Isaac Barouch Essayag, Aryeh Lev Zabokritskiy
No generated summary available for this entry.
overview
Original abstract
We study leakage from Shamir secret sharing when each device uses its share to produce one qubit from an initial quantum resource independent of the secret and sharing randomness. We prove exponentially small trace distance between the leakage states of any two secrets, when reconstruction requires a sufficiently large fraction of the shares, for fixed stationary chains satisfying an upper operator mixing condition and for resources generated by fixed finite quantum memories with primitive transfer channels. These guarantees permit arbitrary extensions of the device marginal as adversary side information and hold uniformly over prime fields larger than the number of shares. For independent device--reference pairs, which provide the quantitative input to the argument, we determine the optimal exponential base when reconstruction requires all shares: $2\sqrt2/π$ for a qubit and $2/π$ for a classical bit, in both cases allowing arbitrary finite references. A comparison of selected marginals with product states converts the bounds for independent device--reference pairs into security guarantees for the correlated resources.
arXiv·2026-10-05·Simon Apers et al.
No generated summary available for this entry.
overview
Original abstract
The concept of subspace designs was introduced by Guruswami and Xing (STOC'13), and explicit constructions were given by Guruswami and Kopparty (FOCS'13). These are families of subspaces that have small intersection with any given subspace of a fixed dimension. We introduce \emph{robust subspace designs}. Informally, these are a quantitative extension in which we demand that not too many subspaces of the family contain directions that lie close to any given subspace of a fixed dimension. We give a probabilistic construction of such a robust subspace design of polynomial size, as well as a non-trivial explicit construction of superpolynomial size. Our main application of this new concept is a quantum space-bounded variant of the Valiant-Vazirani theorem (Theor.Comput.Sci.'86), which shows that restricting $\mathsf{NP}$-complete problems to instances with at most one accepting witness preserves hardness under randomized reductions. For quantum witnesses, the analogous quantity is the dimension of an accepting witness subspace. We use our probabilistic construction of robust subspace designs to isolate a unique witness for space-bounded quantum Merlin-Arthur protocols with perfect completeness and an acceptance gap outside their perfectly accepting subspace. As further applications, we give a randomized reduction of well-conditioned nullity testing to space-bounded quantum Merlin-Arthur protocols with perfect completeness. Using a similar idea, we find that ordinary subspace designs allow us to recover the classical $\mathsf{C_= L}$ containment of Allender, Beals, and Ogihara (STOC'96) for general nullity testing through a simpler proof.
arXiv·2026-10-05·Pedro Rosso Gomez et al.
No generated summary available for this entry.
overview
Original abstract
Advanced levitation optomechanics in the quantum regime requires sophisticated quantumengineered protocols operating at shorter length and time scales, demanding an increasing control over both optical and electrical potentials. Integrated chip-scale platforms offer a natural route toward such control. Here, we demonstrate optical levitation in vacuum using a miniaturized hybrid electro-optical metalens. Motion control is achieved using a high numerical aperture metalens combined with electrical active feedback using planar electrodes, enabling cooling to low phonon occupations. Reheating measurements enable us to rule out any significant influence from electric field noise; an encouraging result for the future development of on-chip levitation platforms operating close to surfaces. This compact integrated platform facilitates the precise manipulation and control of levitated nanoparticles while laying the ground toward exploiting the full capacity of metaoptics to engineer complex optical potentials, marking a significant step forward in technologies for quantum levitation optomechanics.
arXiv·2026-10-05·Eloïc Vallée et al.
No generated summary available for this entry.
overview
Original abstract
Gauge theories describe fundamental interactions in the standard model of particle physics and build effective theories in condensed matter physics. Being notoriously hard to simulate, these theories are commonly regularized as lattice gauge theories which can be evaluated with high precision through Monte Carlo algorithms or variational methods. However, Monte Carlo algorithms are not applicable in all regimes due to the sign problem; while variational methods, quantum and classical alike, only give upper-bounds on the ground-state energy. Their precision crucially depends on the chosen ansatz. Here, we present a framework based on a hierarchy of semidefinite programs to yield increasingly good lower-bounds on the ground-state energy and propagate these bounds to extended observables like Wilson loops and mesonic strings. We demonstrate the numerical capabilities by applying the algorithm to a (1+1)-dimensional $\mathbb{Z}_2$ theory with dynamic fermionic matter and its pure-gauge version in (2+1)-dimensions. In both cases, we obtain certified intervals for the ground-state energy. For a one-dimensional system with 129 sites, the certified interval has a relative spread of $0.04\%$. For a two-dimensional system with 97 sites (corresponding to a $7 \times 8$ lattice), the relative spread is $2.08\%$. Beyond energy estimates, the proposed method provides rigorous bounds on both short- and long-range observables such as Wilson loops over multiple plaquettes and the magnitude of the mesonic string. The method can be both used as a computational microscope into many-body physics and a way to certify results of quantum simulators.
arXiv·2026-10-05·Pedro C. S. Costa et al.
No generated summary available for this entry.
overview
Original abstract
We develop a discrete adiabatic framework for Gibbs-state preparation in classical and quantum optimisation algorithms. For finite time-inhomogeneous reversible Markov chains, we derive a tracking theorem that bounds the distance from the evolving distribution to the instantaneous stationary state by combining two effects: contraction of previously accumulated error by the Markov dynamics and the new error generated as the stationary distribution changes from one step to the next. For Gibbs paths, this leads to explicit step-complexity bounds and to gap- and fluctuation-adapted schedules controlled by the Markov-chain spectral gap and the energy-fluctuation scale $V(β)=\sqrt{\operatorname{Var}_{π_β}(E)}$. In the weak-damping regime, the resulting schedule takes the form $\dotβ\proptoδ(β)/V(β)$. We then apply the discrete quantum adiabatic theorem to temperature-dependent Szegedy quantum walks. The quantum-walk eigenphase gap satisfies $Δ_w=Θ(\sqrtδ)$, where $δ$ is the spectral gap of the underlying Markov chain. By analysing the finite-difference terms entering the theorem, we show that this square-root spectral amplification translates into a quadratic improvement in the gap dependence only for suitably gap-adapted schedules. Under the corresponding regularity conditions, the quantum adiabatic cost scales as $O(δ_{\min}^{-1/2})$, compared with the classical $O(δ_{\min}^{-1})$ relaxation scale.
arXiv·2026-10-05·Kuljeet Kaur, Xuexin Xu, Mohammad H. Ansari
No generated summary available for this entry.
overview
Original abstract
Frequency crowding, the close spacing of qubit transitions, limits superconducting quantum processors through crosstalk, leakage, and spectator dependent errors. We introduce a Hamiltonian based framework that maps two- and three-body collision mechanisms onto a Max-k-Cut problem on qubit frequency allocation. In order to make larger lattices tractable, we introduce a cluster-stitching protocol that decomposes larger lattices into overlapping subgraphs and reconciles their local frequency assignments into globally consistent configurations. We tested our proposed framework across multiple qubit architectures to suppress dominant collision penalties by revealing a hardware residual crosstalk. We benchmark digitized counterdiabatic QAOA (DC-QAOA), standard QAOA, and simulated annealing. Counterdiabatic terms improve QAOA optimization near steep collision penalties, while simulated annealing achieves the lowest costs on the tested instances. These results indicate that our hardware-aware optimization connects microscopic interaction physics to processor-level frequency planning. These results enable a systematic solver for benchmarking of scalable software hardware co design.
arXiv·2026-10-05·Jiawei Cai et al.
No generated summary available for this entry.
overview
Original abstract
Measurement-based quantum computation (MBQC) relies on entangled graph states, yet existing remote state preparation (RSP) protocols prepare only separable states, requiring subsequent entangling gates on the remote server. Here, we introduce Remote Graph State Preparation (RGSP), a framework that prepares arbitrary graph states directly from a single high-dimensional photonic qudit. By encoding multiple qubits and their graph connectivity into the photon's structured phase profile, RGSP can reduce or, for small computations, completely eliminate the need for server-side entangling operations among qubits. We show that under a reasonable noise model the resulting state fidelity is independent of the graph topology. Under cumulative fiber phase drift, we demonstrate that this fidelity is significantly enhanced by a ``highest-weight-first'' mode reordering strategy. Finally, we show that RGSP enables reduced-SWAP universal blind quantum computing on arbitrary topologies, reducing qubit overhead e.g., for a six-qubit Quantum Fourier Transform from $420$ RSP qubits with a standard brickwork topology to $48$ RSP qubits. These results establish RGSP as a resource-efficient, topology-invariant primitive for quantum-secured cloud computing.
arXiv·2026-10-05·Athul Ashok et al.
No generated summary available for this entry.
overview
Original abstract
Edge magnetoplasmons (EMPs) provide a platform for probing chiral charge dynamics and nonreciprocal microwave transport in topological quantum materials. However, detecting small perturbations to EMP propagation remains challenging because their signatures in conventional microwave scattering measurements can be weak. Here, we investigate microwave-photon-induced perturbations of EMP transport using a quantum anomalous Hall topological circulator. Pump--probe measurements reveal a strongly frequency-selective response: while microwave irradiation substantially modifies the EMP transmission at several pump frequencies, the transmission remains nearly unchanged at selected frequencies, including 4 and 7 GHz. We further exploit the non-Hermitian mode hybridization of the coupled EMP-resonator system to probe the response near an exceptional point (EP). The pump-induced change in transmission magnitude near the EP is approximately twice that observed away from the EP, demonstrating an enhanced microwave response to perturbations. These results reveal the interplay among chiral EMP transport, microwave-photon-induced perturbations, and non-Hermitian dynamics, and demonstrate the potential of topological circulators as a promising platform for enhanced microwave spectroscopy and sensing.
arXiv·2026-10-05·Quinten Tupker
No generated summary available for this entry.
overview
Original abstract
Intermediate measurements let quantum computations discard information and reuse their workspace. Deferring all measurements can require storing their entire history, which need not preserve logarithmic space. Fefferman and Remscrim proved that measurements can nevertheless be eliminated with two-sided bounded error, and asked whether the same holds with one-sided error [FR21]. We prove RQLΓ = RQULΓ for the standard gate set Γ = {H, T, CNOT}, preserving polynomial time, logarithmic space, and exactly zero acceptance on no-instances. Our proof extends the density-matrix doubling method of Girish, Raz and Zhan [ GRZ21 ] to general channels, including resets and classical memory. We also prove measurement elimination for broader finite gate sets with exact inverses, including suitable gates with transcendental entries, and establish gate-set independence for a specified family of algebraic gate sets. A separate history-checking construction proves QMAL1,G = QUMAL1,G under explicit gate assumptions: measurements can also be eliminated from logarithmic-space quantum verification while preserving perfect completeness
arXiv·2026-10-05·Kashif Ammar Yasir
No generated summary available for this entry.
overview
Original abstract
The mean Hawking flux does not determine how quantum stress fluctuations perturb a black-hole geometry. That information resides in field correlations, including vacuum contributions absent from the outgoing luminosity. Here we connect the complete exterior Unruh Wightman function to a finite-band stochastic reconstruction of Schwarzschild geometry. We retain the incoming vacuum and both outgoing frequency branches, form the connected stress covariance before angular projection, and propagate its monopole through a density-driven radial response. A shared Gaussian reconstruction then resolves how the value and derivative of the lapse control different geometric observables. For the specified covariance and noise amplitude, 2,200 realizations give relative widths of 0.0185 for the local horizon radius and 0.0483 for the surface-gravity temperature parameter, consistently across histograms and reconstruction checks. Covariance derivatives explain this unequal sensitivity. The construction separates the quantum-state input from the gravitational closure and spatial sampling assumptions, providing a reproducible finite-resolution description of how Hawking-field correlations affect horizon positions and surface-gravity statistics.
arXiv·2026-10-05·Soumya Chakraborty et al.
No generated summary available for this entry.
overview
Original abstract
Trapped particles in hollow-core fibers enable long-range sensing, though advanced control of their in-fiber motion, such as multimodal cooling and squeezing, remains challenging. Here, we present optical interference-based techniques for controlling a fringe-trapped silica nanoparticle inside a fiber. After feedback-cooling its axial and radial motion, we induce axial delocalization (position anti-squeezing) via two approaches. First, non-adiabatic fringe suppression expands position variance by 11.83 ($\pm$0.7) dB to that of the initial cold-state while retaining Gaussian statistics. Second, multi-pass particle positioning at dark fringes increases delocalization to 13.23 ($\pm$0.5) dB relative to the cold-state's variance via inverted potentials, in agreement with stochastic theory. Stronger delocalization produces non-Gaussian states. Our results demonstrate fringe-trapped particles in hollow-core fibers as a versatile platform for long-range sensing and macroscopic quantum physics.
arXiv·2026-10-05·Francesco Debortoli, Fabian Grusdt
No generated summary available for this entry.
overview
Original abstract
The manipulation of non-Abelian anyons is a foundational ingredient for topological quantum computing and underlies topologically protected quantum memories. Here we analyze a quantum-impurity-based protocol for braiding non-Abelian anyons. Exploiting mobile impurities with addressable internal spin states, we provide a concrete protocol to experimentally measure the matrix elements of the $R$ and $F$ matrices that characterize the non-Abelian statistics of anyons. In particular, focusing on the case of Ising and Fibonacci anyons, we illustrate how the anyonic nature of the excitations emerges directly in the Ramsey interferometer we propose. Building on this framework, we further introduce a conventional-to-topological qubit encoder to transfer quantum information from conventional flying qubits into a topologically protected quantum memory.
arXiv·2026-10-05·Petr Brandyshev, Maksim Koniushenko, Yury Budkov
No generated summary available for this entry.
overview
Original abstract
We develop a finite-temperature field-theoretical description of the Casimir interaction between two perfectly conducting boundaries with the intervening gap filled by a two-component quantum Boltzmann plasma embedded in a homogeneous dielectric background. The quantum motion of the charged particles is represented by imaginary-time worldlines, while the electromagnetic field is treated in the Gaussian approximation. The resulting partition function contains distinct longitudinal and transverse response contributions and an additional quantum-induced source term with no classical counterpart. In the classical limit the theory reduces to the usual Casimir-screening picture: the static longitudinal mode is Debye screened, whereas the transverse electromagnetic sector is unaffected by classical mobile charges. Finite thermal de Broglie wavelengths modify the nonzero Matsubara response and produce the leading quantum correction to the force. In the static long-wavelength limit, the longitudinal dielectric function has, through the leading quantum correction, the same expansion structure as the Lindhard response of a degenerate electron gas under the correspondence $k_{TF}\leftrightarrowκ_D$ and $k_F\leftrightarrowλ_{dB}^{-1}$, while the static transverse response reproduces the leading high-temperature Landau orbital diamagnetic susceptibility.
arXiv·2026-10-05·Yufei Wang, Daniel Stilck França, Samuel Slezak
No generated summary available for this entry.
overview
Original abstract
We give quantum algorithms that estimate the log partition function of an $n$-qubit quantum Hamiltonian to additive error $ε$ with Heisenberg scaling, while minimizing calls to thermal-state purification preparation. The input is a block encoding of $H$, unitaries preparing thermofield-double states at chosen inverse temperatures, with their inverses and controlled versions, and an adaptive slowly-varying cooling schedule. The system-size bounds below assume $0\preceq H\preceq hI$ with $h=O(n)$ and block-encoding normalization $α=Θ(h)$. For constant inverse temperature, we show that such a schedule of length $O(\sqrt n)$ always exists and can be generated from overlap estimates with $\widetilde O(\sqrt n)$ further preparations. Given such a schedule and classically chosen temperatures, we estimate the log partition function with $\widetilde O(n^{5/4}/ε)$ expected calls to state preparation and to the block encoding, improving by $n^{1/4}$ on non-adaptive strategies. To achieve our result, we use a recursive-doubling identity that expresses each schedule increment as a weighted sum of logarithms of thermofield-double overlaps and of short imaginary-time steps implemented by quantum singular value transformation combined with previously developed variance reduction techniques. If thermofield doubles can be prepared controlled on a temperature register, a quantum inverse-binomial log estimator combined with quantum mean estimation reduces both query counts to $\widetilde O(n/ε)$. We show that the latter scaling is optimal in block-encoding queries up to polylogarithmic factors and discuss end-to-end complexities for one-dimensional partition-function estimation.
arXiv·2026-10-05·Denis A. Kopylov, Michael Stefszky, Christine Silberhorn
No generated summary available for this entry.
overview
Original abstract
Reliable verification of squeezed-light sources is essential for photonic quantum technologies. High-dimensional quantum optical networks demand single-mode, pure squeezed states which, in principle, can be generated through careful engineering of parametric down-conversion-based (PDC) sources. However, due to the imperfections of optical components, the generated state is never pure and commonly contains internal mode structure. Existing characterisation techniques, based on either joint spectral intensity or normalized second-order correlation functions, work under the assumption that the probed state is pure, and therefore can result in incomplete or misleading assessment of the source quality. Here, we develop a device-agnostic characterisation framework for PDC-based sources with distinguishable signal and idler fields. Treating the source as a black box producing a mixed multimode Gaussian state, we find a lower bound for the state purity, which can be experimentally determined via mode-unresolved measurements. Our approach enables a holistic assessment of realistic squeezed-light source quality without requiring a detailed model of the nonlinear device and its surrounding optical network, providing practical benchmarks for optimizing sources for state-of-the-art quantum applications.
arXiv·2026-10-05·Gabriele Cobucci et al.
No generated summary available for this entry.
overview
Original abstract
Multipartite systems of high-dimensional particles can host forms of quantum entanglement inaccessible to qubit systems. A particularly fascinating class is formed by the fully antisymmetric states, also known as supersinglets, which possess a remarkable symmetry: they are invariant under arbitrary collective local unitaries. Here, we explore their entanglement properties and establish their quantum information applications. Using convex optimisation, we show that central entanglement features of supersinglets are remarkably robust to noise, substantially surpassing the robustness of several paradigmatic entangled states under certain relaxations. We then develop witness methods, based on collective-spin or randomised measurements, that certify both the depth and dimensionality of their entanglement. Finally, we identify supersinglets as a natural resource for high-dimensional gradient sensing and prove that they enable Heisenberg scaling. Together, these results reveal supersinglets as an exceptionally robust and versatile class of multipartite entangled states, combining striking symmetry and strong entanglement with concrete potential for quantum sensing.
arXiv·2026-10-05·Kishlay Kashyap, Sandipan Ganguly
No generated summary available for this entry.
overview
Original abstract
Near-term quantum natural language processing (QNLP) experiments often run on classical simulators, so simulator cost is part of the field's practical compute burden, yet accuracy tables do not show it. We measure that cost for a variational quantum classifier (VQC) on binary SST-2 sentiment classification, using PennyLane's state-vector simulator over a controlled grid of 27 configurations: three balanced training-set sizes (N = 200, 500, 1000), three qubit counts (4, 6, 8), and three circuit depths. Each VQC is compared with logistic regression on the same PCA-reduced input; full TF-IDF logistic regression gives an uncompressed reference. The VQC beats its matched baseline in 6 of 27 single-seed comparisons. After reruns at two further seeds, only 1 of these 6 keeps a positive mean advantage larger than its paired seed-to-seed variability, and paired tests on the fixed validation set do not establish it. VQC training is 886-21,127 times slower in measured wall-clock time than the matched classical fit (median 3,158 times); going from 4 to 8 qubits roughly doubles simulator time, and within the tested range per-step cost is well approximated by a linear function of the parameter count. CodeCarbon energy and CO2 estimates are secondary: they imply an almost constant power of about 41 W, so they add little beyond runtime, and we do not build an energy ratio from them. The study is narrow (one dataset, representation, ansatz, simulator, and CPU environment) and is a reproducible feasibility measurement, not a general verdict on QNLP.
arXiv·2026-10-05·Youping Dai
No generated summary available for this entry.
overview
Original abstract
We construct two superconducting pairing models on doped Kitaev honeycomb, whose microscopic kernels are derived rather than assumed. Both are driven by a bond-local glue neutral between the even- and odd-parity pairing channels; the chirality--parity linkage is set by bond-star geometry, not by the microscopic glue. (i) Model~1(odd-parity sector): the kernel follows from the flux-sector selection rule of the pure model, fixing its component-diagonal, nearest-neighbor separable, rank-one-per-bond form, with $w_α=J_K^2χ_α\propto r_αm_α$, where $m_α$ follows from the Hellmann--Feynman theorem and $r_α\simeq0.24$ is computed numerically. The spin-vertex state is a unitary triplet with a bond-locked anisotropic $\mathbf d$ vector; its gap is a Gram sum of bond sines, so nodal directions are fixed by geometry. (ii) Model~2(even): the kernel is fixed by the $C_3$ little-group selection rule of a zone-corner chiral phonon, up to a Cooper-channel extension whose momentum constraint we state explicitly. The charge-vertex pairing is a $d+id$ singlet: the parity decomposition $f_\pm=g_\pm+p_\pm$ projects onto $g_\pm$, so chirality is slaved to the phonon polarization, with $C=\pm4$ and $κ_{xy}/T=2κ_0$. Reversing the pump helicity reverses the Chern number, Kerr rotation, and thermal Hall sign. (iii) General theorem: on odd-fold bond stars, the angular-momentum ladder of a single-star chiral form factor alternates in parity. Every chiral state selected by such a bond-local form factor is a geometrically enforced singlet--triplet composite with universal amplitude ratios ($n=3$: $d\oplus p$; $n=5$: $g\oplus p$ or $d\oplus f$); coherent doubled-star combinations can restore parity purity. The Chern number of the mixed state follows the dominant on-shell component across a topological boundary. The spin glue drives $C=\pm2$; the charge kernel $C=\pm4$.
arXiv·2026-10-05·Boshuai Ye, Peng Liang, Arif Ali Khan
No generated summary available for this entry.
overview
Original abstract
Quantum compilers synthesize high-level operations, such as the quantum Fourier transform and multi-controlled X gates, into gate-level circuits. Across compilation stages, a circuit may be serialized, exchanged as OpenQASM, converted between compilers, or lowered to gates. These representation changes can preserve computation while removing the high-level operation itself, leaving the receiving compiler unable to apply a requested synthesis method. We call this loss synthesis availability. We study synthesis availability in Qiskit, TKET, and Cirq through controlled experiments, repository analysis, circuits captured from project tests, and a Munich Quantum Toolkit pipeline. Synthesis availability survives serialization when deserialization restores the high-level operation and survives compiler conversion only when the receiving compiler supports that operation. It does not survive the evaluated OpenQASM routes. After a direct OpenQASM 3 round trip, requested synthesis has no effect in all 360 delivered conditions even though compilation succeeds. In the MQT pipeline, OpenQASM 2 interchange increases the two-qubit gate count by 37.2 percent for an eight-qubit Grover circuit. We also introduce Verified, which records high-level operations before a representation change and reconstructs them only when a check confirms that the record still matches the delivered circuit. Verified restores requested synthesis in all 830 recovery runs, with median verification times from 2.0 to 638 ms per operation family. The check rejects every stale record but also some valid records. These results show that preserving functional equivalence alone is insufficient when later synthesis choices depend on retained high-level structure.
arXiv·2026-10-05·Joris Sturm et al.
No generated summary available for this entry.
overview
Original abstract
In this contribution we provide a compact model for the description of inelastic x-ray scattering of spatially localized excitons. We combine our analytical theory with first principles calculations and apply it to the material lithium fluoride (LiF). A comparison of two different approaches for the underlying single-particle wave functions to calculate the spectrum yield a qualitatively good agreement with experimental data but also shows that a detailed description of the wave functions is essential to obtain qualitative results.
arXiv·2026-10-05·N. A. Susulovska, Kh. P. Gnatenko
No generated summary available for this entry.
overview
Original abstract
The geometric measure of entanglement of mixed states is investigated based on its relation to spin correlations. We derive an analytical expression for the entanglement of rank-2 mixed states composed of arbitrary multiqubit pure states within a two-dimensional Hilbert subspace. The dependence of the entanglement of rank-2 mixed multiqubit states on the parameters characterizing arbitrary pure states in the mixture is studied both analytically and using quantum computing. For a particular class of mixed states, namely, equal-probability mixtures of an arbitrary multiqubit state and the Schrödinger cat state, we construct quantum protocols for detecting the geometric measure of entanglement based on its relation to spin correlations. We quantify the entanglement using both the AerSimulator and the ibm_marrakesh quantum computer. The effects of quantum-computing errors are also analyzed. The simulation results reproduce the analytical dependencies, while measurements on the quantum device demonstrate good agreement with theoretical predictions within estimated error bounds.
arXiv·2026-10-05·Lin Zhu et al.
No generated summary available for this entry.
overview
Original abstract
Quantum state preparation is a basic primitive of quantum computation and control, but its resource cost is usually analyzed for one target state or under an independent-copy construction. Here we study the many-copy problem under weighted Pauli control, where a Pauli-product rotation $e^{iφP}$ is charged by its rotation angle $|φ|$, independently of the weight of $P$. We derive the exact single-qubit preparation cost and show that it is strictly nonadditive: a four-pulse collective protocol prepares two $T$ states at lower cost than two optimal one-copy protocols. We further identify finite regions of the Bloch sphere with collective saving, including trajectories that remain product throughout, showing that transient entanglement is not the only mechanism behind the advantage. Complementarily, a dimension-independent Rényi-entropy speed limit gives an extensive lower bound for every coherent target and an exponential fidelity penalty below a finite preparation rate. These results establish a many-copy geometry of state synthesis in which uncorrelated outputs can nevertheless benefit from collective control.
arXiv·2026-10-05·Zihao Wang et al.
No generated summary available for this entry.
overview
Original abstract
The realization of fractional Chern insulators has largely relied on isolated flat bands in complex bilayer or multilayer moiré systems with ideal quantum geometry. Whether such phases can emerge in genuinely dispersive bands, and by what mechanism, remains an open question. Here, we propose a mechanism for magnetic-field-induced strong correlations in the highly dispersive bands of monolayer graphene on hexagonal boron nitride. In the low-field classical-to-quantum crossover regime of the second moiré miniband, we show that the interplay of the moiré potential and weak magnetic fields (B < 1.5 T) profoundly alters electron dynamics. Saddle-point van Hove singularities produce extended open orbits that strongly suppress carrier propagation, potentially favoring a regime in which Coulomb interactions become comparatively more important, while weak magnetic fields lift valley degeneracy and trigonal warping redistributes Berry curvature. High-resolution magnetotransport and temperature-dependent measurements reveal fractional-slope transport features and signatures of interaction-driven incompressibility. Because the Hall conductivity is not fully quantized and the longitudinal resistance remains finite, we describe these observations as incipient FCI behavior: transport signatures consistent with a developing fractional Chern insulating state, without claiming a fully developed FCI phase established by complete Hall quantization and vanishing longitudinal resistance. Our results suggest a possible fermiology-driven route toward correlated topological states in dispersive bands in the classical-to-quantum crossover, distinct from the conventional flat-band scenario.
arXiv·2026-10-05·Shi-Tuan Wang, Zidu Liu, Li-Wei Yu
No generated summary available for this entry.
overview
Original abstract
Gaussian-process limits are powerful in describing overparameterized machine learning models, yet their validity in structured tensor-network architectures remains unclear. Here we analytically present a moment-based approach that identifies precise conditions for the emergence and breakdown of Gaussian universality in tensor-network learning models, with a focus on matrix product states. We prove that in the large bond dimension limit, the learning models with both local and global observables converge to Gaussian processes, with explicit finite-size bounds on higher-order moment deviations. Whereas in the large physical dimension limit, the Gaussian universality no longer persists: while the models with local observables retain Gaussian-process behavior, those global cases exhibit persistent non-Gaussian corrections. Our results reveal that Gaussian-process behavior in tensor-network learning is controlled not only by parameter number, but also by architectural scaling, observable locality, and the spectral properties.
arXiv·2026-10-05·Pablo Herrero Gómez et al.
No generated summary available for this entry.
overview
Original abstract
Preparing quantum states from classical data can cost more than the computation they serve; most loaders tailor a circuit to each input. Here we show that the signals of a real dataset share structure that can be learned once and reused. Our quantum-native loader learns a low-dimensional description of a dataset and prepares every signal with one fixed circuit set by a few numbers. Across seven views of five public datasets it meets the targets of the strongest structured loader at equal gate cost with several times fewer numbers per signal. These numbers can be inferred from a random subset: in a preregistered blind replication the subset needed to come within ten per cent of full-signal accuracy stayed constant within a prespecified margin as signals grew sixteenfold, whereas the structured loader needed ever more. It declines what it cannot represent, covering fewer cases than that baseline and no electrocardiogram.
arXiv·2026-10-05·Dhruv Koul
No generated summary available for this entry.
overview
Original abstract
While independent and identically distributed noise is typically assumed in quantum computing research, complex error models such as correlated and spatio-temporal errors remain underexplored. In this paper, the performance of $\mathrm{XZZX}$ and rotated surface codes is evaluated under these complex noise models. Standard graph-based decoders struggle with the hyperedges generated by correlated errors on bias-tailored codes. To address this, we employ the Minimum Weight Parity Factor (MWPF) decoder, which natively processes syndrome hypergraphs without artificial edge decomposition. Our simulations show that under strong Z-biased circuit-level correlated noise ($η=100$), the threshold of the rotated code degrades to $\approx 0.36\%$, while the $\mathrm{XZZX}$ code drops to $\approx 0.70\%$. Furthermore, a distinct non-monotonic threshold dependence is observed for the $\mathrm{XZZX}$ code across different bias ratios. While the $\mathrm{XZZX}$ code effectively absorbs high-density Z-type hyperedges at extreme biases, it exhibits a threshold minimum at moderate biases ($η\approx 10$) because transverse X and Y errors actively bridge the diagonal strings, breaking the code's one-dimensional decoupling symmetry. These findings demonstrate that utilizing hypergraph-aware decoders is critical, as the performance of bias-tailored codes is highly sensitive to the geometric structure of spatio-temporal correlated noise.
arXiv·2026-10-05·Andrew Li et al.
No generated summary available for this entry.
overview
Original abstract
There has been significant recent interest in near-term qLDPC codes as high-performance alternatives to surface and color codes. One such class of codes is 2-dimensional translationally invariant (TI) codes, such as bivariate bicycle codes, which share similar properties to topological codes. Fundamental objects in the study of such codes are the materialised symmetries, which can be used for the construction of matching-based decoders. These decoders generalise the minimum-weight perfect matching decoder for toric codes and provide similar asymptotic performance guarantees that heuristic decoders such as BP and its variants lack. Despite this, the mathematical structure of symmetries along with their properties under translation and restriction to finite-sized lattices has not been well-studied. We describe a decomposition of symmetry spaces of 2D CSS TI codes on infinite lattices into translation-invariant subspaces which allow us to write an explicit basis of symmetries in a plane-wave-like form. We then describe how to adapt this infinite lattice basis so that any corresponding rectangular periodic lattice basis can be obtained by restriction to basis elements compatible with the periodic boundaries. This allows us to describe how the symmetry space varies with different rectangular dimensions. We illustrate via examples that it is often straightforward in practice to determine a basis of symmetries on twisted boundaries as well, without needing to recompute the decomposition. We comment on the applications of this framework to matching-based decoders and provide examples of symmetries of such codes as the gross code.
arXiv·2026-10-05·Rohit Chaurasiya, Xuemei Gu
No generated summary available for this entry.
overview
Original abstract
Physics simulators can support the discovery of quantum experiments by predicting the states generated by experimental configurations. When these simulators are computationally expensive, repeated simulator calls can limit the search for experiments that generate a desired quantum state. Here, we develop a physics-inspired polynomial neural surrogate for PyTheus, a graph-based quantum-optics simulator, to predict quantum states and use it to design quantum experiments. Its polynomial activations are motivated by the relation between graph perfect matchings and the resulting state amplitudes. We train separate surrogate models for four-, six-, and eight-photon systems and show that they achieve higher prediction accuracy with fewer trainable parameters than standard multilayer perceptrons. We then use the trained surrogates for inverse design of GHZ, W, and linear-cluster states. For the larger systems, the surrogates also enable faster inverse design than direct optimization with PyTheus. These results suggest that incorporating the underlying physics into neural surrogates can provide an efficient approach to quantum experiment design.
arXiv·2026-10-05·Yuchen Lu, Zherui Chen, Tongyang Li
No generated summary available for this entry.
overview
Original abstract
Metastability separates apparent equilibration from true convergence: a dynamical system can remain near an intermediate state long before reaching its stationary state. In quantum dynamics used for optimization, such a plateau can delay progress toward a target concentrated near the global minimizers of a nonconvex potential. In this paper, we initiate the study of the general mechanisms by which coherent evolution and dissipation shape metastability, using quantum Langevin dynamics (QLD) as a concrete example [CLW+25], where the objective function is encoded in the potential and coherent transfer between wells interacts with tunable dissipation. To quantify this interaction, we solve a two-state model precisely and derive a spectral-separation criterion in terms of tunneling frequency, dissipation strength, and damping imbalance. Extending the analysis to multi-state models, we show that sufficiently weak tunneling between wells can separate slow population transfer from fast relaxation within each well. In addition, we establish conditions under which changing the structure of dissipation shortens the time needed to approach a prescribed target state. Numerical experiments on double-well and multi-well potentials demonstrate these improvements while keeping the target and accuracy fixed and accounting for the time spent on control.
arXiv·2026-10-05·Federico Tonetto, Jérôme Dubail
No generated summary available for this entry.
overview
Original abstract
We study the time evolution of the Operator Space Entanglement Entropy (OSEE) of one-dimensional number-conserving free fermions subject to a random space- and time-dependent evolution. It is known that, in free-fermion systems without randomness, the OSEE of \emph{local} operators grows at most \emph{logarithmically} in time. Here we show that, in the presence of randomness, the OSEE of local spin operators involving a Jordan-Wigner string grows as $\mathcal O(\sqrt t)$, for all values of the Rényi index. We establish this in two models: a Brownian Hamiltonian and a brick-wall matchgate circuit. We also consider the OSEE of the evolution operator, and we show that it also grows as $\mathcal O(\sqrt{t})$, in contrast with the linear growth generically expected without randomness. We analytically compute the average entropies of the two operators by mapping the quantum models to the symmetric simple exclusion process, relying on an assumption of self-averaging which we support numerically. We also consider two other types of randomness: random evolution in time that keeps spatial translation invariance, and quenched disorder. In the former case, we find that the OSEE also grows as $\sqrt{t}$. In the latter case, we find that the entropy grows as $\mathcal O( \log \log t)$ for Hamiltonian evolution both for local operators with a Jordan-Wigner string and for the evolution operator, whereas it remains bounded at all times in the brick-wall matchgate circuit.
arXiv·2026-10-05·Seid Koudia et al.
No generated summary available for this entry.
overview
Original abstract
We study transmission of a Greenberger-Horne-Zeilinger (GHZ) state over nonunitary quantum multiple-input multiple-output (QuMIMO) channels using finite-energy Gottesman-Kitaev-Preskill (GKP) encoding. A coupled-mode model describes coherent mixing, mode-dependent attenuation, and Gaussian noise. The transceiver combines programmable passive meshes, quantum-limited MMSE gain, local GKP recovery, and joint classical syndrome decoding. We optimize complex-Givens lattices using instantaneous channel-state information (CSI), current singular values with channel statistics, or statistics alone. Simulations show that joint lattice shaping outperforms product GKP processing. Under coherent-basis drift, full instantaneous CSI improves GHZ-state preservation, whereas singular-value conditioned and fully statistical designs perform similarly because neither resolves the current singular frames. These findings identify singular-frame geometry as a critical resource beyond attenuation knowledge where joint GKP processing adapts the logical lattice and receiver to anisotropic bosonic noise rather than merely inverting multimode mixing.
arXiv·2026-10-05·Yiyi Cai, Yongtao Zhan, Alexander Zlokapa
No generated summary available for this entry.
overview
Original abstract
The Sachdev-Ye-Kitaev (SYK) model is a strongly interacting fermionic system. Its dynamics are difficult to analyze with Lieb-Robinson bounds and cluster expansions due to its all-to-all disordered interactions. We prove that, with high probability over the disorder, the SYK model admits a quantum Gibbs sampler with a system-size-independent spectral gap at sufficiently high constant temperatures. This yields polynomial-time preparation of SYK Gibbs states on a quantum computer. While prior non-rigorous computations that suggested SYK thermalization were limited to studying local correlators, we emphasize that our result holds up to arbitrary inverse polynomial trace distance. Our proof introduces the pseudo-Lindbladian approach to fermions and uses an especially simple SYK analysis based on a comparison to classical dynamics.
arXiv·2026-10-05·Shiva Dwivedi et al.
No generated summary available for this entry.
overview
Original abstract
We show that trap rotation overrides Kibble-Zurek (KZ) universality when a 2D Bose-Einstein condensate forms via a finite-time quench. In stochastic Gross-Pitaevskii simulations, the rotation-induced chiral bias drives the vortex number close to the Feynman-Onsager (FO) value, independent of the quench time. Ramping up rotation with the quench restores the KZ scaling at low frequencies, with vortex numbers below the FO value. The vortices form a disordered lattice that a pinning potential can order into an Abrikosov lattice, even at low rotation. Trap rotation thus offers a control knob for critical dynamics.
arXiv·2026-10-05·J. A. Montanez-Barrera; Kristel Michielsen
No generated summary available for this entry.
overview
Original abstract
Quantum error correction (QEC) relies on repeated parity extraction, mid-circuit measurement (MCM), reset, feed-forward, and scheduling, yet these primitives are usually assessed either in isolation or through resource-demanding experiments. We introduce a few-sample benchmark of QEC-relevant primitives based on an MCM implementation of the quantum approximate optimization algorithm (QAOA) with a fixed set of linear parameters (LR-QAOA). For a chosen code, the QAOA Hamiltonian is constructed from its check structure, such that the resulting circuit mimics the syndrome-extraction connectivity and MCM pattern while producing a direct algorithmic signal, the approximation-ratio r. The LR-QAOA depth, defined by the number of QAOA layers, plays a role analogous to the number of repeated syndrome-extraction rounds in a QEC experiment. From QPU executions, the decay of r with depth defines an effective hardware error, which we map to an equivalent two-qubit depolarizing rate λeff. We compare direct and MCM-mediated implementations across 10 QPUs from IBM, IQM, and Quantinuum, with circuits containing up to 2950 MCM operations. On Quantinuum's Helios-1 and H2-1, we run code-structured LR-QAOA benchmarks for surface-code, triangular color-code, and bivariate-bicycle qLDPC Hamiltonians up to 81, 91, and 48 data qubits, respectively, using up to 480 MCM operations. On IBM ibm_phoenix, we implement the surface-code structure and compare the LR-QAOA response with logical-memory experiments, observing a correlation between the benchmark and the logical performance across different regions of the QPU. Its construction and low resource requirements provide a practical benchmark for comparing hardware generations and QEC implementations before full logical-memory experiments are performed.
arXiv·2026-10-05·Yuta Araki et al.
No generated summary available for this entry.
overview
Original abstract
We developed a highly sensitive and long-term stable diamond quantum magnetometer by integrating a dual-feedback system that compensates for common- and differential-mode frequency shifts in double-quantum (DQ) 4-Ramsey interferometry. Detecting extremely weak magnetic-field signals requires extensive signal accumulation to enhance the signal-to-noise ratio. However, deviations from the optimal operating frequencies caused by thermal drift or environmental magnetic noise severely hinder the long-term stability of such a sensing system. To overcome the limitation, we first derived analytical solutions for the signal response to common- and differential-mode detunings based on a detuning-inclusive Hamiltonian to theoretically clarify the robustness limit in DQ 4-Ramsey sensing. Guided by this theoretical model, we introduced synchronized frequency modulation and a dual-feedback scheme to independently track and compensate for these frequency shifts while maintaining an optimal magnetic-field response. The proposed method enabled stable continuous operation against temperature variations of 2.8 K. By maintaining a magnetic field sensitivity of 7.0 pT/Hz^1/2 in the frequency range of 5-100 Hz for a prolonged duration of 4 hours, we achieved an extremely low noise floor of 64 fT/Hz^1/2. During prolonged continuous sensing, the system exhibited the expected 1/T^1/2 scaling with integration time T, and prevented both the underestimation of amplitude and waveform distortion. These results establish a robust approach for long-term DQ 4-Ramsey diamond magnetometry and demonstrate its potential for detecting weak biomagnetic signals.
arXiv·2026-10-05·Rohith Sajith et al.
No generated summary available for this entry.
overview
Original abstract
Maximum likelihood (ML) decoders perform quantum error correction by measuring a set of syndromes, classically computing an optimal recovery based on these syndromes and the noise model, and then performing that recovery. ML decoders are well understood for the toric code and generalize straightforwardly to other surface codes with Abelian anyons, where they can saturate information-theoretic decoding thresholds. On the other hand, codes with non-Abelian anyons have become increasingly relevant because they can support transversal or constant-depth non-Clifford gates and admit efficient preparation protocols in modern quantum devices. However, they present new challenges for decoding: non-Abelian anyons cannot in general be deterministically annihilated, and the logical operators cannot be classified by Abelian homology. In this work, we show that refined syndrome sets, including measurements that resolve non-Abelian anyon fusion outcomes, systematically improve the performance of ML decoders. We demonstrate this concretely by constructing explicit decoders for the $D_4$ quantum double model under charge noise, and obtaining numerical results for thresholds via mappings to classical statistical-mechanics models. We show that there is a nonzero noise threshold below which the entire logical qudit can be recovered with a single round of measurements.
arXiv·2026-10-05·Jia-Cheng Li et al.
No generated summary available for this entry.
overview
Original abstract
Graphene nanoscrolls form a unique radial superlattice whose geometry enables transport behaviors distinct from their flat counterparts. We theoretically demonstrate that rolling a graphene nanoribbon into a few-turn nanoscroll (1.0-1.2 turns) triggers a giant enhancement in longitudinal conductance by an order of magnitude (nearly twentyfold). We show that this effect stems from interlayer hopping between open boundaries, which not only transforms localized edge states into one-dimensional-like conducting channels and also induces a significant Fermi energy shift. Our results reveal an inverse scaling of conductance with turn number, establishing GNSs as a platform for geometry-driven quantum transport and offering a tunable approach to engineering nanoarchitectural electronic states.
arXiv·2026-10-05·P. K. Nkaimbi et al.
No generated summary available for this entry.
overview
Original abstract
Exceptional points (EPs) are conventionally identified through eigenvector coalescence, inaccessible in classical platforms lacking a Hamiltonian spectrum. We introduce classical observable coalescence as a diagnostic identifying EPs directly from physical configurations, and demonstrate it in a known non-Hermitian Ising chain with coupling $J$ and staggered imaginary field $γ$, chosen for verifiability against established quantum results. A mean-field reduction of the Heisenberg dynamics yields equilibrium branches organising into two symmetry-related families whose fusion at the boundary of the EP supersurface $|γ|=|J|$ exhibits the characteristic $\sqrt{J^2-γ^2}$ branch-point structure and two-sheeted Riemann topology. Crucially, the degeneracy at $γ=0,η=0 $ is shown to be a diabolic point, producing no observable coalescence, establishing the diagnostic as discriminating rather than merely suggestive. An exact Jordan-Wigner and Bogoliubov-de Gennes treatment confirms eigenvector coalescence at the same threshold, and a coupled gain-loss circuit realisation is proposed, establishing classical observables as experimentally accessible signatures of non-Hermitian criticality.
arXiv·2026-10-05·Hongrui Chen, Zhiyan Ding
No generated summary available for this entry.
overview
Original abstract
We prove rapid mixing of a quantum Gibbs sampler for general one-dimensional non-commuting local spin systems at every fixed positive temperature. In particular, for a system of $n$ sites, we show that the Kubo--Martin--Schwinger (KMS) detailed-balanced Gibbs sampler of~\cite{CKG2023} converges from any initial state to trace-norm error $ε$ in time $O(\log^4(n)+\log(1/ε))$. This improves the previous $O(n+\log(1/ε))$ bound and establishes rapid mixing beyond high-temperature and weak-interaction regimes. Our proof explains why the slowest decay rate, captured by the spectral gap, can substantially underestimate the speed of equilibration. The key insight is that a state far from equilibrium must have a substantial component outside the span of low-weight Pauli operators, where stronger dissipation estimates apply. This yields two stages of relaxation: a double-exponential convergence from a bad initial state, followed by exponential convergence near equilibrium. We turn this mechanism into a framework for proving rapid mixing through spectral analysis beyond the gap. Our decay estimate is equivalent to exponential convergence in sandwiched Rényi-2 divergence. Together with the spectral gap, it also implies a modified logarithmic Sobolev inequality with rate $Ω(\log^{-4}(n))$.
arXiv·2026-10-05·Caesnan M. G. Leditto
No generated summary available for this entry.
overview
Original abstract
Higher-order networks (HONs) represent interactions among groups of objects, supporting the study of collective behaviour that pairwise models can miss. In simplicial models of these networks, Hodge Laplacian linear systems provide a common mathematical framework for analysis, for example, for solving statistical ranking problems and investigating long-term stability in coupled oscillator systems. The large number of variables associated with edges, triangles, and higher-dimensional simplices can make these systems costly to solve. Recent quantum algorithms address this bottleneck. However, comparisons with particular classical algorithms do not decision output whether solving these linear system problems establishes a quantum complexity foundation for provable quantum advantage. We prove that preparing a quantum state encoding the normalized minimum-norm solution of Hodge Laplacian linear systems is $\mathsf{BQP}$-hard under the specified sparse oracle model and parameter promises. Our sequence of reductions maps an arbitrary polynomial-time bounded-error quantum computation to such linear systems. Each reduction allows efficient recovery of the normalized minimum-norm solution of the preceding linear system. Together with an efficient quantum algorithm for the associated decision problem from the approximate solution state, we show that this problem is $\mathsf{BQP}$-complete. These results provide a worst-case complexity foundation for evaluating quantum advantage in HON analysis and show that the $\mathsf{BQP}$-hardness of the quantum linear system problem (QLSP) persists even when the matrices are restricted to Hodge Laplacians.
arXiv·2026-10-05·Thomas A. Hahn et al.
No generated summary available for this entry.
overview
Original abstract
For quantum random number generators (QRNGs), strong security guarantees can be obtained under various assumptions. The most well-known assumptions are the non-signalling assumption (needed for device-independent (DI) QRNG) and post-quantum computational assumptions (needed for computationally bounded single-prover QRNG protocols). In this work, we study a third model: a simple prepare-and-measure QRNG whose security relies on physically motivated energy constraints. This physically motivated set-up allows for easier implementations of QRNGs and can supply better rates. So far, previous works that studied the energy-constrained model either assumed that the adversary is classical in their security proof or supplied relatively weak bounds on the certified randomness, by bounding the conditional min-entropy. In this work, we prove a new, essentially tight, lower bound on the single-round von Neumann entropy against adversaries holding both classical and quantum side-information. Our work reveals that working with the von Neumann entropy, rather than the min-entropy, in the quantum case can lead to a major improvement, nearly matching the classical bound in many cases. We further study the robustness of our entropy bound. Since the single-round von Neumann entropy is the main quantity of interest when characterizing the key rate of QRNGs, our bound establishes the main ingredient for rigorous security proofs against general quantum attacks in this framework.
arXiv·2026-10-05·Dikshant Rathore, Leo Zhou
No generated summary available for this entry.
overview
Original abstract
Consider a quantum state vector proportional to any given column of the character table of the symmetric group ($S_n$), corresponding to a superposition over the irreps weighted by the character values. It was recently argued that sampling from this state is classically hard under reasonable complexity-theoretic assumptions, while there exists an efficient quantum algorithm for preparing this character state using the quantum Fourier transform (QFT) over $S_n$ [arXiv:2501.12579]. We give an alternative, simpler algorithm to prepare this character state with a sequence of Hamiltonian evolutions, as well as an efficient implementation with reconfigurable qubits that uses only nearest-neighbor gates in 1D. The gate complexity, accounting for Hamiltonian simulation errors, depends on the choice of the column: For fixed target state error, the estimated sufficient total gate count ranges from as few as $O(n)$ gates for the $n$-cycle column, to $\widetilde O(n^{1.75})$ gates near the conjecturally classically hard parameter regime, to provably $\widetilde O(n^{2.5})$ gates in the worst case. In contrast, the QFT subroutine in the prior approach uses $\widetilde O(n^3)$ gates. Our gate count estimates come from leading-order state-dependent Trotter error analysis, and the proven worst-case bound relies on a QSVT-based Hamiltonian simulation method; numerical benchmarks of the Trotter-based protocol suggest that the estimates are conservative. Furthermore, we generalize our protocol to give an explicit algorithm for the quantum character transform (QCT) over $S_n$ using $\widetilde O(n^{2.5})$ gates and $O(n)$ qubits. An application to entanglement entropy of symmetric orbifold conformal field theories is also discussed.
arXiv·2026-10-05·Swagata Acharya, Jerome Jackson, Mark van Schilfgaarde
No generated summary available for this entry.
overview
Original abstract
The emergence of spin-polarized electrons from nonmagnetic chiral molecules and crystals is called Chirality-induced spin selectivity (CISS). A chiral phonon of definite wavevector $q$ can strongly enhance it, but near equilibrium the two helicities $+q$ and $-q$ are equally populated: they are time-reversal partners and their contributions cancel. We show that in a biased chiral conductor the current causes the phonon of one helicity to damp less than the other. The damping asymmetry is odd in the current, odd under $q\rightarrow-q$, invariant under a mirror that reverses the structural handedness, and equal, mode for mode, to the current-induced nonconservative Berry force on the phonon coordinate. Closing the phonon kinetics with a rate equation turns the asymmetry into a net lattice helicity: at any finite bias one helicity is preferentially populated, with no threshold, growing linearly with the current as $V\rightarrow0$; above a threshold that helicity becomes a self-sustained coherent travelling wave. We demonstrate this effect in elemental tellurium, treated as an open quantum system (electronic Hamiltonian, phonon bath, and electron-phonon coupling) within a quasi-ab initio framework. The electronic Hamiltonian is supplied by a vertex-corrected quasiparticle self-consistent $GW$ (QSGW) potential with spin-orbit coupling; nuclear displacements are modeled with a machine-learned interatomic potential, which yields chiral phonon modes at finite $\pm q_z$ on the $Γ$-A line. The perturbation to the electronic Hamiltonian from a nuclear displacement is approximated by a frozen-phonon deformation potential. No optical pump is needed: a bias alone drives the current and selects the phonon helicity; reversing the current reverses the selection.
arXiv·2026-10-05·Swagata Acharya, Mark van Schilfgaarde
No generated summary available for this entry.
overview
Original abstract
For two decades, the origin of Chirality-Induced Spin Selectivity (CISS), the spin polarization of electrons by nonmagnetic chiral systems without magnetic fields, has remained unsettled. Here, we establish a single exact rule defining the fundamental conditions for the effect: in nonmagnetic, time-reversal-invariant conductors, all measurable CISS signals are time-reversal odd and vanish near equilibrium, proving that structural chirality alone is insufficient. By evaluating leading theoretical mechanisms across four levels of nonequilibrium transport, from coherent classical driving to fully non-Markovian quantum baths, we verify this selection rule to machine precision. We show that coherent chiral vibrations generate substantial collinear polarization (up to 10 percent across 0.5-6 THz) that reverses with handedness, whereas incoherent vibrations yield under 1 percent, and non-Markovian bath memory further suppresses the signal. The chiral geometry first makes the electronic motion chiral by accumulating orbital angular momentum; spin-orbit coupling (SOC) then converts that into spin. CISS therefore acts as both a spin polarizer and a spin filter, the latter an order of magnitude weaker. The polarization grows with molecular length and then saturates, matching trends reported for DNA and peptides. Reversing the drive converts decaying spin into a handedness-locked charge-current pulse (inverse-CISS). We find that once the system is driven, the polarization magnitude scales with an effective spin-orbit coupling: making heavy atoms and curved light-atom backbones indistinguishable at equivalent effective SOC. This enables us to chart how geometry, driving field, and length separate those routes.
arXiv·2026-10-05·Zhuo-Ting Cai, Wei Chen
No generated summary available for this entry.
overview
Original abstract
A quantum-classical correspondence for non-Hermitian symmetry breaking has recently been established using coordinate-space path integrals, providing a semiclassical understanding of spectral transitions at the level of individual eigenstates. Here we develop its dual formulation in momentum space by constructing the corresponding trace formula and quantization condition. We show that the real or complex nature of individual eigenvalues is determined by the symmetry properties of the associated semiclassical orbits, as in the coordinate-space path-integral approach. Moreover, we demonstrate that the topology of semiclassical orbits determines the natural formulation of the quantization condition: the coordinate- and momentum-space formulations are equivalent for contractible periodic orbits in phase space, whereas for noncontractible orbits, the quantization condition along the winding direction remains valid, but its dual form must be corrected by a boundary term. In particular, real-space-winding and Brillouin-zone-winding orbits naturally select coordinate- and momentum-space quantization, respectively. As a nontrivial application, we investigate the boundary-induced spectral transition of Bloch oscillations in a finite non-Hermitian lattice, where Bloch-oscillation orbits winding across the Brillouin zone preserve the relevant symmetry and yield real energy levels, whereas boundary-reflected orbits form symmetry-related pairs and give rise to complex-conjugate eigenvalues. Our work completes the quantum-classical correspondence framework for non-Hermitian symmetry breaking, extending its applicability to a broader class of non-Hermitian problems.
arXiv·2026-10-05·Xinan Chen, Eric Chitambar
No generated summary available for this entry.
overview
Original abstract
Communication using quantum channels generally requires encoding and decoding on many identical uses of a quantum channel. In practical settings, decoherence may severely limit our ability to do so, potentially rendering each channel use nonidentical. Given $n$ nonidentical channels, we present an entanglement-assisted encoding and decoding strategy that yields a channel with higher worst-case fidelity than all of the $n$ given channels. The strategy is universal, in the sense that the improvement holds regardless of what channels are given, as long as they satisfy mild assumptions on their initial entanglement fidelities. Our protocol is optimal when the given channels are depolarizing channels, and is essentially the unique one that is universal. This idea can also be extended to classical channels, where shared randomness between the sender and the receiver allows universal enhancement of the probability of correct transmission. We then consider general quantum resource theories, providing a necessary condition and a sufficient condition for the possibility of such universal improvement of quantum resources.
arXiv·2026-10-05·Malvin Carl Teich, Steven B. Lowen
No generated summary available for this entry.
overview
Original abstract
A series of 11.6-d-duration photon-counting experiments, employing a broad variety of light sources with different statistical properties and optical spectra, were carried out over a 1.5-yr period. All of the photon-count spectra at baseband followed a common $1/f^2$ form over the frequency range $1 \times 10^{-6} \leqslant f \leqslant 5 \times 10^{-4}$ Hz, corresponding to a timescale range $33$ min $ \leqslant T_f \leqslant 11.6$ d, where $T_f \equiv 1/f$. The lower and upper timescale limits were established by the photodetector noise floor and the duration of the individual experiments, respectively. Unlike ordinary Brownian motion, all of the measured photon-count sample paths exhibited irregular long-timescale fluctuations, with durations ranging from hours to days. It has been established that the photon-count spectra cannot plausibly be ascribed to fluctuations of the current, voltage, or temperature of the source or the detector, nor to technical sources of noise associated with the optical system or local environment. Although the physical origin of the photon-count fluctuations remains unresolved, several heterodox hypotheses are set forth. From a statistical point-of-view, the photon counts appear to follow a doubly stochastic Poisson process with a slowly varying random intensity. Analogous experiments that rely on ionizing radiation and direct-conversion solid-state radiation detectors are proposed.
arXiv·2026-10-05·Julian Guam, Jianqing Liu
No generated summary available for this entry.
overview
Original abstract
The Lindblad master equation is the standard framework for describing the non-unitary evolution of open quantum systems, where environmental interactions induce dissipation and decoherence. When both the system Hamiltonian and the dissipation rates are partially unknown or explicitly time-dependent, traditional analytical inversion and system-identification techniques become intractable. Recent works have demonstrated that Transformer-based models can infer unknown dissipation rates from observable time series, yet these approaches typically rely on hand-crafted statistical features under idealized and highly restricted conditions. Here we advance the paradigm by introducing a raw time-series Transformer that directly ingests the full trajectories of Pauli expectation values $\langleσ_x(t)\rangle$, $\langleσ_y(t)\rangle$, and $\langleσ_z(t)\rangle$, thereby fully exploiting the self-attention mechanism for temporal modeling. The architecture is further extended to jointly learn unknown Hamiltonian parameters, handle multiple dissipation channels, and operate robustly under realistic measurement noise. Across all tested scenarios the model achieves consistently high reconstruction accuracy while eliminating manual feature engineering. This provides a scalable, robust, and versatile framework for quantum environment sensing in realistic open quantum systems.
arXiv·2026-10-04·Salvador Barranco Cárceles, Andreas Kyritsakis, Anthony Ayari
No generated summary available for this entry.
overview
Original abstract
As electron sources are reduced in size, fabricated in new materials, or pushed for performance, the analytical formulations for thermo-field electron emission, namely Fowler-Nordheim and Murphy-Good equations and their JWKB-based extensions, are increasingly applied out of the range of conditions for which they were derived. We present GETELEC-3, an open-source code that replaces them with a direct numerical solution of the one-dimensional time-independent Schrödinger equation (1D-TISE). Several methods to solve the 1D-TISE have been implemented to test for speed, robustness, and solution's uncertainty. The Noumerov algorithm is found to be quickest, with the solution uncertainty below 1%, and together with an optimised kernel that advances all electron energies in parallel, the cost of calculating the current density is reduced to a few milliseconds - comparable to the JWKB evaluation. To further boost the calculation speed, especially in complicated barriers, a neural network has been trained on the residual of the logarithm of the semiclassical reference and it reproduces the current density better than 0.4% at a fraction of the computational cost. The code is developed for metals and semiconductors, accepts arbitrary potentials and density of states, and comes with a user-friendly interface and compiled executable to democratise rigorous electron emission calculations and data analysis.
arXiv·2026-10-04·Pei Yuan, Wei Zi, Shengyu Zhang
No generated summary available for this entry.
overview
Original abstract
Unitary synthesis underlies universal quantum computation by translating unitary transformations into circuits of elementary gates. We show that for any budget $m\geq 0$ of ancilla, every $n$-qubit unitary can be exactly implemented using a quantum circuit consisting of $O(4^n)$ CNOT and single-qubit gates in $O(n+4^n/(n+m))$ layers attaining the asymptotically optimal depth--ancilla tradeoff while simultaneously achieving optimal circuit size. The key idea is to encode computational basis states as wavefunctions sharing a Gaussian envelope, converting unitary action on amplitudes into coordinate transformations that admit shallow circuit implementations. The continuous encoding is then discretized, with approximation errors removed by exact residual correction. The depth-ancilla tradeoff follows by recursively applying the quantum Shannon decomposition, synthesizing its smaller unitary factors, and reusing ancillary qubits.
arXiv·2026-10-04·Josef Bruzzese
No generated summary available for this entry.
overview
Original abstract
A finite reversible model can approximate individual quantum gates while retaining freedom in its transition tables and preparation contexts. We formulate the simultaneous certification problem in which one stationary controller and one preparation law must reproduce an entire collection of circuit probabilities. For a specified frame catalogue, accuracy graph and calibration constraints, we give an exact shared-table feasibility formulation and distinguish certificates for a fixed table from certificates for the complete model class. A four-frame qubit example exhibits a strict separation between fitting two circuits individually and fitting them jointly. A larger exact benchmark uses 464 frames and a phase symmetry that removes preparation-prior dependence. We independently reconstruct its admissible graph and certify a sharp repeated-circuit horizon: one controller stays within probability error 1/3 through 192 blocks, whereas every allowed controller violates that threshold by block 193. A separate controller reproduces all 8,190 nonempty Hadamard-phase words of length at most twelve within the same tolerance. We also derive a finite-window spectral obstruction and finite-shot confidence tests, illustrated by a reproducible sampling experiment. The conclusions concern the stated finite reversible model classes; they do not establish a universal memory bound or a discrepancy for physical quantum hardware.
arXiv·2026-10-04·Savero Lukianto Chandra, Daochen Wang, Carolyn Zhang
No generated summary available for this entry.
overview
Original abstract
The Guided Local Hamiltonian Problem (GLHP) is the problem of ground state energy estimation and preparation given a guiding state having good overlap with the true ground state. The problem is known to be BQP-complete for small error but is classically tractable for larger error. In this work, we identify an orthogonal regime in which the problem is classically tractable, namely when the true ground state $ψ$ has polynomially bounded $\ell_1$-norm. In particular, we show that the Truncated Power Method (TPM), a classical algorithm introduced by Kirby et al. in the quantum context, has a runtime that is polynomially comparable to quantum algorithms for GLHP in all relevant parameters, except for an extra factor of $\|ψ\|_1^2$. In other words, if $\|ψ\|_1^2$ is polynomially bounded, then TPM dequantizes quantum algorithms for GLHP.
arXiv·2026-10-04·Nicolae Cotfas
No generated summary available for this entry.
overview
Original abstract
A Hilbert space is usually described using an orthonormal basis, but a more general description can be defined using a tight frame. In the case of continuous-variable Gaussian states, the coherence is usually described using the Hermite-Gauss basis. We present an alternative description using the tight frame of all canonical coherent states. The description of Gaussian states in terms of coherent states is simpler than in terms of Hermite-Gauss basis, and this allows us to obtain an explicit formula describing the frame-dependent coherence of a mixed Gaussian state as a function of the determinant and the trace of covariance matrix. For each mixed Gaussian state, we construct a sequence of discrete-variable quantum states rapidly convergent to it (as concern the purity and coherence) when the dimension of Hilbert space becomes large enough (15 or more). In the discrete case, the coherence is measured with respect to the tight frame of all discrete coherent states.
arXiv·2026-10-04·Bogdan Borodin et al.
No generated summary available for this entry.
overview
Original abstract
The bulk photovoltaic effect (BPVE) provides a direct link between quantum geometry and nonlinear light-matter interactions, yet conventional far-field measurements cannot disentangle BPVE from contact- and interface-induced photothermoelectric signals. Here we develop cryogenic, polarization-sensitive terahertz microscopy with deep-subwavelength resolution and apply it to dual-gated AB bilayer graphene. Near resonance between the band gap and terahertz photon energy, we observe enhanced optical conductivity and spatially resolved BPVE. Polarization-dependent measurements reveal a characteristic twofold angular symmetry and a distinct shift-vector direction, both governed by crystalline symmetries and quantum geometry. The evolution of BPVE with carrier density and temperature provides a sensitive probe of the fine electronic structure of bilayer graphene, revealing signatures of trigonal warping and electron-hole asymmetry. Agreement with theory demonstrates that the terahertz nanoscopy of BPVE established here offers an optical lens into the interplay between band and quantum geometry in quantum materials.
arXiv·2026-10-04·John Lekner
No generated summary available for this entry.
overview
Original abstract
A many-body wavefunction exponential in R, where the square of R is the sum of the squares of the interparticle distances, is shown to be the solution of Schrodingers equation for a potential proportional to the reciprocal of R, for N particles. A set of translationally invariant rotational eigenstates of angular momentum is found.
arXiv·2026-10-04·Haniyeh Hajizade, Vahid Ameri, Alidad Askari
No generated summary available for this entry.
overview
Original abstract
Charging a quantum battery through a pumped charger can lock a substantial part of its stored energy inside the bipartite correlations that grow between the constituent cells, and this \emph{correlation ergotropy}, being the energy that no local single-cell operation can reach and that only collective operations can recover, is the object of the present study. Following the charging trajectory of two coupled three-level cells, we find that the correlation ergotropy closely tracks the logarithmic negativity, which shows that the locked energy is carried by genuine bipartite entanglement rather than by coherent collective dynamics alone, and that an equal-strength coherent non-entangling drive produces no such locking at all. For a pure two-cell battery we establish an exact, basis-independent closed form in which the locked energy depends only on the sorted eigenvalues of the reduced cell and the cell energy levels, revealing that the locked fraction rises from zero at the separable corners of the Schmidt simplex to unity at the symmetric maximally entangled state and remains invariant under local unitaries. Decoherence and dephasing, which destroy the correlations, do \emph{not} release this energy but erase it, so extraction must be collective and must take place while the correlations persist, while cold damping leaves the effect intact and thermal occupation suppresses it. These results give a resource-theoretic reading of correlations in quantum batteries, sharpen the line between genuine entanglement and coherent collective dynamics, and point to experimentally accessible conditions for correlated-charge and collective-extraction protocols.
arXiv·2026-10-04·Nadav Drechsler, Yuval Oreg, Dorit Aharonov
No generated summary available for this entry.
overview
Original abstract
The study of quantum memories out of thermal equilibrium is motivated both by the need for memories that withstand realistic noise in fault-tolerant quantum computers and by the fundamental question of when quantum memory can emerge in autonomous many-body systems. We establish a general equivalence between CSS-based quantum memories subject to Pauli noise and classical memories via two associated probabilistic processes. In the asynchronous setting, where the quantum dynamics is generated by a Lindbladian, we identify a broad class of syndrome-based Lindbladians for which the quantum memory problem is equivalent to memory in continuous-time classical Markov dynamics. In the synchronous setting, we introduce syndrome-based probabilistic cellular automata (SPCAs) and establish a one-to-one correspondence between their classical memories and CSS-based quantum memories under local quantum channels. This framework provides a systematic route for deriving and constructing quantum memories from classical probabilistic processes, and recovers known results, including the fact that the 4D toric code is a quantum memory in the presence of thermal noise. As an application, we give the first rigorous proof that the 4D toric code with Toom's rule is a quantum memory in the presence of local Pauli noise, provided the error is below a constant threshold. We prove this both for the corresponding synchronous, PCA-type quantum dynamics and for a Floquet Lindbladian. More generally, we show that classical memory in an SPCA can be lifted to a quantum memory under Floquet Lindbladian dynamics; whether this can be done with a time-independent Lindbladian remains open. Our results provide a general framework for relating classical and quantum memory, shed light on the conditions for fully autonomous quantum memories, and may guide the construction of provable autonomous quantum memories in low dimensions.
arXiv·2026-10-04·Ryan Anselm et al.
No generated summary available for this entry.
overview
Original abstract
We establish optimal quantum-classical separations in communication complexity for search problems. We introduce a total search problem called Pelagic Fourier Fishing and show that it admits an $n$-qubit quantum one-way protocol, whereas every randomized two-way protocol requires $Ω(2^n)$ bits of communication. We then introduce a variant of this problem whose solutions can be verified in polynomial time. This variant also admits an $n$-qubit quantum one-way protocol, while every randomized one-way protocol requires $Ω(2^n)$ bits of communication. We also construct a family of efficiently verifiable total search problems achieving an $n$ versus $Ω_d(n^d)$ separation between quantum one-way and randomized one-way communication for every fixed $d \ge 2$. In the quantum protocol, Alice prepares her message using a single unitary from the $d$th level of the Clifford hierarchy, and Bob performs a Clifford measurement. This separation is asymptotically optimal under this restriction on Alice's message. For $d = 2$, Alice's message is a stabilizer state and Bob's measurement is Clifford, so the protocol uses no magic, yet achieves an optimal quadratic quantum advantage. Finally, we discuss how these separations can be adapted to near-term quantum advantage experiments in which the demonstrated advantage is both unconditional and efficiently verifiable.
arXiv·2026-10-04·Vojtěch Novák et al.
No generated summary available for this entry.
overview
Original abstract
Variational quantum algorithms turn choices of Hamiltonian, ansatz, and parameterization into a classical nonconvex optimization problem. We study how this objective function can be visualized and characterized in ways that help explain optimizer behavior. We distinguish two properties of the objective: the number of local minima encountered along sampled directions and the differences in quality among local-search endpoints. We then ask how a local optimizer, represented by BFGS, compares with adaptive differential evolution, represented by jSO. Rather than comparing jSO with a single local run, we allow BFGS multiple starts within the same function-evaluation budget. This gives local search repeated opportunities to explore different basins and provides a stronger baseline for asking when a global evolutionary solver is useful. We study these questions using VQE and QAOA, focusing on how frustra- tion, circuit depth, parameter tying, mixed locality, and nonlinear repa- rameterization change the Hamiltonian expectation-value objective seen by the classical optimizer. Increasing independent circuit depth raises the sampled local-minimum count without making global search more effective. Parameter tying, by contrast, produces both more repeated local structure and much larger differences in quality among local-search endpoints, and in this regime adaptive differential evolution outperforms function-evaluation-matched multistart BFGS. The comparison shows that the number of local minima alone does not determine whether global search is advantageous: the important distinction is whether different basins lead to similarly good solutions or to substantially different objective values. These results provide a practical workflow for connecting model construction, objective- function geometry, empirical diagnostics, and optimizer choice.
arXiv·2026-10-04·Ivan P. Miranda, Erik Sjöqvist
No generated summary available for this entry.
overview
Original abstract
We introduce a distinct route for extending classical atomistic spin dynamics into the quantum regime for arbitrary spin $s$, based on a variational product-state \textit{ansatz} that includes both pure and mixed local states. By construction, intersite entanglement -- expected to remain negligible even on very short time scales in many real materials -- is excluded, while local quantum effects are retained through the nonclassical structure of $s\geq 1$ density operators, and nonlinear dynamics arise from both the mean-field interdependence of the local states and the state-dependent dissipative terms. This framework clarifies the variational and geometric origin of the inequivalence between quantum Landau-Lifshitz and Landau-Lifshitz-Gilbert dynamics, provides a criterion for their equivalence under a common time rescaling, establishes connections with the classical theory through two qualitatively distinct limits ($s\to\infty$ and a large number of quantum spins $N$), and allows realistic $\mathcal{O}(N)$ simulations of quantum spin dynamics in materials.
arXiv·2026-10-04·Caroline Stier, Nicolas Cherroret
No generated summary available for this entry.
overview
Original abstract
We show that quasi-paraxial fluids of light propagating in nonlinear Kerr media naturally experience an effective gauge field arising from the intrinsic spin-orbit interaction of light encoded in Maxwell equations. By deriving the leading nonparaxial corrections to the nonlinear Schrödinger equation governing the fluid evolution, we find that, for circularly polarized beams, these corrections generate an effective Lorentz force that modifies the fluid dynamics. Remarkably, the corresponding gauge field is not externally imposed but self-consistently generated by the fluid itself, with its sign controlled by the light helicity and its magnitude governed by the spatial variations of the nonlinear refractive index. We illustrate the physical consequences of this gauge field in two configurations: the chiral deformation of normal and superfluid flows past an obstacle, accompanied by a transverse spin Hall force, and the cumulative precession of an optical wave packet trapped in a focusing fluid.
arXiv·2026-10-04·Artem Karasev, Alexander Teretenkov
No generated summary available for this entry.
overview
Original abstract
We develop a perturbative framework for systems coupled quadratically to bosonic environments with quadratic Hamiltonians and linear Lindblad operators. The method applies to both single-mode and multimode environments whose initial states may be non-Gaussian and nonstationary. By combining linear evolution in a doubled operator space with a characteristic-function representation, we express ordered multitime environmental correlation functions in terms of derivatives of the initial characteristic function. These correlation functions enter a recursive construction of the time-convolutionless generator at arbitrary finite order. We illustrate the method with a qubit coupled to a damped mode via a two-photon interaction. Initial Fock and thermal states with identical first and second field moments produce different second-order generators through their fourth moments.
arXiv·2026-10-04·Dipanjan Bera, Ramniwas Meena, Neel Kanth Kundu
No generated summary available for this entry.
overview
Original abstract
Quantum conference key agreement (QCKA) enables multiple spatially separated users to establish a common key with composable information-theoretic security by exploiting multipartite quantum correlations. Greenberger--Horne--Zeilinger (GHZ) states are a natural resource for this task, but their distribution over optical fiber is degraded by transmission loss, polarization decoherence, and detector imperfections. We investigate the finite-key performance of an $N$-party GHZ-based QCKA system using the $N$-BB84 protocol, where each optical link is modeled by extending the bipartite erasure--Pauli channel to incorporate detector dark counts. We characterize the impact of this quantum channel on the shared GHZ state and derive closed-form expressions for the error rates. The analytical results reveal that the local bit-error rate depends only on transmissivity and dark counts, while the global phase-error rate compounds over all $N-1$ links and therefore degrades faster with both distance and the number of parties. These error rates are integrated into a finite-key secret-key-rate (SKR) framework, in which we optimize the parameter-estimation probability via Brent's derivative-free method. Numerical results show that increasing fiber distance and network size reduce the achievable SKR. Furthermore, the optimized parameter-estimation probability consistently increases the SKR and extends the maximum secure distance relative to a fixed-allocation baseline, with comparison to the asymptotic limit quantifying the residual finite-key penalty.
arXiv·2026-10-04·Claire Donnelly, Rosa Córdoba, Amalio Fernández-Pacheco
No generated summary available for this entry.
overview
Original abstract
The extension of nanoscale quantum materials to the third dimension brings new possibilities to geometrically tune emergent properties, emulating or indeed going beyond the physics of bulk materials, with exciting implications for high-density technological integration. Realising such three-dimensional architectures requires nanofabrication techniques that not only enable complex 3D geometries, but also deliver functional quantum materials with emergent phenomena. Recent advances in focused electron- and ion-beam induced deposition (FEBID and FIBID) have made 3D nanopatterning of functional materials in complex geometries increasingly feasible, paving the way for the experimental realisation of new phenomena and device prototyping. In this review, we discuss the use of FEBID and FIBID 3D nanopatterning of superconducting and magnetic materials. We address the underlying mechanisms, and capabilities of these techniques, focusing on the physical phenomena that become accessible. Considering the resolution of the techniques in the context of the fundamental lengthscales of the materials, we discuss the emergent effects that arise due to three dimensional geometries in magnetic and superconducting nanostructures, and highlight perspectives for future developments of the techniques.
arXiv·2026-10-04·Jiro Akahori et al.
No generated summary available for this entry.
overview
Original abstract
We establish a local Konno-Sato correspondence for reflected random and Szegedy walks on a finite path graph. A generalized reflection principle, using explicit involutions rather than point reflections in the asymmetric case, yields exact zeta factorizations into a boundary factor and local factors indexed by the infinite dihedral group. After symmetrization, the classical and quantum local factors correspond for each group element. The identity contribution determines the normalized thermodynamic limits. In the symmetric case, diffusive and ballistic scalings recover the Gaussian Poisson summation formula and the Dirac comb identity, respectively. Under a double scaling of the asymmetry and spectral parameter, the quantum factorization yields a massive Dirac-type limit: nonidentity even words produce the periodic-orbit factor, the identity produces the free-field factor, and odd words together with the boundary produce a finite boundary correction.
arXiv·2026-10-04·Emma Wang, Joseph Carolan, Andrew M. Childs
No generated summary available for this entry.
overview
Original abstract
In the quantum state distinguishing problem, an algorithm is given copies of a state $|ψ\rangle$ or $|φ\rangle$ separated by trace distance $\varepsilon$, and tasked with deciding which is the case. It is a standard result that $Θ(\varepsilon^{-2})$ copies are required, while having access to a unitary state preparation oracle and its inverse improves this to $Θ(\varepsilon^{-1})$ queries. We study the intermediate case with forward-only access, capturing scenarios where the oracle is a physical process that cannot be reversed. Tang and Wright recently showed that distinguishing a known state from an \emph{unknown} close state requires $Ω(\varepsilon^{-2})$ forward queries in high dimension; we strengthen this result by proving the same bound even when both states are known, as in the state distinguishing setting. Moreover, our lower bound uses a direct hybrid argument, avoiding advanced compressed oracle techniques used in the prior work. In contrast, we give a dimension-independent algorithm solving a continuous-time variant of state distinguishing with only $O(\varepsilon^{-1})$ total forward evolution time. The algorithm uses quantum Zeno dynamics to confine evolution to a known two-dimensional subspace. Thus, a quadratic advantage survives without inverse access for a natural continuous-time analogue of state distinguishing.
arXiv·2026-10-04·Yonglong Li
No generated summary available for this entry.
overview
Original abstract
We study quantum state tomography when the unknown state lies in a trace-distance ball of radius $R$ around a known reference state $ρ$. For arbitrary collective measurements, we determine the minimax expected risk and confidence radius up to universal constants, uniformly over the dimension, center spectrum, radius, and sample size. Write $Γ=d(\mathrm{Tr}\sqrtρ)^2+d^2R$. For $d\ge2$, $0<R\le1$, and $n\ge1$ copies, the expected risk is $Θ(\min\{R,\sqrt{Γ/n}\})$. At failure probability $0<δ\le1/3$, the minimax confidence radius is \[ Θ\!\left(\min\left\{R,\sqrt{\frac{Γ+\log(1/δ)}{n}}\right\}\right). \] For $\varepsilon\le c_0R$ with a universal $c_0>0$, the copy complexity is $Θ((Γ+\log(1/δ))/\varepsilon^2)$. For the lower bound we use a weighted trace-norm witness to retain all spectral scales in a square-root perturbation family. For the upper bound, we give a direct spectral and concentration analysis of a modified existing purification-based procedure.
arXiv·2026-10-04·Zheyu Shen et al.
No generated summary available for this entry.
overview
Original abstract
Open-system dynamics govern decoherence, transport, and engineered dissipation in quantum many-body systems. We propose a quantum algorithm for simulating time-independent, finite-range Lindblad dynamics with bounded local strength on a constant-dimensional lattice of $n$ sites, allowing noncommuting jump operators. For time $T\ge1$ and diamond-norm error at most $ε$, it has depth $O(T\operatorname{polylog}(nT/ε))$ and gate count $O(nT\operatorname{polylog}(nT/ε))$. These results extend the HHKL spatial decomposition to open systems. The main obstacle is that the reversible overlap corrections used for unitary dynamics have no direct analogue for dissipative channels. We overcome this by retaining the environment in a shared unitary dilation, keeping information lost from the system coherently available and making the spatial corrections reversible. We prove exponential occupation bounds for the environmental states generated by the decomposition, allowing compact representation and coherent simulation of local factors on the inputs that arise. The construction reduces each short-time evolution to a constant number of parallel layers on regions of logarithmic diameter, using nearest-neighbour gates and polylogarithmic auxiliary density. We also prove unconditional worst-case lower bounds using time-independent, purely dissipative processes that transport quantum information. For circuits with local quantum and classical communication, the lower bounds are $Ω(nT)$ for the expected gate count and $Ω(T)$ for depth on time scales up to the lattice diameter. They match the upper bounds' leading time and volume dependence up to polylogarithmic factors. At fixed time and sufficiently small fixed error, we further prove a depth lower bound of $Ω(\log n/\log\log n)$, showing that global accuracy can require increasing depth as the lattice grows.
arXiv·2026-10-04·Tushar Pandey
No generated summary available for this entry.
overview
Original abstract
Code surgery measures a logical operator of a quantum LDPC code with $O(d)$ rounds of syndrome extraction. Lifted surgery amortises this cost on Abelian group-algebra codes by measuring an orbit of logical operators under a translation symmetry in one merged code. We extend it to two-block group-algebra codes over non-Abelian groups and ask whether non-commutativity lets one merged code measure more operators than any Abelian group of its symmetries. We classify the block-affine automorphisms of these codes and find that, measured against this full group, most apparent non-Abelian gains disappear. We prove that the gain is at most the index of a largest Abelian subgroup. We find codes with exact distance up to $13$ where the gain is two, including codes in which one merged code reads out every logical qubit, and codes over products of $A_4$, $S_4$ and SL(2,3) with gain three for a best logical, up to $[[336,26,12]]$. A merged-distance lemma gives a simple condition for the gadget to preserve the code distance. In circuit-level simulations with Relay-BP decoding, at the error rates we can resolve, the non-Abelian gadget is as reliable as, or more reliable than, the Abelian gadgets it replaces within statistical error, while using two to three times fewer rounds.
arXiv·2026-10-04·Dikshant Dulal et al.
No generated summary available for this entry.
overview
Original abstract
Quantum hardware advances now make it practical to explore quantum approaches to scientific problems. Applied quantum computing research sits at the intersection of domain knowledge, algorithms, theoretical physics, device physics, and quantum and classical computational methods. The breadth of expertise required and the inherent project complexity challenge not only any individual researcher, but also generic AI systems. Here, we introduce the Quantum Agentic Operating System (QAOS), a structured agentic research system designed to address this challenge for quantum and computational R&D projects. QAOS is built around a nonlinear workflow graph of heterogeneous multi-agent nodes, with a controlled flow of context and computational resources. It decomposes a complex research project into sandboxed multi-agent tasks executed under constraints from the project graph, task-relevant methodologies, and necessary verification steps. We demonstrate QAOS on a quantum chemistry prototyping task, in which it is asked to set up a minimal model for a proton-transfer problem and to implement its solution using sample-based quantum diagonalization (SQD), together with classical reference methods such as FCI (exact diagonalization) and density functional theory (DFT). We compare the QAOS solution to those obtained with baseline agents (Claude Sonnet 5 with the Claude Code harness). In contrast to QAOS, the baseline agents silently ignore explicit instructions, and the runs show large variability.
arXiv·2026-10-04·Muhammad Adnan Shahzad
No generated summary available for this entry.
overview
Original abstract
We ask whether a neural network can learn a structure-preserving map from a compressed latent space to a Hilbert-space representation. Using an 8-dimensional autoencoder bottleneck on MNIST and $n$-qubit product-state targets from PCA-based angle encoding, we report four findings. Although the target angles are generated by a nonlinear sigmoid transformation of the latent projections, the resulting mapping is well approximated by a linear function over the observed latent distribution: linear regression from $z$ to the true target angles achieves $R^{2} = 0.98$, while regression to the MLP's recovered angles achieves $R^{2} = 0.91$. The learned map's primary direction is strongly aligned with the target-induced direction, with cosine similarity $0.989$, while remaining nearly orthogonal to the input's principal direction, with cosine similarity $0.002$. The map is genuinely rank-4: removing any singular direction degrades inner-product preservation by $2.5$--$5.9\times$ despite a singular-value spectrum with two dominant and two small values. The learned subspace does not coincide with the PCA basis used to construct the target, and different random seeds recover the same primary direction but diverge in higher ranks. Finally, kernel ridge regression with an RBF kernel outperforms a tuned MLP (IP error $0.0144$ vs.\ $0.0197$), suggesting that for approximately linear structure-preserving mappings, classical kernel methods may be a simpler and more effective alternative.
arXiv·2026-10-04·Youngjin Seo et al.
No generated summary available for this entry.
overview
Original abstract
Randomized product formulas provide simple and flexible methods for quantum simulation. While qDRIFT-type randomized simulation has been extended to Lindbladian dynamics, higher-order randomized compilers have primarily been developed for Hamiltonian simulation. In this work, we develop first- and second-order randomized sampling algorithms for Lindbladian simulation in both the time-independent and time-dependent settings. Building on first-order qDRIFT-type Lindbladian simulation, we introduce a qSWIFT-type second-order correction for time-independent Lindbladians with a finite local decomposition. For $λt \geq 1$, where $λ$ is the sum of the Hamiltonian coefficients and dissipative rates, the resulting approximation achieves normalized diamond-norm error at most $\varepsilon$ using $r=O(λ^2 t^2/\sqrt{\varepsilon})$ time slices, improving the $\varepsilon^{-1}$ precision dependence of the first-order qDRIFT-type approximation. We then develop first- and second-order continuous-time sampling algorithms for general time-dependent Lindbladians, with the second-order construction likewise achieving an $\varepsilon^{-1/2}$ dependence on the target precision in the number of time slices. We further extend the time-dependent construction to a linear-combination input model over local Hamiltonian and dissipative generators, allowing the randomized sampler to be formulated in terms of local evolutions rather than the full time-dependent Lindbladian. Because the second-order corrected maps need not be CPTP, we use them to estimate observable expectation values rather than to deterministically prepare output states.
arXiv·2026-10-04·Christian Bo Kidmose-Frederiksen, Alfred Leth Nielsen
No generated summary available for this entry.
overview
Original abstract
The quantum $n$-coloring problem, given graph $G$, asks whether there exists a perfect quantum strategy for the $n$-coloring game of $G$. Previously it was known that quantum $n$-coloring is undecidable only for $n=3$. We extend this to all $n\geq 3$ with one elementary reduction. Letting $G'=(G\square K_3)\lor K_{n-3}$, we show that $G$ is quantum $3$-colorable if and only if $G'$ is quantum $n$-colorable.
arXiv·2026-10-04·Zimiao Zhang et al.
No generated summary available for this entry.
overview
Original abstract
Dynamical quantum phase transitions (DQPT) provide a fundamental framework for characterizing nonequilibrium critical phenomena, and have recently been extended to non-Hermitian systems. Half-integer jumps of the dynamical topological order parameter can arise in both Hermitian and non-Hermitian systems, yet their origin in non-Hermitian settings remains unclear. Here, we investigate DQPTs in a two-band non-Hermitian model and show that these fractional jumps originate from the discontinuity in the complex energy spectrum. We demonstrate that this behavior is intrinsically linked to the steady-state phase diagram of the quench Hamiltonian, and also classify the occurrence of DQPT. We further extend our analysis to the multiband Hamiltonian and the two-dimensional model, providing a unified understanding of fractional dynamical topological signatures.
arXiv·2026-10-04·Wei Song, Xiao-Lan Zong, Ming Yang
No generated summary available for this entry.
overview
Original abstract
Suppose Alice and Bob can transform one shared mixed state into another by local operations and classical communication, and can also recover the first state from the second. What can change in such a conversion? We give a complete classification of reversible conversions between two-qutrit states. We consider exact deterministic LOCC transformations of a single copy, allowing finite protocols and the countable protocols specified here. Local flags are known to allow a separable part to be replaced by local preparation while an entangled block is retained. We prove that such a decomposition is necessary for two mutually convertible entangled states that are not locally unitarily equivalent. The two parts are distinguishable by local measurements. The entangled blocks have the same weight and are locally unitarily equivalent after normalization. Each entangled state has a unique smallest retained block. Two entangled states are reversibly convertible if and only if these unnormalized blocks are locally unitarily equivalent. For a state with negative partial transpose, the smallest block can be found using the negative eigenspace of its partial transpose and at most three matrix zero tests.
arXiv·2026-10-04·Shunta Takahashi, Keisuke Fujii
No generated summary available for this entry.
overview
Original abstract
Fidelity estimation is a fundamental tool for assessing quantum resource states across quantum information science. For small infidelity $ε$, tomography and direct fidelity estimation (DFE) have worst-case sample complexity $O(1/ε^2)$ at fixed relative accuracy and confidence. Direct target projections achieve $O(1/ε)$ but generally require non-Clifford operations whose reliability depends on the resource states that are typically the target of benchmarking. Here, we introduce the Bell--coherence fidelity estimation (BCFE) with optimal sample complexity $Θ(1/ε)$ using only Clifford gates and Pauli measurements. We prove that BCFE is applicable to arbitrary pure targets, possibly multi-qubit, with the statistical error of the single-copy coherence part explicitly controlled. To evaluate BCFE in a practical setting, we apply BCFE to analog rotation resource states in the candidate early-FTQC architecture called the Space-Time Efficient Analog Rotations (STAR) architecture. In the simulations using surface codes, BCFE is estimated to require up to approximately $27$ times fewer resource states than DFE for the same standard error in the infidelity estimate, while its estimates remain close to reference values despite circuit-level noise in the additional Bell measurement operations. These results support efficient resource benchmarking within fault-tolerant quantum computing.
arXiv·2026-10-04·Nikolas P. Breuckmann et al.
No generated summary available for this entry.
overview
Original abstract
In Part I, we introduced a general framework for constructing logical gates in quantum CSS codes from cohomology invariants, focusing on cup products and their generalizations from topological to qLDPC codes. In particular, we produced a family of $C^{k-1}Z$ logical gates that we called copy-cup on $k$ copies of the same quantum code implemented by finite-depth circuits. Here, we vastly extend this framework by introducing twists incorporating code automorphisms, higher twisted cohomology operations, and folding operations in relative cohomology. The framework includes operations lifting coefficients from $\mathbb{Z}/2$ to $\mathbb{Z}/2^k$, enabling all diagonal logical gates such as single-qubit rotations $\operatorname{R}(2π/2^k)$. Composing these operations with maps that select cohomology classes yields addressable logical gates. Examples include addressable $T$ gates on three- and four-tori and gates in qLDPC codes beyond topological ones. We introduce cohomology operations, such as the higher twisted Pontryagin powers, that to our knowledge have not previously appeared in the mathematics literature. These operations arise from $E_\infty$-structures on cochains, with explicit constructions using cyclic resolutions and the surjection operad. We expect these results to be of independent interest in homotopy theory. Our formalism applies much more broadly to chain complexes carrying suitable operadic structures, and we expect this operadic perspective to uncover further connections between homotopy theory and fault-tolerant quantum gates.
arXiv·2026-10-04·Shuaifan Cao, Wei Xia, Xiaopeng Li
No generated summary available for this entry.
overview
Original abstract
Numerical studies suggest that quantum reservoir computing performs optimally near the edge of chaos, a behavior commonly attributed to a balance between memory retention and nonlinear information processing. Here we develop an explicit quantum reservoir model and rigorously analyze its chaotic regime and integrable point. In the chaotic regime, we show that Gaussian-unitary-ensemble statistics lead to rapid memory loss: learning performance decays exponentially with the storage time required by a temporal task. This decay limits the ability of chaotic reservoirs to learn long-range temporal dependencies. At the integrable point, described by a free-fermion model, we prove that amplitude encoding and a linear readout of fermionic two-point correlations cannot learn a representative class of nonlinear tasks coupling present and past inputs. Introducing interactions alleviates this obstruction. By identifying distinct limitations on memory retention in the chaotic regime and nonlinear processing at the integrable point, our analysis provides a theoretical basis for the observed edge-of-chaos advantage and guides the design of quantum reservoirs for temporal learning.
arXiv·2026-10-04·Tara Murphy et al.
No generated summary available for this entry.
overview
Original abstract
Electron cotunneling in semiconductor quantum dots is a higher-order tunneling mechanism that connects initial and final charge states through energetically inaccessible virtual intermediate configurations. In quantum-dot arrays, such processes can produce simultaneous charge motion across multiple tunnel junctions and enable transitions that would otherwise be suppressed by Coulomb blockade. Here, building on an earlier proof-of-principle demonstration, we investigate radio-frequency (rf)-driven correlated cotunneling and its application to dispersive quantum-dot readout. Using both theoretical modeling and experimental measurements in two different foundry-fabricated silicon devices, we show that an external rf drive can induce correlated cyclic single-electron transitions, resulting in enhanced charge-polarization of the system. We develop a general theoretical framework for rf electron-cascade readout, which exploits cotunneling events in quantum-dot systems with three or more dots to produce a relative signal enhancement, and extend its experimental demonstration to a gate-sensed device architecture. Our results establish the operating principles of rf electron-cascade readout and provide a route to increased dispersive readout fidelity in semiconductor quantum computing architectures.
arXiv·2026-10-04·A. Ciattoni
No generated summary available for this entry.
overview
Original abstract
The standard Langevin noise formalism (LNF) is a well-established approach for macroscopic quantum electrodynamics in unbounded lossy media, and accordingly, its application to finite objects requires endowing the surrounding vacuum with a fictitious absorption that is taken to asymptotically vanish. Existing justifications for such a singular limiting procedure have been mainly restricted to phenomena governed by vacuum fluctuations and medium-induced interactions (Casimir-Polder forces, thermal radiation, quantum emitter dynamics, etc.), thereby strictly excluding scenarios that involve the scattering of external quantum radiation. Conversely, the modified Langevin noise formalism (MLNF) has recently been established as the complete canonical quantum theory for arbitrary macroscopic systems and electromagnetic processes, entirely bypassing the need for limiting procedures, treating incident quantum radiation fields as independent degrees of freedom, and exactly reducing to the LNF for unbounded media. In this work, we demonstrate that the LNF limiting procedure is universally valid by showing that it recovers any physical prediction of the MLNF across all regimes, including arbitrary quantum scattering processes. Specifically, we introduce a suitable mapping associating any MLNF state and observable with a corresponding entity within the LNF augmented by fictitious vacuum absorption. We then rigorously prove that, as the fictitious absorption tends to zero, every LNF matrix element constructed via this mapping exactly converges to its MLNF original, so that the limiting procedure establishes the asymptotic convergence of the LNF to the MLNF.
arXiv·2026-10-04·Zachary P. Bradshaw
No generated summary available for this entry.
overview
Original abstract
Code switching moves an encoded qubit between two codes whose transversal gates together are universal, but the switching operation itself is usually not transversal and can spread a single fault into an uncorrectable error. We study switching between two permutation-invariant codes on the same qubits, one with transversal Clifford gates and one with transversal gates from the non-Clifford binary icosahedral group. Both are compatible with transversal $X$, $Z$, and $F = HS^\dagger$, and the encoders with this property form a small linear space. We show that its codes of distance at least three are cut out by at most two quadratic equations, and that all of them have the same error geometry in the sense that their single-qubit error states have the same inner products. It follows that a switching unitary commuting with qubit permutations and with the shared transversal gates at every instant, and tolerating one single-qubit fault at an unknown time, exists if and only if the two codes are joined by a continuous path of distance-three codes. Such a switch can be made error transparent, so that a fault at any moment reaches the target code as the same single-qubit error. For real encoders, the distance-three codes are the solutions of a single quadratic equation, and on thirteen qubits, they form an explicit circle through two Clifford codes and an icosahedral code. We construct the switching unitary along this circle as a collective operator, leaving its synthesis into physical control open, and verify that its recovery infidelity per fault is at machine precision, whereas two natural alternatives leave average infidelities of $0.13$ and $0.85$. A survey over odd qubit numbers up to $29$ lists where such switches exist.
arXiv·2026-10-04·Mustafa Bakr
No generated summary available for this entry.
overview
Original abstract
Can quantum mechanics be complete without being fundamental? Under stated source, detector, and statistical conditions, we reconstruct the quantum representation and Born probabilities and prove complete algebraic closure of the admitted quantum predictions without requiring a collapse postulate. We further show that many familiar quantum paradoxes arise from conflating coherent processes with retained records or probabilities with realized outcomes. We also ask whether mathematics as a whole, or the source architecture itself, emerges from a deeper structure.
arXiv·2026-10-04·Yanying Liang, Haoran Zhu
No generated summary available for this entry.
overview
Original abstract
We prove that the second-moment Hamiltonian of the open qubit eSWAP chain has a diffusive spectral gap, resolving a conjecture of Li, Zheng, Liu, Jiang, and Liu. We also characterise the ground space on every connected interaction graph with at least five vertices and prove a uniform lower bound for the unnormalised complete-graph gap. We apply these results to sequential and brickwork circuits and prove that the periodic chain also has a diffusive spectral gap.
arXiv·2026-10-04·Dax Enshan Koh et al.
No generated summary available for this entry.
overview
Original abstract
Variational quantum algorithms (VQAs) generally rely on classical optimization to train parameterized quantum circuits. This training seeks to minimize an objective function, and its efficiency is central to the practical success of these algorithms. However, globally minimizing such training objectives over the circuit parameters is known to be $\mathsf{NP}$-hard, limiting the prospect of general guarantees for efficient training. In this Letter, we prove that even the weaker task of finding a local minimum of such VQA training objectives is strongly $\mathsf{NP}$-hard, including when the objective admits efficient classical evaluation. Moreover, we show that this hardness persists even for the task of finding a parameter vector within $\ell_p$-distance strictly less than $π/2$ of some local minimizer, for every $p\geq 1$. Our central technical result is that approximating a local minimizer of a Hermitian trigonometric polynomial is strongly $\mathsf{NP}$-hard. By explicitly constructing quantum circuits whose training objectives reproduce these hard instances, we obtain a polynomial-time reduction to VQA training. Our results establish a fundamental computational barrier to variational quantum training: even reaching the vicinity of a local minimum remains hard in the worst case.
arXiv·2026-10-04·Chenfeng Cao, Yifan Tang, Jens Eisert
No generated summary available for this entry.
overview
Original abstract
Sampling-based quantum advantage raises a basic resource question: how much non-Gaussianity is needed to reproduce the random-matrix statistics often associated with quantum chaos? Passive fermionic linear optics preserves Gaussian structure, and even Haar-random mode mixing fails to anticoncentrate for Slater inputs. We show that overcoming this obstruction requires an extensive input resource. For any pure half-filled input state, the one-body defect $ν$, defined as the summed occupation variance of the natural orbitals, must scale linearly with system size. For products of bounded-size blocks on $4N$ modes, this condition is also sufficient, with normalized collision moment asymptotic to $2N/ν$, compared with the Porter-Thomas value 2. For four-mode products, the full Porter-Thomas moment hierarchy is recovered precisely when the defect density tends to its maximum. Assuming average-case hardness, approximate classical sampling remains hard near maximal density, with an error tolerance that increases with the density. Two-copy number fluctuations measure $ν$ directly, and the same quantity lower-bounds the combined cost of non-Gaussian resource modes and parity-preserving local gates in deterministic exact preparation. Fermionic randomness therefore carries an extensive magic cost, with a quantitative link between sampling statistics, preparation resources, and an experimentally accessible witness.
arXiv·2026-10-04·Melvin Strobl et al.
No generated summary available for this entry.
overview
Original abstract
Classical simulation supports the development and validation of quantum algorithms through full-state inspection, controlled noise models and backpropagation, albeit for small quantum systems. Existing frameworks offer gate-level execution, differentiable pulse-level dynamics or optimised hardware execution. Just another quantum simulator (JAQSI) combines gate- and pulse-level simulation in one differentiable circuit model built upon JAX. Circuits are represented as pure functions of numerical inputs which support vectorised batches and JIT compilation. Within a single circuit, matrix-defined operations, gates synthesised from Hamiltonian time evolution and noise channels can be composed freely. For a fast simulation, gate and channel fusion reduces passes over the state, while adjoint differentiation computes expectation-value gradients with a constant number of statevectors. At pulse level, JAQSI reduces evolution under single-term Hamiltonians to a scalar pulse-area integral and reuses cached execution plans and compiled solvers. In a benchmark we compare JAQSI with PennyLane, Qiskit, Qibo, Qulacs, QuTiP and dynamiqs. At gate level, we observe performance either on par or an order of magnitude faster across statevector, density, noise and gradient simulation than the compared simulators up to 12 qubits. Beyond 18 qubits, JAQSI is on par with PennyLane Lightning in both statevector and gradient simulation. In the statevector and noisy density-matrix pulse benchmarks, it is at least 5 times faster than the other simulators, even with its closed-form solve disabled. Disabling the latter increases its runtime by at most a factor of 1.5. We provide JAQSI as open-source software on GitHub and PyPI.
arXiv·2026-10-04·Vincenzo Chilla
No generated summary available for this entry.
overview
Original abstract
We present a foundational reinterpretation of quantum dynamics based on the standard von Neumann formalism, positing a structural logical bipartition between a classical observational environment and a quantum observed system. Against universalist frameworks, we show that theoretical consistency requires distinct propositional logics: Boolean logic governs the environment, while non-Boolean logic applies to the observed system. Within this framework, an ideal classical clock is represented as an open system whose energy spectrum is uniformly discretized. The dynamics follow from the Gorini-Kossakowski-Sudarshan-Lindblad (GKSL) master equation under the constraint that the Hamiltonian remains observable. Although the clock's temporal evolution is driven by dissipative coupling to the measurement apparatus, it admits a stable, deterministic solution corresponding to information-preserving cyclic dynamics. This deterministic regime emerges as a logical attractor, stabilized by the Boolean structure inherent to the measurement interaction. Ultimately, $\hbar$ is derived as a fundamental scaling parameter from the classical clock's action-angle commutation relation, revealing that the quantum of action reflects the discrete logical structure underlying classical temporality. Furthermore, this framework establishes an exact mapping with 't Hooft's cellular automaton formalism, offering an alternative ontological interpretation that not require hidden variables and superdeterministic assumptions. The resulting distinction between quantum dynamics (as potential recontextualization) and classical dynamics (as temporal actualization) provides a novel logical approach to the measurement problem.
arXiv·2026-10-04·Zhiming Huang
No generated summary available for this entry.
overview
Original abstract
We study recoverable entanglement in a four-qubit cluster-state register whose two detector qubits couple to a scalar field. A local preparation phase leaves the initial reference--register entanglement and detector marginal unchanged, but controls protection under collective noise. At the optimal phase, a fixed decoder recovers a Bell pair after any channel preserving the singlet and triplet sectors. For uniformly accelerated detectors at finite separation, an exact trace-norm formula shows that the same phase is optimal at every time within the secular weak-coupling dynamics. Small separation produces a slow decay, whose rate and phase-dependent amplitude we derive. Matching the local response to an inertial thermal bath gives an analytic optimum time for the entanglement contrast. A detector measurement and conditional phase correction recover a two-qubit teleportation resource. Spatial smearing and an ordered weak-coupling then small-separation limit specify the microscopic scope of the lifetime prediction.
arXiv·2026-10-04·Tuan-Vu Truong et al.
No generated summary available for this entry.
overview
Original abstract
We study the transverse-field axial next-nearest-neighbor Ising (ANNNI) model on the square lattice and on a bilayer. At the classical multiphase point $κ=J_2/J_0=1/2$, every configuration of straight domain walls that separates domains of at least two sites is a ground state. The walls are rigid, so perturbation theory in the transverse field $g=Γ/J_0$ can be carried out for each configuration separately, and we take it to order $g^8$. Quantum fluctuations select $\langle 3\rangle$ ($\uparrow\uparrow\uparrow\downarrow\downarrow\downarrow$) at order $g^2$, because spins next to a wall gain the most energy from virtual flips. The structures $\langle 23\rangle$, $\langle 223\rangle$ and $\langle 2223\rangle$ then open between $\langle 3\rangle$ and the antiphase $\langle 2\rangle$ at orders $g^4$, $g^6$ and $g^8$, in the order of the Fisher-Selke sequence of the classical three-dimensional model. A second layer suppresses each successive phase more strongly, beyond the stiffening of the local fields. We test the two widest phases with stochastic series expansion quantum Monte Carlo, comparing the free energies of the competing ordered states by thermodynamic integration, since annealing freezes in the modulation that forms at the ordering transition. The simulations reproduce the $\langle 3\rangle$ wedge to about 1%, and in a pre-registered test $\langle 23\rangle$ is stable at six of seven points, with the seventh resolved by post-hoc runs.
arXiv·2026-10-04·Thomas K. Bracht, Moritz Cygorek
No generated summary available for this entry.
overview
Original abstract
Process tensors in matrix product operator representation (PT-MPOs) are a powerful tool to calculate the temporal evolution and multi-time correlations of open quantum systems. While much progress has been made in making the calculation of process tensors for larger system dimensions possible, the numerical cost of the subsequent propagation of the system typically scales as $\mathcal{O}(d^6)$, which renders PT-MPO methods prohibitively expensive for system dimensions above several dozens. Here, we show how PT-MPO methods can be used efficiently when only some of the system states couple to the environment, and how combination with a Taylor expansion method allows for a reduction of the numerical complexity down to $\mathcal{O}(d^3)$. We show that these methods enable efficient simulations of systems with several hundreds of states. This is particularly relevant for solid-state cavity-QED systems with multiple modes, or when calculating frequency-filtered correlation functions by coupling sensor systems to the system of interest.
arXiv·2026-10-04·Anatoly Kulikov et al.
No generated summary available for this entry.
overview
Original abstract
Establishing a complete set of gates across spatially separated quantum nodes is fundamental for distributed quantum computation and communication networks. One of the approaches to do so consists of employing a superconducting device as a universal quantum node that is capable of storing and processing quantum information, and traveling microwave photons as means of communication. In this work, we realize an entangling gate across a primitive two-node superconducting circuit QED network consisting of two dilution cryostats, A and B, connected via a 30-m-long cryogenic quantum link. We perform a bidirectional photon transfer protocol, where a microwave photon emitted by the communication qubit at A acquires a conditional phase based on the state of qubit B. We vary the communication photon frequency, hence tuning the conditional phase acquired during the reflection off the remote node, effectively implementing an arbitrary-phase CZ gate. We use this entangling operation to perform single-shot readout of the qubit in node B from node A. An interesting feature of our scheme is that it does not require precise synchronization of the active node with the remote node; in particular, remote readout can be performed without any active participation by the remote node. These protocols add to the quantum communication toolbox with superconducting circuits and provide a way of realizing basic distributed quantum computing operations.
arXiv·2026-10-04·Richard R. Allen et al.
No generated summary available for this entry.
overview
Original abstract
Quantum algorithms enable Heisenberg-limited scaling across many tasks in sensing and learning, achieving precision $\varepsilon$ using $O(1/\varepsilon)$ total evolution time. However, in Hamiltonian property testing, the best known algorithms have $O(1/\varepsilon^2)$ total evolution time, unless it is possible to $\textit{reverse}$ the flow of time under the Hamiltonian. In this work, we prove that time reversal is necessary to close this gap. We establish evolution time lower bounds for Hamiltonian certification and locality testing, for a continuous family of error metrics ranging from average- to worst-case. We also prove matching upper bounds for Hamiltonian certification in all cases, both with and without time reversal, showing that the advantage from time reversal persists. Our results follow from a new Fourier-analytic approach to quantum lower bounds in continuous time, which is sensitive to time reversal and applicable beyond Hamiltonian property testing. This gives an alternative proof that inverses are required for amplitude amplification and estimation, improving the lower bounds of Tang and Wright and extending to fractional queries. We also show that, for unstructured search, uncertainty in the phase of the oracle destroys the quantum speedup without inverse queries, even when the oracle is fixed and coherent. Our work rigorously establishes time reversal as a resource governing both the precision of quantum measurement and the robustness of quantum algorithms.
arXiv·2026-10-04·Plaban Saha, Binayak S. Choudhury
No generated summary available for this entry.
overview
Original abstract
We propose a protocol for the remote implementation of an arbitrary two-qubit unitary operation using pre-shared entanglement. In our protocol, Bob possesses an unknown two-qubit state, while Alice implements the required operations using calibrated black-box devices. Alice does not need to know the parameters of these operations, and Bob's unknown state never leaves his laboratory. The protocol is based on the Euler decomposition of single-qubit unitary operations and the Cartan decomposition of two-qubit unitary operations. First, we construct protocols for the remote implementation of the single-qubit operation $U = R_z(γ)R_x(β)R_z(α)$ using pre-shared Bell states. We then construct a protocol for the two-qubit operation $R_{zz}(θ)$ using a single pre-shared Bell state and extend it to $R_{xx}(θ)$ and $R_{yy}(θ)$ through local unitary transformations. These elementary protocols are finally combined to implement an arbitrary two-qubit unitary operation. A third party, Charlie, determines the required decomposition and provides Alice with the corresponding black-box devices before the protocol begins. Thus, neither Alice nor Bob requires the classical description of the unitary operation.
arXiv·2026-10-04·Ruizhe Zhang
No generated summary available for this entry.
overview
Original abstract
Estimating the volume of a high-dimensional convex body is a fundamental problem in theoretical computer science. Given a quantum membership oracle for a convex body $K\subset\mathbb{R}^d$, we show that estimating $\mathrm{vol}(K)$ to relative error $\varepsilon$ takes $\widetilde O(d^{5/2}+d^{3/2}/\varepsilon)$ queries. This improves the previous quantum upper bound $\widetilde O(d^3+d^{9/4}/\varepsilon)$ of Chakrabarti et al. (ACM TQC 2023) and Cornelissen--Hamoudi (SODA 2023), and achieves a larger quantum speedup over the currently best classical upper bound $\widetilde O(d^{7/2}+d^3/\varepsilon^2)$ of Jia et al. (JACM 2026). Our quantum algorithm combines two new ingredients: an input-dependent effective spectral-gap analysis of quantum walks based on uniform classical warm-start mixing bounds, and a single quantum estimator for products of normalizer ratios in simulated annealing based on classical bridge sampling. We also prove an $Ω(d)$ quantum query lower bound for constant relative error, improving the previous $Ω(\sqrt d)$ lower bound.
arXiv·2026-10-04·Sparsho Chakraborty et al.
No generated summary available for this entry.
overview
Original abstract
Optimization in machine learning is usually expressed through iterative rules that update model parameters using information from the loss landscape. In this work, we study an alternative viewpoint in which parameter optimization is treated as the evolution of a dissipative dynamical system. The model parameters are regarded as generalized coordinates, the loss acts as a potential energy, and a positive-definite metric defines the local kinetic geometry of parameter space. Starting from a variational formulation, we derive the corresponding Hamiltonian dynamics, the geometric force generated by a position-dependent metric, and a metric-compatible Rayleigh dissipation law. The resulting continuous system satisfies a monotonic energy-dissipation relation, while its discrete form allows the influence of curvature on the optimization trajectory to be studied directly. We illustrate the framework using a controlled CIFAR-10 image-reconstruction problem for which the optimum is known analytically. With the image Hessian used as the metric, the curvature dependence of the quadratic modal dynamics is removed. We then reparameterize the same image as a matrix product state, producing a genuinely position-dependent metric and a nonzero geometric force. Poincaré return maps provide a complementary phase-space view of the resulting contraction dynamics. These examples establish HAMLET as a geometric, energy-based framework for studying optimization as dissipative motion in parameter space. On a five-seed MNIST MLP benchmark, HAMLET attains the highest mean test accuracy (97.95\%) and the lowest mean test negative log-likelihood (0.0696) among the three evaluated optimizers.
arXiv·2026-10-04·Mitali Bafna, Quynh T. Nguyen, Tina Zhang
No generated summary available for this entry.
overview
Original abstract
The quantum PCP conjecture is one of the major open problems in quantum complexity theory. It has resisted attack in part because many primitives used in the proof of the classical PCP theorem, such as locality-preserving gap amplification and alphabet reduction, have no obvious quantum analogues due to quantum no-cloning. Locality-preserving gap amplification is a procedure that takes as input a local Hamiltonian problem instance and produces a new instance with a larger promise gap, without increasing the locality of the Hamiltonian, and instead moderately increasing its local qudit dimension. Obtaining this kind of control over the locality during gap amplification is critical to the success of many known strategies for proving the classical PCP theorem. In this work, we put forth the first known viable template for quantum locality-preserving gap amplification, and we prove that our procedure amplifies the combinatorial gap of local Hamiltonians. Our work introduces a new framework for reasoning about quantum gap amplification in terms of fault-tolerant computation, and illuminates a route toward importing one of the central ingredients in classical PCPs into the quantum setting. In particular, we build upon ideas from the recent classical PCP of Bafna--Minzer--Vyas based on high-dimensional expanders, and the circuit-to-Hamiltonian construction of Anshu--Breuckmann--Nguyen, in addition to several recent advances in quantum coding theory.
arXiv·2026-10-04·Yuan-Hong Tao et al.
No generated summary available for this entry.
overview
Original abstract
Basis-independent coherence of a quantum multistate is fixed by whether its constituent states commute, and for qubits it is detected by pairwise state overlaps alone. What governs its deterministic transformation has been open. We give the exact resource-conversion theory of quantum multistates under common commutativity-preserving operations (CPOs). For qubits, pairwise Bargmann invariants determine the singular values of the unique candidate channel, while a single third-order Bargmann phase determines its orientation. Complete positivity then yields a necessary and sufficient criterion for exact conversion. The criterion identifies a chirality-sensitive shell $\mathcal C_{\rm chir}$, within which targets with identical pairwise geometry can differ in convertibility solely by the sign of their cubic invariant. This yields an order separation, $k_{\rm detect}=2<3=k_{\rm convert}$, for qubit multistates of every size $n\geqslant3$. The chirality-sensitive shell occupies exactly one third of the singular-value simplex, while mirror reflection obstructs two thirds of the admissible orientation-preserving transformations by volume. For $d\geqslant3$, by contrast, the structure is rigid: every resourceful conversion is realized by either an isotropic depolarizing or a transpose-depolarizing channel. Convertibility is then decided by centered Bargmann invariants of degree at most $d^2$.
arXiv·2026-10-04·Xin Wei LEE, Siong Thye GOH, Hoong Chuin LAU
No generated summary available for this entry.
overview
Original abstract
Inequality constraints in combinatorial optimization are conventionally handled by introducing slack variables and quadratic penalties, which increase the qubit count and distort the optimization landscape. Slack-free formulations instead apply a nonlinear custom penalty function directly to the constraint, which are difficult to be implemented in quantum approximate optimization algorithm (QAOA). We show that the Walsh--Hadamard transform (WHT) removes this obstruction for any penalty function: a penalty applied to a linear constraint is exactly a weighted sum of Pauli-$Z$ strings. We propose this framework as the Walsh custom penalty QAOA (WCP-QAOA). Truncating the expansion at Walsh degree $k$ costs $\mathcal{O}(n^k)$ Pauli terms and leaves the qubit count untouched. The truncation is the optimal degree-$k$ approximation of the penalty in $L^2$, and we give a condition on the discarded Walsh coefficients under which the truncated Hamiltonian still ranks every feasible solution below every infeasible one. Since evaluating a Walsh coefficient from its definition requires all $2^n$ penalty values, we give an algorithm that returns any coefficient in sub-exponential time, so that the degree-$k$ Hamiltonian is obtained in time polynomial in $n$ for fixed $k$. We show that for the exponential penalty, there exists a closed product form of WHT, and hence a closed form expression to calculate the Walsh coefficients. We identify structural shortcuts that shorten the exact spectrum. We also tested WCP-QAOA in solving a 6-qubit knapsack problem.
arXiv·2026-10-04·Bhanwar Gupta, Sanjeev Rana
No generated summary available for this entry.
overview
Original abstract
Network operators migrating distributed systems to post-quantum and quantum-safe cryptography face a resource-management problem: quantum key distribution (QKD) gives the strongest guarantee available but is hardware-scarce and costly, so only a fraction of a deployment's links can receive it. Default practice -- ranking links by traffic or centrality and upgrading the top scorers -- optimizes each link in isolation, while a distributed job's real security is set by whichever active link ends up weakest. We present WLPA (Weakest-Link Posture Assignment), an implementation-ready decision framework and algorithm for allocating scarce quantum-safe postures under hardware, latency, and compliance constraints. WLPA computes the optimal weakest-link posture in closed form and returns an assignment in O(|E| log |E|) time -- 125 ms for a 20,000-link network on a laptop -- with a breach-aware refinement matching an exact integer program under common conditions. Our central contribution is a dichotomy telling operators exactly when existing per-link heuristics already match this optimum and when they systematically fail: under constant upgrade cost and uniform traffic-driven risk the two coincide exactly; once costs vary or an adversary concentrates on weak targets, heuristics leave the weakest link unprotected, unboundedly. We validate WLPA across 19 experiments: four microservice topologies, a real enterprise network (SNAP email-Eu-core), a post-quantum latency benchmark, a Qiskit BB84 simulation and a real-hardware BB84 run on IBM's ibm_marrakesh processor, checks against real production traffic traces, a CVE-calibrated correlated-compromise study, Bayesian uncertainty quantification, and seven baseline methods. A concrete-security reduction grounds the framework as theoretical foundation, not primary contribution.
arXiv·2026-10-04·Xuanchao Zhang et al.
No generated summary available for this entry.
overview
Original abstract
The fate of quantum coherence following photoexcitation is a central problem in nonequilibrium condensed-matter physics, especially in low-dimensional solids where electronic, structural and many-body energy scales are strongly coupled. Here, we investigate this interplay in ferroelectric $α$-In$_{2}$Se$_{3}$ using broadband transient-grating spectroscopy with $\sim$5 fs laser pulses. Photoexcitation launches pronounced oscillations dominated by a $\sim$104 cm$^{-1}$ mode that persists for several picoseconds. Measurements from 10 to 300 K show that its frequency remains nearly unchanged while its coherence is progressively suppressed, distinguishing the lattice coordinate from thermally activated dephasing. Varying excitation energy reveals a distinct crossover in which increasing photoexcitation progressively modifies and damps the coherent response. First-principles calculations assign the dominant oscillation to a 101.47 cm$^{-1}$ $Γ$-point optical phonon involving collective In-Se displacement, while quantum-dynamical simulations reproduce the main transient-grating oscillations. These results establish $α$-In$_{2}$Se$_{3}$ as a model system for independently probing lattice coherence, thermal fluctuations and carrier-density-dependent interactions, revealing how a polar van der Waals semiconductor evolves from coherent lattice motion toward an incoherent many-body state after ultrafast excitation.
arXiv·2026-10-04·Jinkang Guo et al.
No generated summary available for this entry.
overview
Original abstract
We introduce a quantum coding framework for discrete small-shift noise, in which errors on qudits are modeled as low-weight $X$- and $Z$-type Pauli shifts, analogous to small phase-space displacements in continuous-variable systems. This structure is approximately respected by nuclear-spin noise and captured by the Lee metric, motivating a quantum extension of classical Lee-metric coding theory. We develop such a formalism for stabilizer codes over $\mathbb{Z}_q$ for arbitrary $q$, using joint and separate Lee metrics for the $X$- and $Z$-components of errors. For qubits, the joint metric counts $Y$ errors twice and can yield codes that detect and correct $X$ and $Z$ errors with fewer physical qubits than codes designed for the conventional Hamming metric. We discuss Lee-weight spreading under Clifford gates and qubitize codes over $\mathbb{Z}_4$ via the Gray map, finding codes with two-fold transversal non-qubit-Clifford gates. For quantum CSS Lee-LDPC codes on $n$ qudits, we prove that the Lee distance cannot exceed $O(n)$, uniformly in $q$, demonstrating an unexpected obstruction to using the large internal Hilbert space of a large-$q$ qudit to make high-Lee-distance codes. Under local Metropolis dynamics, certain classical $q$-ary ``helical repetition codes'' have exponentially long memory times at fixed temperature for sufficiently large $q$ (that grows with system length), which can be understood as spontaneous symmetry breaking at finite temperature, even in local one-dimensional models. Hypergraph products of these helical repetition codes provide local two-dimensional quantum codes that inherit self-correction for $Z$ errors, but self-correction for $X$ errors remains an open question.
arXiv·2026-10-04·Mark M. Wilde
No generated summary available for this entry.
overview
Original abstract
We develop entanglement-of-formation potentials for feedback-assisted classical communication and one-way randomness distillation. For a finite-dimensional quantum channel without initial shared entanglement, an exact amortization theorem bounds the increase of message information plus entanglement remaining across the communicating laboratories. This proves a classical-feedback capacity bound using a mixed-convex-roof expression previously studied by Winter and Yang in the context of potential capacities. We determine the capacity of flagged mixtures of noiseless and entanglement-breaking channels, improve a published depolarizing-channel converse, and evaluate the new bound exactly for the amplitude damping channel. A state analogue gives a finite-blocklength upper bound on the net shared randomness obtainable with one-way classical communication. Amplitude-damping Choi states provide exact benchmarks, while a full-rank generalized amplitude-damping Choi state demonstrates a useful improvement where we do not evaluate the operational rate exactly. We also distinguish one-way from two-way randomness distillation: a two-round weak-measurement protocol strictly exceeds the exact one-way rate of every nontrivial qubit isotropic state. The protocol preserves quantum side information during its first decoding and extracts additional randomness in the reverse direction. This shows why the one-way state potential is not a general two-way converse. Together, these results establish a common entanglement-based approach to sharper communication and randomness bounds, while revealing how retained quantum correlations enable two-way distillation to surpass one-way limits.
arXiv·2026-10-04·Tokunoshin Uchida et al.
No generated summary available for this entry.
overview
Original abstract
We report a demonstration of a self-shunted superconducting flux qubit (SSFQ) as an ultracompact, strongly anharmonic, and long-lifetime qubit by using the full epitaxially grown NbN/AlN/NbN Josephson junctions. The NbN-junction-based SSFQ achieved a high anharmonicity of 797 MHz as well as drastically reduced footprint of the qubit compared to capacitively shunted (C-shunt) flux qubits with a large shunt capacitor. The lifetime of the SSFQ reached 13 - 25 $μ$s, which is comparable to or relatively higher than that of NbN-based C-shunt flux qubits and Al-based flux qubits with more than 10 times smaller junctions. This indicates that the large epitaxial NbN-based junction can be adopted for SSFQ as well as merged-element transmon with the relatively large junctions. The results presented in this work will offer a new choice of the scalable qubits as well as the material platform toward the realization of large-scale superconducting quantum computers.
arXiv·2026-10-04·Koki Honda et al.
No generated summary available for this entry.
overview
Original abstract
Epitaxial NbN/AlN/NbN Josephson junctions are promising alternatives to conventional Al/AlO$_x$/Al junctions for superconducting qubits due to their crystalline tunnel barriers and the high transition temperature of NbN. However, their integration into quantum circuits typically requires complex fabrication processes involving amorphous interlayer dielectrics, which can degrade qubit coherence times. To address these issues, we developed sidewall spacer passivated epitaxial NbN/AlN/NbN junctions using a fabrication process that reduces both the volume of amorphous dielectric material and fabrication complexity. The fabricated junctions exhibited a large gap voltage of approximately 5.6 mV and low subgap leakage currents. By varying the thickness of the AlN tunnel barrier, high-quality junctions were fabricated over a wide range of critical current densities ${\it J}_c$, from 0.3 to 10$^4$ A/cm$^2$. In addition, the comparison of the current-voltage characteristics before and after buffered hydrofluoric acid treatment indicated that the wet etching process did not degrade the electrical characteristics of the junctions. These results establish a scalable fabrication process for epitaxial Josephson junctions and provide a promising platform for high-coherence nitride-based superconducting qubits.
Quantum Computing Report·2026-10-03·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Bernard Crotty joined Quantum eMotion, Florence Lao became CLO at Pasqal, Dr. Elizabeth Iwasawa was appointed Director of Quantum at RBC, and Jeffrey Kilborn is the new CFO at 01 Quantum Inc., all in strategic leadership roles. The post Who’s News: Strategic Appointments at Quantum eMotion, Pasqal, Royal Bank of Canada, and 01 Quantum Inc. appeared first on Quantum Computing Report .
Nature: Quantum Information·2026-10-03
No generated summary available for this entry.
overview
The Quantum Insider·2026-10-03·Yuval Boger
No generated summary available for this entry.
overview
Original abstract
Yuval Boger interviews Helmut Katzgraber, general partner at 55North and former quantum leader at AWS. They discuss Helmut’s view that the most promising near- to mid-term quantum applications are in quantum simulation for materials, chemicals, and pharma, rather than optimization. They also explore European competitiveness, venture opportunities across the quantum stack, cloud and on-prem deployment models, and the workforce and product skills needed to turn quantum ideas into successful companies. Transcript Yuval: Hello, Helmut, and thank you for joining me today. Helmut: Hi, Yuval. Nice talking to you again. Yuval: So who are you and what do you do? Helmut: My name is Helmut Katzgraber. I have had several different roles in the past, and now I’m general partner at 55North, which is a VC fund focused on quantum technologies out of Denmark and to the world. Yuval: And I realized that I interviewed you two years ago when you were at AWS, and I guess I missed an interview when you were a professor at the University of Texas, right? Helmut: Yeah, Texas A&M, but let’s not talk about that. That’s long in the past. Long in the past. Yuval: So now that you’re no longer at AWS, what can you tell me about the quantum world? What have you learned about quantum in the past two years while you were making that transition? Helmut: Surprisingly a lot. As you remember, or might remember, I led a team of scientists that now are being taken care of by Martin Schuetz, who’s a fantastic new leader, focused on a) finding applications of quantum technologies. You know, where can a quantum device have impact in the real world, not in toy problems, but be also, you know, kind of raise the bar for quantum by solving the problems classical in a perfect world, having solutions running in production environment of AWS as customers. And not just during the past two years, but during the last five to seven years
Quantum Computing Report·2026-10-03·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
IBM is expanding its research collaborations with IISc and IIT Bombay in India. The partnerships focus on advancing quantum-centric supercomputing and sovereign AI, including hybrid quantum-classical computing architectures, AI for scientific and energy applications, and optimizing large language models for Indic languages. These collaborations aim to align advanced quantum and AI software frameworks with India's national technology initiatives. The post IBM Expands Research Collaborations with IISc and IIT Bombay to Advance Quantum-Centric Supercomputing and Sovereign AI appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-03·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Silicon Quantum Computing (SQC) and Schneider Electric are advancing to Stage 2 of the Australian Government’s Critical Technologies Challenge Program, securing A$3.6 million. They are deploying hybrid quantum-classical machine learning models using SQC’s Watermelon™ system to improve energy grid forecasting. These models have shown an average 20% improvement in accuracy, with peak gains of up to 41%, and will be scaled across hundreds of residential locations in Australia. The post Silicon Quantum Computing and Schneider Electric Advance Energy Grid Forecasting via Watermelon Quantum-Enhanced AI System appeared first on Quantum Computing Report .
Phys.org Quantum Physics·2026-10-03
No generated summary available for this entry.
overview
Original abstract
When I explain topology to students, I start with a knot in a rope. You can stretch it, twist it or shake it, but the knot stays until you cut the rope. Physicists have found that some materials and devices carry similar "knots" in how waves move through them. These are topological properties, labeled by whole numbers that don't change under small imperfections. That robustness is why topology has become one of the central ideas in modern physics. It promises electronics, photonics and quantum devices that tolerate defects and noise.
The Quantum Insider·2026-10-03·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief IBM is expanding research collaborations with IIT Bombay and IISc covering agentic AI, sovereign AI, multimodal systems, AI infrastructure and quantum computing. The IIT Bombay collaboration will focus on Indic language models, multimodal AI, software programming education, knowledge retrieval and AI infrastructure. The IISc collaboration will cover agentic systems, energy-focused AI models and quantum-HPC algorithms for scientific and industry applications. PRESS RELEASE — IBM today announced expansions of two long-standing research collaborations in India: one with the Indian Institute of Technology (IIT) Bombay, and another with the Indian Institute of Science (IISc) to accelerate innovation in agentic AI, sovereign AI, quantum computing and next-generation computing systems. Building on a collaboration that began with IIT Bombay in 2018, IBM researchers will continue to work alongside faculty and students to explore sovereign and Indic language model adaption, multimodal AI, as well as AI infrastructure and knowledge retrieval. With IISc, IBM researchers will continue a collaboration that began in 2021, which covers agentic systems, AI for applications, and quantum computing algorithm development. Strategic Focus Areas of the IBM -IIT Bombay Collaboration Sovereign and Indic language model adaptation: Advancing sovereign AI and Indic language models to improve multilingual AI capabilities for Indian languages through more efficient model adaptation and optimization techniques. Multimodal AI systems: The collaboration will also focus on developing multimodal AI systems that strengthen software programming education, human-AI collaboration and intelligent operations across hybrid cloud environments. AI Infrastructure and Knowledge Retrieval : Enhancing intelligent knowledge retrieval by developing AI systems that deliver faster, more accurate and scalable access to enterprise knowledge. The effort will be to optimize AI runtimes and distributed
npj Quantum Information
·2026-10-03
·Lewis Bulled, Yingkai Ouyang
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract Quantum synchronisation errors are a class of errors that change the number of qubits in a quantum system. The classical error correction of synchronisation errors has been well-studied, including an insertion-deletion equivalence more than a half-century ago, but little progress has been made towards the quantum counterpart since the birth of quantum error correction. We address the longstanding problem of a quantum insertion-deletion equivalence on permutation-invariant codes, detailing the conditions under which such codes are t -insertion error-correctable. We extend these conditions to quantum insertion-deletion errors, formulating a more restrictive set of conditions under which permutation-invariant codes are ( t , s )-insdel error-correctable. For completeness, we extend our approach to qudit errors on qudit permutation-invariant codes. Our work resolves many of the outstanding questions regarding the quantum error correction of synchronisation errors.
arXiv·2026-10-03·Tao Zhang, Xiaotian Nie, Linghui Chen
No generated summary available for this entry.
overview
Original abstract
Quantum-enhanced sensing typically relies on preparing specific entangled states. However, engineering these states in scalable many-body systems remains challenging due to the difficulty of designing robust preparation protocols and accounting for realistic noise. We show that evolving a simple product state under native time-independent Hamiltonian dynamics in Rydberg atom arrays generates complex many-body correlations that can potentially enable quantum-enhanced parameter estimation reaching the Heisenberg limit (HL). The key challenge is then shifted to extracting the metrological information encoded in spatial correlations of measurement patterns. We introduce a neural correlation learning framework that combines Bayesian inference with neural networks trained on calibration data. Operating in a two-stage calibration-and-sensing protocol, we numerically demonstrate that this framework effectively extracts many-body correlations to saturate the Cramér--Rao bound dictated by the classical Fisher information. Consequently, it achieves quantum-enhanced sensitivity surpassing the standard quantum limit (SQL). Furthermore, the learned estimator is robust to realistic noise, and remains accurate in the absence of rare measurement patterns. Our results establish a hardware-efficient and scalable paradigm for quantum sensing in interacting many-body systems without requiring engineered entangled states.
arXiv·2026-10-03·Jonas Vinther, Leonardo A. Cunha, Johannes Flick
No generated summary available for this entry.
overview
Original abstract
Recent experiments suggest that strong light-matter coupling between molecules and cavity modes can significantly modify chemical reaction rates and yields. Despite multiple proposed mechanisms, a clear microscopic understanding of how vibrational strong coupling alters reaction kinetics remains incomplete. Here, we employ a general quantum-dynamical framework for analyzing competing reaction pathways in polaritonic chemistry by considering reaction coordinates with multiple relevant transition frequencies and general harmonic environments. We extend on a tensor-network formulation of the hierarchical equations of motion (HEOM) method to compute probability currents between vibrational states, leveraging a concise formulation for effective spectral densities and a controlled compression of Markovian bath modes into system-level jump operators. This allows us to decompose the resulting state-to-state probability currents, revealing how cavity-induced changes in individual transitions propagate through multistep reaction networks. We find that these local modifications can alter kinetic bottlenecks and selectively redistribute reaction flux between competing pathways, changing branching ratios under irreversible conditions without substantially affecting the equilibrium yield in the reversible regime. Finally, for coupled reaction-coordinate, spectator-mode, and cavity environments, we find structured, asymmetric rate profiles arising from interference between hybridized decay channels. Together, these results provide a mechanistic framework for understanding pathway-specific chemical reactivity under vibrational strong coupling.
arXiv·2026-10-03·Vernon M. Hughes, David A. Huse
No generated summary available for this entry.
overview
Original abstract
We investigate a class of dynamic percolation models on a lattice, in which connections are added and removed by a set of local stochastic rules. In particular, the removal of any connection that can result in one connected cluster becoming two (or more) separate clusters is strictly forbidden. These models include and are inspired by a model for local quantum error correction for a toric code studied by Chirame, et al., PRX Quantum 6, 030363 (2025), who identified a phase transition with first-order characteristics, such as bistability and a discontinuous order parameter. We show numerically that this transition is a hybrid percolation transition (HPT), having characteristics of a continuous percolation transition such as diverging critical clusters while at the same transition having discontinuities like a first-order transition. We then modify this model to be fully isotropic, showing that the HPT remains. In both of these models, the steady state on one side of the HPT is an absorbing state; by turning on additional isotropic local stochastic moves, we remove the absorbing state and strongly suppress or remove the first-order transition, leaving an apparently continuous percolation transition. Curiously, the numerically-observed percolation critical exponents do not change significantly between the models with hybrid transitions and the model with an apparently continuous transition. These exponents are significantly different from known percolation transitions, indicating that this may be a new universality class.
arXiv·2026-10-03·D. M. Theshan N. Weerasinghe
No generated summary available for this entry.
overview
Original abstract
No-signalling constraints on isolated outcome probabilities do not determine whether an apparatus preserves the joint law of its accessible records under repeated readout, network composition, or reuse. We study these extensions through a conditional-record criterion and four explicit models. For a wrapped-Cauchy retrocausal source, protection under two conditionally independent continuous readouts forces an angle-independent response; three readouts suffice without continuity. A finite angular-bandwidth assumption gives a quantitative leakage bound, whereas continuity alone gives no uniform stability. At a specified two-source Bell junction, the required correction matrix has full nonnegative rank on every even uniform angular grid. A Gaussian controller can cancel branch-mass dependence while leaving a distinguishable joint record, for which we derive exact noise and law-change tradeoffs. Finally, a fixed singlet with shared classical noise reproduces the variable-width isolated outcome family, but retained and refreshed controllers generate different temporal statistics. We prove a finite-resource obstruction and construct positive finite-controller approximations. Numerical studies comprising 8.3 million independent simulated histories support the model-specific predictions. Together, the results identify conditions that must accompany marginal no-signalling when extending an apparatus to richer records and interventions.
arXiv·2026-10-03·Ankush Pandit et al.
No generated summary available for this entry.
overview
Original abstract
Quantum communication can outperform classical communication in a variety of information-processing tasks, but such advantages are typically established for a fixed communication network. Here we introduce topology-independent quantum advantage, in which a quantum protocol outperforms every classical protocol subject to the same communication constraint, irrespective of how the classical communication resource is distributed among the parties or which communication topology is employed, even when the parties may share unlimited classical randomness. We first demonstrate this phenomenon through a simple three-party equality task: two senders receive ternary classical inputs, while an input-free receiver determines whether the inputs are equal. We then formulate a general framework for topology-independent communication and completely characterize the corresponding classical correlation polytope in the minimal three-party scenario. Its facet inequalities reveal several instances of topology-independent quantum advantage. Remarkably, one of these inequalities enables the semi-device-independent certification of a nonunitary quantum channel, while another certifies a sequential quantum network topology without any prior assumption about the network configuration. Finally, we extend the framework to four-party networks, characterize the relevant classical communication structures, and identify a communication task exhibiting quantum advantages against all admissible classical topologies. Our results establish topology independence as a genuine and robust form of quantum advantage in communication networks.
arXiv·2026-10-03·Ayanendu Dutta, Nabanita Sarkar
No generated summary available for this entry.
overview
Original abstract
The SU$(N)$ matrix-model potential $V=-\tfrac{g^2}{4}\sum_{I,J}Tr[X_I,X_J]^2$, the interaction of the BFSS/BMN family, whose thermal large-$N$ states are dual to black holes, is diagonal in the coordinate basis and is compiled in the literature as a phase polynomial with $O(d^2N^4Q^4)$ rotations per Trotter step. That cost is close to optimal for its gate class: we show that for a generic Trotter step the Walsh support $m_{\min}$ lower-bounds both the rotation count and the two-qubit count of every circuit over $\{CNOT,CZ,CPhase,R_{ZZ},SWAP,X,R_z\}$, ancillas included, and we build a parity network attaining $1.01$--$1.10\,m_{\min}$. Improvement therefore requires a gate outside that class, and the exact factorisation of $V$ into a sum of squared commutator entries supplies one in each era. For NISQ, Hadamard: each squared entry is added into a Fourier register and squared there, $Θ(d^2N^3Q^3)$ two-qubit gates. For fault tolerance, $T$: reversible arithmetic with one phase-gradient injection per squared entry, $Θ(d^2N^3Q^2)$ T gates and no arbitrary-angle rotation. Both are built and verified. With a native $R_{ZZ}$ the NISQ circuit uses fewer two-qubit gates than every parity network from $Q=6$ at SU(2) and $Q=2$ at SU(5); the oracle beats a precision-matched Hamming-weight-phasing incumbent at every point built except the smallest, by up to $11.9\times$ in T count and, at equal width, $25.5\times$ in surface-code spacetime. An ablation with the same arithmetic but no factorisation costs up to $21\times$ more and loses to that incumbent at $15$ of $17$ points, so the factorisation, not the arithmetic, produces the win. Both constructions survive the supersymmetric deformation to mini-BMN with fermions, and complete Trotter evolutions on a statevector simulator reproduce the exact product formula to $2\times10^{-12}$.
arXiv·2026-10-03·M. S. Guimaraes, I. Roditi, S. P. Sorella
No generated summary available for this entry.
overview
Original abstract
In this work we study the Bell-CHSH inequality in the vacuum of the free massive Majorana field in $1+1$ dimensions, taking as the dichotomic observables of the two parties even bilinears of smeared fields localized in the right and in the left Rindler wedges. The test functions are generated from seeds in the modular-frequency variable through the Tomita-Takesaki operator of the right wedge and, on the side of the left wedge, through its adjoint multiplied by $i$, which accounts for twisted duality. For seeds supported at positive modular frequency the one-particle overlaps between the two parties do not depend on the modular weights, and we obtain the Bell parameter in closed form. When the seeds are phase rotations of a single compact bump, the bilinears generate a copy of the Pauli algebra in each wedge, and we compute exactly the correlation matrix of the vacuum restricted to the two copies. The optimal settings violate the classical bound up to spectral widths more than twice as large as those reached with planar settings. We also show that the Tsirelson bound is never attained in the wedge vacuum for any choice of dichotomic observables, and that approaching it forces the modular spectral weight of the Bell vectors to concentrate at the spectral point $λ=1$ of the modular operator. This establishes in a precise way how the even sector of the free Majorana field realizes the Summers-Werner mechanism.
arXiv·2026-10-03·Sayan Chakraborty, Victor V. Albert
No generated summary available for this entry.
overview
Original abstract
We develop a theory of stabilizer codes whose stabilizer groups consist of commuting qudit Paulis, oscillator displacements, and/or planar-rotor displacements. We consider codes whose stabilizer groups form generalized lattices in quantum phase space, a condition that guarantees a finite logical dimension. We construct oscillator-rotor, rotor-qudit, and oscillator-rotor-qubit codes that cannot be decomposed into separate subsystems by generalized Clifford transformations. We also introduce an oscillator-qubit code arising from a partially lifted Golay code, where Construction A is applied to half of the Golay code coordinates. We derive analytical forms of logical operators from the symplectic dual lattice, determine Clifford-Gaussian gates from lattice symmetries, show that the code dimension equals the covolume of the stabilizer lattice, and organize the syndrome subspaces into a vector bundle. Our technique builds on earlier non-commutative geometric results by Rieffel, but it can often be interpreted simply as concatenating a given stabilizer code with a Gottesman-Kitaev-Preskill (GKP) code, applying conventional lattice-theoretic results, and unconcatenating. We formulate distances, optimal decoding, and quantum weight enumerators, recovering the Pauli, qudit, and GKP versions together with known MacWilliams identities. We construct finite-energy codewords whose encoding is an isometry up to an error exponentially small in the inverse damping parameter.
arXiv·2026-10-03·Kuntal Bhattacharyya, Bilal Tanatar, Saurabh Basu
No generated summary available for this entry.
overview
Original abstract
We theoretically demonstrate control over the interplay between obstructed atomic insulating and first-order topological phases via electron-phonon coupling (EPC) in a $d$-wave altermagnet (AM) that hosts nonrelativistic spin-split bands with zero net magnetization. By embedding a $d_{x^{2}-y^{2}}$-wave AM in a quantum spin Hall (QSH) insulator, we show that an altermagnetic order beyond a critical strength reconstructs the parent QSH state of a Bernevig-Hughes-Zhang (BHZ)-type topological insulator (TI) into an obstructed atomic insulator (OAI), characterized by nontrivial bulk polarization with quantized fractional corner charges, accompanied by characteristic in-gap boundary states, while the spin Chern number vanishes. Upon incorporating sufficiently strong EPC, the polaronic dressing reorganizes the Wannier centers and the associated effective edge topology, thereby weakening the altermagnetism-induced OAI phase and restoring the helical QSH edge modes. Further, EPC eventually drives the system into a trivial insulator. By uncovering a controllable switching mechanism between topologically distinct insulating phases in AMs, our study establishes a direct route toward phonon-tuned spintronic functionalities in unconventional magnetic platforms.
arXiv·2026-10-03·Ritam Bhaumik, Yu-Hsuan Huang
No generated summary available for this entry.
overview
Original abstract
Cryptographic security proofs often involve an adversary interacting with a larger, keyed oracle that consists of (potentially exponentially) many independent instances of a smaller, base oracle. However, showing quantum indistinguishability between two such keyed oracles can be tricky, since a single query made by an adversary may involve a superposition that covers all instances of the base oracles simultaneously. In this paper, we establish a generic indistinguishability lifting theorem of the following form: if the two base oracles are indistinguishable under quantum queries, then their corresponding keyed oracles are too, up to an O(q^2) multiplicative loss in distinguishing advantage, where q is the number of queries made by the adversary. Our lifting theorem applies to both statistical and computational settings, and to oracles that are stateful as well. It is also optimal in that it matches the obvious Grover search attack for a certain (contrived) choice of oracles. As an immediate application, we extend Carolan's compressed permutation oracle to an efficiently implementable compressed ideal cipher, and use it to prove preimage resistance of the Davies-Meyer compression function in the quantum ideal cipher model. Thanks to our lifting theorem, the soundness of our compressed ideal cipher reduces to that of Carolan's oracle, and any further improvement on the latter would automatically carry over to the former. As our second application, we give a modular construction that doubles the message length of any quantum-secure strong pseudorandom permutation. Along the way, we show that an existing two-round tweakable Feistel construction is indistinguishable from a random permutation under quantum bidirectional queries. This is done via a dedicated polynomial-method argument, which may be of independent interest.
arXiv·2026-10-03·Remi A. Chou
No generated summary available for this entry.
overview
Original abstract
We study quantum-state oblivious transfer over the quantum erasure channel under information-theoretic security guarantees. Specifically, Alice holds two quantum systems, Bob wishes to recover one of them, and the parties have access to independent channel uses and authenticated public classical communication, with no initial shared entanglement. We consider both honest-but-curious and malicious behavior. We establish finite-blocklength converse and achievability bounds, which match in the honest-but-curious setting. The malicious setting construction combines interactive hashing with tests of whether Bob received selected channel outputs, and distributes each input across several qubits so that erasures conceal an entire input from a dishonest receiver, even when the inputs are entangled with an external reference. We also derive fixed-error asymptotic expansions and show that both malicious and honest-but-curious settings have the same capacity.
arXiv·2026-10-03·Zijian Gong et al.
No generated summary available for this entry.
overview
Original abstract
Quantum computers are claimed to produce samples ordinary classical computers cannot reproduce. The sharpest such claim known pits constant-depth quantum circuits, given one entangled state per run, against shallow classical circuits of few-input gates and limited randomness. No efficient test was known that certifies such a claim from classical samples alone. Here we show that what such a test must read is decided by the classical class's pattern of single-bit and pair correlations, not by a distance. The test rests on one inequality: any machine producing the samples sits no further from the target than the fraction it mislabels plus the deviation of its string half, the bits beyond the label, from uniform. A collapse theorem, machine-checked in the Lean~4 proof assistant, confines that second term, one setting of the sampler's random input bits at a time. Four natural checks provably fail; a fifth, reading those same correlations, catches a far-from-target construction they cannot reach, and is exact on the class of few-input gates. The label test is proven and sample-optimal in its own tolerance up to a logarithmic factor; the fifth check is sound, not only effective, on the bounded pinned-residue class, pairwise-uniform samplers whose residue, the string's weight modulo the prime, is pinned by few seeds and whose seed sharing is bounded. What binds an experiment is the $43$-qubit entangled resource state at fidelity near $0.99$, not the readout. What remains are two named open problems; a positive answer to the first would extend the guarantee to the full class.
arXiv·2026-10-03·Kai-Siang Chen et al.
No generated summary available for this entry.
overview
Original abstract
Bell nonlocal correlations cannot be reproduced by local hidden-variable models without communication, making classical communication cost a natural quantitative measure of nonlocality. Although finite communication always suffices to simulate any correlation in a fixed finite Bell scenario, determining the minimum amount needed to (exactly) simulate any given nonlocal correlation remains challenging, especially in the average-cost setting. Here, we derive lower bounds on input-average communication cost from nonlocal games, allowing variable-length, fully interactive two-way protocols. When applied to parallel games, these bounds yield explicit finite quantum correlations for which the exact simulation cost exceeds any prescribed finite input-average communication budget. For $n$ parallel Magic-Square-winning correlations, we prove a lower bound of $n\log_2(3/2)$ bits and give a one-way communication protocol that attains this rate asymptotically. For the quantum correlation maximally winning the $n$-copy of the Clauser--Horne--Shimony--Holt nonlocal game, we obtain an input-average lower bound of approximately $0.04627n$ bits for exact simulation. Finally, we formulate a hierarchy of lower bounds and complementary upper bounds using deterministic correlations up to chosen communication costs. Both recover the exact input-average cost at their final levels, and if the bounds agree at lower levels, their common value yields the exact input-average cost without needing to consider all communication strategies.
arXiv·2026-10-03·Xiaotian Nie et al.
No generated summary available for this entry.
overview
Original abstract
Entangling measurements can reduce the statistical cost of learning many-body correlations. We study Pauli strings with full support on a specified $k$-qubit region using classical shadows with two independent, uniformly random product single-qubit Clifford layers around a controllable unitary acting on that region, followed by computational-basis readout. In this architecture, we prove that a circuit $U_*$ of two collective Pauli rotations attains the exact minimum squared shadow norm over all Clifford choices of the controllable unitary for every $k\geq1$, namely $C_k^{\rm opt}=4\cdot 9^k/(3\cdot 5^k+3^k-6)$ for odd $k$ and $C_k^{\rm opt}=4\cdot 9^k/(3\cdot 5^k-3^k+2)$ for even $k$. The asymptotic optimum $(4/3)\cdot(9/5)^k$ establishes Wu et al.'s exponential base as optimal and improves their prefactor from $2$ to $4/3$. For $1\leq k\leq6$, exact rational certificates prove that the same optimum holds over the entire unitary group $\mathrm U(2^k)$, including all non-Clifford unitaries, within the same measurement architecture. These finite-size results motivate the conjecture that $U_*$ is optimal over all unitaries for arbitrary $k$ within this architecture.
arXiv·2026-10-03·Anderson S. Barbosa, Franklin de L. Marquezino, Giuliano G. La Guardia
No generated summary available for this entry.
overview
Original abstract
In this paper, we present a method for constructing linear codes derived from book graphs. Applying such a method, we construct binary codes that have the greatest possible minimum distance for their length and dimension by means of the $2$-sum of two equal book graphs. We then utilize matroid and graph theory together to investigate some properties of the resulting linear codes. Furthermore, we show that, from the incidence matrix of any graph, we can obtain a linear code over any finite field maintaining the same parameters. Furthermore, we show how the condition for two linear codes to generate a Calderbank-Shor-Steane (CSS) code translates into matroid theory and, utilizing cycle graphs, we exhibit a way to generate codes that meet this condition.
arXiv·2026-10-03·Yuga Hirai, Yasunari Suzuki
No generated summary available for this entry.
overview
Original abstract
The surface code is the leading candidate for fault-tolerant quantum computation owing to its planar nearest-neighbor connectivity, high threshold, and efficient decoding, but its low encoding rate demands on the order of a thousand physical qubits per logical qubit in the teraquop regime. Yoked surface codes improve the density by a factor of two or three by concatenating a high-density parity check code on top of the surface code while retaining planar nearest-neighbor connectivity. In this work, we generalize this idea to multiple levels of concatenation and introduce multi-yoked surface codes. Our construction rests on two new ingredients. First, we propose a family of outer codes called chain codes, built by chaining copies of a seed code that detects the block errors of the code one level below; the resulting codes use all logical qubits of the lower level and achieve a high encoding rate within a few concatenation levels. Second, we design a patch allocation in which movable workspaces perform the yoking checks by lattice surgery with a hierarchy of yoking intervals, so that lower-level checks are performed frequently while higher-level checks are performed less often, which avoids the long yoking intervals that a single large-distance outer code would require. As a benchmark, we construct a three-yoked surface code with a $[[256,166,8]]$ outer code and evaluate it numerically under the SI1000 noise model using soft information from the surface code decoder. The logical error rate is suppressed exponentially in the inner code distance, and in the teraquop regime the three-yoked surface code is about 4 to 4.5$\times$ denser than the unyoked surface code.
arXiv·2026-10-03·Shih-Han Hung, Ming-Hsien Tsai
No generated summary available for this entry.
overview
Original abstract
We study the following quantum state identity problem: given access to copies of $n$ unknown pure quantum states, the goal is to determine whether every pair has fidelity at least $1-\varepsilon$ or some pair has fidelity at most $\varepsilon$. This problem relaxes the identical-or-orthogonal promise considered in previous work. For any fixed overlap parameter $\varepsilon\in(0,1/4)$, we present two quantum algorithms with complementary guarantees on circuit depth and sample complexity. The first runs in constant depth using parallel swap tests and takes $O(\log(n/δ)\log(2/δ))$ copies of each input state to succeed with probability at least $1-δ$. The second uses the Schur transform to reduce the sample complexity to $O(\log(n/δ))$, through an analysis relating Jucys--Murphy elements to Schur sampling. We also prove a matching sample complexity lower bound of $Ω(\log(n/δ))$ for any quantum algorithm with failure probability at most $δ\le 1/2-c$, for any constant $c>0$, establishing that the second algorithm achieves the optimal dependence on both $n$ and $δ$ for fixed $\varepsilon$.
arXiv·2026-10-03·Yu-Cheng Lin et al.
No generated summary available for this entry.
overview
Original abstract
Molecular property prediction is central to computational drug discovery, where graph neural networks learn to weight neighboring atomic environments during message passing. Yet it remains unclear how variational quantum circuits alter learned attention behavior in molecular graphs. We introduce an edge-aware variational quantum attention mechanism for molecular graph learning, in which the receiving atom, neighboring atom, and connecting bond jointly determine the quantum attention state. Across five molecular property and bioactivity prediction tasks, QGAT achieves competitive performance relative to GATv2, with a consistent improvement on BBBP across all six evaluated circuit ansatzes. We further compare how the quantum and classical attention scores weight molecular structure beyond accuracy. In the Verubecestat BACE1 inhibitor series, QGAT achieves a higher Spearman correlation than GATv2 and assigns positive attributions to several structural changes consistent with reported structure-activity relationships (SARs). This case study shows that the two attention mechanisms can exhibit different prediction and attribution behavior across structurally related BACE1 analogues, while broader validation is required to determine how consistently these differences generalize across chemical series and targets. Circuit ablations further show that performance depends on the circuit design. Together, these results show that variational quantum attention can serve as a viable alternative molecular attention parameterization while inducing circuit- and chemistry-dependent behavior distinct from a matched classical scorer.
arXiv·2026-10-03·Hao Wang et al.
No generated summary available for this entry.
overview
Original abstract
Phosphorus donors in silicon are one of the promising platforms for fault-tolerant quantum computing, owing to their long coherence times and compatibility with complementary metal-oxide-semiconductor (CMOS) technology. However, a key bottleneck for scaling this platform lies in the independent addressability of individual spin qubits. Here, we present a scalable quantum processor architecture that integrates scanning tunneling microscope (STM)-defined phosphorus donor-cluster arrays with on-chip micromagnets. By generating magnetic field gradients, the micromagnets enable a broader addressable frequency range compared to the addressing scheme based solely on variations in hyperfine (HF) interactions, which arise from the randomness of intra-cluster configurations. Through micromagnetic simulations to optimize micromagnet geometry, we demonstrate that these structures are compatible with customized array designs, facilitating the integration of over 120 atomic spin qubits and enabling frequency multiplexing with a single microwave antenna, which greatly reduces the overhead of fan-out addressing lines. This design is further validated via magnetic measurements, which generally align with our micromagnetic simulations. These results establish a critical foundation for the development of scalable silicon quantum computing with atomic qubits.
arXiv·2026-10-03·Wenyuan Wang, H. F. Chau
No generated summary available for this entry.
overview
Original abstract
Photonic qubits play an important role in quantum information processing. However, to date, efficient high-speed single photon sources and photon number resolving (PNR) detectors are still difficult to make. Here, we use phase-randomized coherent states and threshold detectors, combined with decoy-state post-processing, to simulate single photon sources and PNR detectors and perform various quantum information processing tasks. We propose a simple linear regression method to predict Fock state statistics based on observable statistics from coherent-state probes, combined with random/structured sampling of probe settings. Compared with traditional decoy-state post-processing based on linear programming and Cartesian product grid sampling, our method enables drastically improved accuracy and much reduced probe resources. It works particularly well for unknown unitary circuits of interest with fixed-size Hilbert space dimensions. For instance, it can accurately simulate 4-photon interference in linear optics with just 32 input/output probe settings and 6-photon interference with 256 probe settings. Moreover, it also works for non-unitary (such as lossy, nonlinear, or arbitrary) quantum channels. This enables a wide variety of applications that can be implemented with easily attainable coherent light sources and threshold detectors, such as characterization of small-scale linear optical quantum computing circuits or quantum sensing/metrology devices.
arXiv·2026-10-03·Luis D. Zambrano-Palma, Yusef Maleki, M. Suhail Zubairy
No generated summary available for this entry.
overview
Original abstract
Harnessed nonclassical resources to enhance the performance of quantum batteries is an important goal of quantum technology. In this work, we investigate multi-emitter batteries coupled to a one-dimensional waveguide driven by a broadband squeezed-vacuum reservoir, and determine how the waveguide geometry controls the battery performance and and their thermodynamic features. We show that for a single emitter, the squeezed reservoir deposits finite energy while the state remains passive, yielding zero ergotropy. For two emitters, however, phase-sensitive reservoir correlations generate coherence and can drive the steady state into a fully nonpassive regime. For three emitters, collective thermal dynamics already supports finite ergotropy, while squeezing further increases the extractable component of the stored energy. Crucially, because the collective and phase-sensitive couplings depend on the emitter positions, geometry provides direct control over the nonclassical correlations and, consequently, over the nonpassivity of the steady state. The ergotropy can therefore be strongly modulated while the stored energy changes only weakly, and in the two-emitter configuration geometry alone can switch the battery between a passive steady state and one in which all stored energy is unitarily extractable.
arXiv·2026-10-03·Yonggang Jiang et al.
No generated summary available for this entry.
overview
Original abstract
We study the quantum query complexity of maximizing a non-negative submodular function, considering both the unconstrained setting and, for monotone functions, a cardinality constraint $k$ on an $n$-element ground set. In the exact reversible digital value-oracle model, our unconstrained algorithm achieves an expected $(1/2-\varepsilon)$-approximation using only $O_\varepsilon(\log n)$ queries. In contrast, any classical randomized algorithm that attains a fixed expected ratio above $1/4$ requires $Ω(n/\log n)$ queries (Li, Feldman, Kazemi, and Karbasi, 2022), establishing an exponential separation in query complexity. For cardinality-constrained maximization, we give a bounded-error quantum algorithm that achieves a $(1-1/e-\varepsilon)$-approximation using $\widetilde O_\varepsilon(\min\{\sqrt n,n/k\})$ queries. When $k=o(n)$, our algorithm achieves at least a quadratic speedup up to logarithmic factors over classical randomized algorithms (Mirzasoleiman, Badanidiyuru, Karbasi, Vondrák, and Krause, 2015; Peng and Rubinstein, 2025). Moreover, when $k=cn$ for any fixed rational $c<1-1/e-\varepsilon$, the query complexity reduces to $O_{\varepsilon,c}(\log n)$, yielding an exponential separation from the classical $Ω(n/\log n)$ lower bound (Li, Feldman, Kazemi, and Karbasi, 2022). We further prove quantum lower bounds of $\exp(Ω(\varepsilon^2n))$ queries for achieving a ratio beyond $1/2+\varepsilon$ without constraints, and $\exp(Ω(\varepsilon^2k))$ queries for exceeding $1-1/e+\varepsilon$ when $k/n\le\varepsilon$. These barriers demonstrate that quantum computation offers no exponential speedup at these approximation thresholds.
arXiv·2026-10-03·Truong-Son P. Van, David W. Snoke
No generated summary available for this entry.
overview
Original abstract
We determine the time required for local weak measurements to collapse to one occupied site in an initial superposition of $N$ alternatives in the model of PRA 111, 032217 (2025). For equal initial occupation probabilities and a fixed confidence threshold $1-δ$, we prove $T_N/\ln N\to1/2$ in $L^1$, with time measured in units of the characteristic measurement time $τ_m$ of each detector. We also connect the asymptotic stabilization theorem of that work to a finite measurement: the first site to reach $1-δ$ is the eventual outcome with conditional probability exactly $1-δ$. The result corrects the previously proposed double-logarithmic asymptotic scaling. The finite-range numerical fit does not determine a constant asymptotic correction or a precise finite-$N$ law.
arXiv·2026-10-03·Giovanna Bruno et al.
No generated summary available for this entry.
overview
Original abstract
Cavity Quantum Electrodynamics (Cavity-QED) offers a powerful framework for controlling light-matter interactions, yet first-principles approaches commonly assume ideal, lossless cavity fields. Here, we introduce a minimal extension to the Pauli-Fierz Hamiltonian that accounts for cavity dissipation through the experimentally accessible cavity quality factor Q. The electromagnetic field is described as a damped harmonic oscillator within the very weak damping approximation. In this framework, cavity losses only enter the light-matter interaction and dipole self-energy terms, without introducing additional photonic degrees of freedom. A time-dependent unitary transformation yields a real-valued Hermitian Hamiltonian that can be incorporated into existing ab-initio QED methods without additional computational cost or changes in scaling. We combined the approach to the QED-CCSD method and investigated the effects of cavity dissipation on the optical spectrum of a p-nitroaniline molecule under strong light-matter coupling. We found that, for realistic quality factors, cavity dissipation can reduce the Rabi splitting by more than 20% compared to the ideal-cavity limit, even though the system remains in the strong-coupling regime. Convergence towards the ideal-cavity limit then requires substantially higher quality factors than those needed to establish strong coupling. These results demonstrate that cavity dissipation can significantly affect polaritonic energetics and highlight the importance of incorporating experimentally realistic cavity losses into quantitative ab-initio Cavity-QED simulations to accurately guide experimental protocols.
arXiv·2026-10-03·Wajid Joyia, S. M. Al-Marzoug, Amaria Javed
No generated summary available for this entry.
overview
Original abstract
We study the charge resolved structure of the pairwise mode entanglement produced by the Schwinger effect. Using the $U(1)$ electric charge of quantum electrodynamics, we decompose the entanglement of the reduced density matrices of momentum modes into individual charge sectors, applying the symmetry resolved entanglement entropy to the pure bipartition reductions and the charge imbalance resolved negativity to the mixed particle-antiparticle pair. For a constant electric field we obtain closed form results for every mode pairing, with all field dependence controlled by the single pair production probability $|β|^2=e^{-πμ}$. For the particle, particle and antiparticle antiparticle pairs the entanglement entropy within each charge sector is field independent, so that the field acts only by redistributing statistical weight among the sectors; for the mixed particle antiparticle pair the populated sector additionally carries a field dependent entropy. The vacuum created pair is the richest case: its resolved negativity is distributed over three imbalance sectors and is transported from one sector to the next as the field increases, the sectors contributing equally only at the critical field. The entanglement across a fixed momentum bipartition, by contrast, is frozen at its initial value because pair creation conserves the sector charge. Symmetry resolution thus refines the total entanglement measures into a sector resolved picture, exposing where in charge space the entanglement of the Schwinger mechanism resides and how the electric field moves it, information beyond that contained in the total measures or in particle number distributions.
arXiv·2026-10-03·Aryan Bhatia, Giandomenico Palumbo, Suraj S. Hegde
No generated summary available for this entry.
overview
Original abstract
The Wen-Zee term is a mixed gauge-curvature coupling in the topological Chern-Simons description of a quantum Hall fluid, encoding the electric charge bound to spatial curvature. We investigate a Lorentz-covariant generalisation of this coupling, expanding its scope to black-hole spacetimes and determine its contribution to horizon entropy. Such a coupling arises naturally in three-dimensional Chern-Simons gravity based on the Maxwell algebra. We show that its Wald entropy contribution is a horizon boost charge, given by a loop integral of the additional gauge field projected along the tangent to the bifurcation circle. This contribution can be nonzero even when the mixed term vanishes on shell. We show that the integral admits an Abelian holonomy interpretation when the projection direction is covariantly constant. We evaluate the charge on a flat cosmological solution and, using smooth horizon fields and a specified thermal ensemble, on an AdS-Lorentz black hole. These results connect the geometric response familiar from quantum Hall physics to gravitational horizon thermodynamics.
arXiv·2026-10-03·Alireza Maleki
No generated summary available for this entry.
overview
Original abstract
The quest for a quantum theory of gravity remains a central challenge in modern physics, driven by the goal of unifying general relativity and quantum mechanics. Direct experimental access to quantum gravitational effects is notoriously difficult due to the inaccessibility of the Planck scale. Recent proposals, however, suggest that gravitationally induced quantum entanglement between two massive particles, realized through advanced quantum interferometric techniques, could provide empirical evidence for the quantum nature of gravity. We demonstrate that the geometrical configuration of an interferometer plays a decisive role in entanglement generation. Our analysis reveals that geometric optimization can substantially enhance the gravitationally induced phase shift, thereby improving the prospects for experimental detection of gravity-mediated entanglement. Moreover, we show that standard approximations employed in prior proposals may severely limit predictive accuracy and compromise experimental feasibility.
arXiv·2026-10-03·Linlin Ye et al.
No generated summary available for this entry.
overview
Original abstract
We investigate the sequential version of Shor's order-finding algorithm from the perspective of the imaginarity of quantum channels. By fixing an eigenbranch of the modular multiplication unitary and a target output path, the process is effectively decomposed into a real diagonal factor and a residual phase channel. We find that for the ideal residual phase channel, the three trace-norm induced imaginarity measures are all equal. On good output paths, a smaller residual imaginarity corresponds to a higher single-block success probability. By combining the branch-wise probabilities, we obtain the exact ideal success probability of the sequential order-finding protocol and derive lower and upper bounds in terms of residual phase-channel imaginarity. We further extend the analysis to noisy residual phase channels, and obtain the lower and upper bounds on the noisy success probability. These results clarify the role of imaginarity of channels in Shor's algorithm and provide a refined perspective on quantum-resource behavior in ideal and noisy sequential quantum algorithms.
arXiv·2026-10-03·Jeremy Ahrens Huang
No generated summary available for this entry.
overview
Original abstract
Despite the importance of the non-uniform Polynomial-Time Hierarchy (PH/poly) in classical complexity understanding the collapse conditions of the Polynomial-Time Hierarchy (PH), a quantum equivalent of PH/poly has yet to be studied in the literature. We introduce the non-uniform computational Quantum Polynomial-Time Hierarchy (QCPH/mpoly), the quantum equivalent of PH/poly, and show that it collapses if and only if QCPH, the quantum equivalent of PH introduced by Gharibian et al. (comput. complex. 2022), also collapses. We also show that QCPH collapses if coQCMA is contained in QCMA/mpoly. These results are analogous to those of Yap (TCS 1983) commonly used to invoke the collapse of PH in classical complexity. QCPH/mpoly is analogous to QCPH with non-uniform quantum verifier circuits.
arXiv·2026-10-03·Sabina Drăgoi, María Gragera Garcés, Lirandë Pira
No generated summary available for this entry.
overview
Original abstract
Circuit cutting runs a quantum computation on processors smaller than the circuit, at the price of classical knitting whose cost grows exponentially with the number of cut gates. Keeping this cost affordable is necessary but not sufficient for an advantage, since knitting classically easy subcircuits is itself classically easy. We formulate three requirements for distributed quantum advantage under a stated budget: affordable knitting, classical difficulty that survives the cut, and, for variational circuits, resolvable gradients. We prove that under stated assumptions knitting stays affordable when subcircuits grow behind a bounded interface and becomes exponentially expensive when fixed-width subcircuits multiply. We turn the requirements into screening criteria and apply them to eighteen circuit families. We identify finite local-depth circuits with bounded interfaces as a setting in which the requirements can coexist, with hardness established only in the worst case. As a classically verifiable proof of principle, we knit one gate joining two field-perturbed toric-code patches on an IBM Nighthawk processor for up to 142 spins, and confirm that the reconstruction can at least resolve the contact correlation beyond independent execution for up to 98 qubits.
arXiv·2026-10-03·S. F. E. Oliviero, S. Onofri, V. Giovannetti
No generated summary available for this entry.
overview
Original abstract
Quantum networks will rely on intermediate nodes to distribute entanglement, but the same nodes may learn which users are being connected. We introduce a minimal two-call routing primitive in which a user, Alice, establishes an entangled link with one of several clients while testing whether the provider, Bob, has disturbed a coherently encoded request. The construction adapts the hidden-order mechanism of quantum private queries: one call contains a direct request, the other a coherent superposition of the desired and null addresses, and Alice keeps their order secret. A private matching qubit held by the selected client restores the coherent test state after a favorable Bell-measurement outcome, so that Alice can test the returned query without any further operation by Bob. The claim is deliberately limited. The protocol shows that a routing request can carry a physical cheating test, and it detects an explicit destination-reading attack with nonzero probability. It does not yet provide a quantitative information-disturbance tradeoff, composable security, or certification of an unmeasured output against arbitrary attacks. We also characterize the exact perfect-pass limit, in which Bob's residual state, averaged over the private matching states, is independent of the destination.
arXiv·2026-10-03·Chuan-Fu Lin, Yu-Chin Tzeng, Po-Yao Chang
No generated summary available for this entry.
overview
Original abstract
We study the effect of repulsive interactions on skin modes and entanglement in the unidirectional Bose--Hubbard model. Although the ground state of this integrable model undergoes a superfluid--Mott transition with suppressed skin accumulation, the corresponding change in entanglement depends on the selected many-body state. We compare the ground state with the steady state, defined as the largest-imaginary-energy eigenstate in the zero-momentum sector. For sixteen sites at unit filling, we find that the ground-state density approaches uniform filling and its entanglement decreases toward the Mott limit, whereas the steady states exhibit a nonmonotonic entanglement crossover. At intermediate interaction ($U/t=10$), the second Rényi entropy of the steady state develops four spatial maxima. We show that these maxima are accounted for by competing subsystem-number sectors within a dominant configuration manifold of four doublons and four holons, but not by the subsystem particle-number variance alone. The dominant global onsite-pair manifold retains the same entropy peak structure. At strong interaction, projection onto the one-doublon--one-holon manifold closely reproduces the full entropy profile and its two edge peaks. Furthermore, we demonstrate that the many-body winding about the origin remains nonzero at strong interaction; an exact two-site example shows how it becomes ill-defined in the singular projected $U/t\to\infty$ limit. Our results distinguish ground-state skin suppression from state-selective entanglement and point-gap topology.
arXiv·2026-10-03·B. Hamil et al.
No generated summary available for this entry.
overview
Original abstract
This work investigates a class of exactly solvable quantum systems described by a generalized Dunkl--Schrödinger equation with energy-dependent interactions. A two-parameter extension of the Dunkl differential operator is introduced, incorporating both the conventional reflection contribution and an additional derivative-reflection coupling. The resulting formalism leads to a modified Heisenberg algebra, from which the continuity equation, conserved probability current, and generalized normalization condition are derived for energy-dependent potentials. As an application, an energy-dependent harmonic oscillator is studied in detail. Exact analytical expressions for the eigenfunctions and energy spectrum are obtained in terms of associated Laguerre polynomials. The combined effects of the Wigner parameter, the deformation parameter, and the energy-dependence parameter are shown to produce parity splitting, nonlinear energy spectra, and nonuniform level spacing while preserving exact solvability. The thermodynamic properties of the model are then examined through the canonical partition function using the Euler--Maclaurin summation formula. Analytical expressions for the partition function, internal energy, entropy, and specific heat are derived and analyzed numerically. The results demonstrate that the generalized Dunkl deformation and energy-dependent interaction provide effective control over both the spectral and thermal characteristics of the system, extending the class of exactly solvable quantum models with reflection symmetry.
arXiv·2026-10-03·Xinchen He, Wenjie Dou
No generated summary available for this entry.
overview
Original abstract
Modelling molecular absorption spectra from scalable ground-state representations is challenging because conventional approaches often require explicit excited states or time propagation. Here, we introduce a method to obtain Absorption Using Recursive Operator Response with vibronic Augmentation (Aurora), which combines neural quantum states (NQSs) with continued-fraction memory-kernel coupling theory (CF-MKCT). Aurora maps the zero-temperature Liouvillian response hierarchy onto repeated wavefunction-space applications of a shifted Hamiltonian to a dipole-prepared state, enabling direct spectral reconstruction from variational ground states. The implementation combines variational Monte Carlo, implicit-restarted-Lanczos-assisted NQS optimization, matrix-free Hamiltonian application, and adaptive recursion control. The resulting electronic spectra closely agree with full-configuration-interaction and conventional MKCT references for tractable molecules, with the restarted-Lanczos strategy improving difficult NQS cases. For electron-phonon Hamiltonians, Aurora combines Huang-Rhys mode selection with local singular-value-decomposition (SVD) phonon encoders. The H2 benchmark indicates that compression retains the dominant vibronic envelope and improves upon bare local-basis truncation, while paired calculations for N2, H2O, H2S, and NH3 yield similar principal features with and without encoding. We further obtain vibronic spectra for C6H6 and a 10-electron, 10-orbital C10H8 active space. Overall, Aurora provides a unified route from variational molecular ground states to electronic and vibronic spectra without constructing excited-state manifolds.
arXiv·2026-10-03·Shuoming An, Fusheng Yang
No generated summary available for this entry.
overview
Original abstract
A logical measurement reads out protected information, and the noise it survives sets how much a quantum computation can absorb. Gauging builds one from a graph on the measured qubits, one extra qubit on each edge, turning a global operator into local parity checks. Its tolerance splits in two: the distance of the code left behind, and the rounds a fault can hide in. Williamson and Yoder proved both components stay at or above the code's distance. The guarantee rests on four side conditions taken as a package, none of them priced. Here we show they are not worth the same: the demand that the first and last rounds be perfect, which reads like bookkeeping, carries the temporal part. Dropping it flattens the fault distance, the least weight of a fault that passes unseen and flips the readout, to one for every code and round count, in a model whose detectors compare adjacent rounds; the full protocol collapses on the instance measured. The expansion condition, that no small set of qubits be sealed off, does not decide the outcome: two paths on the same qubits, both outside the covered regime, give distances one and two. The round count is tight where comparing rounds is the whole rule; the full protocol reaches the distance a round early. Both components are computed exactly on a gauged bivariate bicycle code and a Bacon--Shor measurement, inside a proof assistant. Threshold estimates consume such numbers; side conditions can be priced.
arXiv·2026-10-03·Youngrong Lim
No generated summary available for this entry.
overview
Original abstract
One-way local operations and classical communication (LOCC) can fail to distinguish four orthogonal maximally entangled states in every local dimension $d\ge4$. We show that every set of $k$ pairwise orthogonal maximally entangled states in $\mathbb C^d\otimes\mathbb C^d$ is perfectly distinguishable by an $A\to B\to A$ protocol whenever $d\ge Ck^4[\log(2k)]^ν$, for universal constants $C,ν>0$. A single feedback message therefore raises the number of candidates that can always be distinguished from a constant to $Ω\!\left(d^{1/4}/(\log d)^{ν/4}\right)$, establishing a polynomial separation between one-way and two-way LOCC. In our protocol, Alice preserves exact orthogonality while reducing overlaps between Bob's conditional subspaces. Bob reduces the candidates to a singleton or an orthogonal pair and refines his outcome so that Alice can complete the discrimination. As a corollary, nine copies suffice for perfect two-way LOCC discrimination of any orthogonal maximally entangled set in all sufficiently large local dimensions.
arXiv·2026-10-03·Seth Douglas, Nidhal Mghirbi
No generated summary available for this entry.
overview
Original abstract
How far from finite can an amenable group be? Every finite piece of an amenable group can be imitated by permutations of a finite set, and Cornulier's sofic profile counts how many points such an imitation needs at accuracy $1/r$. We build a finitely presented elementary amenable group with a finite piece whose profile is $\exp(r^{1+o(1)})$, close to the most our counting method can ever detect. The construction is a lamplighter with its lamps on configurations rather than on points. Houghton's group moves the points of three rays, finitely supported affine maps act on their binary configurations, and a copy of $S_3$ sits on every configuration. Then $N$ points carry $2^N$ lamps, yet any two lamps can be brought together by moves that each involve at most three points. The group embeds in Brin's group $3V$, so $3V$ too has a finite piece of nearly exponential profile. The group also gives an explicit quantum channel on $\mathbb C^{873}$ that is cheap to use once and expensive to use many times. A device that applies it $n$ times, releasing each output before the next input arrives, needs about $n/B$ qubits of memory when it may spend $B$ bits of purity, and exact devices achieve this up to polylogarithmic factors. With exchange at the optimal rate, the least memory is about $\sqrt n$, attained with purity of the same order. The channel is factorizable and lies in the closure of channels with finite maximally mixed baths, yet any such bath that imitates it to accuracy $u$ needs dimension $\exp(u^{-1+o(1)})$, although its minimal Stinespring dilation implements it exactly with a pure environment of dimension $130$. The engine is a one-round theorem: after a single use, the memory of any such device carries an approximate representation of the group.
arXiv·2026-10-03·Archie Butterworth, Jens Renders, Jingbo Wang
No generated summary available for this entry.
overview
Original abstract
Quantum processing of classical data fundamentally relies on efficiently mapping classical datasets onto the amplitudes of quantum states. Preparing large amplitude-encoded states, however, remains a major bottleneck in quantum computing. In this paper, we introduce a novel state-preparation framework we call Q-MERGE, that addresses this bottleneck by partitioning a large target state into $M$ $n$-qubit segments, preparing these segments independently and in parallel, and then coherently combining them into a single amplitude-encoded state using SELECT-SWAP operations and measurement. Q-MERGE is agnostic to the segment-level preparation method, allowing existing techniques to be applied to smaller subproblems while providing a tunable trade-off between circuit depth and qubit count. With mid-circuit measurement and preparation-register reuse, the required ancilla qubits can be reduced from $\mathcal{O}(Mn)$ to $\mathcal{O}(n)$. Applied to a real-world \(128\times256\) ultrasound dataset, Q-MERGE achieves an infidelity of $1.066\times10^{-8}$, compared with $3.413\times10^{-1}$ for direct preparation using the same underlying method, a seven-order of magnitude improvement. We demonstrate its feasibility experimentally on the Quantinuum System Model H2 trapped-ion quantum computer and validate the prepared state using shadow-overlap tomography. Numerical analysis of Haar-random states indicates consistent success probability for up to $M=10^7$ segments, supporting the scalability of Q-MERGE for encoding massive classical datasets.
arXiv·2026-10-03·Jinkai Liu et al.
No generated summary available for this entry.
overview
Original abstract
A tilted nonselective measurement can close the upper transition of a three-level quantum refrigerator, but it also generates coherence that feeds back on the populations and suppresses the cooling current. We formulate randomized open-loop control of the measurement azimuthal phase \(α\), sampled independently at each event from a probability distribution \(P(α)\), while keeping the event rate, polar angle, and single-event population-transfer probability fixed. Direct population transfer is phase independent, whereas the coherence source carries the factor \(e^{-iα}\). Exact elimination of the stationary coherence gives \(0\leq k_{\rm eff}[P]\leq A_m\), where \(k_{\rm eff}[P]\) is the effective population-transfer rate between the upper levels and \(A_m\) is the bare direct mixing rate. When the fixed measurement couples populations and coherence, the upper bound is attained if and only if \(\langle e^{iα}\rangle_P=0\), where \(\langle\cdot\rangle_P\) denotes an average over the phase distribution. The minimal realization uses two equally weighted phases separated by \(π\): the population-to-coherence source and its return to the populations then vanish at the generator level, while the full direct mixing remains. Because the cold current increases strictly with \(k_{\rm eff}\) in the refrigeration window, the same condition maximizes the stationary cooling power over the independent random-phase distributions considered here. For one representative parameter set, phase cycling increases the fixed-gap cooling power by about \(32\%\) relative to a fixed-phase measurement, while leaving the ratio of extracted cold heat to supplied measurement energy unchanged.
arXiv·2026-10-03·Sounak Bhowmik, Himanshu Thapliyal
No generated summary available for this entry.
overview
Original abstract
Quantum sensing is emerging as a practical means of improving sensing capabilities in consumer electronics, particularly where size, power, and noise constrain classical approaches. In this paper, we reviewed the near-term applicability of quantum sensing using a platform-and-application framework. Within this framework, we outlined the general sensing protocol and discussed the working of the four key quantum sensing platforms relevant to consumer electronics: nitrogen-vacancy (NV) centers, atomic vapor cells, Rydberg atomic sensors, and photonic quantum sensors. Through case studies involving navigation and positioning, healthcare and wearables, radio-frequency (RF) and wireless systems, the Internet of Things (IoT), and imaging, we examined the tangible engineering advantages offered by quantum sensing. Rather than replacing devices outright, quantum sensing is more likely to earn its place in the near-term by upgrading specific measurement components within hybrid classical-quantum systems. Right now, the clearest opportunities are in weak-field detection, compact RF reception, and sensing that remains robust in noise.
arXiv·2026-10-03·Kai Li et al.
No generated summary available for this entry.
overview
Original abstract
Narrow linewidth (high-Q) quantum discriminators are essential for realizing solid-state $^{229}$Th nuclear clocks, yet the observed transition linewidths remain at the tens-to-hundreds-of-kilohertz level, far exceeding the sub-Hertz linewidth set by the radiative lifetime of the nuclear isomer. Here, we investigate the origin of this broadening in $^{229}$Th:CaF$_2$ through systematic measurements of the linewidth as functions of temperature, thorium concentration, and quadrupole state, accompanied by theoretical analysis and first-principle simulations. We find that the linewidth is independent of temperature, increases linearly with thorium concentration, and depends strongly on the quadrupole state. Data analysis identifies variations of the local electric-field gradient (EFG) as the dominant source of inhomogeneous broadening and reveals that the EFG disorder increases linearly with thorium concentration. The observed Lorentzian line shapes and linewidth linear concentration dependence are explained naturally from the $1/r^3$ scaling of a random distribution of long-range dopant-induced perturbations. Complementary atomistic and \textit{ab initio} density-functional-theory calculations reproduce these characteristic features and provide insights into the microscopic defect configurations responsible for the broadening. These results establish the dominant broadening mechanism in solid-state $^{229}$Th and provide guidance for engineering nuclear-clock materials with reduced inhomogeneous broadening.
arXiv·2026-10-03·Alexey Milekhin, Anders Wallberg
No generated summary available for this entry.
overview
Original abstract
The decay of out-of-time-ordered correlators (OTOCs) to a small residual value signals the scrambling of quantum information. This behavior is generic: it occurs in both chaotic and interacting integrable many-body systems, and therefore cannot by itself distinguish between them. In this paper we analytically study the late-time saturation value of a closely related observable, operator purity, and show that its scaling with system size robustly distinguishes chaotic from integrable systems. Our approach is based on the Mazur bound, which provides concrete scaling estimates and makes explicit why the locality of integrable charges matters. We support our findings with numerical simulations of one-dimensional spin chains.
arXiv·2026-10-03·Daniel R. Germain et al.
No generated summary available for this entry.
overview
Original abstract
Quantum kernel methods are promising for near-term quantum machine learning, but their training costs are driven by the quadratic scaling of Gram-matrix construction and the measurement cost of estimating individual kernel values. In this work, we investigate one-class anomaly detection as a resource-efficient operating regime for training non-variational quantum kernel models. Using the ULB Credit Card Fraud Detection dataset, we evaluate three quantum feature maps across training-set sizes and qubit counts. Power-law saturation models reveal strong diminishing returns with increasing training data, with 500-sample models retaining approximately 90--93\% of their fitted asymptotic average precision (AP). We further observe no severe exponential concentration among the evaluated feature maps over the investigated qubit range, thereby avoiding the exponentially increasing measurement requirements associated with that regime. Finally, Nyström approximation reduces kernel construction from $\mathcal{O}(N^2)$ to $\mathcal{O}(Nm)$ evaluations, with QSVR retaining 94--97\% of its exact-kernel AP using only five landmarks. For ZZ-QSVR, downsampling from 4,000 to 500 training samples and applying a five-landmark approximation decreases the number of required kernel evaluations from approximately $8.0$ million to $2,485$, a reduction of more than 3,200-fold, while AP decreases from $0.812$ to $0.737$. Under the minimum IonQ pricing assumption considered here, this corresponds to an illustrative reduction in quantum kernel training cost from approximately \$1.34 billion to \$417{,}480. These results demonstrate that training-set reduction and low-rank approximation can substantially reduce the resources required to train non-variational quantum kernel anomaly detectors while retaining meaningful anomaly-discrimination performance.
arXiv·2026-10-03·Sudatta Hor, Nathan Wiebe, Yongshan Ding
No generated summary available for this entry.
overview
Original abstract
Inspired by classical Markov Chain Monte Carlo (MCMC) methods, dissipative quantum algorithms are an emerging class of methods for preparing quantum states on a quantum computer. They operate by simulating a dissipative process governed by a mathematical operator known as the Lindbladian. The performance of these algorithms can be limited by the sequential implementation of the Lindbladian's constituent jump operators, which leads to high circuit depth. To address this issue, this work analyzes a parallelization scheme to implement jump operators simultaneously. We leverage the structure of geometric locality to show that individual jump operators remain spatially localized. This exponentially reduces the circuit depth per time step, resulting in an overall polynomial improvement. Numerical experiments demonstrate a 53x reduction in query depth for a 1D benchmark system of 100 qubits. The reduced circuit depth makes dissipative algorithms more practical for near-term quantum computing.
arXiv·2026-10-03·Israel F. Araujo
No generated summary available for this entry.
overview
Original abstract
We consider the Wigner--Smith time-delay matrix of a chaotic cavity with broken time-reversal symmetry, a finite number $M$ of equivalent open channels, and a uniform tunnel barrier of reflection probability $R$. Exact random-matrix results for nonideal coupling are known at the level of the joint matrix distribution, whereas explicit finite-channel formulas for Schur moments are much less developed. We show that every Schur moment of the nonideal Wigner--Smith matrix factorizes into its ideal-coupling inverse-Laguerre value and a barrier factor given by a circular unitary ensemble (CUE) average of a Schur polynomial. A dual-Cauchy generating function reduces the latter to a Toeplitz determinant with a rational symbol, placing the barrier problem within the classical theory of exact CUE characteristic-polynomial ratios. For one-row partitions, specializing the exact CUE ratio formula gives a closed generating function for all barrier coefficients and therefore all finite delay-time moments in the allowed range $n\le M$. The exact ratio formula decomposes into a sector visible to the semiclassical expansion and an additional contribution proportional to $R^{M+1}$, which is invisible to every algebraic order in $1/M$. For the second moment, this contribution exactly reproduces the exponentially small term in the known random-matrix expression for $\langleτ_W^2\rangle$ that is absent from the semiclassical expansion. We also derive an exact finite sum for all one-column partitions and an exact complement symmetry for Schur averages inside the $M\times M$ square. The new contribution therefore lies not in the underlying CUE ratio identities, which are classical, but in combining them with the exact nonideal Wigner--Smith mapping and extracting the resulting finite-channel time-delay formulas and corrections to semiclassical Schur-moment conjectures.
The Quantum Insider·2026-10-02·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Quantum computing could support cleaner energy and industrial processes with a relatively small emissions footprint, according to a BCG study. BCG estimates that fully deployed quantum-enabled technologies could prevent 3 billion to 7 billion metric tons of emissions annually through advances in batteries, carbon capture and industrial chemistry. Only 10% to 15% of those potential savings may be realized by 2040 because commercialization and replacement of long-lived industrial equipment could take decades. Image: Photo by Yamu_Jay on Pixabay The rise of artificial intelligence has raised a new question about whether the next major computing technology will add another large load to power grids. Some experts are worried that quantum systems might do the same as they scale. A Boston Consulting Group study suggests that is unlikely. BCG estimates that quantum-enabled technologies could eventually prevent 3 billion to 7 billion metric tons of emissions annually if fully deployed. At 5 billion metric tons — the midpoint, or middle of that range — the savings would equal nearly a tenth of current global emissions. Although that sounds impressive, the report cautions that those gains would take decades to realize. Under normal equipment replacement cycles, BCG estimates that only 10% to 15% of the potential savings could arrive by 2040, even if commercially viable quantum solutions emerge around 2035. BCG describes quantum as a specialized computing technology that could help solve chemistry and materials problems without the extensive infrastructure built to support AI. Better battery materials could help electricity grids store more renewable power and reduce their dependence on fossil-fuel backup, BCG experts write. The study suggests that quantum’s climate value would depend primarily on what researchers discover with it and how quickly companies can put those discoveries into use. A Smaller Computing Footprint BCG models quantum computing’s
The Quantum Insider·2026-10-02·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief EPB Quantum’s Quantum in Business conference in Chattanooga brought together more than 450 business leaders, researchers, technology innovators and public officials to discuss commercial quantum applications. IonQ and EPB Quantum launched CQ Connect, a webinar series focused on helping businesses explore quantum computing and networking use cases across several industries. The conference highlighted projects involving IonQ , Synopsys, Numana, Nokia Canada, Crypto4A, evolutionQ, Oak Ridge National Laboratory and NVIDIA , alongside Tennessee university and government quantum initiatives. PRESS RELEASE — More than 450 business leaders, technology innovators, researchers and public officials gathered in Chattanooga today for the Quantum in Business conference presented by EPB Quantum SM . The event highlighted Tennessee and Chattanooga’s growing role in advancing quantum innovation while showcasing real-world applications already delivering value for companies. Attendees explored how quantum technologies are creating new ways to solve complex challenges across a range of industries. Home to America’s first commercial quantum computing and networking hub , Chattanooga offers companies a unique place to gain business advantage by exploring how they can use a range of quantum technologies. Throughout the conference, speakers emphasized that organizations are identifying practical use cases that can improve performance, strengthen security and create competitive advantage. “Businesses across the country are considering how quantum technologies can help them solve complex challenges, strengthen security and stay competitive,” said EPB CEO Janet Rehberg . “Here in Chattanooga, businesses have access to commercial quantum infrastructure and can work with university and research partners to develop solutions, with support from state and local leaders and academic and community partnerships that are building a quantum-ready workforce.”
The Quantum Insider·2026-10-02·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Researchers improved the similarity of photons generated by semiconductor quantum dots, advancing light sources for quantum communication and information processing. An optical cavity controlled and accelerated photon emission, increasing photon indistinguishability from 60% to 90%. The researchers found that the cavity can also improve photon purity, with remaining limits linked to vibrations in the semiconductor’s crystal lattice. PRESS RELEASE — Working in close collaboration, researchers from Paderborn University , the University of Basel and Ruhr University Bochum have made a significant breakthrough in the field of quantum communication. In their recently published paper in the prestigious journal Physical Review Letters , they demonstrate how special semiconductor nanostructures can be used to generate individual photons and pairs of photons that are almost perfectly identical. These ‘indistinguishable’ particles form the basis for quantum entanglement and quantum interference. Biexciton decay In quantum information processing, photons are the ideal carriers of information. However, in order to use these light particles for complex calculations, they must possess exactly the same properties – an aspect known as ‘indistinguishability’. Until now, such sources have suffered from the fact that the photons generated were temporally correlated or out of focus, which greatly reduced their indistinguishability and thus their quality. A team of doctoral candidates from Basel and Paderborn has now solved this problem using a process known as ‘biexciton decay’ in semiconductor quantum dots within an optical resonator. This is a process in which a molecule consisting of two bound excitons (each a pair comprising an electron and an electron hole) decays, leaving behind a single exciton and a photon. “The so-called ‘biexciton cascade’ in a semiconductor quantum dot emits photons at the push of a button, which are of great interest for modern applicatio
Quantum Computing Report·2026-10-02·Doug Finke
No generated summary available for this entry.
overview
Original abstract
To find out how a large IT consulting company is approaching quantum, GQI interviewed two executives at CGI to hear their views on how to leverage quantum for their clients. This article provides an interesting perspective on how they are leveraging quantum tech as well as some of the challenges. The post How a Large IT Consulting Company Works with Quantum appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-02·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
The U.S. Department of Energy (DOE) has released its National Quantum Roadmap, aiming for error-corrected quantum computing by 2028. This strategy shifts focus from qubit counts to demonstrated scientific utility, with a three-phphased framework to integrate quantum processing units into existing high-performance computing and AI infrastructure. The roadmap also emphasizes modality-neutral investments and new partnership models to accelerate technology transfer. The post US Department of Energy Releases National Quantum Roadmap Establishing 2028 Fault-Tolerance Milestones appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-02·Resonance
No generated summary available for this entry.
overview
Original abstract
By Sophya Garashchuk , Professor of Chemistry and Biochemistry, University of South Carolina For The Conversation The objects you interact with every day are predictable – you can pick up a box, sit down in a chair without falling to the floor, or open a door without your hand passing through the knob. But if you zoom in on these objects all the way to the quantum level – where you look at the individual atoms – you’ll find that things start to behave somewhat strangely . The typical size of quantum objects is a nanometer, or one-billionth of a meter. For scale, a human hair is 60,000-100,000 nanometers wide . At the nanoscale level, you cannot know where exactly a particle is in space – you can only calculate a probability of where it might be. At the quantum level, particles exhibit wavelike behavior . Instead of discrete, tiny objects, particles act more like continuous waves. A particle’s properties, including properties as basic as its position in space, are defined in terms of probabilities. You can’t know exactly where the particle is, but you can estimate the chances of finding it within a certain region of space. You can compute these probabilities using Schrödinger’s equation, the solutions to which are called wave functions. About a century ago in 1926, Austrian physicist Erwin Schrödinger developed the wave equation, which allowed him to calculate the probability that a particle exhibited a certain property from its wave functions. Even though the human eye can’t parse what’s happening at the quantum scale, the way particles behave at that level influences how you experience the world. It gives plants their green color, provides the foundations for computer and information technology, and governs how many everyday materials work. The wave equation and wave functions I am a theoretical chemist , and Schrödinger’s 100-year-old breakthrough equation underlies many of my research projects. I track how ato
Quantum Computing Report·2026-10-02·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Researchers at Fermilab's SQMS Center and collaborators identified microscopic material defects causing performance variations in superconducting qubits. Their study found that nanoscale fabrication geometries, surface oxides, and energy relaxation times are directly correlated. Specifically, single-nanometer shifts in surface oxide thickness, substrate trench depths below 20 nanometers, and sidewall etch profiles can cause up to a twofold variation in qubit performance. The post Fermilab SQMS Center Identifies Microscopic Origins of Qubit Performance Variance Across Superconducting Transmons appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-02·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Metrosert is inviting companies, students, researchers and other participants from the Nordic and Baltic countries to apply for QEst Hack 2026 in Tallinn from November 11–13. Five companies will bring real business problems and data to the hackathon, where teams will test whether quantum algorithms could offer potential solutions. Applications are open until October 11, with the event offering free participation, quantum computing guidance and access to international mentors and experts. PRESS RELEASE — Metrosert, Estonia’s Applied Research Centre and National Metrology Institute, invites Estonian companies as well as students, researchers and other interested participants from the Nordic and Baltic countries to apply for the QEst Hack 2026 quantum hackathon, taking place in Tallinn from 11 to 13 November. Five companies will be selected for the second edition of QEst Hack in Estonia. Each company will bring a complex business problem and its own data to the hackathon. They will be joined by individual participants and quantum experts from Estonia, Finland and Canada to explore whether quantum algorithms could offer a better way to solve these problems in the future. According to Kalev Kaarna, a member of the QEst Hack organising team and Business Development Manager in Metrosert’s sales team, Metrosert has consistently contributed to building Estonia’s quantum technology ecosystem and developing the country’s capabilities in recent years. “Estonia’s neighbouring countries are actively developing this field, and quantum technologies have already become a national technology and innovation priority in many European countries. To keep pace and avoid falling behind, Estonia must start building the necessary knowledge, experience and partnerships now,” Kaarna explained. “QEst Hack gives both companies and people who may become Estonia’s future quantum technology experts an opportunity to take a major practical step forward. They can work with real co
Nature: Quantum Information·2026-10-02
No generated summary available for this entry.
overview
The Quantum Insider·2026-10-02·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Silicon Quantum Computing and Schneider Electric advanced to Stage 2 of Australia’s Critical Technologies Challenge Program with A$3.6 million in funding to expand their quantum-enhanced energy forecasting work with UNSW Sydney. In Stage 1, SQC’s Watermelon quantum-enhanced AI chip improved next-day energy forecasting accuracy by an average of 20% against a classical benchmark, with gains of up to 41%. Stage 2 will expand the modelling to hundreds of Australian homes and integrate Watermelon directly into Schneider Electric ’s AI workflows. PRESS RELEASE — Silicon Quantum Computing (SQC) and Schneider Electric , a global energy technology leader, have progressed to Stage 2 of the Australian Government’s Critical Technologies Challenge Program (CTCP), receiving A$3.6 million (US$2.5m) in funding to continue their work in partnership with UNSW Sydney. Energy grids are under increasing pressure and urgent solutions are required. As rooftop solar, home batteries and electric vehicles become widespread, household energy systems have become more dynamic and difficult to predict. Schneider Electric uses advanced forecasting and optimisation technologies to help balance distributed energy resources, including forecasting when to switch back and forth to solar energy deployment. During Stage 1, the joint team explored whether SQC’s atomically engineered, quantum-enhanced AI chip, Watermelon, could improve the accuracy of Schneider Electric ‘s forecasting models. Watermelon generates quantum features that, when used alongside classical features, deliver richer models with greater predictive abilities. For companies like Schneider Electric , more accurate forecasting can improve the management of distributed energy resources, increase renewable energy utilisation and contribute to lower energy costs for consumers. Even modest improvements in forecasting accuracy can deliver these benefits, and Stage 1 results delivered well beyond that thr
Quantum Computing Report·2026-10-02·Doug Finke
No generated summary available for this entry.
overview
Original abstract
In part four of our five part series on quantum patents, Sinan Utku discusses the arguments both for and against the patent eligibility as an invention of entanglement swapping. The post Patenting Quantum Computing Innovations – Part 4: Entanglement Swapping appeared first on Quantum Computing Report .
Phys.org Quantum Physics·2026-10-02
No generated summary available for this entry.
overview
Original abstract
Once called a "pipe dream," quantum computers are now approaching practical use. Companies and research institutes around the world are in fierce competition to develop this technology, which has the potential to rapidly perform some calculations that are extremely difficult even for conventional supercomputers.
Quantum Computing Report·2026-10-02·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Scientists at Oak Ridge National Laboratory (ORNL) developed LuGo, an algorithm that significantly reduces the number of quantum gate operations needed for computational fluid dynamics (CFD) by over 95%. This was achieved by using classical supercomputers like Frontier for heavy initialization routines before quantum processing, cutting down 2,000,000 logic gates to 91,000. LuGo was validated on various quantum hardware platforms and is a step towards practical high-dimensional fluid simulations on quantum processors. The post ORNL Develops LuGo Algorithm on Frontier Supercomputer, Reducing Quantum Circuit Gate Counts by 95% for Computational Fluid Dynamics appeared first on Quantum Computing Report .
PRX Quantum
·2026-10-02
·Anonymous
·doi
No generated summary available for this entry.
overview
Quantum Science and Technology
·2026-10-02
·Jing Wu et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract Entangling distant stationary qubits—such as superconducting qubits, color centers, trapped ions, and phononic modes—commonly relies on flying photons transmitted through noisy channels. &#xD;The fidelity of remote entanglement is severely degraded by channel noise. While entanglement purification can theoretically mitigate this effect, its practical implementation in quantum networks is limited by the overhead of local operations and classical communication. We propose a multi-time-bin encoding scheme that improves the fidelity of remote entangled stationary qubits without relying on entanglement purification. Our results show that, compared to single-rail (vacuum–one-photon) encoding, the fidelity in thermal-loss Gaussian channels is improved from 0.66 to 0.89. Taking superconducting qubits connected through microwave-to-optical transduction as a representative implementation, the fidelity is increased from 0.75 to 0.98. Finally, we discuss the prospects for extending the protocol to other stationary-qubit platforms.&#xD;
Quantum Science and Technology
·2026-10-02
·Kangze Li et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract In recent years, quantum lock-in detection has emerged as a promising technique to accurately detect weak signals submerged in background noise. However, the signal-to-noise ratio of existing protocols is severely limited by spectral leakage resulting from control operations implemented in pulse form. Here, we propose a general protocol for realizing quantum lock-in detection by employing successive quantum adiabatic evolution. In our protocol, the signal modulation is achieved by adiabatically controlling the time evolution of the quantum probe, which enables the implementation of triangular modulation functions. The realization of triangular-wave modulation fundamentally solves the problem of spectral leakage and facilitates the extraction of the complete characteristics of the target signals. We present a practical implementation scheme of adiabatic quantum lock-in detection based on nitrogen-vacancy centers in diamond, and demonstrate that the proposed protocol possesses strong resilience against experimental imperfections. Our results establish adiabatic quantum lock-in detection as a robust and experimentally accessible approach to detection of weak alternating signals in noisy environments, thus promoting the advance of real-world quantum sensing technologies.
Quantum Science and Technology
·2026-10-02
·Jie Gu, Kangqiao Liu
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract We derive a finite-frequency fluctuation-response inequality for Markovian open quantum systems in an input-output setting. For any downstream measurement of the emitted field, the measured lock-in response-to-noise matrix is bounded by the output-field quantum Fisher information rate. For dissipative amplitude modulation with vacuum inputs, this information rate is further bounded by a frequency-independent signal-channel activity, which reduces for kinetic modulation to the stationary channel fluxes. For a faithful stationary state, complete access to the Markov output, and horizontal dissipative tangents, we also evaluate the intermediate output-field quantum Fisher information rate explicitly and show that it equals the activity matrix. The result is detector-facing but unraveling-independent: it applies after choosing a measurement record, while the information ceiling is set by the quantum field before any detection scheme or trajectory representation is selected. We formulate the bound for multiple signal channels and real finite-frequency quadratures, and illustrate it with a single-sided cavity, resonance fluorescence, and a two-port truncated Kerr-parametric cat resonator exhibiting appreciable channel mixing and off-diagonal matrix effects.
Quantum Science and Technology
·2026-10-02
·Michael Krebsbach et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract Generative quantum machine learning models are trained to deduce the probability distribution underlying a given dataset, and to produce new, synthetic samples from it. The majority of such models proposed in the literature, like the Quantum Circuit Born Machine (QCBM), fundamentally work on a binary level. Real-world data, however, is often numeric, requiring the models to translate between binary and continuous representations. We analyze how this transition influences the performance of quantum models and show that it requires the models to learn correlations that are solely an artifact of the way the data is encoded, and not related to the data itself. At the same time, structure of the original data, like continuity, can be obscured in the binary representation, hindering generalization. To mitigate these effects, we propose a strategy based on Gray-codes that can be implemented with essentially no overhead, conserves structures in the data, and avoids artificial correlations in situations in which the standard approach creates them. Considering datasets drawn from various low-dimensional probability distributions, we verify that, in most cases, QCBMs using the reflected Gray code learn faster and more accurately than those with standard binary code. This shows that, as complement to specifically tailored circuit ansätze or data pre-processing, binary encodings can be used to introduce inductive biases into generative machine learning models.
Quantum Science and Technology
·2026-10-02
·Joseph Li et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract Transport phenomena play a key role in a variety of application domains, and efficient simulation of these dynamics remains an outstanding challenge. While quantum computers offer potential for significant speedups, existing algorithms either lack rigorous theoretical guarantees or demand substantial quantum resources, preventing scalable and efficient validation on realistic quantum hardware. To address this gap, we develop a comprehensive framework for simulating classes of transport equations, offering both rigorous theoretical guarantees---including exponential speedups in specific cases---and a systematic, hardware-efficient implementation. Central to our approach is the Hamiltonian embedding technique, a white-box approach for end-to-end simulation of sparse Hamiltonians that avoids abstract query models and retains near-optimal asymptotic complexity. Empirical resource estimates indicate that our approach can yield an order-of-magnitude (e.g., 42x) reduction in circuit depth given favorable problem structures. We then apply our framework to solve linear and nonlinear transport PDEs, including the first experimental demonstration of a 2D advection equation on a trapped-ion quantum computer.
Quantum Science and Technology
·2026-10-02
·Zi-Xu Lu et al.
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract The optomagnonic coupling between magnons and optical photons is an essential component for building remote quantum networks based on magnonics. Here we show that such a coupling, manifested as the magnoninduced Brillouin light scattering, can be exploited to entangle two propagating optical fields. The protocol employs two pairs of the whispering gallery modes coupled to the same magnon mode in a YIG microsphere or microdisk. In each pair a strong pump field is applied to activate either Stokes or anti-Stokes scattering. Due to the magnon mode involving in the two scattering processes and as a mediation, Stokes and anti-Stokes photons of different polarizations get entangled. The entanglement can be extracted by filtering the travelling output fields centered at the Stokes and anti-Stokes sidebands. Optimal conditions are identified under which strong output entanglement can be achieved.
Quantum Science and Technology
·2026-10-02
·Tiffany Duneau, Colin Krawchuk, Anna Naomi Pearson
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract Quantum machine learning holds the promise of combining the success of classical machine learning methods with the power of quantum computing, however one of the largest obstacles facing the field is the problem of barren plateaus. Parameterised quantum circuits offer a flexible framework for developing quantum machine learning models, but their practicality is constrained by a trade-off between trainability and classical simulability. In general, circuits that are sufficiently expressive to model complex behaviour often exhibit barren plateaus, where gradients vanish and optimisation fails.&#xD;&#xD;In this work we investigate a compositional approach to mitigate this trade-off. We exploit the recursive structure of Max-Clique by reusing a model trained on small graph instances to guide a sequence of induced-subgraph problems whose outputs are composed into a clique of the original graph. To ensure trainability of these subcomponents, we describe a framework for constructing group-invariant loss functions, which introduce symmetry-induced inductive bias and lead to improved gradient behaviour and generalisation. In particular, we use this framework to design permutation-equivariant quantum graph neural networks for identifying maximum cliques in graphs. The models we construct exhibit superior training trajectories through symmetry-induced bias, reaching accuracies up to 30% better than the un-symmetrised counterparts. Our experiments demonstrate that the trained models generalise to larger, more complex problem instances, which we demonstrate on 8 to&#xD;16 node graphs.&#xD;&#xD;Finally, inspired by Quantum-Informed Recursive Optimisation Algorithms [FKS+24], we implement a recursive hybrid quantum-classical heuristic using the learned quantum models to guide a classical search procedure, demonstrating improved inference accuracy and scalability. Together, these results suggest that compositional circuits could be a viable pathway towards scalable quantum learning models that remain challenging to reproduce classically.
Quantum Science and Technology
·2026-10-02
·Sinan Pehlivanoglu, Srinivasan Iyengar, Amr Sabry
·doi
No generated summary available for this entry.
overview
Original abstract
Abstract Classical simulation of quantum circuits is expensive for two distinct reasons. The obvious one is state-space size: an n-qubit system requires exponentially many amplitudes. The less obvious one is interference: useful output distributions emerge only after many computational histories have been coherently combined at common endpoints, and this aggregation step is itself a substantial source of cost. We introduce statistical interference sampling, a framework that makes this second bottleneck explicit by treating endpoint interference as a separately schedulable computation. Using the Chemical Abstract Machine (ChAM) as our model, weighted path contributions evolve as concurrent molecular species, and interference reactions combine contributions that share a common output state. A threshold rule terminates the process once an endpoint accumulates sufficient amplitude, discarding the remaining reactions. The method does not improve worst-case complexity and is not intended as a general-purpose simulator. Its purpose is to ask a more targeted question: how much of the interference calculation can be skipped while still recovering a useful output distribution? On benchmark circuits for Deutsch-Jozsa, Grover search, Simon's problem, and Shor period-finding instances, we find that nearly 50% of endpoint interference reactions can be omitted while maintaining over 90% output accuracy for most algorithms tested. Circuits with strong amplitude separation, where a large gap exists between the amplitude accumulated at the correct endpoint and the maximum amplitude attainable at any incorrect endpoint, benefit most from early termination; circuits with flatter output distributions, where valid outputs share comparable amplitudes across many endpoints rather than concentrating probability on a single marked state, are less amenable to this strategy. These results suggest that interference arithmetic is a structured resource that admits meaningful approximation, and that exposing it explicitly opens new opportunities for pruning strategies across path-sum, Pauli-path, and tensor-network simulation methods.
arXiv·2026-10-02·Cesar E. P. Villegas et al.
No generated summary available for this entry.
overview
Original abstract
We theoretically demonstrate tunable population transfer and entanglement generation in a two-exciton system coupled to a bimodal optical cavity, including an exciton-exciton exchange interaction. By using dressed-state transformations and Löwdin partitioning, we derive effective Hamiltonians that identify three dynamical time scales: local polaritonic oscillations, long-period dressed-state beats, and direct excitonic exchange. We apply the framework to graphene nanoribbon excitons, using excitonic energies, transition dipoles, and lifetimes obtained from first-principles calculations to parameterize the model. In the small- and moderate-exchange regimes, the dynamics become multiscale, and the beat channel sustains sizable quantum entanglement over long dissipative time windows. In the large-exchange regime, the excitonic Hamiltonian dominates and drives nearly complete population transfer between excitonic states over many coherent cycles. The resulting analytical expressions provide direct design rules connecting the beat period, transfer amplitude, and coherent-cycle number to the exchange interaction, cavity detuning, and light--matter coupling. Our results establish a controllable route for engineering long-lived entanglement and coherent excitonic operations in exciton--bimodal-cavity systems.
arXiv·2026-10-02·T. Daniel Crawford et al.
No generated summary available for this entry.
overview
Original abstract
PyCC is a Python-based quantum chemistry package that emphasizes coupled cluster and related methods. Developed over the last five years, PyCC's purpose is to provide a clear reference implementation that will serve as a validation suite for production code, a platform for rapid prototyping and testing of new methods, and an educational resource for newcomers to the field. The package covers both closed- and open-shell single-determinant references in spatial- and spin-orbital formulations for the coupled cluster hierarchy through triples-including methods such as CC3, as well as for MP2 and CI methods. PyCC provides a broad range of molecular properties such as analytic first and second energy derivatives including gradients, Hessians, polarizabilities and atomic polar tensors, as well as non-energy-derivative properties, such as velocity-gauge atomic polar tensors and diagonal Born-Oppenheimer corrections, plus dynamic linear response functions, and excitation energies. The package includes a number of unique capabilities, such as real-time CC propagation (up through CC3), atomic axial tensors for simulating vibrational circular dichroism spectra at the MP2 and CI levels, and local correlation methods including perturbation-aware correlation domains. The code is designed around a shared Wavefunction base and a method-agnostic derivative layer that enables a new method to inherit the full property set once it supplies its reduced densities and their first-order responses. PyCC is fully open source and available on GitHub under the BSD 3-clause license.
arXiv·2026-10-02·Prem B. Karki et al.
No generated summary available for this entry.
overview
Original abstract
Understanding quantum interactions in van der Waals magnets are critical to realizing their potential for next-generation magnetic, electronic, and spintronic applications. In this study, we investigated the evolution of exchange and dipole-dipole interactions in van der Waals magnet CrCl3 using multifrequency broadband (1-16 GHz) magnetic resonance on a bulk single-crystal CrCl3 sample. We found that the dipolar-broadened low-field resonance linewidth narrows due to exchange narrowing at higher resonance fields. Our findings show that the exchange interaction evolves exponentially as we lower the sample temperature from room temperature to 50 K. However, we found that the dipole-dipole interaction remains constant in the same temperature range. We have also detected the half-field magnetic resonance transition at room temperature, indicating a robust dipole-dipole interaction among spins. The measured inter-spin distance is 2.4(3) A at room temperature. The evolution of dipole interactions, the observation of half-field magnetic resonance, and the strong exchange interaction indicate short-range ordering/correlation in CrCl3 at temperatures far above the magnetic global ordering temperature. This study also demonstrates the significance and sensitivity of the multifrequency electron spin resonance technique for understanding quantum interactions and magnetic correlations in van der Waals magnetic materials.
arXiv·2026-10-02·Kazunari Hashimoto, Chikako Uchiyama
No generated summary available for this entry.
overview
Original abstract
Simulating open-system dynamics on gate-based quantum computers offers a route to exploring dissipative quantum phenomena through programmable quantum processing. Collision models provide a direct and flexible framework by representing the environment through sequential system--ancilla collisions. At finite temperatures, however, they typically require repeated preparation of thermal ancillas, adding circuit overhead and gate errors. Here, we show that, for a broad class of $U(1)$-symmetric system--ancilla interactions, finite-temperature dynamics can instead be reconstructed from simulations with pure ancillas in orthogonal basis states. The target temperature enters only through classical post-processing of the resulting pure-branch data, allowing the same data to be reused for different temperatures without additional quantum processing. Bypassing explicit thermal-state preparation reduces ancilla-preparation overhead and preparation-induced errors.
arXiv·2026-10-02·Clément de Terrasson de Montleau, Victor Drouin-Touchette, Wesley Coelho
No generated summary available for this entry.
overview
Original abstract
Neutral atom-based quantum computers have the ability to dynamically reshape the qubit register geometry between experimental runs. This capability enables different types of problems to be mapped directly onto the hardware, significantly enhancing the efficiency of solving, for instance, complex optimization and machine learning use-cases. However, this flexibility requires finding atom positions to implement target pairwise interactions, inducing a difficult nonconvex optimization for setting up the quantum machine. In this work, we introduce a new force-directed method that targets interactions to encode the input problem on the quantum computer. Numerical results show that our new method can improve embedding feasibility and solution quality by orders of magnitude, and remains reliable on the largest instances.
arXiv·2026-10-02·Shirwan Abdullah
No generated summary available for this entry.
overview
Original abstract
A small excitation gap makes a quantum dot a sensitive probe of a weak electric field, but the charge detector that reads the probe can also excite it. We ask how much of this gap enhancement survives continuous readout, for two interacting electrons tuned through a confinement-driven crossover in a gate-defined quantum dot, using a weak-coupling, stationary two-level model. The answer depends on the energy structure of the detector, not only on its noise. A quantum point contact measures more strongly at higher bias, but once the bias energy exceeds the gap it also excites the probe. When this back-action dominates the probe's own relaxation, the optimised mean-current information rate grows only as the inverse of the gap. A sensor quantum dot with a narrow level instead reaches full measurement strength at a bias below the gap, where, for a non-interacting detector and to second order in the coupling, it cannot excite the probe at zero temperature. This energy-filtered readout keeps the inverse-square gap dependence of the quantum Fisher information, down to a gap set by the detector's level width and the electron temperature. Through such a detector the interacting pair gives about three times the information rate of a single electron with the same gap and detector, compared with 1.6-1.7 in the quantum Fisher information, for both contact and Coulomb-type interactions. These different gap dependences, and the different optimal biases of the two detectors, can be tested by bias and gate sweeps on suitably tuned charge-sensed double dots.
arXiv·2026-10-02·Ankit Kundu et al.
No generated summary available for this entry.
overview
Original abstract
We develop a quantum input-output theory for open photonic systems based on macroscopic quantum electrodynamics using the first-order electromagnetic Green's function. Quantum fields enter and leave the photonic system through waveguide ports, while the electromagnetic Green's function propagates the fields through the arbitrary interior of the photonic system, which may be dispersive and absorbing. The resulting relation contains a port-to-port scattering matrix and a Langevin-noise contribution from material absorption that together preserve the bosonic output commutation relations. For embedded emitters, the low-saturation and single-excitation scattering response is determined by Green's functions connecting the ports and emitters while retaining the non-Markovianity of the photonic environment. Using finite-difference time-domain simulation, we calculate the emitter-modified transmission for a nanophotonic cavity and inverse-designed coupler, providing a direct route from computed electromagnetic response to a quantum input-output model.
arXiv·2026-10-02·Sachin S. Bharadwaj, Katepalli R. Sreenivasan
No generated summary available for this entry.
overview
Original abstract
Extreme values of a physical system are rare by definition, yet they can govern some of its most consequential and anomalous behavior. Their sparsity makes them particularly costly to identify in large data sets. Quantum computation offers a potential way to reduce this cost. The challenge is that quantum amplitudes cannot simply be read, copied, compared, or marked using conventional search oracles. Here we introduce an algorithm for searching amplitude-encoded quantum signals that exploits their underlying structure. Through a nonlinear amplitude transformation, the algorithm identifies and certifies a global extremum while exponentially reducing the effective search space for structured signals. We establish a polylogarithmic query complexity in the data size $N$, together with global completeness, efficient classical verification, and a measurable criterion for quantifying exploitable structure. We demonstrate the framework using computational turbulence data. Applied to line cuts of velocity gradients from a $1024^3$ simulation containing more than one billion grid points, the algorithm consistently isolates the extreme tail and reduces the median search space to $O(\log N)$. The clustered structure characteristic of turbulence further accelerates the search. These results establish a direct connection between physical structure and quantum advantage in extreme-value search. For accessibility, the main text emphasizes the central ideas and results, while the theoretical derivations are provided in the Appendices.
arXiv·2026-10-02·Jan Kochanowski
No generated summary available for this entry.
overview
Original abstract
We introduce and study multi-indexed Schatten spaces which lift the commutative $\ell_{q_1}\![\ell_{q_2}\![\ell_{q_3}\![\dots]]]$ -spaces to the quantum toolbox. They extend Pisier's operator-valued Schatten norms and the recently introduced two-indexed Schatten quasi-norms. For every ordered tuple $\mathcal{Q}=(q_1,\dots,q_n)$ of non-zero indices we define a quasi-norm (for positive indices) or an anti-norm (for negative indices) on operators on an $n$-fold tensor product of Hilbert spaces. We do this for indices of the same sign satisfying the mutual compatibility condition $|\frac{1}{q_i}-\frac{1}{q_j}|\leq1$. Beyond establishing desirable properties of these quasi- and anti-norms via factorization formulas that combine operator space and matrix-analytic techniques, we lift several central tools and results of the seminal [Devetak, Junge, King, Ruskai, CMP 2006] to the multi-indexed and quasi-normed setting. These include a general non-commutative Minkowski inequality relating swapped systems and two identity-removal equalities. As a consequence, complete hypercontractivity and complete reverse hypercontractivity tensorize for all compatible indices, including negative ones. Concerning quantum information theory we prove that the completely bounded minimal and the maximal output conditional entropies are additive under tensor products of quantum channels for all $α\geq\frac12$. This extends the case $α>1$ of [Fawzi, Kochanowski, Rouzé, Van Himbeeck, CMP 2026] and the unconditional results of [Devetak, Junge, King, Ruskai, CMP 2006]. Beyond tensor products, we establish chain rules for $\tilde H^\uparrow_α$, $α\in[\frac12,1)$, for compositions of possibly signaling channels, extending upon the smooth max-entropy chain rule used in device-independent entanglement certification to the whole interval $α\in[1/2,1)$.
arXiv·2026-10-02·Ganga Singh Manchanda
No generated summary available for this entry.
overview
Original abstract
Algorithms which prepare states via the variational principle assume that closeness in energy implies closeness in state; we formalise how this assumption can fail by showing that a ground-state energy estimate converged to within $ε$ of the true value is compatible with observable expectation values in error by up to $\sqrt{2εχ_O}$ at leading order, where $χ_O$ is the static susceptibility of the observable. As a result, the observable error can be orders of magnitude larger than the energy error, a mechanism we call non-linear error amplification, and because a variational algorithm cannot guarantee the correctness of these properties from energy alone, energy does not necessarily certify an observable. In light of our findings, we examine three algorithms: the variational quantum eigensolver on the transverse-field Ising chain, the density-matrix renormalisation group on a pair of weakly coupled hydrogen chains, and Krylov quantum diagonalisation on lithium fluoride. In each case we demonstrate that a well-converged energy can leave observables uncertified.
arXiv·2026-10-02·Laurens Walleghem
No generated summary available for this entry.
overview
Original abstract
Despite its remarkable empirical success and predictive power, quantum theory is riddled with mysteries. One such conceptual puzzle is the measurement problem: why do quantum systems in superposition collapse to a single-valued outcome upon being measured? The scenario of Wigner's friend illustrates this tension, with recent extensions deriving strong no-go results for the nature of reality. Another fundamental puzzle arises at the interface of quantum theory and general relativity---the black hole information paradox. This thesis further explores these two foundational paradoxes. Part I of this thesis focuses on extensions of the Wigner's friend scenario. We introduce several novel extended Wigner's friend arguments, and establish connections with notions of nonclassicality, i.e. the study of quantum phenomena that evade classical explanation. Key results are a refined version of the Frauchiger--Renner paradox, new extended Wigner's friend scenarios based on contextuality, and an argument against the absoluteness of free choices based on the Pusey--Barrett--Rudolph theorem. The latter result complements the Local Friendliness no-go theorem, which challenged the absoluteness of experimentally obtained measurement outcomes. In Part II of this thesis, we turn to black hole puzzles and the interplay of quantum theory and gravity. We present a paradox that unifies extended Wigner's friend arguments with black hole puzzles, strengthening the cloning and firewall paradoxes. After discussing subtleties in these paradoxes, we next present an analysis combining elements of quantum theory with gravity, analyzing the detector response near a superposed black hole using elements of quantum reference frames.
arXiv·2026-10-02·Corentin Delacour et al.
No generated summary available for this entry.
overview
Original abstract
Ising machines have emerged as promising hardware accelerators for intractable optimization and sampling problems, yet their practical impact increasingly hinges on the co-design of algorithms and hardware, where algorithmic demands shape new architectures and new hardware capabilities inspire entirely new algorithms. In this Review, we survey probabilistic algorithms designed for portability across diverse Ising platforms, advocating a top-down perspective that prioritizes principled methods with provable guarantees. We cover foundational methods such as simulated annealing and parallel tempering, including two-dimensional extensions that natively encode hard constraints, and examine approaches that expand the scale of solvable problems from cluster mean-field methods to variational samplers. We highlight the Probabilistic Approximate Optimization Algorithm (PAOA), a classical analog of QAOA that emerged directly from probabilistic hardware development, and explore how generative AI and Ising machines might reinforce each other: learned models propose global moves to accelerate optimization, while probabilistic techniques improve inference in large language models. Much as quantum computing has seen algorithms co-evolve with hardware, probabilistic and Ising computing stand at a similar inflection point. We outline a co-design framework for accelerating the capabilities and adoption of next-generation Ising machines.
arXiv·2026-10-02·Iason Tsiamis, David Petrosyan, Anders S. Sørensen
No generated summary available for this entry.
overview
Original abstract
Coherent microwave-to-optical transduction is essential for hybrid quantum networks. Typical transducers, however, have bandwidths set by fixed device parameters and face efficiency-bandwidth tradeoffs. We propose a cavity-based microwave-to-optical transducer mediated by a collective Rydberg excitation, where external driving fields tune the conversion bandwidth in situ from narrowband, spectrally selective operation to broadband operation without modifying cavity parameters. Under impedance-matching conditions, the system operates as a continuous-wave phase-preserving linear transducer, maintaining both near-unit efficiency and quantum-limited added noise throughout the tunable bandwidth range.
arXiv·2026-10-02·Cian C. Reeves et al.
No generated summary available for this entry.
overview
Original abstract
The increasing complexity of 5G and emerging 6G wireless networks has intensified the need for scalable optimization techniques capable of addressing computationally challenging combinatorial problems. While quantum optimization offers a promising alternative, current near-term quantum hardware remains limited by qubit availability, noise, and scalability constraints. Pauli Correlation Encoding (PCE) has emerged as a qubit-efficient optimization framework that addresses these challenges through polynomial variable compression. However, the impact of compression on representability and solution recovery remains poorly understood. In this work, we investigate the hypothesis that increasing compression ratios introduce representability constraints arising from algebraic closure relationships among encoded Pauli observables. Using Maximum Independent Set benchmark problems, we evaluate multiple PCE ansatz designs and compression ratios. We find that ansatz selection is critical to both solution quality and feasibility, with two ansatz families consistently outperforming alternatives and achieving approximation ratios approaching 0.9. Furthermore, increasing circuit repetitions provides limited benefit and can degrade performance. Most notably, reducing compression by increasing the number of available qubits significantly improves raw solution quality, while post-processed performance remains comparatively stable. These findings suggest that representability effects play an important role in compressed PCE encodings and provide new insight into the relationship among compression, ansatz design, decoding, and solution quality in scalable quantum optimization.
arXiv·2026-10-02·Domagoj Perkovic, Ziwei Wang, Steven Herbert Simon
No generated summary available for this entry.
overview
Original abstract
Recent experiments in monolayer and trilayer graphene have observed incompressible even-denominator fractional quantum Hall states within narrow regions of parameter space associated with crossings of zeroth Landau levels. This is surprising because at half filling the Coulomb interaction in the zeroth Landau level is expected to favour a compressible composite Fermi liquid. Here we provide the first quantitative energetic study of the candidate incompressible phases and of the microscopic mechanisms that can stabilise them near such Landau-level crossings. Using exact diagonalization and infinite density-matrix renormalisation group, we first study ultra-short-range corrections to the Coulomb interaction arising from finite layer separation, lattice-scale effects, and electron-phonon coupling. We find that a sufficiently strong attractive short-range interaction drives the composite Fermi liquid first into a weakly paired \(d\)-wave pseudospin-singlet state and subsequently into a strongly paired state. However, microscopic estimates of these short-range corrections are far too small to stabilise either incompressible phase. We then incorporate Landau-level mixing through screening within the random-phase approximation. Screening substantially reshapes the effective interaction, suppresses the weak-pairing regime, and strongly enhances the tendency toward strong pairing. For a realistic range of microscopic parameters, the strongly paired phase is stabilised over a substantial fraction of that range. Our results identify the interplay of Landau-level mixing and ultra-short-range interactions as a plausible microscopic mechanism for the experimentally observed incompressible states in monolayer and trilayer graphene and point toward a strongly paired composite-fermion phase as their candidate ground state.
arXiv·2026-10-02·Kathleen Chang et al.
No generated summary available for this entry.
overview
Original abstract
Non-Clifford operations required for universal quantum computation can be implemented by measuring logical Clifford operators. We present a generalized framework to fault-tolerantly measure transversal Clifford logical operators in quantum low-density parity check (QLDPC) codes. Our protocol takes any QLDPC code and deforms the code across additional ancillary qubits such that a product of stabilizers measures the desired logical Clifford operator. We prove that the deformed, Clifford-stabilized code remains LDPC and that its distance is preserved up to a constant factor independent of the number of physical qubits. We further prove that the Clifford measurement has a fault distance against data qubit and measurement errors that grows linearly with the distance of the original code. We apply our methods to implement logical non-Clifford gates in algorithmically relevant subroutines and to prepare magic states in quantum stabilizer codes.
arXiv·2026-10-02·Justin Roy Cox et al.
No generated summary available for this entry.
overview
Original abstract
Span programs provide a general method for designing quantum query algorithms, and for Boolean coordinate queries their optimum cost agrees with the general adversary bound. We develop a matroidal organization of this optimization that separates dependence data determined by the query problem from the dependence structure chosen by a span program. The resulting source matroid records query dependence, target determination, and separation data, while a program matroid records dependencies among the target and response-labeled input elements of a candidate program. When a query problem admits a source matroid, we use its structure to organize adversary upper and lower bounds. For separating binary query sets in this setting, the global matroid-span-program optimum equals $\mathrm{Adv}^{\pm}_{\mathcal Q}(f)$. For a fixed regular program matroid, projective uniqueness reduces optimization over real representations to positive element weights. We express positive and negative costs as weighted basis ratios and derive exact $1$-, $2$-, and $3$-sum reductions, giving a compositional evaluation of the fixed-weight objective along a Seymour decomposition. For pointed $R_{10}$ closure, exact certificates give $3.9087553<\mathrm{Adv}^{\pm}_{\mathcal Q_R}(f_R)<3.9301$. The natural $R_{10}$ program has optimized cost $5$, while another regular program has cost at most $\sqrt{87/5}$. Recursive self-composition yields a family on $N$ input bits with randomized query complexity $Ω(N^{0.7324867\ldots})$, an explicit quantum algorithm using $O(N^{0.6500178\ldots})$ queries, and $Q(F)=Θ(N^α)$ for $0.6204277\ldots<α<0.6229063\ldots$.
arXiv·2026-10-02·Jorge Sánchez-Segovia, Álvaro M. Alhambra
No generated summary available for this entry.
overview
Original abstract
The sign problem remains a major obstacle to extending the success of Monte Carlo methods to generic quantum many-body systems. A powerful alternative relies on cluster expansions, which provide convergent representations of free energies and related quantities, with applications ranging from tensor network contractions to quantum dynamics and circuits. Within their convergence regime, these expansions often yield deterministic polynomial-time algorithms. However, such methods require exhaustive enumeration of connected clusters, leading to a computational overhead of $(N\varepsilon^{-1})^{\mathcal{O}(\logΔ)}$, where $N$ is the system size, $\varepsilon$ the desired precision, and $Δ$ the interaction-graph degree. This becomes particularly severe in long-range systems, where $Δ\equiv N$, resulting in quasi-polynomial runtimes. Here, we introduce a Markov chain algorithm that samples cluster expansions directly in the space of connected clusters, replacing deterministic enumeration by Monte Carlo sampling. Because sampling occurs in an abstract cluster space rather than a physical configuration space, the conventional exponential sign problem is absent within the convergence regime. For general polymer models, we establish an FPRAS with runtime $\tilde{\mathcal{O}}(N^4\varepsilon^{-3})$. For quantum partition functions at temperatures $β\leqβ_{\mathrm{sampling}}\equiv\mathcal{O}(1)$, this improves to $\tilde{\mathcal{O}}(N^{3+1/D}\varepsilon^{-3})$, where $D$ is the lattice dimension. The framework directly applies to long-range quantum systems with interactions $\propto1/r^α$, including $2$-local models with $α>2D$.
arXiv·2026-10-02·Dorian Lauwerier et al.
No generated summary available for this entry.
overview
Original abstract
Analog quantum computing with neutral atom computers is rapidly evolving into a promising way to perform combinatorial optimization tasks at scale. As technology matures, exploring real use cases leveraging such unique information processors becomes warranted; one example is logistics management where vehicles are assigned routes to perform a given task. Autonomous aerial vehicles (drones) are increasingly used for surveillance over a given territory. In this paper, we propose an innovative framework integrating classical machine learning forecasts and quantum annealing to find the best combination of tours for a given surveillance criterion. The risk maps produced by machine learning are used to find possible surveillance tours, while a quantum-assisted heuristic chooses the best combination, producing a full surveillance plan. By modelling our decision problem for drone paths as a Team Orienteering Problem (TOP) with additional constraints, we construct a new heuristic using quantum annealing to find good solutions. We apply this framework to wildfire prevention, where finding tours most likely to detect a starting fire has clear benefits. We study the effect of larger quantum resources on heuristic performance and compare those results to the use of classical resources.
arXiv·2026-10-02·Shrey Chowdhary et al.
No generated summary available for this entry.
overview
Original abstract
When the two largest eigenvalues of an entanglement or negativity spectrum meet, the gap of the corresponding entanglement or negativity Hamiltonian closes while entropies stay smooth, an event we call a temporal criticality. We ask when such criticalities occur in open fermionic systems, in which order, and whether they precede the geometric decoherence time, at which the negativity starts to fall. We compare loss and gain, which respect fermion parity only on average (weak symmetry) and keep the state Gaussian, with density dephasing, which respects it in every jump (strong symmetry) and makes the state non-Gaussian. We find that Gaussianity, rather than the symmetry, fixes the criterion for a criticality. In a Gaussian state the entanglement gap of a subsystem closes exactly when its two parity sectors carry equal weight, and the negativity gap closes exactly when this happens for the subsystem or its complement, so the negativity criticality never comes after the entanglement one. Uniform balanced loss and gain only shrink the two parities and leave both criticalities in place at every rate, for any quadratic Hamiltonian. In an open Kitaev chain, weak imbalanced loss and gain shift the criticalities by amounts set by the occupations at the cut, and at strong rates they allow a closing near the relaxation time only when an odd number of neighboring sites pass half filling. For dephasing we solve the non-Gaussian dynamics exactly at the point where the bond terms of the chain commute. Weak dephasing delays both criticalities and, away from the chain ends, moves them ahead of the parity balance, where the parity rules of Gaussian states would place them. As the dephasing rate approaches critical damping, both criticalities recede to infinite time, and at strong dephasing the negativity starts to fall long before either gap begins to shrink.
arXiv·2026-10-02·Thiago O. Maciel et al.
No generated summary available for this entry.
overview
Original abstract
Quantum signal processing (QSP) realizes operator functions through polynomial transformations of a finite degree. In addition to function approximation errors, realistic implementations incur algorithmic errors also when encoding the input operator and in synthesizing gates into a discrete fault-tolerant gate set. We provide an end-to-end analysis of these errors and show that the input error propagation is governed by the operator-Lipschitz constant $L_\star$ of the implemented function. We then derive an efficient classical algorithm to compute tight lower and upper bounds on $L_\star$, and we show that these bounds induce in turn lower and upper bounds on the total quantum-resource cost (for instance, $T$-gate count) needed for QSP implementations compatible with a target total error. We further devise a procedure to search for a polynomial with minimum cost based solely on its coefficients, yielding a resource-aware polynomial-design procedure for QSP. We illustrate the resulting method for ground state energy estimation via eigenvalue thresholding for the H$_6$ molecular Hamiltonian. In the tested hardware profiles, the resource-aware family improves the total-error budget and reduces the modeled $T$-gate count by $51.9\%$--$56.7\%$ relative to the standard analytical polynomial obtained from an error-function approximation.
arXiv·2026-10-02·F. Alet et al.
No generated summary available for this entry.
overview
Original abstract
We present release 3.0 of the ALPS (Algorithms and Libraries for Physics Simulations) project, an open-source software project to develop libraries and application programs for the simulation of strongly correlated quantum lattice models such as quantum magnets, lattice bosons, and strongly correlated fermion systems. As in previous releases, development is centered on common data formats, on libraries to simplify and speed up code development, and on full-featured simulation programs that let non-experts carry out serial or parallel numerical simulations using the important algorithms for quantum lattice models: classical and quantum Monte Carlo (QMC) using non-local updates, extended-ensemble simulations, exact and full diagonalization (ED), the density matrix renormalization group (DMRG), and continuous-time QMC solvers for dynamical mean-field theory (DMFT). Major changes in release 3.0 include distribution of the pyalps binary through the Python Package Index (pip install pyalps) and through Spack for HPC systems; migration of development to GitHub with continuous integration and automated testing; relicensing of the package under the permissive MIT license; a rebuilt documentation and tutorial website, including a set of Jupyter-notebook tutorials and localized content; a broad modernization of the C++ codebase (C++17 compliance, Boost and NumPy 2.0 compatibility, and warning and dead-code cleanup) together with a major DMRG update and associated reliability and build-compatibility fixes; the removal of legacy components (the VisTrails provenance integration and the TEBD, MPS, and directed-worm-algorithm application codes); archival of release 3.0.0 with a Zenodo DOI (10.5281/zenodo.22775899); and a formal governance and sustainability model developed under the US National Science Foundation (NSF) POSE program. The software is available at https://alps.comp-phys.org.
arXiv·2026-10-02·Pablo Martinez-Azcona et al.
No generated summary available for this entry.
overview
Original abstract
Krylov subspace methods provide an efficient tool for modeling any quantum initial value problem as a one dimensional chain. A time ordered path formulation, in which the dynamical generator successively splits probability between paths, yields a speed limit within such dynamical subspaces. For power law growing Lanczos coefficients $b_n \sim n^δ$ we find super ballistic lightcones, with an exponentially spreading lightcone for maximal growth $δ= 1$. Causality in the Krylov chain constrains the Lanczos coefficients to grow at most linearly. We illustrate the validity of the above in the $SL(2, R)$ and Heisenberg Weyl algebras, and in a many body skew field Ising model. Moreover, we extend the above bound to the family of $Q$ complexities. Lastly, mapping to a spin chain gives a Lieb Robinson bound analogue and opens the problem to standard condensed matter methods.
arXiv·2026-10-02·Pradip Kattel
No generated summary available for this entry.
overview
Original abstract
We present a method for constructing time-dependent integrable chiral quantum field theories on a finite spatial interval from the scattering and reflection data of an autonomous integrable model. Each particle carries a spectral label that is constant along its free trajectory. Requiring a right--left scattering event at a fixed time to be independent of its position forces the map from characteristic coordinates to spectral labels to be affine, with the same slope for both chiralities. As a result, all bulk scattering events at a given time sample one common spectral argument, and the two boundary reflections sample the corresponding endpoint arguments. The bulk and boundary drives are not independent time-dependent deformations: their time dependence is fixed by the same affine spectral coordinate. Successive reflections at the two endpoints translate the spectral label by a finite amount. Following a particle through a complete round trip then produces a difference transport whose consistency gives the boundary quantum Knizhnik--Zamolodchikov equations. The Yang--Baxter and reflection equations ensure local compatibility, while BqKZ flatness ensures compatibility of complete round trips. We then reconstruct the local Hamiltonian by inverting the one- and two-particle matching problems. The bulk matrix fixes the contact interaction, while the reflection matrix fixes the corresponding boundary coupling. The same autonomous factorized data determine the boundary qKZ transport problem and the local driven Hamiltonian. Once the boundary qKZ system is solved, its characteristic pullback gives the corresponding time-dependent many-body wavefunction. We illustrate the construction with rational $SU(N)$ models and an $O(3)$-invariant model with dynamical boundary impurities, obtaining driven Kondo interactions whose couplings are fixed by the same affine spectral coordinate.
arXiv·2026-10-02·Moritz Lange et al.
No generated summary available for this entry.
overview
Original abstract
Neural decoders for quantum error correction have achieved high accuracy on surface code memory experiments, but practical fault-tolerant computation requires decoders that transfer across devices, noise conditions, and logical operations. We introduce a modular graph-recurrent decoder designed for this setting. Built from reusable local syndrome encoders, it is pretrained in simulation and fine-tuned to hardware using a common pipeline, with only lightweight spatial aggregation adapted between experiments. The decoder performs competitively on conventional memory benchmarks, outperforming minimum-weight perfect matching (MWPM) at distances 3 and 5 on an IBM Nighthawk-generation processor and closely approaching AlphaQubit on Google's below-threshold hardware data. We then test the framework in two settings beyond memory decoding on the same IBM device. First, in an $X$-type stability experiment, we continuously tune the effective measurement error rate using a variable pre-readout rotation and train a single decoder jointly across the resulting noise range. It matches or outperforms MWPM across the sweep without requiring a separately calibrated decoder for each setting. Second, we decode a $ZZ$-merge lattice-surgery experiment between two distance-3 surface-code patches, improving the decoded correlation between the merge outcome and the final $ZZ$ parity relative to MWPM on real hardware. Together, these experiments demonstrate neural decoding that is portable not only across hardware, but also across qualitatively different surface code observables and logical operations, using models trainable on single-GPU academic resources.
arXiv·2026-10-02·Ryohei Kobayashi, Abhinav Prem, Matthew Yu
No generated summary available for this entry.
overview
Original abstract
We construct large families of mixed-state topological orders in (3+1)D, including intrinsically mixed-state topological orders. We realize these theories by relating the data parameterizing braided fusion 2-categories to the strong higher-form symmetries and their anomalies that characterize mixed-state topological order. We focus here on bosonic theories, which include theories which admit an emergent fermion in the spectrum of line operators. Our general framework is exemplified on the lattice, where we present concrete models and identify how the data of braided fusion 2-categories are physically encoded. We then formalize this data and show that every braided fusion 2-category arises from a general construction (decoherence followed by strong and weak gauging) as the category of topological operators of a (3+1)D mixed state, with intrinsically mixed-state topological orders distinguished by the presence of strong higher-form symmetries whose anomalies cannot be realized in any (3+1)D gapped ground state. Notably, we show that (3+1)D admits a new mechanism with no (2+1)D counterpart: intrinsically mixed-state order whose topological operators braid non-degenerately, but which carries a gravitational anomaly.
arXiv·2026-10-02·Paul Cazeaux, Marius Junge, Diyi Liu
No generated summary available for this entry.
overview
Original abstract
Dissipative protocols offer a route to ground state preparation that does not require a large initial overlap with the ground state. To move beyond time independent Lindbladians and randomized Lindbladians sampled from a fixed distribution, we study driven-dissipative protocols in which the generator varies over time. Our construction uses a family of randomized Lindbladians whose jump operators are obtained by averaging the unitary evolution of random matrices under a fixed target Hamiltonian. We show that empirical averages of these Lindbladians drive arbitrary initial density matrices to low energy states. The resulting mixing time bounds depend on the Hamiltonian only through its eigenvalue distribution and remain valid even for cold starts.
arXiv·2026-10-02·Igor Bandos, Bohdan Zvorskyi
No generated summary available for this entry.
overview
Original abstract
We demonstrate that Maxwell electrodynamics interacting with a planar Chern-Simons interface does not have plane wave solutions localized on the interface. We re-examine the derivation of such waves presented by N. Kaloper in [Phys.Rev.D114(2026)L051903] and show that at an intermediate step certain terms were missed in an equation therein. Taking these terms into account changes the final conclusion of [Phys.Rev.D114(2026)L051903]. We also show that the method used in [arXiv:2606.12513 [hep-th]] to reproduce the same result is not consistent.
arXiv·2026-10-02·Hassan Ugail
No generated summary available for this entry.
overview
Original abstract
A recent trapped-ion experiment realised a lattice gauge theory in which the internal states of the ions carry the gauge field and their vibrations carry bosonic matter. In that experiment, a charge moving around a loop was frozen in place by Aharonov--Bohm interference. The noise of such a device is usually simulated after the measurements have been made. Here we show that it can be predicted before the machine is run. For each quantity that the experiment measures, we derive, from the reported noise rates alone, a formula for how it decays together with a bound it can never exceed. The results reveal a simple pattern. The local conservation law of the theory is a parity of the vibrational mode, so heating violates it at a rate that grows as the mode warms, and the violation accelerates rather than accumulating steadily. At zero electric field, each of the three noise processes of the device leaves its own fingerprint. Heating affects only the conservation law, motional dephasing only the interference, and qubit errors only the stored flux and the frozen state. Once the electric field is switched on, the frozen state begins to leak, and we write an exact formula and a guaranteed bound for that leak.
arXiv·2026-10-02·Boldizsár Poór et al.
No generated summary available for this entry.
overview
Original abstract
Fault-tolerant preparation of logical states is a critical primitive for the realization of large-scale fault-tolerant quantum computing. This paper introduces SpiderCSS, a scalable compilation pipeline that generates highly-optimized, fault-tolerant state preparation circuits for arbitrary Calderbank-Shor-Steane (CSS) codes. Starting from an idealized specification of a CSS state, we use the ZX-calculus and fault-equivalent rewrites to construct a diagram that prepares the given state while preserving the fault tolerance of the initial ideal ZX-diagram. From this diagram, SpiderCSS constructs a fault-tolerant CSS-state preparation circuit using a modular construction that is CNOT-minimal both within each component and also in the way these components are connected together. By only using fault-equivalent rewrites, the final circuit is provably fault-tolerant without needing expensive verification. Monte Carlo simulations across a variety of CSS codes up to distance 15 show that SpiderCSS scales efficiently and constructs circuits with substantially reduced depth and qubit footprint compared to existing scalable and heuristic methods, while simultaneously achieving an average decrease of 33.7% in logical error rate and an increase of 9.5% in acceptance rate.
arXiv·2026-10-02·Aditya Gulati, Dakshita Khurana, Kabir Tomer
No generated summary available for this entry.
overview
Original abstract
We provide the first evidence relative to a classical oracle that pseudorandom unitaries (PRUs) can exist without quantum-computable one-way functions. To obtain this result, we first prove that five independent random diagonal phase layers interleaved with Hadamard transforms \[ U=F_5HF_4HF_3HF_2HF_1 \] form a strong PRU with security under adaptive, controlled access to the unitary, its inverse, transpose, and complex conjugate. Our main result is that, when the phase layers are implemented using a classical random oracle O, the construction remains secure against uniform BQP adversaries with coherent access to suitable Boolean completions of classical-input $QMA^{PH}^{O}}$ decision problems. Such an adversary can invert (even quantum-computable) one-way functions and solve efficiently verifiable one-way puzzles defined relative to O. Our result therefore provides classical-oracle evidence that PRUs do not imply quantum-computable one-way functions, in the form of a black-box separation. We substantially strengthen the classical-oracle result of Kretschmer, Qian, and Tal (STOC 2025) by obtaining PRUs secure against these QMA-aided adversaries. Our construction also consists of a simple, efficient circuit that queries a random function, suggesting a route to concrete implementation via the random-oracle heuristic.
arXiv·2026-10-02·Christoph Hirche
No generated summary available for this entry.
overview
Original abstract
Recent examples have shown that zero private capacity need not imply antidegradability and that two channels with zero private capacity can nevertheless transmit private information together. Existing entropic channel orders compare what a receiver and its environment can learn and thereby bound capacities. We connect these orders to the recent constructions through binary estimation, whose minimum mean-square error is governed by measured $χ^2$ divergence. A new integral representation shows how measured $χ^2$ on a qubit extension recovers quantum $χ^2$. It lets us pass from complete measured-$χ^2$ ordering to complete quantum-$χ^2$, relative-entropy, and less-noisy ordering. Zhu and Wang used a signed lift to show that their qutrit channel has zero private capacity. We show that Hermitian-smoothed measured-$χ^2$ ordering characterizes when such lifts exist, even with a quantum reference. Environmental dominance in binary estimation at every blocklength yields a finite-code reliability--secrecy bound. These results explain why complete comparison prevents activation with antidegradable helpers whereas regularized comparison alone does not. Building on that qutrit example, we establish this stability for a range of noisy Werner--Holevo channels, determine sharp private-capacity and antidegradability thresholds, and compute exact complementary capacities in a nondegradable range. By contrast, we extend Pauli half-erasure activation to all $1/2\le p<1$ and establish the same range for a new four-level family. Reference-assisted measured-$χ^2$ witnesses show why these activating constructions lack complete comparison.
arXiv·2026-10-02·William Kretschmer, Ewin Tang
No generated summary available for this entry.
overview
Original abstract
We show that if quantum commitments exist, then either there is no polynomial-time solution to the unitary synthesis problem, or $\mathsf{BPP} \neq \mathsf{NEXP}$. Thus, showing unconditionally that quantum commitments exist would require answering at least one of two longstanding open questions in complexity theory. We prove our main result as a consequence of a more general lemma, which shows that every unitary in $\mathsf{unitaryPSPACE}$ either cannot be synthesized efficiently relative to any classical oracle, or can be synthesized efficiently with an oracle for $\mathsf{NEXP}$ search problems. Our lemma has other noteworthy consequences, including that certain oracle separations involving $\mathsf{unitaryPSPACE}$ would imply breakthrough classical lower bounds such as $\mathsf{NC} \neq \mathsf{NP}$. Along the way, we propose new definitions for the unitary complexity classes $\mathsf{unitaryP}$ and $\mathsf{unitaryPSPACE}$. Our changes address the biggest conceptual issues with definitions suggested in prior work, and lead to elegant proofs. We study both implementations that erase garbage and implementations that allow it, because we cannot rule out the possibility that the two definitions differ. Nevertheless, we show that both definitions can be viewed as special cases of each other. We also showcase many other ways in which our definitions are robust. For example, we show that $\mathsf{unitaryPSPACE}$ has an equivalent characterization as the set of unitary transformations whose entries can be computed to arbitrary precision in polynomial space. Consequently, we deduce that $\mathsf{unitaryPSPACE}$ can generically erase garbage, a result that provably fails relative to unitary oracles.
arXiv·2026-10-02·Siddhartha Jain, Alexander M. Dalzell, Connor T. Hann
No generated summary available for this entry.
overview
Original abstract
We present a blueprint for implementing the physical QRAM operation in a scalable, passive manner, proving its feasibility in principle. Our construction is passive because for an $n$-qubit address over $N = 2^n$ memory bits the energy cost per QRAM query is $O(\log N)$, and to our knowledge it is the first construction to use $\operatorname{polylog} N$ energy. The runtime for each query is $O(\log^2 N)$. It is achieved by evolving a pre-manufactured time-independent 4-local Hamiltonian with $O(N)$ terms where every qubit participates in at most 4 terms.
arXiv·2026-10-02·Oliver Reardon-Smith
No generated summary available for this entry.
overview
Original abstract
Recent algorithms for classical simulation of quantum mechanics have runtime whose superpolynomial component is given by a linear dependence on the number of terms required to write large tensor products of certain "magic" states as superpositions of "free" states (which may be stabilizer states, fermionic Gaussian states or others). Surprisingly little is known about the number of terms in such decompositions, called ranks (e.g. the stabilizer rank, fermionic-Gaussian rank etc.). For complexity theoretic reasons they are expected to grow exponentially in the number of tensor factors but, while exponential upper bounds are known for both the stabilizer and fermionic-Gaussian rank of magic states; the best known lower bounds on the stabiliser rank are quadratic, and no bounds on the fermionic-Gaussian rank are known beyond fixed constants. In this work we prove that any fermionic Gaussian decomposition of $\lvert M\rangle^{\otimes k}$ consists of $Ω(1.4^k)$ terms. Here $\lvert M\rangle$ is the most standard magic state for fermionic linear optics: the $4$ qubit state that may be consumed to implement a swap gate. We also prove essentially matching bounds on the $δ$-approximate rank of the same state, lower bounding it by the same quantity that bounds the exact rank, multiplied by a factor of $1-δ^2$. Our results on exact fermionic Gaussian rank apply directly to any product of $k$ fixed parity non-Gaussian states, although the same is not true of the approximate rank. Finally, we prove that the coherent state border rank of an $n$-mode bosonic Fock state with $m_j$ bosons in mode $j$ is exactly $\prod_{j}(1+m_j)$, answering a conjecture of Ref. [1] and obtain lower bounds on the approximate coherent state rank given by the same quantity multiplied by a function of the fidelity of the approximation, emphasizing the broad applicability of the method we employ.
arXiv·2026-10-02·Matthew B. Hastings, Alexander Schmidhuber
No generated summary available for this entry.
overview
Original abstract
We consider a class of redudancy-free Hamiltonians, which are those where the trace vanishes for any product of Hamiltonian terms in which at least one term appears an odd number of times. This includes Hamiltonians which are sums of products of Paulis with no relations between them. These Hamiltonians arise naturally in Hamiltonian Decoded Quantum Interferometry, which separates the hardness of preparing quantum states into two steps: a classical decoding step, and a step preparing the thermofield double state of such a redundancy-free Hamiltonian. We focus on the hardness of these Hamiltonians, both for intrinsic interest and to understand the complexity of the state preparation step in Hamiltonian DQI. We present several results showing that the problem becomes easy at quadratically lower temperature than for a general Hamiltonian, with the complexity at given inverse temperature $β$ depending on $β^2 d$, where $d$ is the degree of the anticommutation graph. We give an efficient classical algorithm for small $β^2 d$ to approximate the partition function, while for large $β^2 d$ we show that approximating the partition function is NP-hard. To this end, we introduce what we call an anticommutation glass, where frustration arises purely from anticommutation relations. We give a subexponential time quantum algorithm to prepare the thermofield state for small $β^2 d$, and present some results toward a polynomial time algorithm based on the Feiguin-Klich Hamiltonian. As a result of possible independent interest, we show that this Hamiltonian leads to a polynomial time algorithm for preparing thermofield double states of general Hamiltonians on an interaction graph of degree $d$ for $β\lesssim 1/d$. Finally, we show that estimating the ground state energy of redundancy-free Hamiltonians is QMA-complete.
arXiv·2026-10-02·Filippo Maria Gambetta, Sabrina Yue Wang, Raul A. Santos
No generated summary available for this entry.
overview
Original abstract
Correlation functions are central to understanding the behavior of quantum systems, with their spectra giving direct access to quasiparticle and collective excitations. However, the long-time evolution required for sufficient spectral resolution is challenging to reach for both classical and quantum simulations. In this work, we introduce a principled approach for extending time series of quantum correlation functions and reconstructing their spectral densities, based on their connection with covariance sequences of stationary stochastic processes. This connection enables us to apply Burg's maximum-entropy principle to find the least-committal extension compatible with the measured values of the correlation function, which corresponds to an all-pole autoregressive model whose coefficients solve a set of Yule--Walker equations. The resulting extension is positive semi-definite by construction, guaranteeing the positivity of the spectrum and the automatic satisfaction of its total spectral weight sum rule. The approach applies to both scalar and matrix-valued correlation functions, including those with highly structured or continuous spectra. The generalization to the matrix case makes it possible to trade simulation time for additional measured correlation functions, enabling accurate time-series extension and spectral reconstruction from short-time data, even in the presence of noise.
arXiv·2026-10-02·Lionel J. Dmello et al.
No generated summary available for this entry.
overview
Original abstract
A key goal in the foundations of quantum mechanics is to identify operational constraints characterizing physical theories. Bell inequalities do so for classical probability theory, while Tsirelson's bound provides a first step for quantum mechanics. Here, we address the dual question: Can one certify that all correlations predicted by quantum theory are actually realizable? In this work, we construct a finite number of two-body correlations such that the only probabilistic theory that (1) realizes them, and (2) does so in a way that is stable under iterated teleportation, is quantum theory. For $(\mathbb{C}^d)^{\otimes n}$, Condition (1) can be verified using $\operatorname{poly}(d,n)$ measurement settings. Condition (2) may be understood as a hierarchy of tests, one for each number $N$ of teleportation steps. There is thus a sense in which finite-dimensional quantum theory can be self-tested. In particular, one can certify the existence of Bell inequality violations larger than any that have been directly observed.
arXiv·2026-10-02·Joachim Favre, Armando Angrisani, Zoë Holmes
No generated summary available for this entry.
overview
Original abstract
How much can the action of an unknown unitary dynamics on one family of states reveal about its action elsewhere? We develop a general framework for out-of-distribution quantum dynamics learning based on the first and second moments of the input distribution. These define a notion of the bias and expressivity of an ensemble, which together control generalization between arbitrary pure-state training and testing distributions. Our framework shows that only studying the action of a unitary on random real states can learn its action on random complex states, that tensor products of unbiased pure-state ensembles preserve expressivity, and that single-qubit risks are independent of bias. It also recovers earlier locally scrambling results as loose special cases and yields tight product-to-Haar bounds. We conclude with a series of no-go results and limited generalization bounds for learning certain channels, which further serve to underscore the distinctive role of unitarity in enabling out-of-distribution generalization.
arXiv·2026-10-02·Alessandro Summer, François Jamet
No generated summary available for this entry.
overview
Original abstract
Fault-tolerant block encodings of structured Hamiltonians can reduce their non-Clifford cost in SELECT by selecting where an operator acts separately from what is applied. We construct permute-act-unpermute circuits whose CSWAP networks exploit the support geometry: a selected support is brought to a fixed target register, a shared local circuit acts there, and the permutation is undone. For supports of fixed size, the $T$ count of SELECT then grows with the system size rather than with the number of terms, without requiring translational symmetry or factorised coefficients. For two-site supports, we establish and attain the minimum CSWAP count within address-controlled networks of site transpositions. Compiled for Pauli terms, these circuits use $8SN+O(\log N)$ $T$ gates with $O(\log N)$ permutation work qubits, where $N$ is the number of system qubits and $S$ is determined by the support geometry, with $S=1$ for nearest-neighbour interactions and $S=3/2$ for all-to-all pairs. We also introduce a bridged CSWAP that retains and repairs a temporary AND across the target action. When the repair is Clifford, it halves the $T$ count of a matched forward-inverse CSWAP pair at the cost of one retained work qubit. For a Heisenberg ring, the complete block-encoding query reduces the $T$ count by a factor approaching 3 as the system size grows. For a five-orbital Anderson impurity model, which combines nearest-neighbour and all-to-all support geometries, the reduction is about 1.7 at large bath sizes. Both comparisons use the lowest-cost compiled baselines considered, at unchanged block-encoding normalisation and comparable peak ancilla counts.
arXiv·2026-10-02·Kishor Bharti et al.
No generated summary available for this entry.
overview
Original abstract
Recent work established that, for independent erasures, storing $K$ logical qubits for $S$ time steps with error at most $\varepsilon$ requires a spacetime cost of $Ω(S(K+\log(S/\varepsilon)))$. A matching construction was also given, but assumes ideal error correction. Here we show that the same scaling can be achieved with an explicit noisy error-correction circuit and efficient decoding, counting all state-preparation, gate, measurement, and wait locations, provided that the hardware supports long-range qubit connectivity and fast, reliable classical processing. Thus, reliability adds only a logarithmic overhead shared by all stored qubits. The construction works for sufficiently weak but otherwise general circuit noise, including faults during syndrome extraction and correlated faults, and for independent erasures it matches the best known lower bound up to constant factors. We attain this scaling using quantum Tanner codes, with each memory step consisting of one round of syndrome extraction followed by a fixed number of parallel classical decoder steps that reduce the residual error enough to keep later faults correctable, regardless of memory size, storage time, or target accuracy. Together, this gives exponentially small failure probability per step while keeping the cost of each memory step linear in the code size. The same analysis also extends to certain constant-depth logical Clifford operations.
arXiv·2026-10-02·Ángela Capel, David Pérez-García, Matteo Scandi
No generated summary available for this entry.
overview
Original abstract
Given a finite-range, non-commuting Hamiltonian on a 1D chain of finite spins, we prove a modified logarithmic Sobolev inequality with constant $Ω(1/\log n)$ for the heat-bath dynamics, a quasi-local Gibbs sampler, and for the regularised heat-bath dynamics. This implies rapid mixing of both samplers towards the Gibbs state in relative entropy and trace norm, with mixing times of order $\mathcal{O}(\log n\cdot \log(n/ε))$. The interactions may be spatially inhomogeneous. The proof combines weak quasi-factorisation of relative entropy, decay-of-correlation estimates, a uniform conditional local gap, and a buffered comparison between conditional entropy and quadratic energy. The resulting bounded entropy defect is removed using the global gap. To the best of our knowledge, this is the first proof of MLSI in the non-commuting regime.
arXiv·2026-10-02·Oscar Higgott et al.
No generated summary available for this entry.
overview
Original abstract
Realizing practical quantum computers requires quantum error correction, but the most widely implemented approach, the planar surface code, demands a substantial physical qubit overhead. Here, we demonstrate that partitioning quantum processors into manageable, flat modules with non-local inter-module connections provides a natural solution. By wiring sparse, static boundary connections between Euclidean planar modules, we construct modular hyperbolic surface and color codes, based on new families of semi-hyperbolic codes. Using modular syndrome extraction circuits and efficient neural network and matching decoders, our circuit-level simulations show that this modular memory design can reduce the physical qubit overhead by tenfold or more compared to the surface code, even under elevated inter-module seam error rates. Projecting to larger system sizes, we find modular codes with encoding rate $k/n=1/16$ and distance $d\geq 22$, exceeding both the rate and distance of the $[[288,12,18]]$ two-gross bivariate bicycle code while using mostly nearest-neighbor gates within planar modules, and implying an over $30\times$ overhead reduction relative to surface codes. We develop fault-tolerant walking circuits for implementing logic via code automorphisms, which we co-design with low-weight, highly symmetrical logical bases and a modular extractor system that is $\approx 4.5\times$ smaller than the code itself. Combining these methods, our modular memory can be used as dense storage in a universal fault-tolerant architecture, unlocking the efficiency of high-rate codes without sacrificing the fabrication advantages of planar modules.
arXiv·2026-10-02·Alison Warman, Nathanan Tantivasadakarn, Sakura Schafer-Nameki
No generated summary available for this entry.
overview
Original abstract
We study exact recovery for non-Abelian topological surface codes based on the quantum double $D(G)$ of any finite group $G$. We determine an orthogonal error basis, that is comprised of group multiplication and irreducible representation operators. Whenever the errors are supported on closed loops on the lattice or dual lattice, there is a redundancy in the basis, due to stabilizers. To remedy this, we introduce a gauge-fixing that results in a complete and orthogonal error basis on the code space. Assuming as input predetermined, neutral correctable error clusters, we construct charge and flux transfer circuits that move the errors onto ancillas that then get projected out. This is an exact and deterministic recovery protocol, applicable to surface codes for any finite, in particular non-Abelian, group $G$.
arXiv·2026-10-02·Greg Kaplanek, Jason Pollack
No generated summary available for this entry.
overview
Original abstract
The Redfield equation with time-dependent coefficients (or TCL2 equation) gives one of the simplest perturbative descriptions of open quantum system dynamics derived from a microscopic theory. Its status as an approximation is nevertheless subtle: while perturbation theory fixes the reduced dynamics order-by-order in the system-environment coupling, solving the Redfield equation yields a particular resummation that need not preserve complete positivity. Here we compare Redfield evolution with an exponentiated (Magnus) resummation of the same second-order perturbative map, which is completely positive and trace preserving (CPTP) for a broad class of physical conditions. We also construct a simple CPTP resolvent resummation, illustrating the non-uniqueness of resummations of the same perturbative map. The Redfield and Magnus prescriptions agree to second order but differ through time-ordering corrections at higher orders. We exhibit a weak-coupling criterion which guarantees that Redfield evolution, even when non-Markovian, remains close to a CPTP map. We illustrate the criterion in two examples, focusing on finite-dimensional (qubit) systems. Our results clarify when, and why, Redfield evolution can remain reliable even when it is highly non-Lindbladian.
arXiv·2026-10-02·Avijit Mandal et al.
No generated summary available for this entry.
overview
Original abstract
While the ultimate limits on the rate of quantum communication over noisy channels are well-established, very few efficient coding schemes achieving these limits are known. This contrasts sharply with transmitting classical data over classical channels, where polar codes and low-density parity-check codes both efficiently achieve the classical capacity of any noisy channel. In this work we construct an efficient entanglement generation scheme which achieves the coherent information for a broad class of channels. For degradable channels in the class, which includes truncated versions of the pure loss Bosonic channel, the resulting scheme achieves the quantum capacity. The construction makes use of polar codes for two kinds of classical-input, quantum-output (CQ) channels: those with commuting outputs and those whose outputs are heralded mixtures of pure states. The former case is amenable to decoding by classical polar decoding algorithms, the latter by the belief propagation with quantum messages (BPQM) algorithm. To our knowledge, this construction is the first explicit and efficiently decodable protocol that achieves the energy-constrained quantum capacity of the pure-loss Bosonic channel.
arXiv·2026-10-02·Dylan Herman et al.
No generated summary available for this entry.
overview
Original abstract
We investigate algorithms for the quantum simulation of the Schrödinger equation on a Riemannian manifold, where the kinetic operator is defined by the Laplace--Beltrami operator corresponding to the metric. Our first algorithms are based on a global spectral method based on the identification of an efficient transform to the eigenbasis of the Laplace--Beltrami operator. We use this method to provide explicit, efficient, quantum simulation algorithms for the Riemannian Schrödinger equation on tori and spheres with their standard metrics, simplices with the Wright--Fisher metric, truncated positive orthants and their invertible affine images with the log-barrier Hessian metric, and $\ell_p$ balls with a metric induced by the Duffy map. Our second algorithm is based on a coherent simulation of local spectral methods on multiple charts, and is in principle applicable to any compact manifold. We first analyze this algorithm in the continuum and derive conditions under which a polynomial spectral cutoff suffices. We also provide a discretization analysis of a polynomial spectral cutoff for tensor-products of constant-dimensional manifolds. Finally, we consider applications of these methods to optimization and physical simulation. For optimization, we provide results including a generalization and convergence analysis of Quantum Hamiltonian Descent for geodesically convex functions that leads to explicit algorithms on the sphere and simplex, and a Riemannian generalization of the Real-Space Adiabatic Algorithm. For physical simulation, we show that our algorithms can simulate certain spatially discretized field theories, including a variant of the nonlinear sigma model.
arXiv·2026-10-02·Zhenning Liu et al.
No generated summary available for this entry.
overview
Original abstract
Product formulas are a basic tool for simulating quantum many-body dynamics, but a fundamental degree of freedom in their application---the ordering of Hamiltonian terms---has remained largely unexplored. Here we systematically study such ordering effects, quantifying their impact on simulation accuracy and exploiting them to design more accurate product-formula simulations. We develop an efficiently computable, ordering-sensitive bound on the finite-step-size Trotter error for geometrically local Hamiltonians for arbitrarily high-order product formulas. For translation-invariant one-dimensional chains, our bounds are close to exact second-, fourth-, and sixth-order Trotter errors in small-system tests, while on large-scale systems they improve on previous higher-order analytical bounds by orders of magnitude. We further use the local structure of the error bounds and estimates to optimize ordering efficiently, reducing the long-chain problem to a minimum-mean-weight-cycle problem on a weighted de Bruijn graph. For random translation-invariant chains, sequential (staircase-like) orderings consistently outperform standard brickwall circuits; when circuit depth is restricted, the optimizer instead favors wave-like parallel-sequential orderings, which preserve much of the accuracy advantage over brickwall circuits. These results establish ordering as a useful degree of freedom for both understanding and improving product-formula simulation.
arXiv·2026-10-02·Elias Kokkas et al.
No generated summary available for this entry.
overview
Original abstract
The collective excitation spectra of quantum magnets provide a direct test of quantum computers as tools for studying strongly correlated matter. Hardware noise limits the circuit depths available for these calculations, leaving the question of how much magnetic information can survive circuit compression. Using IonQ's 36 qubit Forte Enterprise processor, we simulate the magnetic excitation spectra and spin dynamics of a 36 site Heisenberg XXZ chain describing the quantum magnet Cs2CoCl4 in a transverse field using quantum circuits containing just 420 two qubit gates. The workflow combines an ancilla free local kick protocol with classical tensor network compression, encoding both ground state preparation and time evolution. The reconstructed dynamical structure factors capture the evolution from a broad two spinon continuum toward a dispersive branch with magnon character near the expected critical field. We observe an interesting field driven sign reversal of the nearest neighbor spin correlations which shows a complementary signature of this magnetic evolution. Our error mitigation methods bring the reconstructed total spectra into close agreement with density matrix renormalization group calculations, with Pearson correlation and structural similarity above 0.9 and normalized mean squared error below 0.15. We also perform comparisons with experimental inelastic neutron scattering measurements to connect the recovered excitations to the material's magnetic response. Our results demonstrate that circuit compression and error mitigation allow noisy quantum processors to recover both collective excitations and local magnetic correlations providing a quantitative benchmark for quantum spectroscopy and a basis for extending these methods to more complex magnetic systems.
arXiv·2026-10-02·Stuart Wayland, Zackary Jorquera, Alexandra Kolla
No generated summary available for this entry.
overview
Original abstract
Quantum Max-Cut is a well-studied local Hamiltonian problem for which the classical complexity of the bipartite case remains open. We give a polynomial-time classical randomized algorithm for the spin-$\tfrac12$ antiferromagnetic Heisenberg model, equivalently Quantum Max-Cut, on dense balanced bipartite expanders. This class includes $G(n,n,p)$ with high probability for every fixed $p>0$. The algorithm estimates the ground energy and any ground state edge correlation to additive error $\varepsilon$ in time polynomial in $n$ and $1/\varepsilon$. We construct a Markov chain on perfect matchings of the complete bipartite graph, each matching representing a product of singlets, that converges to the ground state, and use the expansion of the graph to show that polynomially many steps and samples of this chain suffice.
arXiv·2026-10-02·Harriet Apel, Bjorn K. Berntson
No generated summary available for this entry.
overview
Original abstract
Linear combination of Hamiltonian simulation (LCHS) provides an asymptotically optimal framework for the quantum simulation of linear non-unitary dynamics. The LCHS approach approximately implements the Peano--Baker propagator through an integral representation determined by a kernel function. We establish an LCHS approximation theorem for a broadened class of admissible kernel functions, defined by natural complex-analytic conditions. In the standard time-independent block-encoding access model, we explicitly construct, for each target error $\varepsilon$, the unique kernel function in this class minimizing the query-cost functional and show that the minimum of this functional has the asymptotic expansion $\tfrac{2\mathrm{e}}π\big(\log\frac{1}{\varepsilon}-\log\log\frac{1}{\varepsilon}+o(1)\big)$ as ${\varepsilon\downarrow0}$. The provably optimal leading coefficient $2\mathrm{e}/π$ improves by a factor of approximately 2.1 on the coefficient obtained empirically by Low and Somma through numerical minimization over their family of optimally scaling kernel functions. We construct a spectrally convergent quadrature with explicit bounds on operator error and linear combination of unitaries (LCU) subnormalization, proving that this asymptotic improvement persists after discretization into a finite linear combination of unitaries suitable for implementation. Our results are based on Hardy space theory and convex analysis.
arXiv·2026-10-02·Praneel Gore et al.
No generated summary available for this entry.
overview
Original abstract
We introduce an algebraic framework for constructing a new class of quantum error-correcting codes, bosonic algebraically-restricted constellation (BARC) codes. The code states are finite superpositions of coherent-state constellations constrained by symmetries of solution sets to multivariate complex polynomial systems. The constraints are associated with photon-gain and photon-loss errors, thereby imposing approximate Knill--Laflamme conditions for such errors. For equally-weighted constellation points, we derive upper bounds on the minimum geometric separation between points, indicating how noise-resilient the code is. In the single-mode case, we characterize degree-two polynomial solution sets using an orthogonal group symmetry to obtain explicit ellipsoidal and hexagonal BARC codes. We benchmark representative instances of these families against spherical and cubature codes using the entanglement fidelity with optimal recovery under pure-loss noise.
arXiv·2026-10-02·Xiaoli Hu et al.
No generated summary available for this entry.
overview
Original abstract
Uncertainty relations express the fundamental incompatibility of quantum observables, yet optimal state-independent bounds are known analytically in only a few cases. Here we introduce a covariance-based formulation of quantum uncertainty that yields an infinite family of relations for both Hermitian observables and non-Hermitian operators. For operators forming a basis of a Lie algebra, we derive the optimal bound in closed form from the algebra and its representation, replacing optimization over quantum states with a direct algebraic calculation. Within each weight space, uncertainty takes a fixed value, turning the inequality into a conservation law. These results show how commutation relations and their realization on a quantum state jointly determine the minimum quantum uncertainty associated with incompatible operators. By connecting uncertainty to symmetry and representation theory, the framework offers a route to uncovering intrinsic limits on quantum information processing through its underlying Lie algebra.
arXiv·2026-10-02·John Blue et al.
No generated summary available for this entry.
overview
Original abstract
Consider the task of identifying an unknown classical codeword delivered to a register of quantum sensor qubits through a sequence of weak phase interactions that each encode one bit. Suppose that each received bit controls an identical $Z$-rotation of angle $θ$ applied to every sensor qubit; receivers may also use auxiliary qubits within a total qubit budget $Q$, with arbitrary control unitaries and entanglement among all qubits allowed during each reception step. When the total collected signal is weak ($Qθ\rightarrow 0$), we establish that a sensor coupled to a persistent quantum memory can identify the original codeword more reliably than any receiver with the same $Q$ and $θ$ but only classical memory between received bits, even when bit flips occur during transmission. In particular, for a family of $[n,k]$ binary simplex codes with even $k$ and $n=2^k-1$, we achieve exact correction of up to $t\leq(k-2)/4$ transmission errors by coupling the sensor register to a persistent quantum memory of the same size, using $Q = Θ((t+1)\log n)$ and $θ=\frac{2π}{k\sqrt{n+1}}$; for $t=o(\sqrt k)$, every comparable receiver with only classical memory instead has average success probability (over uniformly chosen codewords) tending to zero. Furthermore, under independent bit flips of any fixed probability $p<1/16$, our receiver with persistent quantum memory achieves decoding error tending to zero as $n\to\infty$ using $Q=O(\log n\log\log n)$ total qubits and the same $θ$. In contrast, every otherwise equivalent receiver with only classical memory has vanishing average success probability under the same stochastic error model.
arXiv·2026-10-02·Arkopal Dutt
No generated summary available for this entry.
overview
Original abstract
In this note, we consider tomography of $n$-qubit quantum states $|ψ\rangle$ that are promised to have stabilizer rank $k$ i.e., admit a stabilizer decomposition of $|ψ\rangle = \sum_{i=1}^k c_i |φ_i\rangle$ where each $|φ_i\rangle$ is a stabilizer state. We give a tomography protocol for such states up to trace distance $\varepsilon > 0$ running in $\textsf{poly}(n,2^k,1/\varepsilon)$ time and thus can handle $k=O(\log n)$ efficiently. This follows from first showing that the stabilizer extent $ξ(|ψ\rangle)$, which is the minimal $\ell_1$ norm over the coefficients $\{c_i\}$ of any stabilizer decomposition of $|ψ\rangle$, can be bounded as $ξ(|ψ\rangle) \leq 2^{O(k)}$ and improving upon the previous best bound of $k^{O(k)}$. The protocol is then obtained by utilizing a tomography protocol for states with bounded stabilizer extent.
arXiv·2026-10-02·Lorcan O. Conlon et al.
No generated summary available for this entry.
overview
Original abstract
A paradigmatic task in quantum metrology is that of phase estimation. For this task it is commonly believed, under reasonable assumptions about prior information, that a quadratic advantage in sensitivity is the maximum possible advantage offered by the use of quantum resources. In this work, we consider a channel that implements a phase shift by an angle $2πk/M$, where $k$ is a uniformly random unknown integer, in addition to a small unknown phase shift of interest. We show that, subject to a constraint on the mean photon number per channel use, there is a super-exponential separation between the quantum Fisher information (QFI) attainable using a squeezed vacuum state and that attainable using coherent states. This advantage holds over any state obtained from a coherent state via phase covariant channels. Specifically, when the mean photon number per channel use is 1, the ratio of their QFI grows as $Ω[(M/\sqrt{2}e)^M]$. For a mean photon number per channel use of $M/\log(M)$, the squeezed vacuum QFI is $Ω(M^{3/2}/\sqrt{\log(M)})$, whereas for a coherent state it is at most $\exp[-M\log\log(M)+O(M)]$. We complement this QFI analysis with non-asymptotic estimation results. For a mean photon number per channel use of $M/\log M$, an explicit squeezed-vacuum protocol estimates the phase to accuracy $O(1/M)$ using $O(\sqrt{M\log M})$ channel uses, whereas every coherent state protocol requires at least $\exp[M\log\log M-O(M)]$ channel uses. We consider the effects of noise and show that the ratio of their QFIs can still grow super-exponentially in $M$. Finally, under fixed optical loss and thermal noise, choosing $\bar n=M^2/(\log M)^{3/2}$ allows squeezed vacuum with heterodyne detection to achieve accuracy $O(1/M)$ using sub-polynomially many channel uses, whereas every protocol in the specified classical family requires super-polynomially many.
arXiv·2026-10-02·Adam Bouland, Victor Shyaka, Chenyi Zhang
No generated summary available for this entry.
overview
Original abstract
The Solovay-Kitaev algorithm states that it is possible to efficiently compile unitaries to accuracy $ε$ in $\text{polylog}(1/ε)$ time using any universal gate set. While Solovay and Kitaev's initial work addressed inverse-closed gate sets, recently Bouland and Giurgicǎ-Tiron showed it is possible to efficiently compile arbitrary gate sets without inverses. However, the exponent of their compilation algorithm is high. For example the inverse-free exponent for a qubit is over $8.62$, while information theoretically it is known that an inverse-free exponent of $3$ is possible in any dimension by a result of Oszmaniec, Sawicki, and Horodecki. This leads to a natural question: can one improve the exponent in Bouland and Giurgicǎ-Tiron's algorithm? And are there any cases where the inverse-free exponent is below 3, thus surpassing existing information-theoretic arguments? To answer this question, we first show that a special case of the inverse-free compiling problem -- namely Pauli gates supplemented by an irrational rotation of a qubit - admits a highly efficient compilation algorithm with an exponent at most $\approx 2.138$. Our algorithm fuses ideas from prior algorithms of Kuperberg and Sardharwalla, Cubitt, Harrow and Linden to construct an efficient ``Pauli golf'' compilation routine. We then extend these ideas to the general inverse-free case for a qubit, where we give a compiling algorithm with exponent at most $2.988$. This result uses a novel form of approximate ``aiming'' of unitary corrections to improve the compilation efficiency. Our results give two examples of quantum compiling algorithms surpassing information-theoretic arguments, and demonstrate that there are many efficiency gains possible for inverse-free compilation.
arXiv·2026-10-02·Adam Leicester et al.
No generated summary available for this entry.
overview
Original abstract
Sample-based quantum diagonalization can reduce the classical cost of many-body calculations by restricting diagonalization to configurations identified through quantum sampling, but its efficiency depends on how compactly the target state is represented in the sampled basis. We investigate this dependence for sample-based Krylov quantum diagonalization of the half-filled Fermi-Hubbard ladder using physically motivated one-body orbital rotations. Across position, momentum, bonding/antibonding, and leg-mode representations, the most compressible basis varies systematically with interaction strength and hopping anisotropy, with momentum sampling favored in the weakly interacting regime and geometry- or interaction-adapted representations becoming advantageous as the dominant energy scale changes. Near intermediate interaction and isotropic hopping, however, even the most favorable representation remains poorly compressible. Statevector SKQD calculations further show that basis choice strongly affects sampling efficiency. Hardware calculations on systems containing up to 120 qubits retain qualitative signatures of this basis dependence while revealing increasing particle-number leakage and reconstruction sensitivity with system size. These results show that scalable sample-based diagonalization requires co-design of the sampled representation, quantum circuit, and classical reconstruction procedure.
arXiv·2026-10-02·Erik L. André et al.
No generated summary available for this entry.
overview
Original abstract
We investigate the physical requirements to reach the ultimate limits of ground-state metrology -- i.e., the estimation of an unknown parameter $θ$ of an $N$-body Hamiltonian via measurements on its ground state -- using many-body probes featuring either short-range or long-range interactions. We characterize the conditions to saturate two fundamental limits of the quantum Fisher information $F_θ$: the static ground-state bound $F_θ\lesssim N^2/Δ^2$, where $Δ$ is the spectral gap, and the dynamical Heisenberg limit $F_θ\lesssim N^2 τ^2$, where $τ$ is the total protocol duration. To saturate the static limit, we argue that short-range interacting systems require a spectral gap that closes with $N$. At second-order quantum critical points this leads to a universal condition on the critical exponents, $ν(d+z)=1$, which can be approached arbitrarily closely, as we show for the XXZ chain; cat-like ground states at first-order transitions provide an alternative route to static optimality. In contrast, we find that all-to-all interacting models can achieve optimality even in gapped regimes. Furthermore, reaching the dynamical bound is tightly related to the ground-state preparation time; we demonstrate that its optimal, inverse-gap profile can be obtained via local adiabatic protocols. By analyzing paradigmatic systems -- the transverse-field Ising chain, the XXZ chain, a squeezing Hamiltonian, and the two-mode Bose-Hubbard model -- we identify specific many-body probes capable of approaching both limits. Overall, our results provide a theoretical basis for the design of (local) many-body ground-state sensors operating at the ultimate limits of quantum precision.
arXiv·2026-10-02·Adam Bouland, Matthew Ding, Siddhartha Jain
No generated summary available for this entry.
overview
Original abstract
We show two unconditional quantum space advantages in the random-order streaming model. First, we show the Yamakawa--Zhandry Code Intersection problem admits exponential quantum advantage in the streaming model when its inputs are streamed in random order. This means quantum computers exhibit exponential space advantage even when simply receiving $(x,f(x))$ pairs for a uniformly random function $f$ in a uniformly random order. Our lower bound is shown using density-restoring partitions as in the work of Göös, Gur, Jain, and Li (STOC 2025) combined with a convex potential, similar to the work of Raz (J.ACM 2018) on parity learning and its generalization by Garg, Raz, and Tal (STOC 2018). Second, we use our framework to show quantum space advantage for the Optimal Polynomial Intersection (OPI) problem in certain regimes via a streaming version of the Decoded Quantum Interferometry algorithm (Nature 2025; arXiv:2510.10967). In particular, we show that for degree $d$ and $n$ evaluation points, attaining $1/2 + Ω(\sqrt{d/n})$ fraction of satisfied OPI constraints via streaming requires $Ω(n)$ classical bits of memory but only $O(d\log n)$ qubits. This yields provable quantum advantage in a "low-rate" regime when the number of evaluation points is much larger than the degree, with a space advantage that can be as large as exponential in certain parameter settings.
arXiv·2026-10-02·Timothée Hoffreumon, Mischa P. Woods
No generated summary available for this entry.
overview
Original abstract
In our previous paper on the matter, we proved that real quantum theory (RQT) cannot be experimentally falsified without the experiment falsifying quantum theory (QT) as well. Our result is in direct contradiction to the central claim of an article by Renou et al., published in Nature [600, 625--629 (2021)], reporting a bilocal network experiment that could falsify real quantum theory without falsifying quantum theory. The purpose of this note is to address several seemingly natural attempts to recover the experimental conclusion of Renou et al. We first explain how these results, although based on nonlocality experiments, are far from a Bell-like level of proof. Then we explain why the proposed experiment requires an experimentally untestable premise about independent preparations necessarily being represented as product states. Finally, we discuss some concerns that lie outside the scope of both results.
arXiv·2026-10-02·Martino Bernasconi, Giulio Malavolta
No generated summary available for this entry.
overview
Original abstract
We study a multilinear optimization problem for tensors with bounded Frobenius norm, where each of the $k$ local factors of dimension $d$ is chosen from a convex set. We give a deterministic algorithm running in time $d^{O(k)}$ for constant additive approximations. As applications, we obtain the first polynomial-time algorithms at constant accuracy for weak membership in the nuclear-norm unit ball of high-order tensors and for multipartite quantum separability in Frobenius norm. Our approach views tensor optimization as a cooperative multiprover game and combines this perspective with a recursive spectral compression procedure. We then show that related ideas admit a quantum implementation when the input state is given through copies, rather than an explicit classical description. In these settings we obtain an algorithm to solve Frobenius-norm separability testing using $\text{poly}(k)$ copies and $\text{poly}(k\log d)$ time.
arXiv·2026-10-02·Zahra Baghali Khanian, Amir-Reza Negari
No generated summary available for this entry.
overview
Original abstract
We prove that the von Neumann entanglement of purification is nonadditive. For two-qubit Werner states $W(f)$ with singlet weight $1/64\le f\le1/4$, we show that canonical purification is globally optimal: its entanglement, also known as reflected entropy, gives the exact entanglement of purification. In contrast, the regularized entanglement of purification lies strictly below the reflected entropy for $0<f<f_\ast$, where $f_\ast\approx0.017$. Together, these results establish nonadditivity throughout $1/64\le f<f_\ast$. Our canonical-optimality proof generalizes the proof in [1], which established Rényi nonadditivity for $0\leα<1$ using classical two-qubit states. We thus resolve the additivity question at $α=1$. Remarkably, nonadditivity is again witnessed by separable states and no entanglement in the underlying states is required.
arXiv·2026-10-02·Robert Salzmann et al.
No generated summary available for this entry.
overview
Original abstract
The fundamental task of quantum hypothesis testing, which consists in discriminating quantum objects, has been extensively studied for quantum states and channels. Here, we investigate the fundamental limits of discriminating an arbitrary pair of quantum Markovian dynamics generated by Lindbladians, focusing on the roles of total exposure time and temporal resolution. We allow adaptive choices of evolution durations and arbitrary instantaneous controls between them. We characterise the optimal type-II error exponent (Stein exponent) as the largest instantaneous increase of quantum relative entropy, and give an algebraic criterion for its finiteness in terms of the Lindbladians. Remarkably, an infinite exponent is equivalent to a vanishing type-II error probability at sufficiently large finite total time, for every positive type-I tolerance. While some dynamics admit a finite protocol with zero type-II error, others require increasingly fine temporal control. For the latter, the error vanishes as the minimum allowed evolution duration, or resolution time, tends to zero at fixed sufficiently large total time, but remains bounded away from zero at every fixed positive resolution time. We achieve this using quantum Zeno protocols, establishing temporal resolution as a resource for discrimination. When the null hypothesis is the identity semigroup, an infinite asymptotic error exponent has a stronger consequence: at a fixed finite total exposure time, the type-II error can be made arbitrarily small while keeping the type-I error exactly zero. This is impossible in the corresponding classical setting. Discriminating the identity semigroup from generalised amplitude damping on a qubit provides examples of all three regimes: a finite asymptotic error exponent, zero type-II error attainable at positive resolution time, and vanishing type-II error requiring the resolution time to tend to zero.
arXiv·2026-10-02·Maryam Mudassar et al.
No generated summary available for this entry.
overview
Original abstract
Fault-tolerant quantum simulation requires compiling symmetry-preserving time evolutions into discrete gate sets. Standard Clifford+T synthesis can break continuous symmetries even when the target evolution preserves them, causing compiled simulations to lose essential features of the original system. We develop a fault-tolerant compilation framework that preserves SU(2) symmetry exactly. We characterize the number-theoretic obstruction preventing symmetry-preserving unitary Clifford+T circuits from approximating arbitrary SU(2)-symmetric evolutions and circumvent it using measurement and feed-forward. The resulting synthesis confines compilation errors to the symmetry-preserving operator algebra rather than introducing symmetry-breaking perturbations. We demonstrate the algorithm by simulating transport in the one-dimensional Heisenberg model. At a lower matched T-count, for instance, 54 T gates per two-site Trotter step, standard synthesis yields an incorrect transport exponent, whereas our symmetry-preserving compilation reproduces the expected exponent for the same expected T-count. If instead each approach is allocated whatever resources are necessary to estimate this exponent to the same accuracy, our construction reduces the T-count by approximately a factor of five. We further extend the framework to gauge symmetries in lattice gauge theories and to particle-number and spin symmetries in fermionic models relevant to quantum chemistry and the Fermi-Hubbard model. These results show that symmetry-preserving fault-tolerant compilation can qualitatively change the effects of synthesis error while substantially reducing the resources required for quantum simulation.
arXiv·2026-10-02·Shuyu Zhang et al.
No generated summary available for this entry.
overview
Original abstract
We study anyon decoherence in 2D topological order, with the fermion decoherence in Kitaev's sixteenfold way as explicit examples. The sixteenfold way includes chiral topological phases, which are believed to admit no commuting projector Hamiltonian, making it challenging to study their decoherence directly. We further conjecture the density matrix produced by this decoherence induced phase transition can be obtained by a three-step procedure: first lift the topological order to its Walker-Wang model, followed by a transition to another Walker-Wang model, and finally trace over the bulk degrees of freedom. This establishes a connection between the decoherence of a topological order and a pure state phase transition in its 3D counterpart. Many examples are given. In particular, we show that decohering the fermion in each of the sixteen states always yields an intrinsically mixed-state topological order, a consequence of the fact the corresponding 3D bulk always transits into the 3D fermionic toric code (fTC). Our result suggests a systematic method for studying anyon decoherence in chiral topological orders at the level of commuting projector Hamiltonians.
arXiv·2026-10-02·L. Arnaldi et al.
No generated summary available for this entry.
overview
Original abstract
The QICK (Quantum Instrumentation Control Kit), first introduced in 2022, is a standalone open source control system for quantum information science. Since then, QICK has been migrated to new hardware platforms, expanded its functionality for applications with different types of qubits (superconducting, atomic, ion-trapped, and spin defects), as well as quantum sensors, and quantum networks. QICK is a highly optimized control kit, with a library of functions that can be used for more than one application. In particular, the software and firmware are customized to minimize latency and maximize control performance and throughput. In this white paper, we describe hardware details and performance of the QICK Box. The QICK Box features up to 16 outputs, up to 8 inputs, and 8 20-bit DC biases. Modular output and input daughtercards give the choice of signal chains optimized for fast DC-coupled signals or RF signals up to 10 GHz. Power levels, step attenuation, and bandpass filtering are controlled by software. We demonstrate the system's performance through single-shot readout measurements of a six-transmon device at the Quantum Underground Instrumentation Experimental Testbed (QUIET) at Fermilab, achieving (91.7 +/- 0.4)% readout fidelity limited by T1 decay during the readout. The single shot readout signal-to-noise ratio (SNR) is 4.4 +/- 0.1 without a quantum amplifier, confirming that the QICK Box is suitable for high-fidelity quantum control and measurement applications. Advances in firmware and software will be described in a separate paper.
arXiv·2026-10-02·Xiao Xiao et al.
No generated summary available for this entry.
overview
Original abstract
Non-Clifford gates are essential for avoiding classical simulability under the Gottesman-Knill theorem. An error-corrected circuit with non-Clifford gates will therefore be an important element for realizing useful fault-tolerant quantum algorithms. However, accurately understanding the fault-tolerant performance of such circuits faces challenges due to the classical hardness of simulating these circuits. We avoid simulating logical measurements and develop exact and efficient classical methods for benchmarking circuits composed of X, CNOT, and diagonal gates in the Clifford hierarchy, including state and gate teleportation gadgets with feedforward. For circuits with third-level diagonal gates, our benchmarking algorithm efficiently samples syndrome statistics and estimates the output logical fidelity and expectation values of certain Clifford observables, including all Pauli observables. The evaluation of syndrome expectation values also extends to circuits with fourth-level diagonal gates. Our algorithm scales polynomially in the number of physical qubits n and circuit depth T, independent of the number of logical qubits. The benchmarking applications include IQP sampling and magic state preparation/cultivation. We demonstrate the practical utility of our simulation algorithms by using them to optimize high-rate magic state distillation factories based on three copies of a [[27,3,3]] tricycle code.
arXiv·2026-10-02·Zhihui Wang et al.
No generated summary available for this entry.
overview
Original abstract
We consider the cost of implementing the quadratic collective phase $e^{-iγK^2}$, with $K$ a collective observable of evenly spaced spectrum, such as the permutation-symmetric Hamming weight. This gate is the cardinality-penalty layer of constrained quantum optimization, the one-axis-twisting gate of spin squeezing and the Kerr phase of a bosonic mode. Instead of two-qubit gates, it can be sampled as a linear combination of single-qubit rotation layers (an LCU) at an overhead $Γ$. We determine the minimal overhead. Ancilla-free sampling of the layers reproduces the target's outcome probabilities up to this factor, and no smaller factor works for every input; when $K$ is permutation symmetric, arbitrary single-qubit gates do no better. The minimal overhead's growth with the register size $n$ is set by the continued fraction of $γ/π$: rational angles $πp/q$ in lowest terms cost exactly $Γ=q$ for every $n\ge2q-2$; the cost is $Θ(n)$ if and only if $γ/π$ is badly approximable; and a master formula, proved two-sided near low-denominator rationals, reads it off the nearest one. Without the symmetry the cost over single-qubit gates can be exponential: for the binary-weighted $K=\sum_j2^jx_j$ the squaring phase of Fourier arithmetic on $m$ qubits costs at least $2^{0.557m-O(1)}$, beyond the $2^{m/2}$ ceiling of every cut bound, by a new certificate-lifting argument. The Fourier-based LCU of Carrera Vazquez, Egger and Woerner (2026), which guarantees $Γ\le n+1$, is optimal up to a constant factor at typical angles at fixed $n$; at rational angles the unique optimizer is the fractional-revival decomposition of Kerr optics, a recipe independent of $n$. In bosonic simulation, the Kerr-gate phase-shifter decomposition of Upreti, Quesada and Chabaud (2026) is the unique optimum over phase shifters, and a finite-cost one exists only at rational $γ/π$.
arXiv·2026-10-02·Kaavya Sahay, Cody Jones
No generated summary available for this entry.
overview
Original abstract
For quantum low-density parity check (qLDPC) codes, the ability to manipulate individual logical units of information, i.e. the use of addressable gates, enables maximal utility of their efficient encoding. We introduce explicit low-depth unitary circuits that realize fully addressable and fault-tolerant two-qubit Clifford gates for a subset of two-dimensional translationally invariant qLDPC codes. Our transversal unitaries are created by applying a geometrically structured sparsification procedure to round-robin circuits. We verify the general applicability of our protocol by proposing and numerically simulating a range of addressable CZs between toric, cyclic hypergraph-product, color, gross, and directional codes, demonstrating fault-tolerant memory-like logical error rate scaling.
arXiv·2026-10-02·Rohit Chatterjee et al.
No generated summary available for this entry.
overview
Original abstract
Quantum fire is a recently introduced cryptographic primitive consisting of efficiently preparable quantum states, called \emph{flames}, that admit efficient cloning but resist efficient telegraphing, namely reconstruction via classical communication without preshared entanglement. In all prior constructions of quantum fire, cloning is a public operation that requires no separate key and every holder of a flame state can clone it. For applications to access control, however, an issuer may wish to delegate cloning to designated quantum servers while withholding this capability from other flame holders. To address this, we introduce \emph{delegatable quantum fire}, in which cloning requires a separate key. We give two constructions in the classical-oracle model. Our first construction uses a classical secret key which enables cloning, and any user with the entire key may clone successfully. Our second construction, which we call \emph{torch-fire}, uses quantum cloning keys, called \emph{torches}, which enable cloning while remaining unaffected in the process but cannot otherwise be split or delegated to enable additional cloning. An efficient adversary given $m$ torches cannot, except with negligible probability, enable more than $m$ noncommunicating parties to each clone a fresh, independently issued challenge flame. The adversary may jointly process its resources before separating the parties and distribute arbitrarily entangled registers among them. Both constructions are in the oracle model, relying on public classical oracles that allow queries in quantum superposition.
arXiv·2026-10-02·Kai-Min Chung et al.
No generated summary available for this entry.
overview
Original abstract
We present a unified framework for upgrading a broad class of cryptographic primitives to support constant-rate certified deletion. Previous constructions require a linear number of qubits per encrypted bit of certified-deletable plaintext. In contrast, we obtain the first constant-rate constructions in the plain model that achieve certified deletion while preserving everlasting security. Our approach applies to a wide range of "all-or-nothing"-type primitives based on BB84-style encodings, including commitment schemes, public-key encryption, attribute-based encryption, and fully homomorphic encryption. Beyond this class, we also obtain constant-rate certified deletion for primitives built from subspace coset states, such as blind delegation, secure software leasing, functional encryption, and differing-inputs iO, and CCA-PKE. Importantly, our framework does not introduce any additional assumptions beyond those required by the underlying certified deletion primitives. Finally, under the hardness of SIS, we show that public verifiability can be incorporated into BB84- and coset-based certified deletion. In combination with our constant-rate constructions, this yields publicly verifiable certified deletion schemes with constant rate.
arXiv·2026-10-02·Yale Fan, J. P. Marceaux
No generated summary available for this entry.
overview
Original abstract
Randomized benchmarking comprises a suite of standard techniques for assessing the operational fidelity of quantum processors. These techniques can be reliably applied to groups with process matrix representations that are free of multiplicity. However, many groups that are naturally formed from native gates do have multiplicity, and it is difficult to draw robust conclusions from the resulting data. In this work, we present a new and intrinsic solution to the problem of multiplicity that completely eliminates the need to fit multi-exponential decays while still remaining robust to errors in state preparation and measurement. Our procedure, which we call lifted randomized benchmarking, generalizes key elements of both character and synthetic randomized benchmarking to benchmark a target group of quantum gates with respect to an enlarged group. We illustrate in numerical examples that our method can efficiently and reliably estimate the fidelity of two-qubit gates relevant to experimental trapped-ion systems. These techniques may find applications beyond randomized benchmarking to quantum tomography and learning, as well as the characterization of error-correcting codes.
arXiv·2026-10-02·Tal Barak
No generated summary available for this entry.
overview
Original abstract
The computational complexity of simplicial homology has been studied since the question was raised by Kaibel and Pfetsch, and clique homology was later shown to be $\mathsf{QMA}_1$-hard by Crichigno and Kohler. King and Kohler subsequently introduced the weighted, spectrally gapped version considered here and developed a reduction intended to establish the same hardness result in this setting. We give a complete proof of the hard direction. The earlier King-Kohler argument contains a gap in the analysis of the nontrivially folded local gadgets, so the required topological and spectral properties have to be re-established on the clique complexes actually produced by the reduction. This is not a local repair of the published proof: the argument requires a new analysis of the local topology, the filtered cochain complexes, and the interaction of many overlapping gadgets. Our proof uses exact finite certificates for the local combinatorial data and relative homology to determine the effect of each gadget on the encoded qubit space. We then prove the finite-dimensional filtered-Hodge statement needed to recover the corresponding rank-one low-energy penalty and derive a quantitative global estimate that transfers the source-Hamiltonian promise gap to the final weighted Hodge Laplacian. Consequently, for fixed efficiently computable $k(n)$ and inverse-polynomial $γ(n)$, weighted gapped clique homology is $\mathsf{QMA}_1(\mathcal G)$-hard. The previously known $\mathsf{QMA}$-containment argument is logically independent of the gap and remains unaffected.
arXiv·2026-10-02·Vladyslav Visnevskyi, Laura Mančinska
No generated summary available for this entry.
overview
Original abstract
We initiate the study of weak Schur sampling (WSS) under noisy input. Many optimal quantum learning algorithms rely on this measurement, for instance in such fundamental tasks as quantum spectrum estimation (QSE) and quantum state tomography (QST). The standard analysis of WSS, QSE and QST assumes that the $n$ input copies of the target state $ρ$ are identical. We study what happens when they are not, a more realistic noisy scenario that breaks the very permutation symmetry on which WSS is built. In the simplest noise model, the copies are independent but not necessarily identical, i.e. they form a product state, and each is $ε$-close in trace distance to the $d$-dimensional target state $ρ$. A naive data-processing argument lets the per-copy errors accumulate to $nε$ on measurement output, growing with the input size. We prove that they do not accumulate: the expected output error in total variation is at most $ε+η(n,d)$, where $η(n,d)=O(d/\sqrt n)$ is the noiseless error, and the additive noise term $ε$ is optimal. Beyond noisy product states, for arbitrary inputs $ω$ we show that the outcome observables of WSS are $1/n$-Lipschitz with respect to the quantum Wasserstein distance $W_1$ of De Palma et al., so the error is at most $η(n,d)+\frac{1}{n}\|ω-ρ^{\otimes n}\|_{W_1}$. In particular, our results imply, for the first time, noise-robustness of Keyl and Werner's seminal algorithm for QSE, more than two decades after its introduction. Within our model of robustness, the promise cannot be weakened to closeness of single-copy marginals or to a global trace-distance budget alone, since in both cases some noisy inputs defeat every measurement and estimator. Our results are a necessary step towards optimal quantum learning in practice, and help make progress towards robustness of many other problems in quantum information theory.
arXiv·2026-10-02·Anupam Prakash et al.
No generated summary available for this entry.
overview
Original abstract
A quantum orthogonal polynomial transform (QOPT) is an algorithmic primitive that maps a superposition of standard basis states $\sum_k α_{k} \ket{k}$ coherently to a basis of normalized univariate polynomials orthogonal with respect to a probability measure $μ(x)$. We provide new discrete and continuous QOPTs for polynomial families in the Askey scheme extending the results for the quantum Hermite transform (Jain et al., STOC'26). Our efficient QOPT algorithms require time $O(\text{polylog}(N, 1/ε))$, where $N$ is the grid size and $ε$ is the error, for the discrete Charlier, Meixner and Krawtchouk transforms and for the integer-order Laguerre transform in the continuous setting. The efficient QOPTs are obtained by uncovering the links between Askey scheme polynomials and Gaussian quantum optical gates and developing a compilation framework for $SU(2)$ and $SU(1,1)$ optical gates on Cartesian grids extending the framework developed by Iyer et al. (arXiv:2602.15180). Further, we reduce the continuous Jacobi transform to the discrete Hahn transform and provide an $O\!\left(N\operatorname{polylog}((N+α+β+1)/ε)\right)$-time Hahn transform, a quadratic speedup over the naive implementation. This is based on a more efficient compilation of the Clebsch--Gordan transform for coupling $\mathrm{SU}(2)$ representations with spins $(j_{1}, j_{2})$. Finally, we develop a new framework for Laguerre transforms for all orders $ν>0$ by fast-forwarding the corresponding radial oscillator using a 3-term chirp decomposition and an efficient algorithm for the Quantum Hankel Transform on a logarithmic grid.
arXiv·2026-10-02·Masahito Hayashi, Farzin Salek
No generated summary available for this entry.
overview
Original abstract
For classical--quantum wiretap channels with a transitive covariant input action, both output ensembles admit a description as unitary group orbits of fixed seed states. We use this structure to construct finite-block preprocessing schemes whose private information is an entropy difference evaluated at two distributions related by group convolution. Applying the construction to product groups allows correlations across any fixed number of channel uses. We give a sufficient condition for the associated uniform-input bound to equal the single-use private information. Constant-composition channel codes and universal$_2$ hashing achieve the resulting rates, with trace-distance leakage controlled by sandwiched Rényi information. For uniform outer randomization, the representation structure reduces the comparison-state optimization to Eve's invariant states. For the hybrid binary channel considered by Tikku, Berta and Renes, numerical optimization at three and four uses gives rates above our numerical estimate of the optimized noisy-repetition benchmark wherever that estimate is positive on the tested grid. The improvement comes from noise distributions beyond the family of independent physical flips and a symmetric logical flip. We also prove nonadditivity at an explicit channel parameter using a two-use encoder, an analytic single-use converse, and certified entropy bounds. Finally, we relate the hybrid model to binary phase-shift keying with a fixed receiver measurement.
arXiv·2026-10-02·Cambyse Rouzé, Daniel Stilck França
No generated summary available for this entry.
overview
Original abstract
Classical Dobrushin--Shlosman theory uses heat-bath block updates to identify sharp temperature thresholds for establishing the rapid mixing of Gibbs samplers. In particular, these mixing guarantees often hold even when stricter single-site conditions fail. We extend this approach to noncommuting quantum lattice systems through a quantum Dobrushin--Shlosman condition for finite-block dynamics, which we call smoothed heat-bath dynamics. We establish this condition in two regimes. For finite-range quantum spin chains at every fixed finite temperature, we prove logarithmic trace-norm mixing in system size, with normalized bounds uniform in on-site fields and single exponential in inverse temperature. We also prove stability under small local perturbations of interacting, possibly noncommuting reference Hamiltonians on graphs of polynomial volume growth. For classical references with bounded local interactions, uniform strong spatial mixing implies our quantum condition. With bounded local terms and fixed physical, geometric and block parameters, the resulting samplers prepare Gibbs states to trace-norm error $\varepsilon$ using $N\operatorname{polylog}(N/\varepsilon)$ gates and classical operations. Our block updates combine a local Gibbs reset with quantum belief propagation to incorporate interactions across the block boundary, yielding exactly Gibbs-preserving, KMS-reversible channels. Two independently tunable parameters control contraction: an internal evolution time suppresses the influence of sites inside a block, while the block size allows interior contraction to dominate boundary influence. This finite-time relaxation has no counterpart in a classical heat-bath block update.
arXiv·2026-10-02·Christophe Piveteau, Yihui Quek, M. Isabel Franco Garrido
No generated summary available for this entry.
overview
Original abstract
We propose a Gibbs state preparation algorithm that exploits algebraic structure in the Hamiltonian. Our starting point is Hamiltonian Decoded Quantum Interferometry (HDQI), a recent algorithm that reduces Gibbs state preparation for Pauli Hamiltonians to decoding error-correcting codes. We introduce quantum decoding HDQI (QD-HDQI), replacing HDQI's coherent classical decoder by a quantum decoder that can exploit interference between different errors. For commuting Pauli Hamiltonians, our reduction is efficient and the associated quantum decoding problem corresponds to transmitting the associated symplectic code over i.i.d. pure-state classical-quantum channels. For uniformly random Hamiltonian signs, the vanishing-error threshold of an efficient decoder directly determines the lowest temperature that our algorithm can reach. Even using only classical decoders, this improves upon HDQI's achievable inverse temperature from linear to square-root in the correctable error fraction; quantum decoders can improve further by tolerating still stronger noise. A similar picture extends to the noncommuting regime previously handled by HDQI, where now the noise is correlated within small, independent blocks. We study two such quantum decoders in our QD-HDQI Gibbs sampling framework. The first, based on unambiguous state discrimination, works efficiently for arbitrary binary linear codes. However, we "dequantize" this strategy for commuting Hamiltonians, contributing a classical rejection sampler that matches its temperature threshold. The second is belief propagation with quantum messages (BPQM), a quantum generalization of classical belief propagation. We show that for certain dilute spin glasses, BPQM's decoding threshold exceeds the Shannon limit for classical decoding, reaching temperatures inaccessible to any classical decoder within our framework.
arXiv·2026-10-02·Jannis Ruh, Samuel J. Elman, Adrian Chapman
No generated summary available for this entry.
overview
Original abstract
Exactly solvable models are often identified from structural features of their interactions. For quantum spin Hamiltonians, these are captured by the frustration graph of anticommuting Pauli terms. The frustration graph characterizes broad families of spin models that map to free fermions for arbitrary, or generic, values of their coupling strengths. Nevertheless, there exist non-generically solvable models that admit free-fermion solutions only at finely tuned couplings. In this work, we characterize a family of such models in terms of graph structures. Given an arbitrary instance of Fendley's free-fermions-in-disguise (FFD) chain, we construct a set of operators, called Krylov currents, that are exactly quadratic in its effective fermionic modes and thus extend it to a linear family of free-fermion solvable Hamiltonians. As the Krylov currents are nonlinear in the FFD Hamiltonian terms, the elements of this generated family are non-generically solvable, and they accordingly fail the known conditions for generic solvability. We prove that every Krylov current admits an expansion in terms of induced paths of the frustration graph and that they generate the full special-orthogonal algebra of Gaussian transformations. Our results identify path support as a signature of non-generic solvability, and they provide a systematic route to finding exactly solvable many-body Hamiltonians.
arXiv·2026-10-02·Danesh Morales-Hashemi, Graeme Smith, Ningping Cao
No generated summary available for this entry.
overview
Original abstract
What must a quantum error-correction decoder know about temporally correlated noise, and what does it cost to learn? We study this question for fixed stabilizer memory experiments with known system-environment interactions. We formulate calibration in terms of the fidelity differences that select a Pauli recovery and relate missing information to the resulting fidelity loss. Our main example uses weak coherent $X$ rotations in a class of CSS codes including Shor, Steane, and odd-distance rotated surface codes. All physical qubits share a sign either fixed throughout a run or independently redrawn each interval. The two models have identical syndrome statistics and the same spatiotemporal Pauli process (SPP), obtained by Pauli-twirling every noise interval. Yet at suitable storage times, they require different logical corrections. In the weak-noise limit, each model is almost perfectly correctable when known. Without model information, even the best final recovery has a worst-case fidelity loss approaching $1/2$ relative to the noise-aware optimum, despite access to the full syndrome record. For this pair of models, at fixed code and fixed positive target loss below $1/2$, we prove matching calibration bounds. With logical preparation and final readout, complete QEC cycles require a number of noise intervals scaling as the inverse rotation angle raised to the code's $X$ distance. Allowing two uninterrupted intervals before one extraction reduces the optimal cost to inverse-square scaling. Physical Pauli twirling of every noise interval changes both recovery performance and its information requirements. Discarding the record of applied random Pauli operations makes the SPP sufficient for optimal recovery. Keeping this record can improve the attainable fidelity, but reaching that optimum may require additional noise information.
arXiv·2026-10-02·Fredrik Hasselgren, Matthew L. Sims-Goh
No generated summary available for this entry.
overview
Original abstract
Loading data into quantum computers is a key bottleneck that threatens end-to-end quantum advantage. Quantum-circuit compilers for structured states like matrix product states (MPS) are a critical enabler to manage this in quantum chemistry, finance, and many-body quantum simulation. Approximate preparation of MPS typically relies on layered sequential staircases of nearest-neighbour gates. We present Adaptive State Preparation by Iterative Removal of Entanglement (ASPIRE), an algorithm that approximately compiles state-preparation circuits by selecting gates based on the state's underlying entanglement geometry and the available connectivity of the target quantum processor. Our protocol scores candidate qubit pairs on the removability of their entanglement and identifies layers of parallelised long-ranged gates that remove the most entanglement. We demonstrate our protocol empirically across a range of settings, illustrating its success for preparing Hamiltonian ground states and multivariate amplitude-encoded functions, and accounting for qubit connectivity, hardware noise, and both NISQ and early fault-tolerant settings. Throughout, ASPIRE typically achieves higher fidelities and shallower circuits than existing methods for states with long-ranged entanglement, even when classical optimisation is accounted for. Our investigation positions ASPIRE as a competitive, resource-frugal state-preparation protocol, with particular promise for applications tolerant to imperfect fidelity such as preparation of guide states for quantum phase estimation.
arXiv·2026-10-02·Tanguy Fontana, Axelle Coulon, Giovanni Manfredi
No generated summary available for this entry.
overview
Original abstract
We investigate dynamical relaxation to the Born rule in a semiclassical gravity model described by the Schrödinger-Newton equations. Using a Gaussian variational solution for the self-gravitating wave packet, combined with Nelson's stochastic representation of quantum dynamics, we track the evolution of particle ensembles whose initial probability distribution differs from $|Ψ|^2$. Relaxation to the Born rule ("quantum equilibrium") occurs when the wave packet remains bounded, or grows sufficiently slowly in time; in contrast, for rapidly expanding solutions of the Schrödinger-Newton equations, deviations from the Born rule can persist indefinitely. Numerical simulations confirm this analytical picture. These results show that semiclassical self-gravity can either enable or inhibit relaxation towards the Born rule, providing a minimal model relevant to proposals of primordial quantum non-equilibrium, as suggested by Underwood and Valentini [Phys. Rev. D 92, 063531 (2015)].
arXiv·2026-10-02·Hanson H. Nguyen et al.
No generated summary available for this entry.
overview
Original abstract
Frequency-bin encoding provides a scalable platform for photonic quantum information processing by enabling high-dimensional qudit states compatible with the telecommunications infrastructure. However, characterizing these systems remains challenging, as conventional quantum state tomography requires measurement resources that increase rapidly with dimensionality, compounded by the difficulty of implementing controllable measurements across many frequency modes at once. Here, we address these challenges and demonstrate threshold quantum state tomography of entangled frequency-bin qudits using adaptive measurements that exploit the sparsity of highly entangled biphoton frequency combs. Combined with Bayesian inference, we experimentally demonstrate full state estimation of biphoton frequency combs with Hilbert space dimensions up to $d^2=100$---a 56% increase over the previous record---all while performing a mere 1.9% of the measurements required by conventional tomographically complete approaches. This work confirms the promise of measurement-aware approaches for characterizing high-dimensional photonic quantum systems, unlocking new tools for full tomography that are hardware-efficient, state-aware, and free from a priori assumptions about state structure.
arXiv·2026-10-02·Chiran Wijesundara et al.
No generated summary available for this entry.
overview
Original abstract
Multicore optical fibers (MCFs), developed to scale classical telecommunications, are gaining traction as a quantum platform for high-dimensional key distribution, entanglement, and photonic quantum walks. So far, quantum light has occupied these fibers only as single-mode path channels; the spatial-mode structure within each core has remained untouched. Here we operate a telecom-grade 39-core fiber far from its design wavelength, where each core supports exactly two LP mode groups (LP01, LP11), and measure heralded photon-number states |1> and |2>, resolving the photon number simultaneously with the intra-core spatial mode or with the core index. Displacing the launch prepares a coherent LP01-LP11 superposition whose single-sided intensity pattern shows that the intermodal phase is preserved over the fiber: a drift-resolved joint fit gives a pixel asymmetry (0.4% vs 47%) incompatible with an incoherent mode mixture. Because the two modes couple to neighboring cores at different rates (kappa_LP11/kappa_LP01 = 2.4), the launched mode content acts as a state-selectable coupling knob: the effective inter-core coupling of the passive fiber is set by the launch alone (3.9-13.1%), a tunability that otherwise requires electro-optic, thermo-optic, or mechanical reconfiguration. The propagation is photon-number independent: the per-photon crosstalk of heralded |2> states equals that of |1>, bounding any Fock-state dependence to |dx/x| < 6.1% (95% CL), and the imaged mode distributions of |1> and |2> agree to better than 1%. This measured linear-optics null, validated against exact Fock-space simulation, is the baseline against which genuine multiphoton interference in fiber quantum walks must be certified; we also show how coincidence-based event selection produces spurious photon-number-dependent crosstalk if accidentals are not subtracted.
arXiv·2026-10-02·Ryota Matsuda, Masahiro Hoshino, Yuto Ashida
No generated summary available for this entry.
overview
Original abstract
Fermionic non-Gaussianity is a key resource for universal quantum computation, and its behavior in quantum many-body systems has attracted growing interest. Recently, a convolution-based measure, which we call the magic Rényi entropy (MRE), has been proposed as a resource measure of non-Gaussianity, but its evaluation is limited to small systems due to the computational cost growing exponentially with system size. In this work, we develop a perfect-sampling method to calculate the second-order MRE from matrix product states (MPSs). Our method uses a bounded estimator to control sampling fluctuations and a recursive sweep to draw the samples directly from the input MPS, which allows us to generate each sample with $\mathcal O(nD^3)$ time, where $n$ and $D$ denote the number of modes and MPS bond dimension, respectively. We benchmark our method on the XXZ chain with up to $128$ sites, demonstrating that the MRE captures intricate higher-order correlations at large scales, which are inaccessible to covariance-based measures. These results provide a computational tool that quantitatively evaluates many-body fermionic non-Gaussianity by accounting for higher-order correlations.
arXiv·2026-10-02·Zhen Qin, Qing Qu, Alfred O. Hero
No generated summary available for this entry.
overview
Original abstract
Neural quantum states based on modern deep learning architectures have emerged as powerful representations for quantum many-body systems. In particular, Transformer-based neural quantum states provide expressive models capable of capturing long-range correlations, and their empirical generalization performance has recently been demonstrated. However, a theoretical understanding of their generalization behavior remains largely unexplored. In this paper, we develop a theoretical framework to analyze the generalization properties of Transformer-based neural quantum states under in-context learning. We establish a rigorous inference-time generalization error bound in terms of mean squared error (MSE), showing that the pointwise prediction error decreases inversely with both the number of in-context examples and the depth of the Transformer. We further show that the Transformer depth required to achieve this guarantee scales only linearly with the system size--namely, the number of particles in continuous systems or the number of qudits in discrete systems. Building on this result, we extend our analysis to full quantum states formulated as rank-one density operators, and derive MSE-based generalization bounds over both continuous and discrete domains under physical constraints. Finally, numerical simulations corroborate our theoretical analysis.
arXiv·2026-10-02·Lucio De Simone et al.
No generated summary available for this entry.
overview
Original abstract
Quantum entanglement is a fundamental resource in quantum information theory, yet its general characterization and quantification remain challenging, especially in multipartite systems. In this work we investigate entanglement from a geometric perspective, focusing on the Riemannian structure induced by the Fubini--Study metric on the projective Hilbert space of multi-qubit quantum states. By exploiting the local-unitary invariance of this metric, we derive the entanglement distance (ED), a geometric measure that quantifies entanglement as an obstruction to locally minimizing the sum of squared Fubini--Study distances generated by local operations. We analyze the properties of ED for pure multi-qubit states and discuss its behavior under local operations and classical communication. In particular, we show that ED reproduces established entanglement measures in well-defined and restricted settings. For pure states of two qubits, ED reduces to an exact monotone function of the concurrence and, independently, to an explicit monotone function of the entropy of entanglement. These results provide a clear geometric interpretation of standard bipartite entanglement measures within the present framework, while highlighting the limitations of such correspondences beyond the two-qubit case.
arXiv·2026-10-02·Jan Li et al.
No generated summary available for this entry.
overview
Original abstract
Bell correlations have been detected in atomic ensembles ranging from hundreds to hundreds of thousands of particles, witnessed by the permutationally invariant (PI) Bell operators. For all the operators realized so far, the maximally violating state can be brought, in a suitable basis, into a nonnegative-amplitude form. In that basis, the Bell operator is stoquastic. The coefficients parametrising these operators that at the same time lead to stoquasticity form a convex cone, the so-called stoquasticity cone. Its characterization had remained open beyond two-body operators, as for many-body operators the number of inequalities grows with the system size $n$. In this work we show that, in the thermodynamic limit, the stoquasticity cone admits an exact semidefinite characterization, valid at any operator order. The key observation is that, along each off-diagonal, the matrix elements are the values of a single univariate polynomial. Being univariate, this condition is equivalent to a linear matrix inequality, with no relaxation hierarchy. Therefore, deciding stoquasticity becomes a single semidefinite feasibility problem. As its lowest-degree instances, this description recovers the known three-hyperplane characterization for two-body operators and yields, for three-body operators, a curved boundary.
arXiv·2026-10-02·Hong Qin
No generated summary available for this entry.
overview
Original abstract
The susceptibility tensor of a homogeneous collisionless magnetized plasma possesses parity-time (PT) symmetry. For a stationary gyrotropic equilibrium, with the wave vector $\mathbf{k}$ and the equilibrium magnetic field $\mathbf{B}_0$ in the $x$--$z$ plane, the kinetic response satisfies $χ(ω^*,\mathbf{k})=Rχ(ω,\mathbf{k})^*R$, where $R=\operatorname{diag}(1,-1,1)$. We show that the susceptibility PT-symmetry is a reduced-response-space manifestation of PT symmetry of the underpinning kinetic system. We identify parity $P$ and time reversal $T$ on the electromagnetic kinetic eigenmode space and show that the Hamiltonian operator $\mathcal{H}_{\mathrm{VM}}$ of the linearized Vlasov--Maxwell system is PT-symmetric, satisfying $PT\mathcal{H}_{\mathrm{VM}}(PT)^{-1}=\mathcal{H}_{\mathrm{VM}}$. The PT symmetry of the homogeneous magnetized Vlasov--Poisson eigenproblem is also established. Many kinetic instabilities associated with nonmonotonic distributions, rings, loss cones, and resonant energetic-particle populations are fundamentally spontaneous PT-symmetry breaking, which is achieved through and only through Krein collisions. Three examples demonstrate distinct utilities of this analysis. Definite-sign cyclotron residues protect thermal Bernstein modes from spontaneous PT-symmetry breaking. The nonmonotonic Dory--Guest--Harris distribution permits sign-indefinite residues and Krein collisions, for which we derive an analytical instability threshold and growth rate. The recently discovered mode-pole resonance instability provides a distinct realization of spontaneous PT-symmetry breaking and illustrates how PT symmetry can guide the discovery of kinetic instabilities with applications to fusion energy. These results establish PT symmetry as a structural principle of plasma waves and instabilities and open new directions for studying spectral topology in kinetic plasmas.
arXiv·2026-10-02·Soham Ghosh, Holger Boche, Andrew Tanggara
No generated summary available for this entry.
overview
Original abstract
We develop an operator-algebraic framework for analyzing fault tolerance in quantum circuits and establish necessary and sufficient conditions for fault tolerance under any given noise model. For prescribed circuit families and noise models, we derive a semidefinite program (SDP) based test whose infeasibility certifies that there does not exist any recovery map restoring its intended operation. For non-adaptive stabilizer circuits, analyzing the stabilizer symmetries of its components with symplectic geometry, we obtain closed-form detection and logical-effect matrices that characterize circuit distance algebraically. Applied to a finite Hastings--Haah honeycomb Floquet-code circuit, these matrices certify the dynamical encoding of two logical qubits and distance four under Pauli noise including measurement errors. Using these matrices, we then derive MacWilliams identities for circuit weight enumerators and obtain linear-programming (LP) upper bounds on circuit distance. Output-code constraints give additional Singleton-like bounds. Under independent and identically distributed (i.i.d.) depolarizing noise, the weight enumerators determine decoder failure probabilities and yield upper bounds on finite-circuit pseudothresholds. Finally, we derive LP distance bounds for families of flag syndrome-extraction circuits specified by their CNOT orderings, by incorporating the $t$-flag criterion as additional linear constraints to the distance-bounding LP. An analytical CSS Hamming-code benchmark yields a tight distance-three bound attained by the Chao--Reichardt one-flag construction.
arXiv·2026-10-02·Tomohiro Yamazaki
No generated summary available for this entry.
overview
Original abstract
In this paper, we propose a linear-optical quantum computation scheme that starts from high-dimensionally entangled qudits but performs quantum computation on qubits defined in their subspaces. This approach enables us to increase the success probability of linear-optical fusions from $50\%$ to $1-1/d$ for qudits of dimension $d$ without relying on existing approaches using ancilla photons and quantum codes. In particular, we show that a 2D cluster state of qubits can be generated from 5-qudit 1D cluster states using pairwise fusion gates while preserving their boosted success probability. We numerically demonstrate that this approach can improve the loss tolerance of a percolation-based scheme while keeping the photon number per resource state constant.
arXiv·2026-10-02·Yuguo Shao, Zi-Wen Liu
No generated summary available for this entry.
overview
Original abstract
Logical error rate is a standard benchmark for quantum error correction, providing an aggregate measure of the overall effect of physical noise. In actual QEC architectures, errors at different circuit locations can have markedly different effects on logical failure even when their probabilities are equal. Here we introduce an error attribution scheme to quantitatively characterize the influence of individual circuit components on the logical error rate and use this refined information to guide targeted intervention and design for improved QEC performance. Our attribution estimator computes all component sensitivities jointly from the same Monte Carlo samples used to estimate the logical error rate. The resulting sensitivity maps identify hotspots where targeted noise reduction can most effectively improve logical performance. We test the scheme in circuit simulations of rotated surface code memories and high-rate lifted product codes: halving the noise strength on about 5\%-7\% of physical components selected by sensitivity reduces logical error rates by approximately 15\%-25\%, roughly twice the mean reduction from the same intervention on an equal number of randomly selected components. By connecting performance benchmarking to targeted optimization, our scheme provides a practical strategy for improving quantum error correction with limited resources.
arXiv·2026-10-02·Mingrui Jing et al.
No generated summary available for this entry.
overview
Original abstract
Polynomial transformations of data encoded in quantum operations are a building block of quantum algorithms, and their query complexity measures how often those operations are used. For multiple variables, existing methods either realize restricted polynomial families or implement monomials separately at a query cost exponential in the number of variables. We present a quantum circuit that implements every multivariate trigonometric polynomial up to an explicit normalization. The circuit processes one variable coherently over the frequency components of the remaining variables, allowing all components to share the same signal queries. Each variable is queried exactly as many times as its degree in the polynomial, and we prove that this query complexity is optimal. We further extend the construction to commuting unitaries. The resulting circuit applies the multivariate polynomial simultaneously across their shared eigenbasis, using the minimum numbers of forward and inverse queries to each unitary. We also study trainable rotations with fixed preparation and a local readout of the last input. At query depth at least two, independent uniform initialization gives every active readout gradient a variance lower bound set by its squared branch weight and the inverse square root of the depth, uniformly over data states and dimensions. For supervised squared loss, retaining sample correlations gives an initialization gradient-variance bound in terms of targets and input spectra. This also bounds the expected loss decrease after the first exact gradient step with a specified step size. These results provide a scalable and practical solution for developing multivariate quantum algorithms and quantum learning models.
arXiv·2026-10-02·Farsad Ahmad, Aeysha Khalique
No generated summary available for this entry.
overview
Original abstract
Continuous-variable quantum key distribution (CV-QKD) networks require routing strategies that account simultaneously for secret key generation, relay trust and finite network resources. We introduce Quantum Utility Routing (QUR), a weighted routing framework for networks combining trusted point-to-point links with untrusted CV Bell measurement relays. Transition level composable finite size secret key rates (SKRs) are incorporated directly into the route search, allowing QUR to balance bottleneck SKR against route geometry and resource use. We consider graph optimized QUR (QUR$_{\mathrm{go}}$) and a fixed weight implementation (QUR$_{\mathrm{fw}}$) that uses machine learning to avoid repeated graph specific weight optimization, and benchmark both against A* and Max--Min routing. At the default network configuration, QUR$_{\mathrm{go}}$ and QUR$_{\mathrm{fw}}$ improve the mean path SKR relative to A* while requiring substantially fewer network resources than Max--Min. The framework also maintains secure connectivity over a broad range of trusted node availability by exploiting untrusted infrastructure as measurement relays. These results demonstrate that routing in CV-QKD networks can be treated as a configurable trade off between cryptographic performance and network resource consumption.
arXiv·2026-10-02·Jiwan Kang, Namshik Han
No generated summary available for this entry.
overview
Original abstract
Quantum annealers can sample degenerate optima unevenly, so the composition of finite-read output matters when multiple solutions are sought. We investigate whether problem structure can steer this output through node-dependent anneal offsets for Minimum Vertex Cover (MVC). In MVC, vertex degree equals the number of incident edge-cover constraints and therefore measures local constraint participation. We use this relation to define degree-conditioned offset-scheduled quantum annealing (DC-OSQA), a static rule assigning more negative offsets to vertices with larger max-normalized degree. Experiments used a D-Wave Advantage2 system1 quantum processing unit (QPU). For each graph, DC-OSQA was compared with a zero-offset baseline using the same MVC encoding, fixed physical embedding, majority-vote chain decoding, and 1000-read budget. A sampled bitstring was counted as a certified candidate only if it represented a feasible vertex cover and its cardinality matched the minimum independently certified by integer linear programming. Across 120 paired comparisons on sparse Barabasi-Albert graphs with two attachments per added vertex and graph sizes N = 70-150, DC-OSQA increased the mean number of distinct certified candidates from 171.7 to 455.8 and the mean number of complete-linkage Hamming-distance families from 22.5 to 80.0; paired gains were positive at every tested size. These shifts, together with lower empirical concentration, indicate a change in the composition of the observed certified support. At N = 150, the degree-aligned assignment exceeded the within-instance mean over 20 random reassignments of the same offset values in 19 of 20 graphs for certified-support size and all 20 graphs for Hamming families. Within the tested ensemble, these results show that an MVC-specific degree rule changes the certified optima observed within a fixed QPU read budget.
arXiv·2026-10-02·Shih-Han Hung, Han-Hsuan Lin
No generated summary available for this entry.
overview
Original abstract
Marriott and Watrous showed that quantum Merlin--Arthur games admit generic error reduction without increasing witness size [Computational Complexity, 2005]. In this work, we show that this state-size-preserving amplification property does not hold for polynomial-time quantum computation with quantum advice. In particular, we present decision problems for which even a vanishing additive error reduction requires longer advice. More precisely, for every polynomially bounded advice length $m(n)\geq n^4$ and every error bound $\varepsilon(n)$ that stays below $1/2$ by at least an inverse polynomial, there is a positive function $δ$ with $δ(n)=O\bigl(\min\{(\log m/m)^{1/4},\ \sqrt{\log m/m}\,/(1/2-\varepsilon(n))\}\bigr)$ such that $\mathsf{BQP}_{\varepsilon}/\mathsf{q}m \subsetneq \mathsf{BQP}_{\varepsilon + δ}/\mathsf{q}m$; for constant $\varepsilon$ the gap is $O(\sqrt{\log m/m})$. Here, $\mathsf{BQP}_\varepsilon/\mathsf{q}m$ is the class of languages recognizable with error at most $\varepsilon(n)$ by a polynomial-time quantum algorithm with an $m(n)$-qubit advice state that only depends on the input length $n$. We show this by proving a stronger separation $\mathsf{P}_{\varepsilon+δ}/\mathsf{r} m \not\subset \mathsf{BQP}_{\varepsilon}/\mathsf{q} m$, where $\mathsf{P}_{\varepsilon}/\mathsf{r}m$ is the class of languages recognizable with error at most $\varepsilon(n)$ by a deterministic polynomial-time algorithm with an $m(n)$-bit advice string sampled from a distribution that depends only on $n$.
arXiv·2026-10-02·Jens Palsberg, Keli Huang, Abdullah Almanei
No generated summary available for this entry.
overview
Original abstract
A well-known theorem states that the Clifford+T gate set is universal for quantum computing. The theorem combines approximation using a distance measure on unitary matrices with equality up to global phase. Previous proofs combine these two notions for specific distance measures, but do not identify the properties that govern how they work together. Which properties are sufficient to state and prove the theorem? We answer this question by defining projective distance measures using four axioms. We prove that the universality theorem holds for every distance measure satisfying these axioms. Thus, our formulation of the theorem is independent of any particular choice of distance measure. We show that the Hilbert-Schmidt distance is already a projective distance measure. We also develop a general construction that transforms a large class of distance measures into projective distance measures and apply it to obtain projective versions of the operator-norm distance, the Frobenius distance, and the trace distance. Finally, we formalize the proof of the universality theorem in Lean.
arXiv·2026-10-02·Daniel Keren, Ye Zhou
No generated summary available for this entry.
overview
Original abstract
For the coupled three-dimensional double well $H=\tfrac12|p|^2+2\sum_i(q_i^2-1)^2-\sum_{i<j}q_i^2q_j^2$ we exhibit, at the first excited energy level (and also at the ground state), a linear functional on polynomials of degree $\le 6$ that satisfies every constraint of the standard level-3 eigenstate bootstrap, has a \emph{strictly} positive definite moment matrix, and nevertheless assigns a negative value to a nonnegative polynomial. It is therefore an interior point of the level-3 relaxation that is realized by no quantum state. The construction reflects a fact that holds at every level: the eigenstate rows never reach the top-degree momentum moments. At level 3, where strictly feasible points exist, this means that the corresponding block of the moment matrix carries no information about which energies admit one. Every algebraic ingredient is an exact rational certificate, and the only numerical ingredients (spectral enclosures of an eigenfunction) are carried out in rigorous ball arithmetic.
arXiv·2026-10-02·Mingjie Hu, Jian-Qiang Hu
No generated summary available for this entry.
overview
Original abstract
Quantum computing has developed rapidly in recent years and has shown potential advantages over classical computing in various domains. In this paper, we study whether quantum computing can accelerate the convergence rate of discrete simulation optimization in the fixed-budget setting. We first formulate the quantum discrete simulation optimization problem by defining the quantum simulation oracle, the algorithmic performance measure, and the corresponding optimality guarantee. Based on this formulation, we establish a minimax lower bound on the expected optimality gap for any quantum algorithm. The lower bound analysis reduces the discrete simulation optimization problem to a sequential quantum phase-testing problem, and the resulting lower-bound argument may be of independent interest. By comparing the quantum lower bound with its classical counterpart, we show that the optimal convergence rate in the quantum setting exhibits a quadratic improvement in its dependence on the simulation budget, at the cost of a worse dependence on the number of decisions. We then propose the first fixed-budget quantum algorithm, called \textsc{QUEST}, for discrete simulation optimization. The algorithm combines a quantum Monte Carlo subroutine with a sequential elimination framework and uses a slow-measurement mechanism to help preserve quantum superposition during the optimization process. We prove that \textsc{QUEST} achieves the optimal convergence rate up to logarithmic factors. Numerical experiments further show that \textsc{QUEST} outperforms its classical counterpart, which provides empirical evidence for the quantum advantage in improving the convergence rate of discrete simulation optimization algorithms.
arXiv·2026-10-02·Michele B. Rota et al.
No generated summary available for this entry.
overview
Original abstract
Quantum key distribution (QKD) is a fundamental functionality of quantum networks. Extending its range requires quantum repeaters, a technology still under development and not yet demonstrated in combination with quantum cryptographic protocols. Here, we address the elementary operation of a viable quantum repeater scheme by evaluating whether correlated photons distributed via entanglement swapping can support secret key distribution. We employ a state-of-the-art deterministic photon source based on a strain-tuned GaAs quantum dot embedded in a photonic cavity and implement a source-independent QKD protocol between two nodes using entanglement-swapped photons. We benchmark the system and present how high-resolution temporal post-selection can enable secure key exchange, with further rate improvements expected through realistic device and protocol optimizations. Due to its compatibility with a wide range of quantum memory platforms, our approach represents a significant step towards long-distance quantum-safe communication.
arXiv·2026-10-02·Matteo Mezzadri et al.
No generated summary available for this entry.
overview
Original abstract
We propose multi-spin molecules as a viable architecture for fault-tolerant quantum computing. To this aim, we introduce a correction protocol handling both diagonal and off-diagonal errors, typically associated with dephasing and relaxation. The scheme is based on a hybrid encoding which combines dephasing-tolerant units suppressing the leading pure dephasing error into a multi-spin molecule implementing a multi-qubit code for residual off-diagonal errors. Our proposal leverages peculiar properties of molecular spins, i.e. the strong hierarchy between different errors and the possibility to engineer multi-spin molecules at the synthetic level. Moreover, it addresses the important issue of the loss of coherences in anharmonic systems subject to off-diagonal errors, which hampers their correction at the single spin level. Thanks to the huge suppression of dephasing by the first-level code, we numerically demonstrate the potential performance of this strategy even with a limited number of spins per logical unit.
arXiv·2026-10-02·Letian Tang, Thomas Steckmann
No generated summary available for this entry.
overview
Original abstract
Bell sampling efficiently learns the stabilizer group, and hence the stabilizer nullity, of pure states with little magic, a primitive underlying tomography and certification of low-magic states. Real devices, however, only prepare noisy images of the target, which we model as a Pauli channel acting on the ideal state; the resulting noisy state generically has no exact Pauli stabilizers. Existing structure learners for mixed states rely on such exact stabilizers. Agnostic tomography does not, but its guarantees scale exponentially in the nullity $t$. We show that the ideal stabilizer group remains encoded in the noisy state as the set of Pauli operators under which it is invariant. We give Bell-sampling algorithms that learn the group to accuracy $\varepsilon$ for states of nullity at most $t$. The difficulty is that noisy samples break the group structure pure-state learners rely on, so more samples can erase structure rather than reveal it. We resolve this with a finder-verifier scheme that extracts stabilizer structure from partially corrupted sample batches while certifying proposed updates. For sufficiently weak global depolarizing noise, both samples and runtime are $\mathrm{poly}(n,t,1/\varepsilon)$ when the channel's total error probability is at most of order $\varepsilon n/t$. Up to a constant total error probability ($\approx 0.16$), samples remain polynomial while classical processing costs $2^t$, and for any error probability below one a $4^t$ overhead suffices. Arbitrary Pauli channels exhibit the same three regimes, with more restrictive thresholds. For weak Pauli noise, this closes much of the gap between agnostic learners such as stabilizer bootstrapping and polynomial pure-state algorithms.
arXiv·2026-10-02·Maureen Krumtünger, Maxwell West
No generated summary available for this entry.
overview
Original abstract
Understanding the speed with which various classes of quantum systems can scramble information is a key goal of quantum information theory, with relevance to both fundamental physics and the study of the efficiency of quantum algorithms. Famously, such understanding enabled Hayden and Preskill to show that, under the assumption that black hole dynamics may be modelled by a Haar-random unitary, old black holes act as ''mirrors'', reflecting infalling quantum information back out again effectively instantaneously. In this work, we investigate which aspects of this mirror behaviour survive beyond the Haar-random setting by considering a random free fermionic model of black hole dynamics. We find that the rate of information release is governed by the underlying representation-theoretic structure; such a black hole acts as a ''polarised mirror'', retaining information encoded in low fermionic-degree irreps while reflecting information encoded in high fermionic-degree irreps much more rapidly. As a result of the retention of low-degree information, we show that faithful recovery of the infalling quantum information is impossible until all but a vanishing fraction of the black hole has evaporated. However, augmenting the dynamics with a fixed Clifford unitary can restore their reflective behaviour, even though the ensemble's frame potential remains unchanged and far above its Haar value. Remarkably, we find that such black holes can outperform their fully Haar-random counterparts: in the high-fidelity limit, recovering a single-qubit message requires asymptotically approximately $37\%$ fewer emitted qubits.
arXiv·2026-10-02·Arthur Braida, Joseph Cunningham, Jérémie Roland
No generated summary available for this entry.
overview
Original abstract
An analog device implements a local Hamiltonian H, but a polynomial P (H) is in general not local, so the device cannot implement it. We carry P (H), to any prescribed accuracy, as the action of a single time-independent local Hamiltonian on an explicitly described invariant subspace. Short chains of ancilla qubits are attached to H. A chain of 2m sites has a unique isolated eigenvalue that is an analytic function of the input vanishing to order exactly 2m, because the input must cross the chain and come back before it can shift the energy at the far end. Chains of different lengths therefore form a triangular family, and a weighted sum of them reproduces a prescribed polynomial term by term. Even chains give the even part and odd chains the odd part, so any polynomial is reached. We prove uniqueness, analyticity and coefficient bounds uniform in the chain length for inputs H of norm below any r < 1. Where the circuit model pays degree 2l in 2l sequential oracle calls, the result here is one Hamiltonian of locality two more than that of H, which pays the degree in O(l^2 + log2^(1/eps)) ancillas and in energy scale. As an application we filter a marked eigenstate of a local Hamiltonian. Composing a synthesised square along the Chebyshev doubling identity works, but its energy scale grows quasi-polynomially with the degree. Iterating instead the exact eigenvalue branch of the two-site chain k times gives a filter on k + 1 ancilla qubits whose error decays geometrically in k, at an energy scale polynomial in the inverse passband width and independent of k, the locality growing by one per stage. In adiabatic optimisation with a rank-one driver, the construction replaces that non-local driver, by a Hamiltonian with O(log n) ancillas and O(log n)- body terms, at an energy scale polynomial in n. Simulations including every ancilla reproduce the spectrum of the ideal algorithm.
arXiv·2026-10-02·Alessio Benavoli, Felix Binder, Cangxiong Chen
No generated summary available for this entry.
overview
Original abstract
Information Processing Capacity (IPC) is a powerful system-agnostic metric for quantifying a dynamical system's computational capability and is widely used in quantum reservoir computing. However, standard IPC suffers from severe computational limitations. Computing IPC involves estimating how well the system can reconstruct, via linear regression, an (in principle) infinite family of orthogonal polynomial functions of delayed inputs. In practice, this evaluation must be made finite, so we need only to consider polynomials up to a chosen maximum degree. Moreover, the computational complexity for computing IPC grows combinatorially with the considered maximum degree and delay. Here, we introduce Kernel-IPC (KIPC), a scalable framework that uses kernel methods to compute the total IPC without explicitly enumerating basis functions. This allows us to account for the full (infinite) basis (without degree truncation). We also provide a null-hypothesis test for statistically comparing the KIPC of two dynamical systems. We validate KIPC on an echo state network and demonstrate its utility for quantum reservoir computing on a disordered spin chain.
arXiv·2026-10-02·Daniel J. Spencer et al.
No generated summary available for this entry.
overview
Original abstract
A central topic in economics and finance is the valuation of strategic games and bets, of investments providing uncertain future cashflows, and of other asset-like structures and contracts. Often, such valuation involves a probabilistic model, random variables, and computing expectation values of complex payoffs. Extending beyond this classical framework, a scenario emerges where assets are non-commuting operators and the inherent uncertainty is described by quantum states. In this work, we combine such notions of quantum finance with a graph-theoretic framework and ideas from contextuality. We discuss exclusive quantum assets and introduce scenarios when holding such assets can provide advantages over holding classical assets. In particular, we consider a "quantum market" based on nonlocal games such as the CHSH game and demonstrate that this setting can function as a market with well-defined financial structures. We provide upper bounds on the fair prices of the quantum assets based on graph-theoretic quantities like the independence number and the Lovász theta number. Our insights into markets of non-commuting assets help to elucidate what a financial system in a world filled with quantum technology could look like.
arXiv·2026-10-02·Mikhail Roiz et al.
No generated summary available for this entry.
overview
Original abstract
Gaussian Boson Sampling (GBS) has provided strong evidence of quantum advantage, motivating the search for real-world applications. Such applications rely on mapping physical problems to the native GBS output: photon-number patterns sampled from a highly non-trivial probability distribution. Here we derive a GBS-compatible mapping for the rate constant $k_\mathrm{IC}$ of internal conversion (IC), incorporating two important physical effects -- Duschinsky rotations and Herzberg--Teller contribution. We validate this framework using sampling \textit{simulations} of dibenzoterrylene, reproducing reported values of $k_\mathrm{IC}$. Beyond $k_\mathrm{IC}$ reconstruction, we show that the photon-number patterns of GBS encode the vibrational mode combinations responsible for the IC process, which we refer to as non-radiative pathways. This pathway-resolved data can then be grouped in different ways to extract multiple physically motivated observables. In particular, it enables $k_\mathrm{IC}$ analysis at several levels, from individual modes and mode family contributions to recurring vibrational configurations shared by multiple pathways. We find that Duschinsky rotations increase the fraction of $k_\mathrm{IC}$ associated with correlated vibrational pathways from 46% to 86%, and identify the mode combinations with the largest rate contributions. These pathway-resolved insights can guide targeted molecular modifications, including selective deuteration and bond substitution, to control non-radiative decay.
arXiv·2026-10-02·Yipei Liu et al.
No generated summary available for this entry.
overview
Original abstract
Quantum computing is a promising paradigm for problems that are challenging for classical machines, but realizing that promise requires far more qubits than a single processor can offer. Distributed quantum computing (DQC) scales out by connecting multiple quantum processing units (QPUs), at the cost of making entanglement the scarce resource: every remote gate consumes a Bell pair, and inter-QPU links generate Bell pairs at finite rates orders of magnitude slower than local gates. Since quantum programs are executed repeatedly, this rate bounds how fast shots complete and thus how fast results are obtained. Existing DQC compilers emit a single implementation per circuit, so throughput is capped by its busiest link while other links stay idle. We observe that alternative compilations of the same circuit are logically equivalent yet stress different links; executing them concurrently and pooling their samples converts idle Bell pairs into additional shots. We formulate the joint selection of compilations and allocation of shots under per-link Bell-pair capacities as Candidate-Constrained Max-Shot Allocation (CMA), prove it NP-hard, and solve it with a dynamic program and its approximate variant AppDP, a compact MILP, and a greedy heuristic Effi. In simulation on six-QPU networks, multi-compilation raises throughput by 2-4.5* over the single compilation and correspondingly improves output fidelity under equal Bell-pair budgets. On hardware, it increases measured fidelity by up to 93% and reaches the single-compilation fidelity in up to 10* less time. Scaling to 36 QPUs and 144-qubit circuits, MILP improves throughput over the single compilation by 76.8% on average across 48 configurations while Effi allocates in milliseconds.
arXiv·2026-10-02·Edoardo Suerra et al.
No generated summary available for this entry.
overview
Original abstract
Time-domain multiplexing of continuous-variable quantum states provides a scalable approach to photonic quantum information processing, in which individual temporal modes can be sequentially manipulated within a common optical path. Here we demonstrate pulse-resolved post-generation phase control of squeezed-vacuum states at a repetition rate of 93 MHz using a low-loss bulk lithium-niobate electro-optic modulator driven by a broadband RF power amplifier. The driving architecture exploits low-cost, commercially available RF components and the impedance mismatch between the RF chain and the capacitive crystal load, rather than relying on dedicated custom high-voltage electronics, to obtain large voltage excursions on the modulator while operating above the piezoelectric-resonance region of lithium niobate. The modulator is driven synchronously with the optical pulse train, enabling the phase of consecutive temporal modes to be individually controlled. An interferometric calibration yields a maximum differential phase excursion of 1.93 rad. We apply the modulator to a 1035 nm squeezed-vacuum field generated by a synchronously pumped optical parametric oscillator and characterize the output using time-resolved balanced homodyne detection. With the local-oscillator phase kept fixed, the phase of the squeezed state is varied from pulse to pulse, and the corresponding phase-dependent quadrature variance is reconstructed. The resulting quadrature scan agrees with an equivalent measurement obtained by varying the local-oscillator phase with a piezoelectric actuator. These results demonstrate post-generation quantum-state phase control at the individual-pulse level and provide an electro-optic building block for programmable manipulation of time-multiplexed quantum states in recirculating optical architectures.
arXiv·2026-10-02·Ryan J. J. Connor et al.
No generated summary available for this entry.
overview
Original abstract
Solving the high-dimensional, nonlinear partial differential equations that govern the rich physics of plasmas remains a major computational challenge. In fluid dynamics, quantum-inspired methods based on tensor-network techniques have recently emerged as a promising new paradigm, offering large degrees of data compression on conventional hardware and a natural pathway towards solving exponentially large problems on quantum computers. Early studies suggest that tensor-network methods may also help overcome key bottlenecks in computational plasma dynamics, particularly for industry-relevant scenarios where conventional simulations remain costly. In this work, we present recent progress in developing tensor-network methods compared to standard particle-in-cell codes and discuss their capability to overcome the bottlenecks of conventional approaches. We further extend the tensor-network formulation to support the insertion of electromagnetic fields at arbitrary spatial locations. This capability is demonstrated through the injection of a laser field to accelerate a plasma, providing a key step towards tensor-network-based simulation of externally driven plasma systems.
arXiv·2026-10-02·M. F. Z. Arruda et al.
No generated summary available for this entry.
overview
Original abstract
Stimulated parametric down-conversion (StimPDC) is the seeded version of the process that underlies much of photonic quantum information. Replacing the vacuum at one input port with a coherent seed leaves the interaction Hamiltonian, the phase-matching function and the two-photon amplitude unchanged, while raising the output to levels accessible with ordinary classical detectors. This review treats the transverse spatial physics of that process. We show that a single relation, in which the idler amplitude is the pointwise product of the pump field with the complex conjugate of the seed, organizes results usually presented separately: the image and coherence transfer experiments of the 1990s; phase conjugation and its use for wavefront correction; the conservation and conjugation of orbital angular momentum, together with the generation of radial modes and geometric intensity patterns; and the processing of vector vortex beams carrying spatially varying polarization. We then consider StimPDC as an instrument rather than as an object of study, covering stimulated emission tomography, the experimental realization of Klyshko's advanced-wave picture, and the transfer of partial coherence, including the conservation of the twist phase of twisted Gaussian Schell-model beams. We close with the quantum regime, reached when the seed approaches the single-photon level or the idler is used as a herald, and with an assessment of open problems and prospective applications.
arXiv·2026-10-02·Otavio A. D. Molitor, Sergii Strelchuk, Michał Studziński
No generated summary available for this entry.
overview
Original abstract
Collective noise can leave degrees of freedom unaffected, allowing them to store quantum information. Processing this information also requires physically available logical gates. We consider $r$ fundamental qutrits transforming under $U\in SU(3)$ and $s$ dual qutrits transforming under its complex conjugate $\overline U$, with collective action $R_{r,s}(U)=U^{\otimes r}\otimes\overline U^{\otimes s}$. Using the image of the walled Brauer algebra and Lie-algebra arguments, we show that adjacent exchanges within each qutrit type and one singlet-projector interaction between the two types generate any independently chosen family of special unitary gates on the noiseless subsystems by a finite pulse sequence, for every $r,s\geq1$. This establishes semi-universality of this system. We illustrate the result with a numerically optimised sequence of 24 pulses for three fundamental qutrits and one dual qutrit. We then use the encoding and available logical corrections for qutrit teleportation under correlated Weyl noise. Under explicit assumptions on channel composition and which trials are retained, and allowing for baseline implementation errors, we identify noise ranges in which encoded teleportation exceeds the classical fidelity bound of $1/2$, while the unencoded teleportation channel is entanglement breaking. We analyse fidelity on accepted trials separately from the transmission costs of the additional physical qutrits.
arXiv·2026-10-02·Yu Yang et al.
No generated summary available for this entry.
overview
Original abstract
Quantum covert target sensing aims to detect low-reflectivity targets embedded in the thermal environment while avoiding discovery by an adversary. This covertness requirement constrains the admissible probe energy, thereby imposing a trade-off between covertness and sensing performance. However, how this resource constraint determines the ultimate estimation precision of the target parameter remains largely unexplored. To fill this gap, we establish a unified framework connecting covert target discrimination with quantum-enhanced parameter estimation. We first present perturbative $ε$-covertness-induced bounds on the probe energy, which yield an admissible energy window narrowing as $\mathcal{O}(\sqrt{ε/M})$. Moreover, we introduce the covertness-constrained quantum Fisher information (CCQFI) to quantify the ultimate precision of target-reflectivity estimation and assess its attainability with specific measurements. For Gaussian-distributed coherent-state (GCS) and two-mode squeezed vacuum (TMSV) probes, their CCQFIs scale as $\mathcal{O}(ε)$ and $\mathcal{O}(M)+\mathcal{O}(\sqrt{εM})+\mathcal{O}(ε)$, respectively. In particular, in the strong covertness regime $ε\to0$, the GCS CCQFI vanishes, whereas the TMSV retains a finite $\mathcal{O}(M)$ contribution exhibiting a pronounced metrological advantage. Besides, photon counting saturates the GCS CCQFI, whereas homodyne detection achieves a higher attainability for the TMSV probe. Our work identifies covertness as a quantitative resource constraint governing the metrological limits of quantum target sensing.
arXiv·2026-10-02·Devroop Kar, Daniel Krutz, Travis Desell
No generated summary available for this entry.
overview
Original abstract
Hybrid quantum classical neural networks integrate parameterized quantum circuits (PQCs) with established deep learning architectures, but their performance depends strongly on the choice of quantum circuit architecture, a choice that remains largely manual. Most existing approaches rely on hand-designed or fixed circuit ansätze, requiring circuit structure, gate composition, and qubit connectivity to be specified in advance with no guarantee that they suit the task. This limitation is especially acute in image classification, where quantum circuits must transform features extracted by classical networks while remaining compact enough for practical training, requirements that generic, task-agnostic ansätze are unlikely to satisfy simultaneously. We extend EXAQC, an evolutionary framework for automated quantum circuit discovery, to image classification. EXAQC evolves PQCs as intermediate processing modules while retaining classical feature-extraction and prediction layers. On MNIST, Fashion-MNIST, and CIFAR-10, EXAQC achieves 98.42%, 90.62%, and 85.47% accuracy, respectively, while using comparable gate counts to other quantum architecture-search methods. Against classical networks, evolved hybrid models maintain comparable accuracy with substantially fewer trainable parameters, reaching 85.68% on CIFAR-10 with over 25$\times$ fewer parameters than a 10-layer CNN. Encoding choice also matters: rotation-based encodings (RX, RY, U3) outperform amplitude encoding by 22-25 points on CIFAR-10. These results demonstrate that automated circuit discovery yields compact quantum modules that can replace larger classical components in vision architectures while retaining competitive accuracy.
arXiv·2026-10-02·Dávid Ferenc
No generated summary available for this entry.
overview
Original abstract
A method for solving the two-center Dirac equation using a Gaussian-product basis set tailored to the axial symmetry of diatomic systems is presented. For the ground state of H$_2^+$ at an internuclear distance $R=2.0~a_0$, we obtain a relativistic energy with relative precision at the $10^{-18}$ level. The properties of the basis set allow for an analytic Fourier transform of the wave function. As a first application we evaluate, for the first time, the zero-potential contribution to the one-loop self-energy for H$_2^+$ in Feynman and Coulomb gauges. Although this contribution is not separately gauge invariant, its calculation provides a proof of principle for the use of the present framework in prospective QED calculations.
arXiv·2026-10-02·Shuoming An, Fusheng Yang
No generated summary available for this entry.
overview
Original abstract
A code is described by three numbers: its physical qubits, its logical qubits, and the smallest error it cannot detect, counted in qubits. The first two are linear algebra. The third, the distance, is an optimum over an exponentially large set, read off a solver whose answer carries no certificate. Whether a code's parameters can be checked uniformly across codes, with a certificate of proved size, is open. Here we show that they can, by moving the unit of work from the code to a \emph{certificate}, a short object, either a list, a pairing or a symbolic instance, whose correctness the kernel of the \Lean\ proof assistant decides by computation. The kernel is the small core that checks each step. The certificate's size is itself a theorem: its enumeration form lists the vectors of weight below the distance $d$, $\sum_{j<d}\binom{n}{j}$ of them, a polynomial in the code's length $n$ at fixed distance $d$. No bound uniform over codes in both $n$ and $d$ is smaller. For product families the certificate is smaller still, the bound being proved once, symbolically. Deciding that a vector lies outside the row space of the check matrix, the set of sums of its rows, becomes one matrix-vector product and one inner product. On an eighteen-qubit toric code, a surface code closed into a torus, the whole-file check of that decision falls from 42\,s to 9\,s. Eleven code families and thirty-nine parameter sets follow, the widest at 1872 qubits. Nothing beyond the three standard axioms of \Lean's logic is trusted, though the generator that writes a code's checks stops at twenty qubits, and the lower bound for the 144-qubit code is imported rather than proved here. A distance becomes checkable rather than believed, and the same move applies wherever else a computation ends in a solver.
arXiv·2026-10-02·Francisco Escudero Gutiérrez, Junseo Lee, Sebastian Zur
No generated summary available for this entry.
overview
Original abstract
We establish lower bounds for Hamiltonian property testing with access to the time-evolution operator but not its inverse. Each experiment may query the time-evolution operator multiple times, and distances between Hamiltonians are measured in the normalized Frobenius norm. In this model, we show that testing whether a Hamiltonian is $k$-local or $\varepsilon$-far from every $k$-local Hamiltonian requires $Ω(1/\varepsilon^2)$ total evolution time, matching the upper bound of Kallaugher and Liang (TQC'25). We also prove that testing whether an unknown Hamiltonian equals a target Hamiltonian or is $\varepsilon$-far from it requires $Ω(1/\varepsilon^2)$ total evolution time, matching the upper bound of Sinha and Tong (2025). These are the first lower bounds for natural problems in Hamiltonian learning and testing that rule out Heisenberg-limited scaling of $1/\varepsilon$. As a third result, we show that amplitude estimation to precision $\varepsilon$ requires $Ω(1/\varepsilon^2)$ total time evolution, recovering the result of Tang and Wright (QIP'26) in the continuous-time query model. All three results follow from the hardness of distinguishing the zero Hamiltonian from a suitably chosen ensemble of random Hamiltonians. We establish this hardness by adapting the continuous-time adversary method to forward Hamiltonian evolution.
arXiv·2026-10-02·Alireza Nourmandipour, Stefano Mancini
No generated summary available for this entry.
overview
Original abstract
We investigate how dissipation can emerge in a quantum network from temporal fluctuations of the interaction topology. For a network whose graph is redrawn at short time intervals, the averaged dynamics yields a Markovian master equation: the mean network fixes the coherent part and the covariance fixes the dissipative structure. The covariance eigenvalues set the noise strengths, while its eigenvectors determine the collective operators on which those strengths act. Two ensembles with identical mean adjacency and covariance spectra but different eigenvectors produce distinct dynamics despite identical purity. A physically realizable model yields an analytically predicted dissipative gap, giving quasi-protected dynamics. These results establish fluctuating connectivity as a resource for engineering quantum dissipation and protection.
arXiv·2026-10-02·Ipsita Mandal
No generated summary available for this entry.
overview
Original abstract
We investigate collective charge excitations in three-dimensional vortex nodal-ring semimetals (VNRs), whose pseudospin texture winds around the nodal ring and differs qualitatively from that of the conventional $\mathcal{PT}$-symmetric nodal-ring semimetal (PTNR). While plasmon modes in PTNRs have been studied in a companion work, arXiv:2609.35373. Here, we focus on how a VNR's pseudospin texture changes the response compared with the former. Within a low-energy two-band description and the random-phase approximation, we analyse the density response, density-of-states, Drude weights, dielectric function, and plasmon modes at low doping. We consider the untilted system together with in-plane and axial band-tilts. Although the VNR and PTNR have distinct Hamiltonians, pseudospin textures, and Berry-curvature distributions, their linearised energy dispersions coincide. The vortex texture, however, introduces a toroidal-angle dependence in the band-overlap factor and quantum metric, thereby modifying the charge response. We examine how these effects enter the dielectric screening and collective modes for different wavevector orientations. Our results clarify how pseudospin texture, beyond the band dispersion alone, influences collective charge dynamics in three-dimensional nodal-ring semimetals.
arXiv·2026-10-02·Johannes Mögerle et al.
No generated summary available for this entry.
overview
Original abstract
We present a numerical study of a blockade Hamiltonian with a local $\mathbb{Z}_2$ symmetry. For such models, the existence of a topologically ordered ground state has been proven rigorously for weak Rabi driving [T. F. Maier et al., PRX Quantum 6, 030340 (2025)]. However, the phase diagram beyond weak driving is still an open question. We perform large-scale infinite-size density matrix renormalization group (iDMRG) simulations on a cylinder and map out the full phase diagram of the model. We find a single continuous phase transition between the topologically ordered phase and a trivial paramagnetic phase, and confirm numerically the stability of the topologically ordered phase up to Rabi drives comparable to the characteristic energy scale of the system. Furthermore, we compute the excitation gaps and show that the charge gap remains open across the phase transition and charges become confined in the trivial phase. On the other hand, the gap in the symmetric sector closes at the transition, consistent with the condensation of flux excitations.
arXiv·2026-10-02·Debashis Saha, Zhen-Peng Xu, Adán Cabello
No generated summary available for this entry.
overview
Original abstract
A fundamental prediction of quantum mechanics is that observables can be measured through ideal measurements, that is, measurements that give the same outcome when repeated and do not disturb any observable that is jointly measurable. In terms of quantum instruments, such an ideal measurement is described by projective effects together with the associated Luders state-update rule. Here, we show that quantum mechanics allows for self-testing any ideal measurement. Using solely the output statistics of bipartite Bell tests in which a non-demolition measurement is sometimes added, it is possible to certify in a device-independent manner whether the added measurement is ideal.
arXiv·2026-10-02·Nirvik Sahoo, Paul Robert Griffin
No generated summary available for this entry.
overview
Original abstract
Feature selection for imbalanced classification tasks such as credit card fraud and consumer default detection requires balancing predictive relevance, inter-feature redundancy, and computational feasibility. We benchmark three computing paradigms, classical branch-and-bound optimization (Gurobi), photonic entropy computing (QCI Dirac-3), and simulated photonic boson sampling (Piquasso), across thirteen feature-selection methods on two datasets: ULB Credit Card Fraud (30 features) and AmEx consumer default (159 features). Each method is routed to the solver matched to its mathematical structure. On ULB, Dirac-3 MI-Spearman matches the all-features model using 13 of 30 features (mean F1 0.873 +/- 0.023 over five runs, best run 0.896), and Piquasso is the best method at k=5. On AmEx, performance rises steadily with the feature budget and every paradigm approaches F1 = 0.80 only near the full feature set. Most differences between Gurobi and Dirac-3 on identical methods fall within run-to-run variation; the large gaps occur where the certified optimum generalizes poorly, most sharply for distance correlation on AmEx at k=25 (Gurobi F1 = 0.422 vs. a Dirac-3 mean of 0.746). At matched budgets, F1 varies about ten times more across methods on ULB than on AmEx, which we trace to how concentrated the predictive signal is in each feature space.
arXiv·2026-10-02·Vadim Lebedev et al.
No generated summary available for this entry.
overview
Original abstract
Here, we report the fabrication and characterization of single crystal diamond films on a two-inch wafer-scale containing three-dimensional layered structures of negatively charged nitrogen-vacancy color centers (NV$^{-}$). The (100)-oriented layered diamond films were grown by chemical vapor deposition (CVD) to create spatially separated regions of enhanced emission associated with NV$^{-}$ centers. Such localized emission enhancement as well as 2D and 3D arrays of spins could enable close-packed architectures for emerging quantum devices, such as data processors, memory cells, and magnetic sensors. A cyclic sequence of CVD growth and oxygen-plasma etching is employed, resulting in the in-situ formation of layered inverted pyramidal structures with flat $\{$111$\}$ sidewalls. These pits are subsequently overgrown by nitrogen-doped diamond to achieve NV$^{-}$-rich facets with a uniform N-V bond arrangement and improved nitrogen incorporation efficiency.
arXiv·2026-10-02·Ali Vahedi
No generated summary available for this entry.
overview
Original abstract
We study a finite-width Majorana shutter as a local, time-dependent scattering defect and determine which features of its infrared memory are insensitive to the microscopic spatial profile. For a smooth shutter, the zero-frequency scattering matrix is fixed by the integrated coupling, while finite-width corrections vanish in the long-wavelength limit. A time-dependent switch then produces an infrared Bogoliubov kernel whose singular part is controlled by the change in this scattering matrix. We examine the many-body response through three observables. The overlap of the pre- and post-shutter Gaussian vacua exhibits Anderson orthogonality, with an exponent set by the scattering angle. A lattice calculation of the post-quench quasiparticle number resolves its logarithmic infrared growth, reaching the predicted coefficient in the slow-switch test and reproducing the expected dependence on the scattering-angle change. When the entanglement cut passes through the shutter, the entropy follows the effective-central-charge description of a conformal defect, with parameter-free agreement at the percent level, improving for the wider shutter. When the shutter lies inside the interval, its contribution remains a subleading finite-size correction. A local bilinear correlator approaches the expected Majorana power law and shows no stable logarithmic amplitude. These results show that the same low-frequency scattering data control distinct global and spatial observables, while their infrared coefficients are not interchangeable. The remaining limits are also made explicit: the finite-memory correction to the continuum kernel and the controlled continuum limit of large-interval spatial entropy.
arXiv·2026-10-02·Ayaka Fujimoto et al.
No generated summary available for this entry.
overview
Original abstract
Predicting many molecular properties requires accurate ground-state energies of molecular Hamiltonians. Quantum-selected configuration interaction (QSCI) obtains such energies by measuring an input state to select important electronic configurations and classically diagonalizing the Hamiltonian in the subspace they span. ADAPT-QSCI, an adaptive extension of QSCI, improves the input state through iterative circuit growth. For single-reference molecules, the sampling distribution is dominated by the Hartree-Fock (HF) configuration, so most measurements reproduce a configuration already known. We reduce this redundancy by placing the HF configuration in the diagonalization subspace classically, before any measurement. This invalidates the operator-selection criterion of ADAPT-QSCI, and we derive a consistent replacement with energy and gradient in closed form, adding no query to the quantum device. At the per-iteration shot budgets previously used for ADAPT-QSCI, the proposed scheme reaches chemical accuracy with approximately $63\%$ and $43\%$ of the CNOT gates for $\mathrm{H}_4$ and $\mathrm{H}_6$, and $44\%$ and $40\%$ of the total shots. The advantage depends on the budget, however: in the infinite-shot limit the $\mathrm{H}_4$ CNOT count increases to $125\%$ of that of ADAPT-QSCI. These results identify the per-iteration shot budget as a key design variable governing resource savings in QSCI-based algorithms.
arXiv·2026-10-02·Ida Mishra et al.
No generated summary available for this entry.
overview
Original abstract
The dimensionality of entanglement in high-dimensional quantum systems is quantified by the Schmidt number, whose large value signals potential advantages for quantum communication and quantum computation. A commonly used approach to practical Schmidt-number detection in finite-dimensional systems is based on the estimation of fidelities to pure states with large entanglement dimensionality or lower bounds to these fidelities. However, for mode-entangled continuous-variable systems, the corresponding measurements are typically difficult to realize. Here, we introduce and assess fidelity bounds for Schmidt-number detection based on practically more accessible measurements of the first and second statistical moments of arbitrary continuous-variable quantum states. We provide analytical formulas that allow evaluating these bounds and test them for families of Gaussian and non-Gaussian states, including two-mode squeezed thermal states and photon-added displaced two-mode squeezed vacuum states. We compare our bounds to other methods for the certification of high-dimensional entanglement based on the same measurements.
arXiv·2026-10-02·Nisarg Vyas, S. Harshini Tekur, M. S. Santhanam
No generated summary available for this entry.
overview
Original abstract
The spectral fluctuations in complex quantum systems are modeled in terms of spectra from random matrices. Quantitative agreement with random matrices holds only when the quantum spectrum is a pure sequence, and not a composite spectrum that mixes levels from different symmetry sectors. It was shown earlier that discrete symmetries in composite spectra can be detected using higher-order spacing ratio statistics provided the symmetry sectors are of equal dimensions. The general case is when the symmetry sectors have unequal dimensions, and the symmetries of the Hamiltonian system are unknown or only partially known. In this work, we address how the number of symmetry sectors can be determined from a composite spectrum arising in Hermitian and non-Hermitian settings. A Best Subset Technique is proposed for determining the number of the symmetry sectors by comparing the spectral fluctuations to that of an appropriate random matrix ensemble without requiring de-symmetrization. It is demonstrated using spectra from Gaussian, Wishart and Ginibre ensembles, and also for spectra drawn from many-body quantum systems.
arXiv·2026-10-02·Swarup Sangiri, A Taraphder
No generated summary available for this entry.
overview
Original abstract
We develop a finite-state geometric framework based on third-order Bargmann invariants for evaluating Chern numbers and characterizing local quantum-state geometry. Using gauge-invariant state overlaps, the framework evaluates the Chern number directly on discretized parameter spaces while retaining local geometric information through the phase-derived density and the complementary amplitude density, as well as signatures associated with changes in topological character. We apply the construction to the Qi--Wu--Zhang, $1/3$- and $1/4$-flux Hofstadter, SSH, and Rice--Mele models, including a rank-$2$ extension for isolated composite subspaces and applications to closed-loop and parameter-space topology. The resulting framework organizes Chern topology and local geometric information directly from finite-state data, providing a compact state-based description without relying on dynamical evolution.
arXiv·2026-10-02·Luning Zhao et al.
No generated summary available for this entry.
overview
Original abstract
Quantum-classical auxiliary-field quantum Monte Carlo (QC-AFQMC) is a promising route to using quantum computers for strongly correlated electronic structure problems, but its scalability is limited by a classical post-processing bottleneck: the measured quantum trial state must be used to evaluate overlaps, force biases, and local energies for many walkers throughout the AFQMC propagation. Existing matchgate-shadow approaches avoid the exponential cost of generic classical shadows, but their post-processing remains expensive for large systems. In this work, we show that particle-number-preserving fermionic shadows, implemented as orbital-rotation shadows, are able to drastically reduce QC-AFQMC post-processing costs. We derive efficient estimators for overlaps and their derivatives, giving $O(N^3)$ scaling for overlaps and force biases and $O(N^4)$ scaling for local energies per shadow and walker and with $O(N)$ Cholesky vector. For fixed normalized target determinants, we also prove that the overlap estimator is unbiased with variance upper bounded by $O(η)$, where $η$ is the particle number, yielding a sufficient budget of $O(η/ε^2)$ ideal independent measurements for additive overlap error $ε$. We combine these estimators with a novel virtual-correlation-energy treatment and a GPU implementation and demonstrate QC-AFQMC using orbital-rotation shadows. Performance projections for $π$-conjugated molecules up to pentacene with a (22e, 22o) active space and 356 total orbitals show that the full classical post-processing workflow can be completed in slightly more than two days on 8$\times$A100 graphics processing units (GPUs). These results significantly reduce classical post-processing costs for QC-AFQMC and motivate further improvements in preparation and measurement of the trial state on quantum hardware.
arXiv·2026-10-02·Bora Baran et al.
No generated summary available for this entry.
overview
Original abstract
Fast control of long-lived quantum registers often relies on an auxiliary degree of freedom, a mediator, but real mediator excitation can introduce decoherence, leakage, or loss when the mediator is not the coherence-optimized component. We introduce dispersive interaction via analytical linear inversion (DIAL), an analytical control construction for excitation-suppressed interaction engineering in mediator-coupled quantum registers. In the dispersive regime, we show that off-resonant driving of an effective two-level mediator transition yields a diagonal Hamiltonian whose Pauli-\(Z\) interaction rates depend linearly on the drive intensities through a transfer matrix determined by the register-resolved transition spectrum. This establishes a direct linear map from experimentally accessible controls to induced multi-qubit interactions, enabling control design without iterative propagation of the full driven dynamics. We turn this structure into the target-aware DIAL algorithm, which selects favorable off-resonant tones and determines their drive intensities for a prescribed target interaction. We benchmark the resulting controls across 100 register realizations for each register size \(n=2,3,4,5\), targeting the highest-order interaction \(Z_1\cdots Z_n\) with an interaction phase of magnitude \(π/4\), which generates an \(n\)-qubit GHZ state up to local equivalence. Propagation under the full driven mediator-register dynamics yields typical gate fidelities above \(0.997\), while the maximum transient mediator excitation remains near \(1\%\) on average, far below what is typically possible with resonant Rabi drives. The manuscript is accompanied by an open-source Python package implementing the target-aware DIAL algorithm and the associated numerical validation workflow.
arXiv·2026-10-02·Jaromír Fiurášek
No generated summary available for this entry.
overview
Original abstract
We present and theoretically analyze a method for direct estimation of the second-order correlation function $g^{(2)}(0)$ from the click statistics of a multiplexed detector composed of M binary on-off detection channels. The method uses linear estimators of the first and second moments of the photon-number operator and can provide accurate results even for optical fields with substantial mean photon numbers. For a fixed number of channels, the detection range can be extended by introducing additional losses before the detector. We demonstrate the performance of the method for coherent, thermal, amplitude-squeezed, and photon-added coherent states. We also derive a nonclassicality criterion based on the estimated correlation function and show how the method can be adapted to unbalanced detectors. Our work establishes direct estimation of $g^{(2)}(0)$ as a simple and versatile method for quantitatively characterizing quantum light using multiplexed click detectors.
arXiv·2026-10-02·Akshat Gupta et al.
No generated summary available for this entry.
overview
Original abstract
In a world fraught with uncertainty, it behooves us to consider the most disastrous possible outcomes, in order that we can best mitigate against them. Often these are extreme risk events -- of high consequence, but low probability. Yet, the rarity of such events limits our ability to study them; there is a paucity of past occurrences to draw upon, and sampling such rare events from models is typically costly in time. Here, we introduce an approach for rare-event sampling based on quantum stochastic models. This integrates the memory advantages of quantum stochastic modelling -- and its associated efficient means of preparing quantum sample states -- with the `speed-ups' of quantum amplitude amplification, to yield simultaneous reductions in spatial and temporal computational complexity compared to classical Monte Carlo-based approaches.
arXiv·2026-10-02·Paweł Caban, Muhammad Mohsin
No generated summary available for this entry.
overview
Original abstract
In our paper, we show that a two-qutrit Werner state admits a local hidden-variable model for all values of the parameter in a scenario involving two projective measurements per site, with three outcomes per measurement. To this end, we derive a simple sufficient condition under which a two-qutrit state satisfies the Collins-Gisin-Linden-Massar-Popescu inequality for arbitrary choices of Alice's and Bob's observables, and show that the Werner state always satisfies this condition. Next, we use the fact that any two-qutrit state satisfying the Collins-Gisin-Linden-Massar-Popescu inequality for arbitrary choices of Alice's and Bob's observables admits a local hidden variable model.
arXiv·2026-10-02·Gaoqing Meng, Mingshu Zhao
No generated summary available for this entry.
overview
Original abstract
The center of mass of a Bose--Einstein condensate in a harmonic trap oscillates at the trap frequency independently of the interactions. Without interactions a parity-time-symmetric gain-loss gradient leaves this frequency unchanged, and a cloud of the ground-state width is translated rigidly while the atom number is periodically modulated. With interactions the protection is lost, because the gain and the loss change the number of atoms; the modulated atom number drives the width of the cloud, and the width acts back on the center of mass. At small gain the period grows quadratically with the gain strength, with a coefficient that in the Thomas--Fermi regime is set by the size of the cloud alone. The family of periodic orbits continued from the Kohn oscillation can be followed up to a critical gain, where it comes into resonance with highly excited states of the trap, and over the computed families this critical gain decreases with the amplitude of the oscillation and with the size of the cloud. A five-variable moment model reproduces the period and the width of the cloud along the orbits nearly up to the critical gain.
arXiv·2026-10-02·Peng Xu, Li-E Qiang
No generated summary available for this entry.
overview
Original abstract
Stochastic semiclassical gravity represents stress--energy fluctuations through the Einstein--Langevin noise kernel. We examine its Newtonian projection for specified closed, particle-number-conserving non-relativistic sources and distinguish the source covariance from a reduced matter channel. The connected one-particle covariance is state dependent and differs from the universal potential-noise law postulated in the Diósi--Penrose model. To relate the source spectrum to dephasing, we define a separate static probe subject to a prescribed Gaussian noise law. For a finite-variance source operator in an isolated non-degenerate eigenstate, the full connected spectral measure has a gap around zero. The probe dephasing exponent is then bounded and its long-time slope vanishes. Stationary doublets can instead carry static or low-frequency spectral lines, while a specified freely spreading Gaussian source gives a finite limiting exponent. Continuum results depend on preparation, normalisation, infrared regularisation and the order of limits. We also compare coherent and incoherent many-body preparations and establish no-signalling for fixed classical-noise channels. These results identify the spatial, temporal and dynamical assumptions needed to relate source fluctuations to a matter-decoherence model. They do not exclude Markovian limits in other number-conserving non-relativistic preparations.
arXiv·2026-10-02·Hayato Arai, Yasuaki Nakayama
No generated summary available for this entry.
overview
Original abstract
An alchemical resource theory admits a nonfree state that can be exactly replicated by free operations and whose finitely many copies enable exact simulation of arbitrary quantum instruments. The only known nontrivial examples, imaginarity and parity asymmetry, exhaust the qubit case (arXiv:2609.12988) and exhibit an all-or-nothing property: any nonmaximal resource exactly simulates only free unitaries. We introduce aquaternionicity for even-dimensional qudits $d\ge4$, based on a quaternionic structure represented by an antiunitary $Θ$ with $Θ^2=-I$. It is extremal in two senses: every pure state is alchemical, and alchemicality is maximally abundant under mixing. Within this framework, for any nontrivial $d$-dimensional resource theory and pure alchemical state $g$, the admissible pure-mixing set satisfies $\dim\mathcal M_g\le 2d-4,$ which aquaternionicity saturates for every pure state. Conversely, these two extremal properties characterize the quaternionic structure. Because every pure state is alchemical, the initial resource can be chosen to match the known noise structure. Moreover, when the noisy resource states remain within a common isotropic subspace, the same free processor works exactly for all of them while returning the resource unchanged. This enables recalibration-free exact simulation, including universal quantum computation, and is realized for standard dephasing and dissipative noise, where aquaternionicity substantially outperforms imaginarity and parity asymmetry.
arXiv·2026-10-02·Dominic W. Berry et al.
No generated summary available for this entry.
overview
Original abstract
We give quantum algorithms for Hamiltonian simulation, linear differential equations, and linear systems with square-root dependence on sparsity. For an $s$-sparse Hermitian matrix with row and column Euclidean norms bounded by $η$, evolution for time $t$ to error $ε$ uses $\mathcal{O}(\sqrt{s}τ+\sqrt{sτ\log(1/ε)}+\log(1/ε))$ queries, where $τ=η|t|$. The same bound holds for time-dependent Hamiltonians with coherent time-indexed sparse access and certified time discretisation. Our construction combines an exact entrywise representation with Cayley transducers. A joint lower bound nearly matches the time, sparsity, and precision dependence, ruling out a uniformly additive bound in $\sqrt{s}τ$ and $\log(1/ε)$. For dissipative linear differential equations we obtain $\mathcal{O}(\bar g[\sqrt{s}(τ+\sqrtτ)+1]\log(C\bar g/ε))$ queries, where $τ$ is the evolution time multiplied by a norm bound, $\bar g$ bounds the ratio of combined input and source norms to the final-solution norm, and $C$ is an absolute constant. We sharpen this bound by separating Hamiltonian and dissipative components, and treat general constant generators. Lower bounds capture joint parameter dependence for time-dependent equations and precision hardness for constant positive semidefinite dissipation. For linear systems, a Cayley walk and Chebyshev filter give $\mathcal{O}(κ\sqrt{s}\log(1/ε))$ queries when $\|A\|\le1$ and $\|A^{-1}\|\leκ$, and we give an alternative proof of a matching joint lower bound. We also give gate-efficient implementations of time-independent Hamiltonian simulation and the dissipative ODE solver, including Lipschitz time dependence, retaining the query bounds with polylogarithmic overhead in inverse precision given efficient entry decoding, arithmetic, and required source preparations.
arXiv·2026-10-02·Jielun Chen, Jiace Sun, Garnet Kin-Lic Chan
No generated summary available for this entry.
overview
Original abstract
The first-principles quantum simulation of the full electronic Hamiltonian of a material model of realistic size appears daunting even in a future era of fully fault-tolerant quantum computers. In contrast, classical simulations of material excited states rely on heuristic quasiparticle frameworks, such as the GW approximation and Bethe-Salpeter equation, where only a few quasiparticles are explicitly considered. Here we give a detailed description of quasiparticle quantum simulation for multi-excitonic states within the BSE. We develop an explicit first-quantized, orbital-based block encoding of the multi-exciton BSE Hamiltonian for qubitization, and reduce its cost using integral factorization and crystal symmetries. For a materials model of size $N$, and a fixed number of quasiparticles, the resulting algorithms require $\widetilde{O}(N)$ Toffoli gates and $O(\log N)$ logical qubits, or, using space-time tradeoffs, $\widetilde{O}(\sqrt{N})$ Toffoli gates and $\widetilde{O}(\sqrt{N})$ logical qubits, achieving up to a sixth power reduction in Toffoli count, or up to exponential reduction in qubit count, versus standard full Hamiltonian simulation techniques that have been explored in materials simulation. Resource estimates for the classically challenging problem of triexcitonic eigenvalue estimation across a range of semiconductor models of a realistic physical size of $O(10^3)$ atoms, show that our Toffoli-optimized implementation reduces the Toffoli count by $10^6-10^7$ relative to full Hamiltonian simulation estimates, while a qubit-optimized implementation requires only a few hundred logical qubits. More broadly, these results show that classical heuristic frameworks will be essential in the design of future fault-tolerant quantum algorithms for materials.
arXiv·2026-10-02·Caesnan M. G. Leditto, Kuo-Chin Chen, Min-Hsiu Hsieh
No generated summary available for this entry.
overview
Original abstract
Preparing Gibbs states through dissipative dynamics requires controlling convergence for the chosen Hamiltonian $H$ and coupling operators. However, efficient implementation requires convergence guarantees from the spectral gap of the generator of the dynamics, which remains a crucial challenge. Recent results address the challenge by restricting the dynamics with structural assumptions about the Hamiltonian and its interactions. For the Chen-Kastoryano-Gilyen (CKG) construction and arbitrary finite-dimensional Hamiltonians, we prove an explicit comparison that converts a spectral gap estimate for the infinite-temperature generator into a lower bound on the spectral gap of the CKG quantum Gibbs sampler at every finite positive inverse temperature $β$. It allows a single spectral gap estimate at infinite temperature to certify convergence across Hamiltonians and temperatures. Such an estimate is often known from a classical spectral gap estimate, such as the classical random walk spectral gap. For Hodge Laplacians of simplicial complexes as Hamiltonians, we construct coupling operators whose generator at infinite temperature has the same spectral gap as a classical simplicial down-up walk. A positive spectral gap of the walk and bounded spectral width $W=λ_{\max}(H)-λ_{\min}(H)$ give a generator spectral gap independent of the number of simplices at every fixed temperature. We then establish conditions under which the sampler approximately prepares zero-energy (harmonic) states in polynomial evolution time. This provides a conditional convergence guarantee for the state preparation in the thermal approach to quantum topological data analysis.
arXiv·2026-10-02·Kanji Nishii, Ryo Nagai, Yoshihiko Abe
No generated summary available for this entry.
overview
Original abstract
We study how memory affects the thermalization of a qubit in a repeated-interaction model. In our model, a memory qubit interacts repeatedly with the system, while both qubits undergo collisions with fresh thermal ancillas. We derive exact closed evolution equations for their populations and mutual coherence, and demonstrate memory effects using a causal-break operation. Although the system converges to the target thermal state, the thermalization behavior shows non-monotonic approach. We also find a Mpemba-like reversal, in which the number of collisions required for thermalization depends non-monotonically on the temperature of the target state. Within the initial-state family considered, both phenomena require initial coherence between the system and memory or an imbalance in their excited-state populations.
arXiv·2026-10-02·Jinhong Park, Christian Sp{\ra}nsl{ä}tt
No generated summary available for this entry.
overview
Original abstract
Shot-noise measurements with a quantum point contact provide a direct probe of the quasiparticle charge in Laughlin fractional quantum Hall (FQH) states. However, the interpretation of such measurements becomes more subtle for multichannel edges, where the point-contact tunneling noise coexists with noise generated by intermode equilibration and heating. We develop a general framework that incorporates both these contributions and apply it to the paradigmatic $ν=2/3$ FQH edge. We derive expressions for the drain auto- and cross-correlations in a four-terminal QPC geometry and show that equilibration-induced heating affects the auto- and cross-correlations in parametrically different way than the intrinsic partition noise. This distinction permits us to propose a specific combination of the two correlations which strongly suppresses the heating contribution and fully recovers the tunneling quasiparticle charge. Our results thereby provide a systematic framework for interpreting shot-noise measurements in complex FQH edges and can be further extended to more general counterpropagating edge structures.
arXiv·2026-10-02·Sebastian P. Kish, Simon J. Devitt
No generated summary available for this entry.
overview
Original abstract
What does quantum error correction do to relativistic proper time? We show that when two error-corrected quantum memories follow distinct worldlines and are controlled by local references, their local correction histories factor exactly from the proper-time difference between them. Error correction therefore does not erase time dilation: when the memories are compared, the accumulated difference appears as a relational phase rotation. During locally referenced operation this rotation is invisible to every local error syndrome; at discrete phases admitted by a code, the final relational evolution instead returns exactly as a deterministic logical gate, including an $S$-type Clifford gate at a $π/2$ excursion. These results connect fault-tolerant quantum information with relativistic clocks and establish protected quantum memories as a platform for preserving proper-time information and for long-coherence tests of quantum evolution involving relativistic proper time.
arXiv·2026-10-02·Hao-Yu Lu et al.
No generated summary available for this entry.
overview
Original abstract
We propose a programmable quantum read-only memory based on Gray code encoding, termed GQROM, designed to efficiently load classical data into quantum circuits. This architecture mitigates critical bottlenecks in near-term quantum computing by reducing initialization overhead and gate-induced errors. By utilizing Gray code, in which consecutive addresses differ by only a single bit, GQROM minimizes state transition complexity. We demonstrate the architecture's flexibility in accessing targeted data through initial-state modification. The entire design, including a systematic EDA flow, was implemented and validated on the Qiskit platform, confirming its practical feasibility. These results underscore GQROM's potential as a scalable and hardware-friendly solution for efficient state preparation in quantum circuits.
arXiv·2026-10-02·Siying Wang et al.
No generated summary available for this entry.
overview
Original abstract
Hyperedge faults remain a major challenge in circuit-level quantum error correction. Accurately exploiting hyperedge correlations often requires substantial computational resources, which complicates real-time decoding. Matching-based decoders are fast and scalable, but their pairwise graph representation limits the use of higher-order fault information. Here, we introduce Syndrome Motif Projection (SMP), a general framework for incorporating hyperedge information into matching-based decoding. The key idea is that a hyperedge fault produces a characteristic local syndrome motif. Observing such a motif provides evidence for the corresponding fault. SMP extracts this information directly from the measured syndrome with linear-complexity preprocessing while preserving the matching backend. It can therefore serve as a lightweight front end to existing scalable and real-time matching decoders. We demonstrate SMP across surface code memories, color code memories, and logical gate circuits. On Google's Willow experimental surface code data, SMP improves both standard and correlated matching and outperforms the tested belief matching baseline. For color code memories, SMP combined with Chromobius reduces logical failure probabilities by up to 77.8\%. For logical gate circuits, SMP reduces the failure probability of a six-CNOT circuit by 35.5\% relative to logical observable matching while achieving performance comparable to iterative belief matching. These results demonstrate that SMP provides a lightweight and transferable approach to hyperedge decoding, with a clear path toward integration into scalable real-time decoding architectures for fault-tolerant quantum computation.
arXiv·2026-10-02·Shixuan Chen et al.
No generated summary available for this entry.
overview
Original abstract
In the photoreceptor compass model, a light-generated, spin-correlated radical pair undergoes singlet-triplet interconversion driven by Zeeman and anisotropic hyperfine interactions, leading to orientation-dependent reaction yields. In this study, we consider simultaneously the spin environment and the boson environment surrounding the radical-pair system and concentrate on the correlated memory effect of the spin bath. In the linear-response limit, the spin bath is mapped to an effective Gaussian environment. The system dynamics and yields under its influence together with the bosonic bath are propagated uniformly using the hierarchical equations of motion (HEOM) or equivalently the dissipaton equations of motion (DEOM) method. The HEOM/DEOM is non-Markovian and non-perturbative, exact for Gaussian environments. Corresponding results of the Markovian Lindblad master equation are also shown for comparison. Numerical demonstrations highlight the non-Markovian memory effect as a crucial ingredient for radical-pair magnetoreception.
arXiv·2026-10-02·Tushant Mittal et al.
No generated summary available for this entry.
overview
Original abstract
We show that for any $R,ε>0$ and any prime $p\geq 2$, there exists an infinite family of $p$-ary quantum low-density parity-check (QLDPC) codes, rate $R$, checks of weight $O_ε(1)$, and normalized distance at least $δ_{\mathrm{GV}}(p,R)-ε$. Here, $δ_{\mathrm{GV}}(p,R)$ denotes the quantum Gilbert-Varshamov (GV) bound for $p$-ary stabilizer codes. In fact, we construct an ensemble of such QLDPC codes, such that a random code from this ensemble is close to the GV bound with high probability. Moreover, this ensemble matches the performance of random stabilizer codes on several quantum channels. Specifically, it approaches the quantum capacity of the erasure channel and the hashing bound for memoryless Pauli channels, including the depolarizing channel. A significant challenge in working with QLDPC codes is that they are necessarily \emph{degenerate}, i.e., contain many low-weight stabilizers. A key contribution of our work is a construction of QLDPC codes with quantitative control on their degeneracy. These codes are obtained by combining known constructions of asymptotically good QLDPC codes with the expander-based distance amplification procedure of Alon, Edmonds, and Luby [FOCS'95]. Our random ensemble is constructed by starting with these low-degeneracy QLDPC codes near the quantum Singleton bound and concatenating each coordinate with a random inner code. This can be viewed as a quantum analogue of Thommesen's construction, and as an LDPC version of a result of Ouyang, with an appropriately designed outer code.
arXiv·2026-10-02·M. D. K. Lee et al.
No generated summary available for this entry.
overview
Original abstract
We show that adaptive Bayesian estimation in fluorescence state detection reduces to a comparison of elapsed time with two arithmetic time sequences fixed by the bright and dark count rates and confidence parameters $ε_d$ and $ε_b$. No probabilities are computed in real time and the resulting implementation, which we term sequential deadline detection, is provably optimal in mean detection time. The analysis permits closed-form expressions for detection-time distributions, mean detection times, error rates of both channels accounting for miscalibrated rates, decay between the states during detection, and afterpulsing in single photon counting modules. The predictions are validated by Monte Carlo simulation and demonstrated by fluorescence detection with Ba$^+$
arXiv·2026-10-02·Owen Friedewald et al.
No generated summary available for this entry.
overview
Original abstract
Removing an input-scaling module changes both a classifier and the perturbations reaching its encoder. A robustness difference can therefore reflect the comparison rule as well as the module. We demonstrate this problem in a four-qubit quantum-attention detector on generated power-grid trajectories. A learned scaling module appears beneficial at a fixed physical attack budget, but matching an upper bound on perturbations at the encoder reverses the ordering. Neither comparison alone establishes a robustness benefit caused by the module. The initial test also perturbs clean examples into attacked examples while retaining their original labels; tests restricted to already attacked examples do not establish a benefit. Replacing a trained model's input scales disrupts detection. Retraining its linear classification layer restores the detection rate, but changes individual predictions, leaving the comparison descriptive rather than causal. Two further design checks explain why the input quantum Fisher information regularizer cannot train this model's query parameters, and why removing confidence bounds does not establish a larger certified radius. The evidence is limited to ten seeds, exact simulation, synthetic data, and a restricted set of attacks; classical baselines achieve better clean prediction. The practical lesson is to specify which perturbation budget is fixed, check that attacks preserve labels and interventions preserve predictions, and distinguish exploratory controls from confirmatory evidence.
arXiv·2026-10-02·Owen Friedewald, Ali Shiri Sichani, Chi-Ren Shyu
No generated summary available for this entry.
overview
Original abstract
Quantum Fourier sampling may help audit the spectral learnability of delay-based physical unclonable functions (PUFs). We ask whether that promise survives access matching, a strong classical comparator, and oracle synthesis. Three gates structure the evaluation. Structure: low degree is not small support at reachable challenge lengths; for 4-XOR at $n=14$, degree $\le d_f(0.1)$ admits $91\%$ of all $2^n$ characters and the median $90\%$-mass set spans a third of the spectrum. Algorithmics: constructing the phase oracle logically implies classical membership access, making Kushilevitz--Mansour the correct baseline; across 45 tasks it exhausts each finite domain, and no 4-XOR ideal-sampling case reaches $90\%$ mass within $2^n$ calls. A quantum-kernel diagnostic appears more favorable, with geometric difference rising to $2.151$ at $N=512$ challenges, but it correlates $0.991$ with $1/\sqrt{λ_{\min}(K_C)}$ for the classical Gram matrix $K_C$, and the 4-XOR label-complexity ratio does not exceed a balance-preserving permutation null ($p=0.930$). Trace-normalized geometric difference can therefore grow through classical ill-conditioning alone, without task-label alignment. Implementation: a simulator-validated fixed-point phase oracle based on the quantum Fourier transform admits an $18.9\%$ routed-depth reduction, yet the least certified precisions have estimated durations of $1.18$--$1.55\times$ the median dephasing time $T_2$ of the mapped qubits on a static backend snapshot, without hardware execution. We find no end-to-end advantage in the evaluated regime, although ideal sampling does use fewer coherent calls on the thresholded task. The contribution is the Three-Gate Quantum Audit Protocol: a reproducible procedure separating an ideal query advantage from a realizable security benefit. This is not a claim about deployed silicon and not an impossibility result.
arXiv·2026-10-02·Jiaxin Liu, Zuoxian Wang, Danyue Ma
No generated summary available for this entry.
overview
Original abstract
Quantum Fisher information adds over independent probes, so a single parameter is best measured probe by probe. We show that Gaussian measurements, the linear optics and homodyne detection of optical and microwave experiments, break this rule: two independent modes are better measured together. The uncertainty principle leaves a linear detector half of phase space, and for two modes the choice of half is a resource. Bell homodyne, a balanced beam splitter followed by two homodyne detectors, beats the best separate readout when the modes differ in quadrature width and in how the width responds to the parameter. Heterodyne detection splits a mode on a beam splitter to read both quadratures and pays one unit of vacuum noise for the empty port. Bell homodyne fills that port with the second mode, so the noise turns into signal. We prove that the gain stays below $(\sqrt2-1)^2=17.157\%$ for every parameter carried by widths. For thermal modes at one temperature, the canonical case, a gain was conjectured impossible. We prove that any frequency difference opens a temperature window and that the gain peaks at $12.699\%$ at frequency ratio $3.318$, where Bell homodyne is the optimal Gaussian measurement. Standard hardware reaches the gain: two coupled resonators with two homodyne detectors, or a phase-preserving amplifier whose idler band is fed by the same thermal source.
arXiv·2026-10-02·Kishor Bharti et al.
No generated summary available for this entry.
overview
Original abstract
We study a family of quantum subsystem codes defined on rectangular coordinate grids of any dimension, with even side lengths of at least four. The directly measured operators act along coordinate lines. For every member of the family, we derive the number of protected logical qubits and prove its dressed distance without a numerical search. To illustrate the resulting design choices, we impose a budget of at most 10,000 data qubits and determine the complete tradeoff between encoding rate and measurement weight within this family at distances 16, 32, and 64. At distance 16, one code protects 4,096 logical qubits among 10,000 data qubits using weight-ten measurements. At distances 32 and 64, codes with 7,776 and 9,216 data qubits protect 1,024 and 256 logical qubits, respectively, using weight-six measurements. We include and explain Lean code snippets throughout the paper to guide readers through the formal verification of our subsystem-code construction and its dressed and bare distances.
The Quantum Insider·2026-10-01·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Researchers in Japan found that a crystal’s structural dimensions classified magnetic states more consistently than electron concentration across a family of complex alloys. The compounds exhibited distinct magnetic states at different lattice sizes, providing a guide for designing materials with targeted magnetic properties. The findings could help quantum researchers systematically explore unconventional magnetism and investigate how atomic structure influences collective behavior. Image: A Tsai-type cluster consists of nested atomic shells, including the rhombic triacontahedron, icosidodecahedron, icosahedron, dodecahedron, and inner tetrahedron. Rare-earth atoms occupy the icosahedral shell and provide the magnetic moments responsible for the magnetic response in these compounds. (Tokyo University) Researchers in Japan have identified a structural measurement that could help scientists predict magnetic behavior in complex alloys, offering a more reliable way to search for materials with unusual quantum properties. The finding gives researchers studying quasicrystals and related materials a practical guide to selecting compounds for further investigation. These materials have intricate atomic arrangements that can support unconventional magnetism, making them useful subjects for exploring how atomic structure shapes collective behavior. According to a Tokyo University of Science news release, the size of a crystal’s repeating structural unit classified magnetic states more consistently than a commonly used measure of electron concentration across the compounds examined. The research was led by Farid Labib of Tokyo University of Science and Kazuhiro Nawa of Tohoku University, alongside Tokyo University of Science professor Ryuji Tamura. “Quasicrystals are among the most uniquely structured materials discovered to date and are expected to exhibit novel magnetic states and quantum phenomena not found in ordinary crystals,” Labib said. “Until now, there
Quantum Computing Report·2026-10-01·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Classiq has launched its Fault Tolerance Engine, a new tool integrated into the Classiq SDK. This engine translates high-level quantum circuits into detailed, hardware-aware execution plans for fault-tolerant quantum processors, specifically using a 3D surface-code lattice. It automates routing and scheduling for quantum error correction, aiming to optimize qubit overhead and runtime. The engine helps developers and hardware designers understand resource needs and bottlenecks before fault-tolerant quantum processing units are widely available. The post Classiq Launches Fault Tolerance Engine for Hardware-Aware Quantum Application Synthesis appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-01·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Stony Brook University and the University of Hawaiʻi at Mānoa researchers are collaborating on a three-year NSF -funded project to develop quantum intelligent sensor networks. The project will study how distributed quantum sensors can use entanglement, quantum information and coordinated network architectures to detect weak and spatially varying signals. The research will initially focus on photonic architectures using squeezed light and integrated optics, with potential applications in magnetic sensing, biomedical imaging, environmental monitoring, quantum radar and communications. PRESS RELEASE — The National Science Foundation (NSF) has awarded a $600,000 grant to Hyeongrak “Chuck” Choi, an assistant professor in the Department of Electrical and Computer Engineering at Stony Brook University , and Bo-Han Wu, an assistant professor at the University of Hawaiʻi at Mānoa, to develop quantum intelligent sensor networks. The three-year collaborative project, which began on June 1, 2026, will focus on building smarter quantum sensor networks. To do this, the researchers will investigate how spatially distributed quantum sensors can work together as a coordinated network. Rather than treating sensors as independent devices, they will study how entanglement and other quantum resources can be distributed across multiple sensing nodes to improve the extraction of weak and spatially varying signals. Their mission is to help sensors work together more efficiently and adapt to changing conditions. Choi and Wu will co-lead the research, with complementary roles. Choi will lead the development of the sensor-network architecture and its integration into an intelligent distributed sensing platform. His group will use information-theoretic tools, including quantum Fisher information, to determine fundamental sensing limits and to study how network topology, entanglement distribution, loss and noise affect performance. Wu will lead the continuous-variable
Quantum Computing Report·2026-10-01·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
California Governor Gavin Newsom has signed legislation and allocated $30 million for quantum and deep-space research to advance the state's technology infrastructure. This initiative, known as Quantum California, supports university research, startup incubators, and hardware supply chains. Key legislation includes bills to commercialize fusion energy and integrate advanced nuclear technologies, along with a proposed $7.5 billion bond measure for research funding. The post Governor Newsom Signs Fusion Legislation and Allocates State Capital to Advance California Quantum Infrastructure appeared first on Quantum Computing Report .
Quantum Computing Report·2026-10-01·Doug Finke
No generated summary available for this entry.
overview
Original abstract
The Unitary Foundation has launched its 2026 Quantum Open Source Software (QOSS) survey, an annual initiative designed to collect information on the quantum open-source software community. The survey includes questions on demographics, research, tools, and platforms, with the goal of providing an informative and representative snapshot of the community and field. The post Unitary Foundation Launches Its 2026 Quantum Open Source Software Survey appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-01·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Alice & Bob and ENS Lyon demonstrated a voltage-driven approach to stabilizing cat qubits that could enable more compact quantum hardware with lower heat generation. The device achieved a two-photon exchange rate of 3 MHz without a microwave drive, exceeding previous microwave-driven cat-qubit couplers while suppressing an unwanted frequency effect. Adjusting the voltage enabled one-, two- and four-photon exchanges on the same chip, potentially supporting four-component cat qubits. PRESS RELEASE — Alice & Bob, a leader in fault-tolerant quantum computing, and the École Normale Supérieure de Lyon today announced a new and faster approach to stabilising cat-qubits in superconducting quantum systems enabling more compact designs that generate less heat. Cat qubits, which store information in a microwave resonator, are stabilised by a process that dissipates photons from the resonator into the environment strictly in pairs. This process takes place in a component called a coupler. In Alice & Bob’s current cat qubits, the coupler is driven by a carefully engineered microwave signal, an approach the company has refined over many years. In this new experiment, the researchers explored an alternative coupler. They drove the same kind of process using a steady voltage of about one millionth of a volt, with no microwave signal required. Key findings include: Faster than any pumped coupler: The new coupler exchanged photons faster than any previous pumped-drive cat-qubit coupler (two-photon exchange rate of 3 MHz. The data suggests that the design could reach considerably higher rates. Several operations, one chip: Changing only the voltage switched the device between exchanging photons one, two or four at a time (two-photon process at a bias of about 1.1 microvolts). Suppression of unwanted nonlinearity: Usual cat stabilisation usually comes with an unwanted change of freque
Phys.org Quantum Physics·2026-10-01
No generated summary available for this entry.
overview
Original abstract
Quantum technologies rely on qubits, units of information that can exist in combinations of the states 0 and 1 instead of being limited to one or the other like conventional bits. Qubits can become entangled, which means their states become linked in ways that cannot be explained by considering each qubit separately.
The Quantum Insider·2026-10-01·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Pasqal appointed Florence Lao as Chief Legal Officer to oversee the company’s global legal strategy as it expands as a publicly traded quantum computing company. Lao will lead work across corporate governance, securities law, commercial transactions, intellectual property, regulatory compliance and international operations. Lao brings nearly 20 years of international legal experience, including senior roles at Deezer, Adisseo and SMCP and earlier work at Latham & Watkins and Artemis. PRESS RELEASE — Pasqal (NASDAQ: PSQL), a global leader in neutral-atom quantum computing, today announced the appointment of Florence Lao as Chief Legal Officer. In this role, she will serve as a strategic advisor to Pasqal’s executive leadership team and Board of Directors as the company continues to scale globally as a publicly traded company. As Chief Legal Officer, Florence will oversee Pasqal ’s global legal strategy, including corporate governance, securities law compliance, commercial transactions, intellectual property matters, regulatory compliance and strategic growth initiatives. She will also support the company’s international operations and continued expansion across key markets. “Florence is a proven legal leader with extensive experience guiding international organizations through significant periods of growth, transformation and public company governance,” said Wasiq Bokhari, CEO of Pasqal . “As we continue expanding our commercial footprint and advancing the adoption of quantum computing globally, her expertise across capital markets, governance, compliance and strategic transactions will be invaluable. We are delighted to welcome Florence to the Pasqal leadership team.” Florence brings nearly 20 years of experience as an international business lawyer, with extensive expertise spanning corporate governance, capital markets, mergers and acquisitions, compliance, financing transactions and global commercial operations
The Quantum Insider·2026-10-01·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Quanome Technologies entered into a revolving loan agreement with CEO and Chairman Yang Li for up to $15 million in non-dilutive growth capital. Approved advances will carry 6% annual interest and may be used for working capital and general corporate purposes, subject to the agreement’s terms. The arrangement was independently reviewed by Quanome’s Audit Committee, with Li disclosing his interest and abstaining from the committee’s deliberations and vote. PRESS RELEASE — Quanome Technologies, Inc. (Nasdaq: QNME) (“Quanome” or the “Company”), has entered into a revolving loan agreement with the Company’s CEO and Chairman, Yang Li, for up to $15 million in non-dilutive growth capital. The arrangement gives Quanome an additional potential source of capital as it executes its strategic priorities in the quantum computing space. Approved advances will bear interest at 6.0% per annum. The instrument is revolving, meaning amounts repaid may be borrowed again during the draw period, subject to the agreement’s repayment terms and Mr. Li’s approval of each borrowing request. Any proceeds will be used for working capital and general corporate purposes. The transaction was reviewed and approved independently by the Audit Committee of Quanome’s Board of Directors. The committee determined that the agreement and the transactions it contemplates are fair and reasonable to the Company and in, or not inconsistent with, the best interests of the Company and its stockholders. Mr. Li disclosed his interest and did not participate in the Audit Committee’s deliberations or vote. “I am deeply committed to Quanome’s quantum-focused strategy and the long-term potential of the growth opportunities we are pursuing,” said Yang Li, Chief Executive Officer and Chairman of Quanome Technologies. “Providing this financial support is a practical expression of my confidence in our future. Our ambition remains steadfast: to conn
Quantum Computing Report·2026-10-01·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
Alice & Bob and ENS Lyon have demonstrated a DC-biased SQUID architecture for stabilizing cat qubits, replacing traditional microwave pumps with a microvolt-scale DC voltage. This method eliminates unwanted Kerr nonlinearities and provides a scalable control mechanism for superconducting bosonic codes. The experimental setup showed selective activation of 1-to-1, 2-to-1, and 4-to-1 photon conversion processes, enabling deterministic pair-photon extraction and paving the way for more robust quantum error correction. The post Alice & Bob and ENS Lyon Demonstrate DC-Biased SQUID Architecture for Multi-Photon Cat Qubit Dissipation appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-01·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief Diraq plans to establish a quantum research and development laboratory at Roadrunner Quantum Lab in Albuquerque, New Mexico, with operations expected to begin by the end of 2026. The facility will include cryogenic equipment and a dedicated measurement engineering team focused on quantum device testing and characterization. The New Mexico laboratory will expand Diraq ’s U.S. R&D presence as it develops silicon spin-qubit systems and targets utility-scale quantum computing. PRESS RELEASE — Diraq today announced plans to establish a new research and development laboratory in Albuquerque, New Mexico, expanding its U.S. presence as the company brings its silicon quantum computing technology toward utility scale. Diraq has signed a memorandum of understanding to establish operations at the Roadrunner Quantum Lab (RQL) powered by the State of New Mexico, a joint effort of Roadrunner Venture Studios and the New Mexico Technology and Innovation Office (TIO). Roadrunner Quantum Lab is a shared facility giving quantum startups, industry partners, and national laboratories space to accelerate the development and commercialization of quantum technologies. Diraq’s space will include Maybell cryogenic equipment that supports device characterization and other research and development activities. Diraq’s lab is expected to begin operations by the end of the year. The State of New Mexico is supporting Diraq ‘s expansion into the state as part of its partnership with DARPA’s Quantum Benchmarking Initiative (QBI), a federal initiative to verify and validate utility-scale quantum computing. Diraq is a QBI performer currently in Stage B of the program, and the state’s matching funds are helping to build equipment and infrastructure in the state quantum ecosystem that will enable Diraq’s lab operations in New Mexico. “Roadrunner Quantum Lab is focused on bringing quantum computing to market and their commitment to commercialization closely
Phys.org Quantum Physics·2026-10-01
No generated summary available for this entry.
overview
Original abstract
Working in close collaboration, researchers from Paderborn University, the University of Basel and Ruhr University Bochum have made a breakthrough in quantum communication. In their recently published paper in the journal Physical Review Letters, they demonstrate how special semiconductor nanostructures can be used to generate individual photons and pairs of photons that are almost perfectly identical. These "indistinguishable" particles form the basis for quantum entanglement and quantum interference.
Quantum Computing Report·2026-10-01·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
NATO has released its Quantum Technology Roadmap, effective July 2026, to implement its 2023 Quantum Technology Strategy. The roadmap outlines Lines of Effort in quantum computing, sensing, and communications, with target milestones to accelerate technology adoption and maintain defense interoperability among its 32 member nations. Key initiatives include quantum sensing for PNT in GNSS-denied environments and the Quantum Zero Beacon Project for secure communications. The post NATO Releases Official Quantum Technology Roadmap Establishing Operational Timelines and Standardization Frameworks appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-01·Matt Swayne
No generated summary available for this entry.
overview
Original abstract
Insider Brief Researchers demonstrated charge sensing, high-frequency reflectometry and a few-electron double quantum dot in zinc oxide, establishing tools for developing semiconductor spin qubits. An integrated sensor and radio-frequency circuit enabled faster detection of electron charge changes, while the device confined individual electrons in two quantum dots. The team next plans to demonstrate electron spin readout and manipulation and measure how long spin states persist and retain quantum coherence. Image: (a) The structure of the gate electrodes on the ZnO device used in the experiment in this paper. (b) The charge stability diagram indicating the formation of ZnO double quantum dot in few-electron regime. (Kosuke Noro et al.) PRESS RELEASE — Researchers at Tohoku University, in collaboration with the National Institute for Materials Science (NIMS) and the University of Tokyo, have taken an important step toward semiconductor quantum computing using zinc oxide (ZnO). The team successfully demonstrated charge sensing, high-frequency reflectometry, and the formation of a few-electron double quantum dot in a ZnO device – three key technologies for developing and evaluating spin qubits. Semiconductor quantum dots are promising building blocks for scalable quantum computers because they can confine individual electrons and use their spins to store quantum information. Silicon and gallium arsenide have been extensively studied for this purpose, while ZnO has emerged as an alternative material with attractive properties, including a low nuclear spin environment that may help preserve electron spin states and a direct bandgap for possible optical coupling. However, rapidly and accurately detecting the charge state of electrons in ZnO quantum dots has remained a challenge. To address this, the researchers fabricated a ZnO device containing two target quantum dots (QD1 and QD2) alongside a sensor quantum dot (SQD), which acts as a sensitive electrometer.
The Quantum Insider·2026-10-01·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief D-Wave launched a beta program for its gate-model quantum computing simulator, giving selected customers early access to error-aware programming tools. The simulator is based on D-Wave ’s dual-rail superconducting gate-model architecture and is available through its Leap quantum cloud service and Ocean SDK. Beta participants include BBVA, FirstQFM, Florida Atlantic University, and the Jülich Supercomputing Centre, which will use the simulator to explore quantum applications and error-aware computing. PRESS RELEASE — D-Wave Quantum Inc. (NASDAQ: QBTS) (“ D-Wave ” or the “Company”), the only dual-platform quantum computing company providing both annealing and gate-model systems, software and services, today launched its gate-model quantum computing simulator beta program, marking an important milestone in D-Wave’s gate-model development roadmap. The beta program offers select customers early access to the simulator in advance of its general availability to experiment with error-aware programming and develop quantum applications in preparation for D-Wave’s forthcoming gate-model systems. The simulator is built around D-Wave’s dual-rail superconducting gate-model technology, which is designed to harness error detection to deliver efficient quantum error correction with significantly lower hardware overhead as systems scale. Participants in the simulator beta program represent the following commercial and research organizations: BBVA, FirstQFM, Florida Atlantic University (FAU) and the Jülich Supercomputing Centre (JSC). “Quantum error correction is a defining challenge in the race to commercially useful gate-model quantum computing,” said Dr. Alan Baratz, CEO of D-Wave. “By giving leading organizations early access to our simulator, we’re enabling them to explore a fundamentally more efficient approach to fault tolerance and the applications we expect it will unlock. The beta program marks a major step in the rapid execution of our roadmap and reinfo
Quantum Computing Report·2026-10-01·Mohamed Abdel-Kareem
No generated summary available for this entry.
overview
Original abstract
D-Wave has launched a beta program for its gate-model quantum computing simulator, accessible via its Leap quantum cloud service. The simulator supports up to 21 qubits with both ideal and hardware emulation modes and models D-Wave's dual-rail superconducting cavity qubit architecture, which uses hardware-level error detection. The program aims to evaluate mid-circuit error detection, test real-time classical feedback control, and establish design rules for quantum machine learning algorithms under hardware noise constraints, with initial participants including financial institutions and research centers. The post D-Wave Launches Gate-Model Simulator Beta Program Featuring 21-Qubit Dual-Rail Erasure Emulation appeared first on Quantum Computing Report .
The Quantum Insider·2026-10-01·Mohib Ur Rehman
No generated summary available for this entry.
overview
Original abstract
Insider Brief California Governor Gavin Newsom signed legislation establishing a strategic framework for fusion energy and announced a new $30 million investment for quantum and deep-space research. The new fusion legislation calls for a statewide fusion strategy, expanded research opportunities, a commercial fusion plan, fusion manufacturing development, and an assessment of advanced nuclear technologies. The $30 million quantum investment follows California’s 2025 launch of Quantum California and adds to existing state funding, workforce programs, research infrastructure, and industry initiatives. PRESS RELEASE — Standing alongside faculty and staff at a quantum lab at UC Berkeley, Governor Newsom announced he has signed legislation to accelerate the development of quantum and fusion energy in California by investing in the state’s research hubs. The Governor also announced a new $30 million investment to further cutting-edge quantum and deep-space research, leverage public-private partnerships, and cultivate a quantum start-up ecosystem. This new budget allocation follows landmark legislation the governor signed in 2025, launching Quantum California, a statewide initiative bringing together universities, national laboratories, private companies, investors, and policymakers to cement the state’s position as a global leader in quantum technology. California has always been where big ideas become real-world breakthroughs. Today, we continue our work to grow quantum and fusion technologies in our state — creating a stronger framework and workforce to the infrastructure needed to support it. Through cutting-edge research and continued investments, we are moving past what is possible, and instead shaping what comes next. — said, Governor Gavin Newsom . A b-roll package of the Governor signing this legislation can be downloaded here. California is the national leader in emerging technologies, fostering an educated and skilled workforce capable of delivering
No generated summary available for this entry.
overview
Original abstract
Insider Brief Quantum Renaissance will bring together leaders from research, industry, government and finance at Palazzo Vecchio in Florence on April 1-2, 2027, to examine quantum technology’s development and wider implications. Organized by Resonance and The Quantum Insider in partnership with the Comune di Firenze, the event will feature discussions on scientific progress, commercialization, investment and public policy. A public exhibition running both days will showcase quantum companies, universities, research organizations and student projects, alongside a private gala dinner and conference sessions. PRESS RELEASE — Quantum technology leaders from research, industry, government and finance will gather at Palazzo Vecchio in Florence on April 1-2, 2027, for Quantum Renaissance, a two-day event examining the development and wider implications of quantum technology. The event is organized by Resonance and The Quantum Insider in partnership with the Comune di Firenze. Programming will include conference keynotes and panel discussions and a public exhibition intended to make quantum science and technology accessible to residents, students and visitors, as well as a private gala dinner. Held in Florence, the home to transformational figures including Leonardo da Vinci and connected to Galileo Galilei’s early astronomical work, Quantum Renaissance will place discussions about the next generation of computing, communications and sensing within a city closely associated with scientific and intellectual change. The main conference will take place in the Salone dei Cinquecento, the historic hall inside Palazzo Vecchio, which serves as the seat of Florence’s city administration. The first day, Thursday, April 1, will open with a public exhibition in the courtyards and Sala d’Armi of Palazzo Vecchio. The exhibition will feature quantum companies, Italian universities, research organizations and student projects presenting their work for a general audience. That
Quantum
·2026-10-01
·Ayaka Usui, Artur Niezgoda, Manuel Gessner
·doi
No generated summary available for this entry.
overview
Original abstract
We demonstrate that spinor Bose-Einstein condensates (BECs) can be operated as an analog simulator of the two-dimensional vibron model. This algebraic model describes bending vibrations of molecules and, in the case of triatomic molecules, exhibits two phases where linear and bent configurations are stabilised. Spinor BECs can be engineered to simulate states that correspond to linear or bent triatomic molecules, with the Wigner function of the BEC encoding information about the molecular configuration. We show how quantum simulations of the bending dynamics of linear molecules can be realised, and how preparing a linear configuration in the bent phase leads to a dynamical instability. In the dynamics triggered by the corresponding instability, a significant amount of entanglement is generated, and we characterise the dynamics with the squeezing parameter and the quantum Fisher information (QFI). The scaling of the non-Gaussian sensitivity, described by the difference between squeezing and QFI, grows with the system size once the spinor system crosses from the linear to the bent phase, thus serving as a dynamical witness for the quantum phase transition.
Quantum
·2026-10-01
·Muhammad Osama, Dimitrios Thanos, Alfons Laarman
·doi
No generated summary available for this entry.
overview
Original abstract
We introduce new parallel algorithms for efficiently simulating stabilizer (Clifford) circuits on GPUs, with a focus on data-parallel tableau evolution and scalable handling of projective measurements. Our approach reformulates key bottlenecks in stabilizer simulation – such as Gaussian elimination and measurement updates – into GPU-tailored primitives that eliminate sequential dependencies and maximize memory coalescing. We implement these techniques in QuaSARQ, a GPU-accelerated stabilizer simulator designed for large qubit counts and many-shot sampling. Across a broad benchmark suite reaching 180,000 qubits and depth 1,000 (roughly 130M gates), QuaSARQ shows substantial runtime improvements, with up to 105 &#x00D7; speedup, and over 80% energy reduction on demanding instances. Moreover, QuaSARQ consistently outperforms Stim, a state-of-the-art CPU-optimized stabilizer simulator, as well as Qiskit-Aer (CPU/GPU), Qibo, Cirq, and PennyLane. Finally, QuaSARQ exhibits a significant advantage in many-shot sampling on large workloads. These results demonstrate that our parallel algorithms can significantly advance the scalability of stabilizer-circuit simulation, particularly for workloads involving extensive measurements and sampling.
Quantum
·2026-10-01
·Noah Gorgichuk et al.
·doi
No generated summary available for this entry.
overview
Original abstract
We study the problem of n -fold rotationally symmetric bosonic state preparation, which is of great importance to bosonic quantum error correction, using a multiphoton interaction between an oscillator and an auxiliary qubit. We present an n -photon Law-Eberly ( n LE) protocol that serves as an analytic baseline, alongside numerical optimal control calculations that further reduce state preparation time. We find that multiphoton control protocols substantially reduce preparation times for binomial, cat, and Gottesman-Kitaev-Preskill codewords compared to schemes relying on standard linear interactions. Further, we achieve arbitrary control over the oscillator's Hilbert space by combining different multiphoton interaction orders. We also extend these control improvements to the preparation of rotationally symmetric multi-oscillator states. Lastly, numerical simulations using realistic planar superconducting circuit parameters validate the robustness of our scheme against qubit and oscillator decoherence. Our findings can significantly enhance the performance of bosonic codes on planar superconducting hardware, an important ingredient for scalable fault-tolerant quantum computers.
Quantum
·2026-10-01
·Hsuan-Cheng Wu, Xiantao Li
·doi
No generated summary available for this entry.
overview
Original abstract
We present a universal framework for simulating N -dimensional linear Itô stochastic differential equations (SDEs) on quantum computers with additive or multiplicative noises. Building on a unitary dilation technique, we establish a rigorous mapping from the general linear SDEs d X t = A ( t ) X t d t + &#x2211; j = 1 J B j ( t ) X t d W t j to stochastic Schrödinger equations (SSE) on a dilated Hilbert space. Crucially, this embedding is pathwise exact in that the classical solution is recovered as a projection of the dilated quantum state for each fixed noise realization. We demonstrate that the resulting SSEs are naturally implementable on digital quantum processors, where the stochastic Wiener increments are encoded directly by preparing the ancillary qubits. Exploiting this physical mapping, we develop two algorithmic strategies: (1) a trajectory-based approach that uses sequential weak measurements to realize efficient stochastic integrators, including a second-order scheme, and (2) an ensemble-based approach that maps moment evolution to a deterministic Lindblad quantum master equation, enabling simulation without Monte Carlo sampling. We provide error bounds based on a stochastic light-cone analysis and validate the framework with numerical experiments.
Quantum
·2026-10-01
·Matthijs Vernooij, Yuming Zhao
·doi
No generated summary available for this entry.
overview
Original abstract
Robust self-testing in non-local games allows a classical referee to certify that two untrustworthy players are able to perform a specific quantum strategy up to high precision. Proving robust self-testing results becomes significantly easier when one restricts the allowed strategies to symmetric projective maximally entangled (PME) strategies, which allow natural descriptions in terms of tracial von Neumann algebras. This has been exploited in the celebrated M I P &#x2217; = R E paper and related articles to prove robust self-testing results for synchronous games when restricting to PME strategies. However, the PME assumptions are not physical, so these results need to be upgraded to make them physically relevant. In this work, we do just that: we prove that any perfect synchronous game which is a robust self-test when restricted to PME strategies, is in fact a robust self-test for all strategies. We then apply our result to the Quantum Low Degree Test to find an efficient n -qubit test.
npj Quantum Information
·2026-10-01
·Luis Colmenarez et al.
·doi
No generated summary available for this entry.
overview
arXiv·2026-10-01·Diyi Liu et al.
No generated summary available for this entry.
overview
Original abstract
Coherent alias sampling implement an important subroutine for block encoding and qubitization based quantum simulation using quantum lookup table. Related constructions exploit data lookup and matrix structure to implement block encodings for use in quantum singular value transformation. For a state on $n$ qubits, constructing and storing the alias table requires both classical and quantum resources exponential in $n$. We show that when the amplitudes are samples of a polynomial of degree at most $d$, the table can be represented and evaluated coherently with cost polynomial in $n$, $d$, exponentially reduced from $Θ(2^n)$ classical and quantum cost. We construct a quantum circuit for coherently computing the alias table for polynomial states using reversible integer arithmetic. By employing fast arithmetic, we construct a deterministic circuit for preparing polynomial states over Clifford+$T$ with a complete gate count of $\tilde{O}(ndB+B^2)$, where arithmetic width $B=\tilde{O}(dn+d\log(d+1))$. In the high precision limit for state fidelity $ε$ with fixed $n$ and $d$, it is sufficient have $B=Θ(\log(1/ε))$ and the complete gate count becomes $O(\log^3(1/ε)\log\log(1/ε))$. Additionally, the effective representation of the alias table can also be used for classical sampling algorithms. Furthermore, we develop a novel technique for uncomputing the auxilary register generated by coherent alias sampling. This technique opens a research direction in sampling based initial state preparation.
arXiv·2026-10-01·Arun Govindankutty
No generated summary available for this entry.
overview
Original abstract
Formal verification of quantum circuits becomes difficult as circuit size grows because exhaustive reasoning over the Hilbert space is computationally expensive. In previous work [1], we introduced a bit-vector abstraction that separates superposition tracking from basis-state behavior, enabling SMT-based verification of fixed-size error-detection and entanglement circuits built from H, X, and C-NOT gates. This paper extends the framework in five directions. First, we generalise correctness properties to parametrised repetition and concatenated phase-flip codes with up to 101 logical elements. Second, we verify syndrome extraction for CSS codes specified by arbitrary parity-check matrices, including the Steane, [[15,7,3]] Hamming, [[15,1,3]] Reed-Muller, and rotated surface codes with distances up to 101. We consider arbitrary error patterns, detection up to a specified weight, and recovery using a classical decoder, with counterexamples beyond each code's correction or detection capability. Third, we characterize the {H,X,C-NOT} fragment for which the abstraction faithfully represents Hilbert-space semantics. We prove soundness, demonstrate necessity with counterexamples, validate the characterisation against state-vector simulation, and prove the six lemmas from the original work. Fourth, a mutation study using 13 operators identifies equivalent mutants and detects all 622 non-equivalent mutants within the evaluated fault model. Fifth, a direct Z3 implementation verifies GHZ circuits with up to 262,144 qubits across three topologies on a 16GB laptop. Random H+C-NOT networks show verification cost rises sharply with depth when outputs depend on many inputs. The approach does not target general stabilizer circuits, Y-type stabilizers, fault-tolerant protocols, or physical noise; we identify extensions needed to address these cases.
arXiv·2026-10-01·Eric Culf
No generated summary available for this entry.
overview
Original abstract
Constraint satisfaction problems (CSPs) with operator assignments to the variables provide a well-structured setting to study the decision complexity of the entangled value of classes of nonlocal games. Due to the CSP dichotomy theorem, the complexity of constraint satisfaction problems with classical assignments can be fully understood by studying the symmetries of the CSP, in terms of the polymorphisms of the underlying relational structure. In this work, we show that the polymorphism-based reductions between CSPs can be generalised to gap-preserving reductions between entangled CSPs based on an entangled analogue of the polymorphisms. This reduction allows us to show undecidability of entangled graph colouring with more than three colours, a problem that has proved resistant to prior hardness reductions based on commutativity gadgets.
arXiv·2026-10-01·Suheng Xu et al.
No generated summary available for this entry.
overview
Original abstract
A central goal of the emerging field of materials QED is to harness subwavelength electromagnetic confinement in engineered cavities to tailor light-matter interactions. Here, we demonstrate that van der Waals multilayer cavities composed of stacked graphene and hexagonal boron nitride (hBN) provide unprecedented control over hybridization between their electromagnetic resonances. By magnetically tuning graphene inter-Landau-level transitions (ILTs) into resonance with hBN phonons, we witness broadband, mode-selective strong coupling in the mid-infrared. Our quantum-material QED framework shows that cavity geometry and layer placement jointly control both coupling strength and modal selectivity. For experimentally realistic cavity parameters, the predicted mode splitting exceeds the width of the hBN Reststrahlen band, providing a direct route to the ultrastrong coupling regime. Together, these results establish van der Waals multilayer cavities as a scalable platform for tunable multimode QED and broaden the design space for reconfigurable quantum materials.
arXiv·2026-10-01·Shaobing Yuan, Carlo Vanoni, Salvatore Torquato
No generated summary available for this entry.
overview
Original abstract
Disordered stealthy hyperuniform (SHU) systems are emerging as platforms for controlling classical and quantum transport due to vanishing single-scattering contributions in the stealthy regime. Here, to our knowledge, we present the first perturbation theory of one-dimensional quantum transport through a continuum of identical point scatterers with SHU positional disorder. Our perturbation theory indicates the exact cancellation of all the lower-order terms due to the Fourier-space stealthy condition $S(q)=0$, and the further suppression of the lowest non-vanishing fourth order in the Lyapunov exponent $λ(k)$ due to the real-space hyperuniform constraint $\lim\limits_{D\to\infty}σ_D^2=c<\infty$. Our findings presents universal implications of the general wave-propagation phenomena in disordered SHU systems.
arXiv·2026-10-01·Naveen V et al.
No generated summary available for this entry.
overview
Original abstract
Multimode spectro-temporal non-Gaussian quantum states of light play a crucial role in continuous-variable quantum information processing. In particular, the non-Gaussian quantum states generated through a single-photon addition (SPA) to multimode quantum fields at telecommunication wavelengths constitute a useful resource for quantum technologies. We present a detailed theoretical analysis and numerical simulations of single-photon addition (SPA) and mode-selective single-photon addition (MSSPA) to a multimode quantum field at telecommunication wavelengths. The analysis is performed for congruently grown lithium niobate (LN), $5\%$ MgO-doped lithium niobate (MgO:LN) and various concentrations of ZnO-doped lithium niobate (ZnO:LN) bulk crystals. We investigate MSSPA using type-II parametric down-conversion (PDC) and SPA using the type-I PDC processes. We further present spectro-temporal mode-selective SPA at the telecom wavelength using $5\%$ MgO:LN for temperatures ranging from $0^\circ C$ to $15^\circ C$. In addition, we perform simulations to investigate SPA based on the noncollinear type-I PDC configuration. These theoretical results identify optimal experimental conditions and phase-matching parameters to achieve SPA and mode-selective SPA for LN-based crystals, providing a potential platform for non-Gaussian quantum state engineering at telecommunication wavelengths, mainly at $1550$ nm.
arXiv·2026-10-01·Mohamed R. Khodja, Belkacem E. Khodja
No generated summary available for this entry.
overview
Original abstract
Nonequilibrium electromagnetic fluctuations offer a route to repulsive Casimir--Lifshitz forces. However, designs optimized only at nominal conditions may be fragile. We formulate repulsion in a planar PEC--vacuum--biased-GaAs--vacuum--PEC stack as a robust constrained optimization problem. The smaller of the outward pressures on the two conductors is maximized under fabrication and drive uncertainties. In the optically thick-slab limit, we prove that identical boundaries admit a symmetric optimizer, so equality of the optimal gaps emerges from the model rather than being imposed. At $300~\mathrm{K}$, with gap uncertainty of $\pm10~\mathrm{nm}$ and drive uncertainty of $\pm0.005$, the optimized design sustains a worst-case outward pressure of $2.257~\mathrm{mPa}$ and exceeds the corresponding far-field radiation-pressure plateau by $0.1812~\mathrm{mPa}$. At the nominal and active worst-case points, a full finite-slab scattering calculation agrees with the reduced model to within $1.60\times10^{-3}\%$. These results provide a design bound for cavity-enhanced nonequilibrium Casimir--Lifshitz repulsion and show how robust optimization can distinguish cavity enhancement from ordinary far-field radiation pressure.
arXiv·2026-10-01·Rifzah Shahid, Amna Qadeer, Ali Raza Mirza
No generated summary available for this entry.
overview
Original abstract
We study the exact entanglement dynamics of two qubits coupled to a common bosonic reservoir through a pure dephasing interaction. We ask how this dynamics changes when the qubits and the reservoir already share correlations before the qubit state is prepared. In that case the system and reservoir first interact for a long time and settle into a joint equilibrium state. Only afterward is the qubit pair projected onto the desired state by a local measurement. For an Ohmic spectral density we obtain the exact reduced two qubit dynamics. Using the Wootters concurrence we show that initial correlations always speed up entanglement sudden death relative to the factorized case, and that this gap grows quadratically with the coupling strength in the weak-to-moderate coupling regime. Finally we show that a symmetric sequence of periodic π pulses applied to both qubits extends the entanglement lifetime close to a factor of seven over the range of pulse numbers studied.
arXiv·2026-10-01·Shihao Zhou et al.
No generated summary available for this entry.
overview
Original abstract
The spatial structure of a microwave photon mode provides a degree of freedom for controlling its interaction with a localized magnetic excitation. We demonstrate site-selective magnon-photon coupling in modular arrays of discrete dielectric resonators mounted on a common microstrip line. The resonators can be added, removed, or rearranged on the same completed PCB, enabling post-fabrication geometrical reconfiguration of the collective photon modes and their nodal structure. A YIG sphere is positioned successively above individual resonators, while an in-plane magnetic field tunes its Kittel mode through the collective photon resonances. In a three-resonator array, modes with finite local microwave magnetic fields hybridize with the magnon at every measured site, whereas a mode containing a central field node exhibits no resolvable splitting when the sphere is positioned at that node. Full-wave simulations and a coupled-mode model show that the interaction is governed by the local amplitude of the collective photon mode rather than by spectral resonance alone. Extending this local-node selection rule to a five-resonator array successfully predicts the measured position-dependent coupling patterns. These results establish post-fabrication control of spatial magnon-photon hybridization and provide a route toward reconfigurable magnonic interfaces in future hybrid quantum microwave architectures.
arXiv·2026-10-01·Kiran M. Kulkarni et al.
No generated summary available for this entry.
overview
Original abstract
We reveal that a chiral cavity distinguishes the resonant and antiresonant interactions between a two-dimensional electron gas and the cavity vacuum. For co-rotating helicities, the modes anticross, exhibiting vacuum Rabi splitting, and retain a bare vacuum ground state. For counter-rotating helicities, the modes cross, acquiring vacuum-mediated energy shifts and a two-mode squeezed ground state. We trace the origin of these observations to the SU(2) and SU(1,1) symmetries of the respective Hamiltonians and present their spectroscopic signatures in chiral photonic crystal cavities. We further predict that cavity chirality produces a handedness-dependent correction to Hall resistivity at finite polariton broadening, while such a correction is not present in an achiral cavity. For the longitudinal resistivity, we find an asymmetric response of the Shubnikov--de Haas oscillations for the different helicities. Finally, we present an experimentally accessible route for detecting the squeezed ground state through current fluctuations. Parameters based on a recently demonstrated terahertz chiral cavity place these effects within experimental reach.
arXiv·2026-10-01·Michel Kulhandjian, Lajos Hanzo
No generated summary available for this entry.
overview
Original abstract
We propose Q(q,d), a family of q-ary non-CSS qudit stabilizer codes with prime power q and dimension d >= 2, constructed from Singer difference sets and non-degenerate quadrics in PG(d,q). The parity check H = (A | M_Q A) couples the Singer-circulant incidence matrix A with the quadric circulant M_Q, and a Cancellation Lemma uses the identity (k - lambda) = q^{d-1} = 0 mod p to make H symplectic-isotropic over F_q. Five structural theorems carry the novelty: a cross-correlation modular-constancy identity nu = 1 mod q at q odd, d >= 3, with a two-value pattern that proves a 2-torsion distance ceiling; a CRT zero-count identity; an explicit Clifford bridge identifying Q(q,2) as a graph-state encoding of the trivial Singer CSS code, with the 2021 low-density-spreading (LDS) sign-flip pattern realised by a symmetric circulant; a paired column-rigidity equality d_min = R_P + 1; and a lower bound d_min(Q(7,2)) >= 8 from an exhaustive Singer-Frobenius search. A Hamada-Smith specialisation yields the closed-form logical dimension k(p,d) = theta_d(p) - C(p+d-1, d) - 1, and the flagship Q(p,2) = [[p^2 + p + 1, p(p+1)/2, d_min]]_p attains asymptotic rate one-half. We conjecture d_min(Q(p,2)) = p + 1 for odd primes, proven at p = 5 and lower-bounded to >= 8 at p = 7. Instances include Q(3,2) = [[13,6,3]]_3, Q(5,2) = [[31,15,6]]_5, Q(7,2) = [[57,28, d>=8]]_7, and Q(3,4) = [[121,105,3]]_3. Monte-Carlo over 1.5 x 10^6 trials shows Q(5,2) achieves a 70-fold per-logical-qudit improvement over Steane [[7,1,3]]_2 at depolarising rate 10^-3 with zero silent logical errors. A textbook bounded-distance decoder is used; Berlekamp-Massey-style cyclic decoding is left as the natural sequel.
arXiv·2026-10-01·Yibin Wang, Ruifeng Liu
No generated summary available for this entry.
overview
Original abstract
Dissipative dynamics can stabilize a quantum target without providing a reliable sequence of finite control operations. We derive checkable conditions for implementing such stabilization with imperfect controls, with bounds on convergence, errors during operations, and physical cost. The analysis includes pulses, idle intervals, and all simultaneously acting background dynamics. Using a common Lyapunov measure of deviation from the target, we require a contraction bound that remains uniformly below one over the prescribed uncertainty set after accounting for implementation errors. If all allowed paths preserve the target subspace throughout each operation, repeated cycles converge to that subspace from every initial state, even when errors vary between cycles. Comparison with these certified target-preserving paths gives an explicit long-time error bound under bounded leakage. Two single-qubit counterexamples show why a stabilizing average or a stabilizing generator obtained by unitary conjugation does not ensure these path conditions. The certification approach also supports a finite-library search. For a specified four-level cascade model with finite pulses, calibration and timing errors, dephasing, and bounded pumping, this search yields a sequence with an explicit preparation-time bound. For every initial state, it guarantees trace distance at most $0.1$ from the target at the end of preparation and throughout subsequent cycles.
arXiv·2026-10-01·Danial Motlagh
No generated summary available for this entry.
overview
Original abstract
Quantum read only memory (QROM) is a substantial source of non-Clifford cost in fault-tolerant quantum algorithms. Borrowing dirty qubits can reduce this cost, provided their unknown initial states are restored. We consider the practically relevant qubit-constrained regime, where limited workspace restricts the table-block size and table loading dominates the cost. For $N$ entries of $b$ bits and approximately $bλ$ dirty qubits, SelectSwap has leading Toffoli count $2N/λ$. Recent work using sequential bit packets reduces this to $(1+1/b)N/λ$. In this work we introduce a dense encoding construction of QROM, where two bits of classical information are stored in each dirty qubit instead of one by utilizing both the $Z$ and $X$ bases. On its own, dense encoding provides a $2\times$ improvement over SelectSwap by reducing the leading Toffoli count to $N/λ$. Combining it with sequential bit packets gives $\tfrac12(1+1/b)N/λ$, a further halving of the sequential construction's leading cost, and an approximately $4\times$ improvement over SelectSwap in the large-$N$ limit for practical values of $b$.
arXiv·2026-10-01·Sakshi Bahamnia et al.
No generated summary available for this entry.
overview
Original abstract
We demonstrate a general mechanism to generate scalable, metrologically useful entanglement in the form of generalized spin squeezing in multi-level (qudit) spin systems with power-law interactions. We demonstrate this for spin-changing dynamics, extending the physics of spin-nematic squeezing known from spinor BECs to spatially extended lattice geometries. In the absence of all-to-all connectivity, the dynamics generally suffers from leakage into non-collective finite-momentum modes, destroying Heisenberg scaling. We show that introducing local $\mathfrak{su}(D)$ exchange interactions establishes an energy gap that protects the fully symmetric collective manifold, suppressing non-collective excitations, and achieving Heisenberg scaling $ξ^2\propto1/N$ in one to three dimensions for any power-law exponent. We provide an analytical understanding of the mechanism via the analysis of the Bogoliubov excitation spectrum, and demonstrate its effectiveness via numerical simulations of the quantum many-body dynamics. Our findings more broadly apply to other spin-squeezing Hamiltonians, and directly generalize to larger internal spin dimensions. Our results provide a practical pathway towards scalable Heisenberg-limited qudit entanglement generation in experimental platforms such as arrays of (polar) molecules, magnetic atoms, and Rydberg atoms realizing multi-level spin systems.
arXiv·2026-10-01·Nora Brambilla, Tom Magorsch
No generated summary available for this entry.
overview
Original abstract
We study how much quantum structure bottomonium retains during its evolution in the quark-gluon plasma. Within the open quantum system framework, we simulate the Lindblad equation obtained from potential nonrelativistic QCD in the quantum Brownian regime. From the resulting real-time evolution of the bottomonium density matrix, we compute the Wigner transform and study its negativity as a measure of nonclassicality and a test of a key condition underlying classical Langevin-type approximations. We find that the medium suppresses the negativity, which nevertheless approaches a finite plateau close to that of the $1\mathrm{S}$ state. The overlaps with the excited $2\mathrm{S}$ and $3\mathrm{S}$ states arise from near-canceling positive and negative phase-space contributions, driven by negative regions in the Wigner transforms of the bound-state projectors, while the $1\mathrm{S}$ overlap is insensitive to such contributions. We further show that the position-space coherence is similarly suppressed and plateaus close to the 1S value. We trace the finite residual quantum structure to conditional purification: the medium preferentially dissolves weakly bound and unbound modes with large $\langle r^2\rangle$, driving the surviving singlet $\mathrm{S}$-wave ensemble toward the $1\mathrm{S}$ state. More broadly, these results reveal that classicalization is partial and observable dependent, a feature that is relevant across applications of open quantum system methods in fundamental physics.
arXiv·2026-10-01·Ankit Wenju Shrestha, Budhaditya Bhattacharjee, Adolfo del Campo
No generated summary available for this entry.
overview
Original abstract
Counterdiabatic driving provides a universal route to fast quantum control, but its standard formulation presupposes a Hamiltonian generator. We develop a Hamiltonian-free theory of the adiabatic gauge potential (AGP) for parameter-dependent unitary operators $U_λ$. Exact and regularized versions of the AGP follow from a Hermitian, banded linear system at a cost comparable to the Lanczos construction in the Hermitian case, requiring neither diagonalization nor a matrix logarithm. We demonstrate rapid convergence of the truncated Krylov approximation for the kicked top and for an integrable brickwork circuit built from unitary $\check{R}$ matrices, a setting in which no local effective Hamiltonian is available. Our results extend shortcuts to adiabaticity, and AGP-based diagnostics of chaos, to Floquet systems and quantum circuits.
arXiv·2026-10-01·Yoshito Watanabe et al.
No generated summary available for this entry.
overview
Original abstract
Random projective measurements are an effective tool to model the interlinked phenomenology of monitoring, inferring, and decoding highly entangled states such as quantum error-correcting codes. At the same time, the study of such monitored dynamics has opened a new arena for critical phenomena, renewing longstanding questions in disordered statistical mechanics, including percolation, random-bond models, and Nishimori physics. Here we investigate the robustness of stabilizer quantum error-correcting codes under a single round of independently sampled single-qubit Pauli measurements and demonstrate that their threshold behavior falls into two broad categories - geometric and homological percolation transitions, with the toric code and color code being the principal examples for each class. We establish the distinct character of these two threshold theories by analyzing the logical-support criteria of these codes and by providing numerical estimates of their respective critical exponents obtained from optimized stabilizer simulations of large-scale systems with over one million qubits. Our framework extends to non-CSS, subsystem, higher-dimensional, and Floquet stabilizer codes and allows us to determine their respective threshold phase diagrams. We exemplify how the latter provide quantitative and qualitative guidance for the computationally more demanding problems of tunable learning and maximum-likelihood decoding. As a practical application of our framework, we discuss the robustness of the gross code.
arXiv·2026-10-01·Yuya Kusuki, Kosei Suzuyama, Yin Tang
No generated summary available for this entry.
overview
Original abstract
We conjecture that the universal logarithmic coefficient for capacity of entanglement $c_{\mathrm{cap}}$ is bounded below by the corresponding entropy coefficient $c_{\mathrm{eff}}$ at conformal interfaces. We prove the bound in free boson and fermion CFTs and in holographic models with interface branes, and establish it using defect perturbation theory. Numerical calculations at interacting interfaces between the tricritical Ising and Ising CFTs further support the bound. Despite this constraint, capacity provides independent interface data. We construct interfaces with identical entropy and energy transmission coefficients but different capacity coefficients, and show that capacity can even increase as entropy decreases.
arXiv·2026-10-01·Xi Dong, Jiuci Xu
No generated summary available for this entry.
overview
Original abstract
We study the entanglement structure of partially entangled thermal states in double-scaled SYK , allowing flavor degrees of freedom carried by matter insertions to be in an arbitrary mixed state. In the semiclassical limit, followed by the heavy-probe limit, our replica calculation gives a Faulkner--Lewkowycz--Maldacena formula: the boundary entropy decomposes into an `area' term (independent of the flavor state) and the bulk matter entropy in a corresponding entanglement wedge. Varying the Euclidean locations of the operator insertions produces sharp transitions in the boundary entropy, which we interpret as individual matter excitations crossing the boundary of the wedge and hence as evidence for a sharply defined entanglement wedge. To derive this result, we analyze the semiclassical behavior of general Euclidean $2n$-point functions and give a probabilistic proof of their factorization into sums over products of two-point functions. We also give a complementary derivation from exact spectral representations, using the semiclassical behavior of the quantum $6j$-symbol.
arXiv·2026-10-01·Thomas Perez, Titouan Carette
No generated summary available for this entry.
overview
Original abstract
Local fermionic mode (LFM) based quantum computation has pure state spaces that are isomorphic, via the Jordan-Wigner representation, to qubit state spaces, but its compositional structure is subtly different. Indeed, the algebraic formalism specifying how to embed fermionic systems underlies a notion of parallel composition, for which, in general, the usual interchange law of monoidal categories fails. We give a categorical account of this phenomenon. Starting from the CAR-algebraic semantics of fermionic gate application, we show that LFM processes form a symmetric premonoidal category whose centre is precisely the even, parity-preserving subcategory. The same processes can alternatively be organized with the ordinary tensor product and a fermionic presymmetry that is natural exactly on even maps. To reason diagrammatically in this latter presentation, we introduce pronaps, a relaxation of the notion of prop, in which permutations are not-necessarily-natural, and use them to organize a hierarchy of fragments of the fermionic ZW calculus relevant to the study of fermionic circuits on physically motivated gate-sets. We then extend scalable diagrammatic notation to pronaps. In this setting, syntactic sugars inspired by SZX and GSA are defined, with the specificity that matrix arrows encode minors and determinants, while graph triangles encode pfaffians of principal submatrices. These constructions yield elegant normal forms and completeness proofs for our presentations of the EoW, FoW, EW, and FW fragments. In particular, the FW presentation gives a new normal form for the matchgate fragment, distinct from the rWGS-X normal form of the planar-W (pW) presentation of the same category. The resulting framework connects fermionic circuit semantics, diagrammatic rewriting with scalable notations, and the algebra of determinants and pfaffians.
arXiv·2026-10-01·Sheersh Sen, Christopher A. Leong, Bitan Roy
No generated summary available for this entry.
overview
Original abstract
Nearest-neighbor (NN) tight-binding models (TBMs) on plaquette-centered $\{ 10,3\}$ (Schläfli symbol), $\{ 8,3\}$, and $\{ 8,4\}$ hyperbolic lattices on a Poincaré disk with open boundary conditions display a vanishing, a finite, and a diverging density of states (DOS) near zero energy (band center), respectively, yielding a Dirac liquid, a Fermi liquid, and a flat band. Emergent bipartite nature of these lattices within the framework of NN-TBMs, allows us to scrutinize the impact of mass disorder on the electronic states and DOS therein. From extensive numerical calculations of the average and typical DOS using the kernel polynomial method, we show that hyperbolic Dirac liquid remains stable against weak mass disorder, undergoing a semimetal-to-metal quantum phase transition at moderate disorder, followed by an Anderson metal-to-insulator transition at even stronger disorder. The remaining two systems display only the latter transition. Critical exponents near all these transitions are found to be close to the ones mediated by on-site potential disorder.
arXiv·2026-10-01·Adrian Chapman et al.
No generated summary available for this entry.
overview
Original abstract
We study Hamiltonian learning in a novel setting, where we are promised a physical structure that is obfuscated by a global unitary. In particular, we consider the task of learning the weights $E_i$ of a Hamiltonian $H=U^{\dagger}(\sum_{i \in I} E_i n_i + H_O)U$ comprised of a set of non-interacting modes $I$ and an arbitrary ``spectator'' $H_O$ acting on a disjoint set of modes $O$. The non-interacting structure is hidden by an unknown global unitary $U$, and our goal is to recover the $E_i$ without reconstructing $U$. Such Hamiltonians are well-motivated in the setting of materials modeling, where they find application for classical methods such as mean-field theory, Green's functions, and density functional theory. We show that this problem is DQC1-hard, despite the apparent simplification given by the non-interacting structure. We then introduce SPICES (single-particle inference via contour estimators), which combines a Hadamard test with a novel classical postprocessing procedure to efficiently recover the spectral distribution in Wasserstein distance under certain natural assumptions. The method exploits the correspondence between single-particle energies of the individual quasiparticles and the Fourier frequencies governing zeros of the partition function at complex inverse temperature. As quasiparticle spectra feature ubiquitously in downstream materials calculations, and with SPICES being simple and practical to execute, we expect that SPICES is a promising route to quantum applications in materials simulation.
arXiv·2026-10-01·Anurag Anshu et al.
No generated summary available for this entry.
overview
Original abstract
We study the problem of learning the dense Sachdev--Ye--Kitaev (SYK) Hamiltonian from copies of its Gibbs state. Existing algorithms for Hamiltonian learning typically rely on geometric locality or bounded interaction degree and therefore do not apply to SYK, where each quartic interaction overlaps with $Θ(n^3)$ others. We show that this obstruction can be overcome by exploiting the random mean-field structure of the model. At any constant temperature, we prove that with high probability over the SYK couplings, the entire Hamiltonian can be learned to inverse-polynomial accuracy using polynomially many samples. Furthermore, when the inverse temperature is restricted to be a sufficiently small constant, we construct a quasipolynomial-time learning algorithm which is qualitatively different from the sample-efficient algorithm.
arXiv·2026-10-01·Zahra Baghali Khanian, Debbie Leung, Graeme Smith
No generated summary available for this entry.
overview
Original abstract
Correlations across channel uses can improve quantum communication rates, making optimization over arbitrarily large blocks a central difficulty in determining quantum capacity. We show how full permutation invariance limits this advantage for every finite-dimensional memoryless channel. The optimized coherent information per use converges to the single-use maximum and consequently attains its supremum at a finite block length. Thus finite-block superadditivity remains possible, while the asymptotic optimization reduces to a single channel use. We also establish a strong converse for pure-source entanglement generation with permutation-invariant inputs: at any fixed rate above the single-use coherent-information maximum, the fidelity tends to zero. Beyond these communication bounds, we identify a common structure underlying completely bounded norms and the sandwiched Rényi channel quantities governing discrimination against a replacer and entanglement-assisted communication. De Finetti reduction and permutation covariance yield systematic alternative proofs of their known multiplicativity and additivity results within a shared variational framework. We further show that, for permutation-invariant inputs, correlations cannot sustain an asymptotic reduction in output entropy per use below the single-use minimum. This entropy limit holds for Rényi orders greater than one and for the von Neumann entropy, extending the role of symmetry from communication bounds to the control of output entropy.
arXiv·2026-10-01·Fuchuan Wei et al.
No generated summary available for this entry.
overview
Original abstract
The power and limitations of classical simulation are central to understanding quantum computational advantages. A leading simulation paradigm is based on coherent decomposition into classically tractable free states where the decomposition rank determines the simulation complexity. Proving strong lower bounds on this number is a notoriously difficult and mathematically rich problem, as exemplified by the qubit stabilizer rank problem. Here, we study the Gaussian version of this problem in both bosonic and fermionic systems and establish robust exponential lower bounds on Gaussian rank. In particular, we prove that for every pure non-Gaussian state on finitely many modes, with definite parity in the fermionic case, the approximate border Gaussian rank of its tensor powers grows at least exponentially at any fixed norm error below one. Our proofs combine reduction to four modes with Majorana spectral bounds for fermions, and Gaussian postselection with an entropy-based rank bound for bosons. As concrete examples, we derive explicit exponential lower bounds for the four-mode fermionic GHZ state and the bosonic single-photon state. The bosonic results require no assumption on the energy of the target state. Our results show that non-Gaussianity universally entails exponential Gaussian decomposition complexity, setting fundamental limitations on decomposition-based classical simulation of bosonic and fermionic systems.
arXiv·2026-10-01·Jiaqing Jiang et al.
No generated summary available for this entry.
overview
Original abstract
Quantum impurity models are paradigmatic models of interacting quantum matter, as well as key computational primitives for modern electronic-structure methods. They describe a small subsystem of interacting fermions coupled to a large, noninteracting bath. We perform a comprehensive study of the computational complexity of simulating impurity models, delineating the boundary between classical and quantum tractability for this class of problems. Our main finding is that static properties of quantum impurity models can be calculated efficiently on a classical computer. Specifically, we give classical algorithms that (1) estimate the ground-state energy to additive precision $δ$ in time $\mathrm{poly}(n,δ^{-1})$, and (2) estimate the partition function at inverse temperature $β$ to relative precision $δ$ in time $\mathrm{poly}(n,β,δ^{-1})$, where $n$ is the system size. These results improve the previous best-known complexity for ground-state energy estimation from quasipolynomial to polynomial time, while establishing for the first time rigorous polynomial-time guarantees for simulating impurity models in thermal equilibrium. On the other hand, we find that simulating dynamical properties of impurity models is hard for classical computers but easy on a quantum computer. As a canonical example, we show that computing their nonequilibrium Green's functions captures the full power of quantum computation, even at finite temperature. Taken together, our results rule out superpolynomial quantum speedups for computing static properties, but provide an avenue for quantum advantage in simulating impurity physics out of equilibrium.
arXiv·2026-10-01·Omar Al-Ghattas, David Gamarnik, Bobak T Kiani
No generated summary available for this entry.
overview
Original abstract
We introduce a method for studying state preparation complexity in dense quantum $p$-spin Hamiltonians on $n$ qubits, going beyond bounds based only on circuit lightcones. The key input is the class's effective profile complexity, which is derived from the metric entropy of its Pauli profiles. These profiles record expectations of all Pauli operators supported on exactly $p$ qubits. Classes with uniformly bounded quadratic effective profile complexity remain separated from the ground-state energy by a positive multiple of $\sqrt n$ for sufficiently large fixed $p$. At subquadratic effective profile complexity, the class cannot outperform a suitable benchmark class at leading order, with product states providing a universal benchmark. The proof combines an adaptation of a nonsymmetric quantum de Finetti theorem of Berta et al. (arXiv:1810.12197) with Gaussian process entropy bounds. Applying this framework, we show that attaining near-ground-state energy requires $Ω(n^2/\log n)$ one- and two-qubit gates, even with arbitrary discardable ancillas. We also obtain depth-width tradeoffs, entanglement-depth and matrix product state bond-dimension lower bounds, and obstructions for both orientations at every fixed level of Parham's magic hierarchy (arXiv:2504.19966), with total circuit width $O(n)$. In first-level reverse magic, a shallow circuit is followed by an unrestricted Clifford circuit. The latter can spread local observables across the system, preventing a direct application of small-lightcone bounds. For this first-level class, our bounds also allow arbitrarily many clean ancillas at fixed shallow-circuit depth. A sharper benchmark shows that Clifford+$T$ circuits with $o(n)$ $T$-gates have no leading-order energy advantage over product stabilizer states, even with unrestricted Clifford operations and arbitrary discardable ancillas.
arXiv·2026-10-01·Suying Liu et al.
No generated summary available for this entry.
overview
Original abstract
Hamiltonian learning provides a systematic framework for reconstructing unknown quantum dynamics. However, existing protocols typically assume direct measurement access to the entire system. With fast single-qubit control and a connected reference backbone, we show that a single measurable qubit suffices to learn all $O(N)$ independent parameters of a bounded-degree two-body Hamiltonian on $N$ qubits at the Heisenberg limit. Crucially, our protocol uses robust SWAP gates synthesized by quantum signal processing, enabling coherent transfer of states evolving under distant Hamiltonian parameters to the measurable qubit. This transfer requires no prior calibration of the Hamiltonian parameters of the intermediate links. A parallel learning architecture achieves total query time $\widetilde{O}(N)$ for an $N$-qubit chain, while retaining Heisenberg-limited precision scaling. On the chain, these scalings match the fundamental precision and information-propagation lower bounds up to logarithmic factors. The framework further extends to arbitrary bounded-degree interaction graphs. Our results establish a scalable route to learning an extensive number of many-body Hamiltonian parameters through only a local measurement interface.
arXiv·2026-10-01·Daniel Grier, Jackson Morris, Kewen Wu
No generated summary available for this entry.
overview
Original abstract
In this work we study the robustness of $\mathsf{QAC}^0$ with respect to error tolerance and modifications to its gate-set. First, we investigate whether the non-zero error typically allowed for $\mathsf{QAC}^0$ circuits computing Boolean functions is truly necessary. We show that the error inherent in the parallel $W$-test of \cite{grier_morris_wu} can be eliminated entirely via a novel application of exact amplitude amplification in the many-copies context. Consequently, we find that $\mathsf{QAC}^0$ can \textit{exactly} simulate $\mathsf{TC}^0$ with polynomially many copies of the classical input and that for every fixed prime $p$ exact $\mathsf{QAC}^0$, $\mathsf{EQAC}^0$, can compute total Boolean functions outside of $\mathsf{AC}^0[p]$. Second, we ask to what extent the computational power of $\mathsf{QAC}^0$ follows from the fact that arbitrary single-qubit gates may be used at any point in the circuit. We find that $\mathsf{QAC}^0$ is in fact robust to restrictions on which single-qubit gates are permitted: every $\mathsf{QAC}^0$ circuit can be approximately implemented by a $\mathsf{QAC}^0$ circuit consisting of just generalized Toffoli, $S$, and Hadamard gates. Moreover, this approximating circuit can be constructed efficiently from a classical description of the original circuit.
arXiv·2026-10-01·Matthew Coudron et al.
No generated summary available for this entry.
overview
Original abstract
We give a deterministic classical algorithm that estimates $|\langle x|U|0^n\rangle|^2$ to additive error $\varepsilon$ in $\mathrm{poly}(n, 1/\varepsilon)$ time, where $U$ is a constant-depth quantum circuit comprised of gates with bounded fan-in and arbitrary connectivity, and $x$ is an arbitrary $n$-bit output string. This improves over prior state-of-the-art algorithms that takes $n^{O(log(n))}$ time for the same task, $n^{O(log(log(n))}$ when $U$ is geometrically local, and $n^{O(1)}$ for 2D geometrically-local circuits.
arXiv·2026-10-01·Maximilian J. Kramer et al.
No generated summary available for this entry.
overview
Original abstract
Decoded quantum interferometry (DQI) is a novel paradigm for tackling approximate optimization problems on quantum computers. This framework comes with strong performance guarantees and exploits a well-established duality between optimization and coding theory. A central question, however, is whether DQI can actually provably outperform all polynomial-time classical algorithms. In this work, we establish such an advantage in an oracle setting: we consider an optimization task called folded optimal polynomial intersection (folded OPI), where the acceptance sets are chosen randomly and accessed through membership oracles. We establish a strict gap between the approximation ratio achievable by any polynomial-time classical algorithm and the approximation ratio achieved by the DQI algorithm. Our proof builds on Jordan et al.'s DQI framework for approximate optimization and extends the classical lower-bound method underlying Yamakawa and Zhandry's exact-search oracle separation to approximation. Building on recent developments by Sun and Wootters, Horinaga and Yamakawa, and Jo, we further show that a modified version of the DQI algorithm achieves a strictly larger gap on the folded OPI problem, yielding an even stronger quantum separation. As a concrete example, for code rate $0.3$, DQI and the modified algorithm achieve expected scores of approximately $0.85$ and $0.95$, respectively. In contrast, exceeding the classical threshold of $0.65$ by any fixed amount with constant probability on sampled instances requires super-polynomially many classical membership queries.
arXiv·2026-10-01·Andrew C. Yuan
No generated summary available for this entry.
overview
Original abstract
We first provide a simple proof showing that any single-shot code is self-correcting. We then show that any $[[n,k]]$ CSS quantum low-density parity-check (QLDPC) code can be transformed into an $[[nm,k]]$ CSS QLDPC code with single-shot (SS) quantum error correction and an efficient local decoder which runs in $O(\log m)$ parallel time. Below a constant threshold $p_{\rm RG}>0$ for joint local stochastic physical and measurement noise, the logical failure probability over $T$ correction rounds is bounded by \begin{equation*} O(T n)\exp[-Ω(m^α)] \end{equation*} for a constant $α>0$; we say that the \textit{threshold} is $p_{\rm RG}$ and \textit{error suppression} is $Ω(m^α)$. Moreover, if the input code is equipped with a single-shot decoder with threshold $p_c>0$ and error suppression $Ω(n^β)$, then the output code \textit{enhances} the error suppression to $Ω(m^α n^β)$, while maintaining the decoder-independent threshold $p_{\rm RG}$, and thus \textit{enhanced} if $p_c < p_{\rm RG}$.
arXiv·2026-10-01·Shih-Han Hung
No generated summary available for this entry.
overview
Original abstract
Random quantum circuits aim to efficiently reproduce the statistical properties of ideal random quantum evolution. One approach is to construct approximate unitary designs, which match the moments of Haar-random unitaries up to a prescribed order with controlled error. In this work, we establish quantitative guarantees for how accurately these designs reproduce the full distributions of individual output probabilities. We show that, for every strong $\varepsilon$-approximate unitary $k$-design on $n$ qubits, the distribution of each individual output probability is within $O\left(\sqrt{\frac{2^n}{k(k+2^n)}}+\varepsilon\right)$ in Kolmogorov distance of the finite-dimensional Porter-Thomas distribution, a beta distribution with parameters $1$ and $2^n-1$. This bound is optimal up to constant factors, implying that a substantially better uniform bound requires additional structure. We further show that local invariance yields an exponential improvement in the dependence on $k$, with guarantees also in the stronger metric of total variation: every strong $\varepsilon$-approximate unitary $k$-design invariant under unitary translations acting on $\log k+O(1)$ qubits achieves error $2^{-Ω(k)}+O(\varepsilon)$ in Kolmogorov distance and $2^{-Ω(k)}+O(\varepsilon\log(2/\varepsilon))$ in total variation distance. These results identify both the distributional accuracy guaranteed by moment matching and the additional structure that substantially improves it. As an application, we show that if the marginal distribution of each output probability of a strong approximate design is within Kolmogorov distance $η$ of its Haar counterpart, then the expected Shannon entropy of the output distribution differs from its Haar value by $O(\sqrtη)$.
arXiv·2026-10-01·Li Gao
No generated summary available for this entry.
overview
Original abstract
We prove a generalized quantum Stein lemma for i.i.d. normal states against convex, tensor-stable families on arbitrary von Neumann algebras. Assuming the existence of an alternative state with finite relative entropy from the null state, we show that, at every type-I error tolerance $\varepsilon\in (0,1)$, the worst case type-II error exponent is achieved with the regularized relative entropy with a strong converse. The proof combines the integral representation of relative entropy by hockey-stick divergences, a modular testing bound, and convex minimax argument.
arXiv·2026-10-01·Benoît Dubus, Julien Ladeuze, Jérémie Roland
No generated summary available for this entry.
overview
Original abstract
Transducers (Belovs, Jeffery and Yolcu, 2024) are a quantum computing framework describing a quantum algorithm as a unitary converting an input state into a target state using a catalyst, an auxiliary vector that is left unchanged. They are a powerful tool in quantum algorithm design, especially in the context of quantum query complexity: feasible points of the (dual) adversary semidefinite program directly translate into transducers and the optimal transduction complexity is equal to the adversary bound, i.e. the Las Vegas complexity, which is known to characterize bounded-error quantum query complexity. Moreover, contrary to bounded-error algorithms, transducers compose exactly, which limits overheads due to controlling errors in algorithms constructed by composition. Constructing efficient, let alone optimal, transducers in terms of quantum query complexity nevertheless remains a hard task since it still requires solving the adversary SDP and constructing the unitary to obtain an explicit algorithm. In this paper, we show how using the symmetry group of state-conversion problems simplifies both steps. First, using a symmetrization argument, we prove an optimal catalyst can always be chosen covariant under a representation of the symmetry group. Second, we prove that the transducer intertwines two different representations of the group and can thus be chosen block diagonal in the isotypic decomposition of the Hilbert space. Using those methods, we then derive optimal transducers, with optimal constants, for different widely used quantum algorithmic primitives, such as unstructured search, amplitude amplification and amplitude estimation. Our approach extends previous work on the use of representation theory to compute adversary lower bounds (Høyer, Lee, and {\v S}palek, 2007; Ambainis, Magnin, Roetteler and Roland, 2011) to the systematic construction of optimal algorithms.
arXiv·2026-10-01·Srinivasan Arunachalam et al.
No generated summary available for this entry.
overview
Original abstract
A quantum impurity model describes a small interacting subsystem embedded into a large bath of free fermions. Here we study the computational complexity of calculating the ground energy, thermal equilibrium, and dynamical properties of these models. Our work reveals a sharp contrast: equilibrium properties can be efficiently approximated by classical means, whereas time evolution can implement a universal quantum computation. More precisely, let $H$ be the Hamiltonian of an impurity model with $n$ fermionic modes and a constant-size impurity. We show that: (1) the ground energy of $H$ can be approximated to additive error $\varepsilon$ by a classical algorithm with runtime $\textsf{poly}(n,1/\varepsilon)$, improving on the quasi-polynomial runtime of the best previously known algorithm; (2) at inverse temperature $β$, the Helmholtz free energy and a classical description of the thermofield double state can be computed to precision $\varepsilon$ in time $\textsf{poly}(n,β,1/\varepsilon)$; (3) simulating the time evolution $e^{-iHt}$ is $\textsf{BQP}$-complete, for $H$ that is time-independent and has a fixed, constant impurity size. Our algorithms exploit exponential suppression of multi-particle bath excitations in a basis organized by energy scale and Krylov depth. Our universality construction realizes a stationary quantum processor whose program arrives in a stream of freely propagating fermions.
arXiv·2026-10-01·Barry M. Dillon et al.
No generated summary available for this entry.
overview
Original abstract
Fast and accurate qubit-state assignment is essential for feedback, calibration, and error correction in quantum processors. In superconducting platforms, frequency-multiplexed readout makes this task intrinsically multivariate as measured traces can encode crosstalk, qubit-state relaxation events, and other transient nonidealities that are not fully captured by conventional matched filtering. Here, we introduce spiking neural network (SNN) discriminators for superconducting qubit readout. By processing the measurement window in successive time chunks, the networks exploit temporal structure and update classification scores as data arrive, rather than waiting until the end of the readout window. The spiking networks outperform matched-filter discrimination and approach the accuracy of a full-trace artificial neural network. Beyond reaching the performance of artificial neural networks, the key advantage of SNNs is that they provide a streaming, time-resolved estimate of the qubit state that evolves as the readout signal is acquired. Using quantisation-aware training and hls4ml synthesis, we further demonstrate that each FPGA inference update can be completed before the next readout chunk arrives. These results establish spiking neural networks as a promising route to low-latency, real-time qubit readout on FPGA hardware, with broader implications for time-critical quantum-control and scientific-inference applications.
arXiv·2026-10-01·Aniruddha Sen, Nicholas Hunter-Jones
No generated summary available for this entry.
overview
Original abstract
Porter-Thomas statistics are a characteristic feature of the output distribution of random quantum states and, more broadly, chaotic quantum many-body systems. Convergence to Porter-Thomas plays a central role in random circuit sampling and experimental demonstrations of quantum advantage, where the output statistics of low-depth random quantum circuits are expected to be approximately Porter-Thomas, despite the absence of a rigorous proof of convergence. We show that the output distribution of polynomial-depth brickwork random circuits converges inverse-polynomially in total variation distance to the Porter-Thomas distribution. Specifically, consider the output probability distribution over a fixed bitstring of a local random quantum circuit, constructed from nearest-neighbor Haar random gates. Then, for any $m \geq 0$, the distribution corresponding to circuits of depth $O(n^{2m+1}\log(n))$ is at most $O(1/n^m)$ far in total variation distance from the Porter-Thomas distribution. Our proof uses moment bounds from approximate designs, analytic estimates for characteristic functions, and a local anticoncentration property for inverse moments.
arXiv·2026-10-01·Daniel Alabi, Emil T. Khabiboulline
No generated summary available for this entry.
overview
Original abstract
We introduce information-theoretically private quantum protocols for two-party Hamming distance when both parties must output the same estimate. Classically, for input length $n$, information-theoretic protocols require $Ω(\sqrt{n})$ error under pure differential privacy and $Ω(\sqrt{n}/\log n)$ error under strong approximate differential privacy, whereas computational security permits $O(1)$ error. In Klauck's honest, nonpreemptive, message-preserving model, we give an $O(n)$-communication quantum protocol with pure $\varepsilon$ quantum differential privacy (QDP) and expected error at most $\frac{2}{\sinh \varepsilon}+γ$, for every $γ>0$. For approximate $(\varepsilon, δ)$ QDP, an exact hockey-stick divergence calculation yields strictly smaller error, while preserving the $O(1)$-versus-$Ω(\sqrt{n}/\log n)$ separation for $δ=o(1/n)$. Thus, quantum communication achieves $O(1)$ information-theoretic error, matching the accuracy available classically only under computational assumptions. The main construction uses a guarded coherent round trip and an equal-Gram rigidity principle that prevents an honest player from retaining input-dependent complementary information. We separate this model from weaker prescribed-channel privacy, which already admits an exact classical realization, and from fully retention-robust security, against which measurement-and-abort attacks remain possible. Therefore, we identify preservation of non-orthogonal quantum messages as a resource for privacy.
arXiv·2026-10-01·Shrigyan Brahmachari et al.
No generated summary available for this entry.
overview
Original abstract
Schur sampling is a fundamental primitive for extracting permutation-invariant information from many-body quantum systems and has broad applications in quantum information science. Circuit-based implementations typically rely on coherent representation-theoretic operations such as Clebsch-Gordan transforms, generalized phase estimation, or quantum Fourier transforms over the symmetric group. We show that unitary Schur sampling of arbitrary permutation-invariant mixed states on $n$ $d$-dimensional qudits can instead be implemented using only pairwise SWAP tests, namely, two-qudit projective measurements onto the symmetric and antisymmetric subspaces. Our protocol achieves error $ε$ in diamond distance using $O(n\min\{n,d\}^{3}\log^2(n/ε))$ random SWAP tests. The central idea is to repeatedly identify and extract the largest antisymmetric subsystem. This turns unitary Schur sampling into a search for antisymmetry and gives the algorithm a natural interpretation as a stochastic traversal of a Young diagram. The protocol preserves the $\mathrm{SU}(d)$-irrep state while preparing a canonical pure state in the multiplicity subsystem. As an application, we consider quantum purity amplification (QPA), in which multiple noisy copies of a pure quantum state are combined to produce a state of higher purity. We show that the optimal purified state can be obtained by retaining a single designated output qudit and discarding the rest.
arXiv·2026-10-01·Fangqi Dong, Alex Lombardi
No generated summary available for this entry.
overview
Original abstract
We prove near-optimal time-space lower bounds for breaking quantum cryptography in the random oracle model. Specifically, we show that a $T$-query adversary with $S$ qubits of non-uniform advice can recover a random key $k$ from the $n$-qubit binary phase state $|ψ_k\rangle \propto \sum_{x} R(k,x) |x\rangle$ with probability at most $O(\frac{T^2 + \sqrt{ST}}{N})$ for $N=2^n$. In contrast, the best known bound for post-quantum one-way functions is $O(\frac{T^2 + ST}{N})$, with a trivial attack at $S = N$. This demonstrates a new advantage of quantum cryptography over classical cryptography: $n$ qubits of communication suffice for security against preprocessing attacks with space up to $N^2$ rather than $N$. Our methodology is simple: express the optimal preprocessing attack as the operator norm of a random matrix, and bound this value in expectation over the random oracle via the trace-moment method. These trace moments have a natural interpretation using compressed oracles [Zhandry, Crypto 2019], which we then analyze. This can be viewed as a simplification and generalization of the approach of Liu [Eurocrypt 2023] for proving time-space tradeoffs for breaking post-quantum cryptography. We also prove the following results: (1) We tighten Liu's analysis of post-quantum PRGs in QROM, achieving a distinguishing advantage bound of $O(\frac{T^2}N + \sqrt{\frac{ST}N})$. (2) For unitary synthesis, we extend the one-query lower bound of Lombardi-Ma-Wright [STOC 2024] to hold against adversaries that can make one arbitrary function query along with polynomially many (adaptive) queries to the random oracle, either before or after the function query. This also interprets the original LMW24 result in terms of compressed oracles. (3) Finally, we prove a tight $O(\frac{\sqrt{S}}N)$ bound for the pseudorandomness of random binary phase states against space $S$ distinguishers.
arXiv·2026-10-01·Jesko Dujmovic, Jonas Haferkamp, Alexander Poremba
No generated summary available for this entry.
overview
Original abstract
Can simple processes appear highly complex? Gowers (Comb. Prob. Comp. '96) conjectured that repeatedly composing local random reversible operations can yield global permutations that are indistinguishable from random. In this work, we study the unitary quantum analog of this question, in an attempt to make new progress on this longstanding conjecture. Our first result shows that statistical moment matching in the form of unitary designs does not generically lead to pseudorandomness---even for the simplest quantum processes: for every fixed $t$, we give an efficiently samplable family $\{ν_n\}_n$ of distributions on one- and two-qubit gates such that, after $T=O_t(n^2\log^2 n)$ independent steps, the resulting $n$-qubit ensemble is an approximate unitary $t$-design with negligible error $\exp(-Ω(\log^2 n))$, yet an efficient quantum algorithm distinguishes it from random using only $O_t(\log^2 n)$ queries. This refutes the unitary analog of the Hoory--Magen--Myers--Rackoff conjecture (ICALP '04) for permutations. Our second result is a stronger separation between unitary designs and pseudorandom unitaries at polynomially bounded moments; our counterexample, however, requires highly structured ensembles, in contrast with the simple local walks from before. This suggests caution when using unitary designs to model information scrambling in black-hole physics, as even maximally scrambled systems can exhibit structure which is accessible to efficient experiments. Motivated by these findings, we then propose new conjectures for how pseudorandomness can plausibly emerge within simple quantum processes, such as random quantum circuits.
arXiv·2026-10-01·Ryan Anselm et al.
No generated summary available for this entry.
overview
Original abstract
A longstanding question in quantum communication complexity is whether some task can be accomplished with a small amount of communication in the presence of entanglement, yet require much more quantum communication in the absence of entanglement. Separations of this nature were previously known for relational problems and, in the simultaneous message passing model, for partial functions. But it has remained unresolved whether any such separation exists for a total Boolean function. We resolve this question with an exponential separation in the one-way setting: we exhibit a family of total Boolean functions $f_n\colon \{0,1\}^n \times \{0,1\}^n \to \{0,1\}$ that can be computed with $O(\log n)$ bits of one-way classical communication given prior entanglement, but that require $Ω(n^{1/3})$ qubits of one-way quantum communication without entanglement. Our function is a special case of the subgroup membership problem, first studied in the communication setting by Aaronson, Le Gall, Russell, and Tani.
arXiv·2026-10-01·Shunta Takahashi, Zhi Li, Beni Yoshida
No generated summary available for this entry.
overview
Original abstract
Electromagnetic duality in the toric code has order two at the level of anyon types and acts as a Hadamard-type logical transformation on the encoded quantum information. Here, we ask whether it can likewise be realized microscopically as an order-two Clifford operation. For the $\mathbb{Z}_2$ toric code, we prove that any locality-preserving Clifford realization of electric-magnetic exchange cannot have order two. Our proof is fully general and requires neither translation symmetry with restricted families of system sizes nor a fixed pairing between vertex and plaquette stabilizers. Geometrically, the proof locally emulates the unavoidable crossing between electric and magnetic strings, similar to a cross-cap in a non-orientable manifold. Extending the problem to the $\mathbb{Z}_N$ toric code, we find that an order-two Clifford realization exists for odd $N$, whereas it is impossible for even $N$. Our results show that the group law of an emergent electromagnetic duality need not lift faithfully to its microscopic Clifford realization.
arXiv·2026-10-01·Steef Hegeman, Joon Hyung Lee, Alfons Laarman
No generated summary available for this entry.
overview
Original abstract
The quantum state preparation problem is to, given a description of a quantum state, efficiently generate a quantum circuit computing the state. We show that for quantum states described by weighted d-DNNF (deterministic, decomposable pseudo-Boolean circuits) a quantum circuit computing the state can be obtained in linear time up to complex arithmetic.
arXiv·2026-10-01·Xiang Zou, H. F. Chau
No generated summary available for this entry.
overview
Original abstract
Symmetric private information retrieval (SPIR) lets an inquirer obtain one specific bit only, without leaking any information about its index to the database owner. With a single server, this is impossible for parties with unrestricted quantum power. We show that it becomes possible, with information-theoretic security, when the server and the user hold only noisy intermediate-scale quantum (NISQ) devices without long-term quantum memory and measure each qubit on arrival, while the eavesdropper remains all-powerful; this is a stricter form of the memory restriction of the bounded- and noisy-quantum-storage models. The server sends BB84 states one way; the user discriminates them unambiguously and so knows a random subset of the bits. After a joint random permutation into blocks, the user announces the conclusive locations of one privately chosen block, and the server hashes and takes a random parity of these locations in every block; the permutation makes it exponentially unlikely that one set of locations fits two blocks. We prove secrecy against the eavesdropper, database privacy through an explicit size rule for the announced set, and user privacy against a server who prepares the prescribed BB84 states and announces truthfully, exactly for single photons and up to a small multi-photon term over a tolerated noise channel. The only addition to BB84 equipment is a passive linear-optical measurement with one ancillary mode. For a $10^{4}$-bit database and database privacy $10^{-6}$, blocks of about a thousand qubits suffice over a tolerated noise channel for a user who applies the prescribed measurement; certifying an arbitrary memoryless user and committing to the permutation need larger auxiliary transmissions, which we quantify with finite keys. Database privacy extends to decoy-state weak coherent pulses, and simulations show that the bound is nearly tight.
arXiv·2026-10-01·Itai Panas
No generated summary available for this entry.
overview
Original abstract
A stationary quantum state has one dynamical phase factor and one scalar energy even when its internal response spans a large Hilbert space. Our argument concerns not the value or observability of an absolute phase, but the one-ness of stationary time evolution. In regularized Hartree--Fock (reg-HF), the connection to the stationary mean field is established before any one-mode reduction: the primitive-product relative-coordinate Gaussian measure induced by the Gaussian HF representation fixes a covariance and, at that covariance, is simultaneously the minimum-Fisher-information and maximum-Shannon-differential-entropy distribution and the equality case of the Stam bound. The Coulomb operator admits a compatible Gaussian scale resolution, and virial completion converts the resulting regularized pair displacement into a stationary-compatible response. Stationarity motivates a one-mode constraint on the terminal scalar correlation response. The decisive reg-HF hypothesis is a one-mode exclusion axiom: covariance carried by response components orthogonal to the retained pair mode is excluded from the terminal scalar energy property, without asserting that the unrestricted response is one dimensional. Helium provides the minimal nontrivial test. The parameter-free retained Coulomb carrier $-δ/e$ and finite-$Z$ insertion $8δ/9$ closely reproduce independent He-like coefficients and energies, while an explicit Bethe--Goldstone calculation displays a broad non-single-denominator return spectrum even though its scalar energy is exactly moment-compressible. The result separates microscopic spectral complexity from one-mode energetic sufficiency.
arXiv·2026-10-01·Matilde Grassi et al.
No generated summary available for this entry.
overview
Original abstract
Tensor networks are powerful tools for simulating quantum many-body systems, but the growth of spatial entanglement severely limits the direct evolution of pure states under chaotic unitary circuits. Here we consider a more targeted task: the approximate strong simulation of a specified output probability of a 1D chaotic brick-wall circuit at finite relative precision. Given input and output bit strings $\by$ and $\bx$, we evaluate $p(\bx|\by)=|\bra{\bx}U(T)\ket{\by}|^2$ using the Sweeping RTM algorithm, a transverse tensor-network contraction based on reduced transition matrices (RTMs). The algorithm compresses the left and right temporal boundary states jointly, seeking an output probability that converges across spatial cuts and as the bond dimension is increased. For chaotic one-dimensional brick-wall circuits at a fixed relative target precision, we find numerical evidence that the bond dimension required to obtain stable estimates grows subexponentially over the accessible time window. Our findings open a direct route to classical probability queries for chaotic quantum circuits, with potential applications to benchmarking and learning tasks.
arXiv·2026-10-01·Yuting Guo et al.
No generated summary available for this entry.
overview
Original abstract
Epitaxial quantum dots (QDs) are widely recognised as one of the best quantum light sources, given their good stability, brightness, quantum efficiency and coherence. To reach such properties, QDs are protected from potentially detrimental surface states by a relatively thick capping layer, typically exceeding 50nm. This prevents the implementation of near-field effects, like plasmonic-based ones, that can dramatically increase the light-matter interaction, since the control of the spontaneous emission dynamics and directionality of the emission can only occur if the emitter is in close proximity (typically tens of nanometers or less) from the metallic structures. In this work, we report the growth and optical characterisation of InAs/GaAs QDs with GaAs capping layer thickness of 10nm, 20nm, and a more standard 95nm. Remarkably, we observe emission linewidths up to 5 times smaller than previously reported, with unperturbed excitonic lifetimes. These results demonstrate that the epitaxial QD's high optical quality can be maintained even when the emitters are at reduced distances from the surface, opening the path for the exploration of near-field light-matter interactions with coherent and stable emitters, suitable for quantum technology applications.
arXiv·2026-10-01·Thuy-Duong Vuong
No generated summary available for this entry.
overview
Original abstract
We study the transverse field Ising model, defined by the Hamiltonian $H =\frac{1}{2}\sum_{i, j\in [n]} J_{ij} Z_i Z_j +\sum_{i=1}^n h_i^z Z_i + η\sum_{i} X_i$ where $J $ is the symmetric interaction matrix, and $η$ is the transverse field strength. Let $Δ(J)=λ_{\max}(J)-λ_{\min}(J)$ be the spectral width of $J.$ When the inverse temperature $β\geq0$ satisfies $Δ(J)\cdot\frac{\tanh(βη)}η\leq1$, we give a randomized classical algorithm that approximates the partition function $Z(β)=\operatorname{Tr}(e^{-βH})$ to a given relative error $ε\in(0,1)$ in time polynomial in $n$, $β$, the model parameters, and $ε^{-1}$. When $ Δ(J) \cdot \frac{\tanh(βη)}η > 1 ,$ we show that approximating $ Z(β)$ within an $\exp(o(n))$-multiplicative factor is $\textbf{NP}$-hard, and thus unlikely to admit an efficient classical or quantum algorithms under standard complexity theoretic assumptions. Furthermore, in the regime $Δ(J)\cdot \frac{\tanh(βη)}η\leq 1,$ we provide an efficient randomized classical algorithm that approximates Pauli string observables of the Gibbs state $ ρ_β= \frac{e^{-βH}}{\operatorname{Tr}(e^{-βH})}$ within an arbitrarily small additive error. In the special case when the observable is also diagonal in the $X$-basis, i.e. $P \in \{I, X\}^{\otimes n}$, the algorithm further achieves arbitrarily small relative error.
arXiv·2026-10-01·Masahiro Hoshino, Ryota Matsuda, Yuto Ashida
No generated summary available for this entry.
overview
Original abstract
Fermionic non-Gaussianity is a resource for universal quantum computation that can be generated by interactions in quantum many-body systems. Using the magic Rényi entropy (MRE) as a measure of non-Gaussianity, we derive its universal upper bound and Haar mean, proving that typical Haar-random states attain the maximal MRE density of $\ln(4/3)$ per Majorana in the large-system limit. We also show that the MRE can differ extensively between states with identical covariance matrices. To investigate how non-Gaussianity grows toward this maximal density, we evolve a Gaussian state in imaginary and real time under the Sachdev-Ye-Kitaev Hamiltonian. By varying the imaginary- and real-time durations, we identify a first-order transition marked by a kink in the MRE density and spontaneous breaking of the permutation symmetry among the four copies used to evaluate the MRE. This transition represents a qualitative change in the non-Gaussianity of the state that is not reflected in the thermal free energy.
arXiv·2026-10-01·Yibin Wang
No generated summary available for this entry.
overview
Original abstract
How complex can the responses of a quantum device become as it runs longer with a fixed internal memory? We quantify this complexity through sequential response capacity: how many adaptive testing stages, each using a fresh run, can continue to separate possible processes by a prescribed gap in response probabilities. For fixed system and memory sizes, we establish a tight law relating this capacity to run length and probability resolution. At fixed resolution, the capacity grows on the order of $K\log K$, where $K$ is the number of time steps in each run. Our construction attains this growth using time-dependent phase rotations on a single visible qubit with no additional internal memory; its tests give response probabilities exactly zero or one. Under the same tests, classical stochastic processes that measure in a fixed basis at every step have only linear capacity at fixed sizes and resolution. For phase sequences selected by a stored classical label, we then quantify how known independent Pauli noise changes this logarithmic enhancement. With ideal controls and weak residual phase noise after correction, we prove matching capacity bounds at a fixed small probability gap. These bounds identify the inverse residual phase-flip probability as the coherence timescale that limits the extra logarithmic growth.
arXiv·2026-10-01·Paulus C. Tjiang, Sylvia H. Sutanto, Vincentius E. W. Tjia
No generated summary available for this entry.
overview
Original abstract
The eight-component relativistic wave equation for spin-$\frac{1}{2}$ particles of Robson and Staudte (FV$\frac{1}{2}$), a Feshbach--Villars linearization of the Feynman--Gell-Mann equation, reproduces the Dirac hydrogenic spectrum with a doubled solution space and an indefinite inner product. Its exact Stark shifts must equal the Dirac ones; whether its indefinite-metric perturbation theory delivers them is not guaranteed. We compute the first- and second-order Stark shifts of the $n=1$--3 levels of hydrogenic ions from H to U$^{91+}$ in the Schrödinger, Dirac and FV$\frac{1}{2}$ theories, evaluating all spectral sums, continuum included, by the Dalgarno--Lewis method. The FV$\frac{1}{2}$ and Dirac shifts coincide level by level, to working precision at first order (closed-form roots) and to 45 significant figures at second order. Both ingredients are needed: without the explicit spin--field coupling the first-order roots become complex, and without the negative-norm states the $(Zα)^2$ coefficient is wrong. Norm sign and parity are locked in the doubled space: a potential lifting the $2s_{1/2}$--$2p_{1/2}$ degeneracy needs its own spin--gradient term, and shifts placed by hand on the $κ$-labeled states give a spurious imaginary linear Stark shift. The relativistic linear Stark effect is smaller by finite factors, but a second-moment sum rule shows the non-relativistic linear Stark strength is conserved, the missing part reappearing in singular $(Zα)^{-2}$ second-order terms. For levels with a fine-structure partner, an exact intra-shell/regular split of the second-order shift gives the $(Zα)^0$ coefficients analytically and relates the $π^2$ terms of the $(Zα)^2$ coefficients to the singular ones. The Dirac weak/strong-field crossover for $n=2$ of hydrogen lies near 2.8~kV cm$^{-1}$, and the perturbative window set by the fine structure grows as $Z^5$.
arXiv·2026-10-01·Maxwell West, Martin Larocca
No generated summary available for this entry.
overview
Original abstract
Deciding whether an unknown quantum state either belongs to, or is far from, a given family of states is a natural question of quantum information theory. In many such cases, there is a natural 2-copy test which always accepts whenever the state indeed belongs to the target family; it is often much more difficult, however, to bound the probability of acceptance for states that are far from the family. Here we develop a simple new technique for upper bounding this probability for general families, and therefore upper bounding the sample-complexity of the decision problem itself. As a particularly striking example of this framework, we show that deciding whether an unknown pure $n$-mode state is fermionic Gaussian, or at least $\varepsilon$-far in trace distance from all Gaussian states, can be accomplished using the optimal number $Θ(\varepsilon^{-2})$ of copies. Remarkably, our analysis applies to the well-known Bell sampling procedure for testing fermionic Gaussianity, which we therefore show to be optimal, even compared to protocols making arbitrary collective and adaptive measurements. As a second example, we show that the analogous decision problem for the family of Slater determinant states can also be solved with mode-independent sample-complexity.
arXiv·2026-10-01·Daniel Grier, Hakop Pashayan, Luke Schaeffer
No generated summary available for this entry.
overview
Original abstract
Consider the following optimization problem over stabilizer product states: given an $n$-qubit stabilizer state $\left|ψ\right\rangle$ and a set of single-qubit stabilizer states $S$, maximize $\left|\langle ψ| φ_1, \ldots, φ_n \rangle\right|^2$ over single-qubit stabilizer states $\left|φ_i\right\rangle \in S$. By varying the set $S$, we show that solutions to this problem can be useful in a variety of settings: tighter runtime bounds for certain classical simulation algorithms; measures of entanglement; and the complexity of low-rank matrix completion. Moreover, we give a complete complexity classification of this nearest stabilizer product state problem. After accounting for the symmetries in the Clifford group, there are $9$ distinct possible sets $S$, and we show that all but the two simplest of these are $\NP$-complete.
arXiv·2026-10-01·Satyaki Manna, Debashis Saha
No generated summary available for this entry.
overview
Original abstract
We show that a pair of two-qubit product measurements can be perfectly distinguished when accessed jointly, yet cannot be perfectly distinguished when their local components are distributed between distant parties restricted to local quantum operations and classical communication (LOCC). This establishes a measurement analogue of nonlocality without entanglement that, unlike its state-based counterpart, emerges in a remarkably simple setting. We further uncover a hierarchy of LOCC discrimination strategies: adaptive protocols, in which the probe used at one site may depend on classical information obtained from another, can strictly outperform restricted non-adaptive protocols, as demonstrated by a set of six bipartite qutrit product measurements. We also show that LOCC distinguishability of bipartite measurements can be intrinsically directional, depending on which party initiates the protocol. More generally, we construct pairs of $n$-qubit product measurements that are globally perfectly distinguishable but cannot be perfectly distinguished across any bipartition, even when all parties on either side of the bipartition are allowed arbitrary joint quantum operations. Finally, we show how quantum data hiding based on quantum-process nonlocality without entanglement can be realized using elementary optical components.
arXiv·2026-10-01·L. Bittel et al.
No generated summary available for this entry.
overview
Original abstract
Stabilizer states are central to quantum computing, underlying quantum error correction, benchmarking, and efficient classical simulation. Yet their learnability exhibits a striking gap: an $n$-qubit stabilizer state can be learned from $Θ(n)$ copies using two-copy Bell measurements, whereas non-adaptive single-copy measurements require $Ω(n^2)$ copies. Here we show that adaptivity completely closes this gap. We give a polynomial-time adaptive algorithm that learns an arbitrary $n$-qubit stabilizer state from $Θ(n)$ single-copy Clifford measurements, matching the optimal sample complexity of Bell sampling without any multi-copy measurements. The same ideas yield a sample-optimal single-copy tolerant tester and, with $k$ qubits of quantum memory, the optimal testing tradeoff $Θ(n-k+1/\varepsilon)$ at infidelity $\varepsilon$. Finally, we show that this adaptive mechanism extends beyond exact stabilizer states: states of stabilizer nullity at most $r$, including states prepared by Clifford circuits with a bounded number of $T$ gates, can be learned using $O(n2^{r})$ single-copy measurements.
arXiv·2026-10-01·Zecheng Li, Chunhao Wang
No generated summary available for this entry.
overview
Original abstract
We give a quantum algorithm for simulating a $d$-sparse Hermitian Hamiltonian $H$, assuming a known upper bound $Λ$ on its maximum column Euclidean norm $\|H\|_{1\to2}$. For $tΛ\ge1/2$, simulation with operator-norm error $ε$ uses \[ O\!\left(tΛ\sqrt d+\sqrt d\log(2/ε)\right) \] sparse-oracle queries. This removes the subpolynomial overhead in Low's algorithm [STOC 2019], replacing it with an additive logarithmic precision term. For $d>1$ and $tΛ\ge\log(2/ε)$, the bound matches the worst-case lower bound. A known spectral-norm upper bound may also be used in place of $Λ$. The number of 1- and 2-qubit gates is linear in the query scale, up to oracle costs and polynomial overhead in the input bit lengths and logarithmic precision parameters. As applications, we obtain $O(κ\sqrt d\,\mathrm{polylog}(κ/ε))$ queries for solving $d$-sparse quantum linear systems with $\|A\|\le1$ and $\|A^{-1}\|\leκ$, under standard sparse and state-preparation access. We also give a gate-efficient implementation of black-box unitaries with at most $d$ nonzero entries per row and column using $O(\sqrt d\log(2/ε))$ queries, given sparse access to the unitary and its adjoint. At constant error, the query bound is optimal and yields $Θ(\sqrt N)$ queries for arbitrary $N\times N$ unitaries, resolving the open question on black-box unitary implementation posed by Berry and Childs [QIC 2012].
arXiv·2026-10-01·Luna Lima Keller, Richard Kueng
No generated summary available for this entry.
overview
Original abstract
Optimal circuit synthesis is the problem of finding the shortest-depth circuit representation of a given functionality with respect to a pre-specified elementary gate set. This is a central problem in both quantum and classical hardware design. While the classical version is very well understood -- both in terms of heuristics and rigorous hardness assertions -- much less is known about optimal quantum circuit synthesis. We focus on optimal Clifford circuit synthesis, for which various heuristics are known, e.g. via reduction to 3-SAT. Our main result supplies a matching hardness result: a variant of optimal Clifford synthesis is NP-hard. The proof proceeds in two parts: (i) reduce 3-edge colorability on 3-regular graphs to a circuit synthesis problem that only involves CZ gates, (ii) prove that the availability of additional elementary Clifford gates -- most notably: Hadamard, phase and CNOT -- cannot lead to further improvements of the optimal circuit depth. Our work sharpens the complexity-theoretic understanding of Clifford circuits: simulation and equivalence checking are in P, whereas deciding whether a Clifford unitary admits an implementation within a prescribed depth is NP-complete.
arXiv·2026-10-01·Giulia Mazzola, Renato Renner
No generated summary available for this entry.
overview
Original abstract
Typically, multiple copies of a quantum state are described by a tensor power of that state. However, from an operational point of view, an experimentalist cannot, in general, rule out imperfections at unknown positions or correlations between copies, so assuming independent and identically distributed (iid) copies is not justified a priori. In the following, we relax the iid assumption by considering a whole set of resource states that are fundamentally indistinguishable from a tensor power state, and in that sense look like many copies of the quantum state to the experimentalist. Using a de Finetti-type argument, we show that this operational set of states can asymptotically be represented by almost-iid states. As an application, we introduce operational analogues of asymptotic transformation rates, such as entanglement cost and distillation. This raises the question of whether these rates coincide with their iid counterparts.
arXiv·2026-10-01·Baisong Sun et al.
No generated summary available for this entry.
overview
Original abstract
Knill-Laflamme coefficients characterize exact quantum error detection through scalar compressions of error operators to the code space. For prescribed Pauli observables and a fixed code dimension, attainable coefficient vectors form a joint higher-rank numerical range, whose Euclidean norm image is the signature spectrum. We study how operator representation, code dimension, and detection constraints govern this geometry. Our main theorem identifies representation multiplicity as sufficient to lift active expectation data to exact scalar compressions: a lift exists whenever each occupied block has multiplicity at least the code dimension times the rank of the corresponding active state. When multiplicity suffices to realize all active states, the coefficient range is the full active expectation body and is therefore convex and connected, with a closed interval as its signature spectrum. This framework unifies commuting Pauli families, where sufficient common-eigenspace degeneracy yields polytopes, and subsystem stabilizer codes, where protected logical subsystems supply multiplicity spaces for noncommuting gauge observables. Explicit examples show how increasing the code dimension can make a range shrink, collapse, or become empty, while increasing multiplicity can turn a Bloch sphere into a filled ball. In the subsystem setting, parent-Hamiltonian constructions realize exact detecting codes as degenerate ground spaces, selecting distinguished vectors and continuous paths within these ranges. A final three-qubit example shows additional noncommuting detection constraints reduce a tetrahedral range to its barycenter and four vertices, producing a disconnected signature spectrum. The results provide a structural framework for Knill-Laflamme coefficient geometry and motivate sharper criteria for connected coefficient ranges and interval signature spectra under structured error models.
arXiv·2026-10-01·Sergio Escobar et al.
No generated summary available for this entry.
overview
Original abstract
Many quantum systems are believed to thermalize slowly at low temperatures due to the existence of metastable phases. However, there are cases where further cooling can restore polynomial-time thermalization: we demonstrate that the Davies dynamics of the mean-field interchange model with local dimension $d\geq 3$ and single-site generalized Pauli couplings exhibits this behavior. The dynamical phase diagram is beholden to two distinguished inverse temperatures, $β_{\mathrm{min}}(d)$ and $β=d$, with the static first-order phase transition lying between them. At low and high temperatures surrounding the interval $(β_{\mathrm{min}}(d),d)$, the spectral gap of the Davies generator is bounded below by an inverse polynomial in system size $n$. Meanwhile, in this interval, the gap vanishes exponentially in $n$, indicating metastability. The proof uses Schur-Weyl duality to decompose the Davies generator into a classical Markov generator on Young diagrams, and the restriction to the remaining symmetry sectors whose gap is $Ω(n^{-1})$. Thus, exponential slowdown arises entirely from the Young diagram chain.
arXiv·2026-10-01·Zongbo Bao, Jonas Helsen, Tuyen Nguyen
No generated summary available for this entry.
overview
Original abstract
We address the problem of testing whether an unknown $n$-qudit state $ρ$ is $a$-close to a product state or $b$-far away from any product state, as measured in terms of state overlap. We provide a time-efficient algorithm to solve this problem that requires an $n$-independent number of copies of the unknown state. Our random coloring argument shows that for any unknown state there always exists a partition of $[n]$ into $q$ parts such that the square of the overlap with the closest product state with respect to this partition is only an additive factor $O(1/q)$ larger. This reduces the problem to tolerant testing of $q$ parties, with potentially growing local dimensions. Combining this insight with blockwise spectral projection arguments we can show that the natural $k$-copy generalization of Harrow & Montanaro's product state test provides an efficient tolerant tester. We use the same random coloring and blockwise spectral projection techniques to obtain a substantially improved algorithm for closest product state learning. In particular we give an algorithm that takes in $\widetilde{O}\big((nd)^2\big)\, 2^{\widetilde{O}(1/\varepsilon^8)}$ copies of the unknown state and produces an $\varepsilon$-approximately optimal product state. The key technical components of this learner are a qudit variant of the Bakshi et al. high-fidelity product state learning algorithm and a sampling technique based on Werner's optimal cloning channel.
arXiv·2026-10-01·Federico Santona et al.
No generated summary available for this entry.
overview
Original abstract
Compact ground-state preparation circuits are essential for early fault-tolerant quantum chemistry. We introduce Variational Imaginary-time Majorana Evolution (VIME), a classical pre-training algorithm that extends operator-projected variational quantum imaginary-time evolution (OVQITE) to molecular electronic structure using a single compiled Majorana-propagation (MP) surrogate graph. We pair VIME with a compressed tiled Unitary Product State (c-tUPS) ansatz that we develop to reduce both classical simulation and quantum state-preparation costs. In the strongly correlated ruthenium complex TLD-1411, active-space calculations requiring up to 52 qubits achieve chemical precision against DMRG reference energies, with energy errors approximately $400\times$ smaller than those from ADAPT-VQE-based variational Majorana-propagation (ADAPT-VMPE). Across the strongly multireference acene series up to heptacene (60 qubits), VIME matches or improves on the MP-reported energy accuracy of the ADAPT-VMPE comparison points with up to $26\times$ fewer CNOTs and $167\times$ lower two-qubit depth. These results establish imaginary-time classical pre-training of compressed variational ansätze as a promising route to resource-efficient molecular ground-state preparation.
arXiv·2026-10-01·Kaito Watanabe et al.
No generated summary available for this entry.
overview
Original abstract
Universal channel coding enables communication without a complete description of the channel. For classical channels, universal codes can attain both capacity and the optimal high-rate reliability. We show that this compatibility fails for classical-quantum channels in general; that is, the optimal reliability in the channel-aware scenario is not always achievable with universal coding due to the ignorance of the unitary rotation of the output system. We exhibit a family of classical-quantum channels for which one cannot achieve the channel-aware optimal reliability by a fixed coding scheme. We further derive a converse bound on the reliability for unitary-invariant decoders, a natural assumption for the universal coding scheme, that can be strictly smaller than the optimal channel-aware error exponent. Conversely, we construct a channel-independent encoder-decoder pair and establish a universally achievable bound on the reliability that matches this converse bound in the high-rate regime, thereby characterizing the optimal universal reliability. Specifically, the channel-aware and universal exponents are governed by the Petz and sandwiched Rényi divergences, respectively. These divergences coincide for commuting outputs but differ for noncommuting ones, explaining why universality preserves optimal reliability classically but can reduce it quantumly. Our results showcase the fundamental reliability cost of performing the classical-quantum channel coding task universally.
arXiv·2026-10-01·Anthony Yuezhang Liu et al.
No generated summary available for this entry.
overview
Original abstract
Given oracle access to an unknown unitary $U=e^{iH}$ , the fractional query problem asks how many queries are required to implement a noninteger power $U^t=e^{itH}$, $0<t<1$, when the spectrum is separated from the branch cut by a gap $δ$. Quantum singular value transformation gives an upper bound of $O\!\left(\frac{1}δ\log\frac{1}{\varepsilon}\right)$ queries for approximation error $\varepsilon$. We prove a matching lower bound for arbitrary query algorithms. Our argument reduces any $N$-query circuit to the approximation of $e^{itθ}$ by a trigonometric polynomial with degree bounded by $O(N)$, together with Remez inequality. This allows us to establish the lower bound of $Ω_τ\!\left(\frac{1}δ\log\frac{1}{\varepsilon}\right)$. Consequently, the optimal query complexity for fractional query problem is $Θ_τ\!\left(\frac{1}δ\log\frac{1}{\varepsilon}\right)$, showing that the known QSVT construction is asymptotically optimal. We also give an alternative lower bound proof based on constructing a linear functional that annihilates the approximant space, yielding a $Ω_τ\!\left(\log\frac{1}{\varepsilon}\right)$ bound uniform to $δ$.
arXiv·2026-10-01·Jihong Cai, Advith Govindarajan, Marius Junge
No generated summary available for this entry.
overview
Original abstract
We propose a novel approach to state preparation by embracing the full power of open quantum systems. Instead of working with the whole unitary group in $n$ qubits, we identify a small Lie group $G$ in $(n+3)$ qubits. The dimension of its Lie algebra is $\text{poly}(n)$. Every state can be approximated starting from any fixed input state by repeatedly using partial trace and state preparation in the environment alongside group operations. Moreover, we also identify a single (open system magic) interaction Hamiltonian whose unitary group can be combined with open system quantum technology mentioned above to achieve transitivity on the space of all densities. Similarly, we show that all channels on $n$ qubits can be approximated by using a larger environment, achieving channel universality. The interesting small groups we identify are derived from Lie algebras of local Pauli strings and lead to a new landscape of cheap and expensive states, densities, and channels.
arXiv·2026-10-01·Felix Burt et al.
No generated summary available for this entry.
overview
Original abstract
Networking matter-based quantum processing units (QPUs) offers a promising route to scaling fault-tolerant quantum computers. This requires distributed logical operations to be performed across photonic links, where noise is characteristically different from and stronger than in local QPUs owing to photon loss and probabilistic linear-optical operations. Measurement- and fusion-based quantum computing are designed to be robust against loss and probabilistic photonic operations, suggesting they could complement circuit-based error correction at the interface between networked QPUs. We use ZX calculus transformations to construct hybrid syndrome extraction protocols and apply them to distributed rotated surface code lattice surgery, demonstrating that several protocols attain a $50\%$ interface-erasure threshold when local noise is absent, including circuit-based lattice surgery using fused Bell pairs and hybrid protocols using linear cluster states. Relative to a straight Bell-pair interface geometry, the hybrid protocols increase the merge-observable interface distance from $d+1$ to $2d+1$ and restore the perpendicular-observable interface distance from $\lfloor(d+1)/2\rfloor$ to $d$. We calculate how the threshold decreases when using truncated resource states and map correctable regions under resource-state errors, local circuit noise, and fusion erasure. We then convert these erasure thresholds into photon-loss thresholds and probe subthreshold performance using fusion boosting. At circuit and resource-state error rates of $10^{-3}$, local errors largely mask the interface-distance advantage. As local noise is reduced to $10^{-4}$ and below, the linear-chain protocols improve more rapidly with decreasing erasure, suggesting that interface distance enhancements are effective in low local noise regimes.
arXiv·2026-10-01·Kewen Wu, Guangxu Yang
No generated summary available for this entry.
overview
Original abstract
Decoded quantum interferometry (DQI) is a polynomial-time quantum algorithm introduced by Jordan et al. (Nature 2025). For a natural optimization problem, known as optimal polynomial intersection (OPI), it achieves approximation guarantees in regimes where all known classical algorithms require exponential time. Besides time, space is another central resource: storing and manipulating a massive input can be very challenging, especially when logical qubits carry substantial fault-tolerant implementation overhead. This motivates the following question: does DQI yield quantum advantages in memory, and can we prove it unconditionally? We give an affirmative answer to this question in the streaming setting. In particular, we consider a natural generalization of OPI using Hermite interpolation and Hasse derivatives, which asks for a low-degree polynomial satisfying as many constraints on its values and derivatives as possible. As a concrete example, we show [Quantum efficiency.] An adaptation of the DQI algorithm produces a polynomial satisfying $93\%$ of the constraints; moreover, it only reads the input stream in one pass, uses polylogarithmic space, and has polylogarithmic computation time per stream entry. [Classical hardness.] Any classical algorithm that produces an answer satisfying just $76\%$ of the constraints requires polynomial space, even if it can read the input stream with polynomially many passes and can use unlimited time. Our result provides a complete tradeoff curve for the tunable parameters, and implies that DQI has provable quantum advantages for the original OPI problem.
arXiv·2026-10-01·Andreas Fring, Ian Marquette
No generated summary available for this entry.
overview
Original abstract
We study classical and quantum superintegrability of a resonant three-dimensional Hamiltonian with indefinite kinetic energy and three Poisson descriptions of the same flow. Besides three commuting quadratic Hamiltonians, the polynomial first-integral ring contains two primitive degree-four generators, $I_4^{\rm o}$ and $I_4^{\rm e}$, of odd and even momentum parity. A single octic relation leaves the polynomial invariant ring with transcendence degree four. Solving the complete first-integral equation shows that every rational first integral is a rational function of $H_1,H_2,H_3,I_4^{\rm o}$, so that the rational invariant field likewise has generic functional rank four. A branch-free transcendental invariant raises the generic smooth functional rank to five on the invariant open set $Δ>0$. The system is therefore minimally superintegrable in the polynomial and rational classes and maximally superintegrable on this invariant domain when transcendental integrals are admitted. Weyl quantisation yields exact higher-order differential symmetries in all three Poisson realisations. The branch-free fifth classical invariant also admits a densely defined nonlocal quantum counterpart, providing a concrete quantum realisation of the transcendental completion.
arXiv·2026-10-01·Dmitry Budker, Angela Wittmann
No generated summary available for this entry.
overview
Original abstract
The chirality-induced spin selectivity (CISS) effect, the coupling between structural chirality and electron spin polarization, has been experimentally observed across many diverse systems. However, despite extensive theoretical effort, a unified mechanistic understanding remains elusive. In this perspective, we demonstrate how some of the basic properties of the fascinating effects of CISS can be understood based on straightforward symmetry considerations commonly employed in fundamental particle physics. In particular, we show that CISS does not violate any fundamental symmetries including parity and time-reversal. By anchoring CISS within the universal language of symmetry, we offer a robust conceptual foundation for interpreting experiments and guiding future theoretical and experimental designs.
arXiv·2026-10-01·Emilio Onorati et al.
No generated summary available for this entry.
overview
Original abstract
Analogue and digital Hamiltonian simulation represent two distinct approaches to making one quantum system replicate the physical properties of another, with consequences ranging from practical applications to complexity theory and quantum gravity. They are rooted in two distinct regimes of quantum dynamics: time-independent Hamiltonians for the former; fully controllable time-dependent quantum circuits in the latter. Time-periodic Hamiltonians represent an intermediate regime. In this work, we establish a theory of Floquet simulation where we use periodically driven Hamiltonians to synthesise time-independent ones. We show that a set of interactions $S$ can Floquet-simulate every Hamiltonian in the Lie algebra $\mathrm{Lie}(S)$, and consequently we give a complete and constructive characterisation of Floquet-universal Hamiltonians that are able to produce any target Hamiltonian. Notably, our construction uses only $O(1)$ local interaction strengths and ratios thereof, avoiding the impractical multi-scale local interaction strengths often required in analogue simulation via time-independent Hamiltonians. Instead, the construction requires a range of driving frequencies which scales polynomially with system size for important classes such as $k$-local lattice Hamiltonians. This has immediate complexity-theoretic implications, including numerous BQP-completeness and QMA-hardness results for natural physical properties and quantities studied in Floquet physics.
arXiv·2026-10-01·Letao Wang et al.
No generated summary available for this entry.
overview
Original abstract
Geometric quantum machine learning incorporates symmetry into quantum models, but how symmetry shapes their expressivity and guides effective model design remains insufficiently understood. We address this question through the Fourier representation of quantum Fourier models (QFMs). Symmetry organizes the frequency spectrum into orbits and sums the Fourier coefficients within each orbit into a symmetrized coefficient. When QFM trainable layers form independent exact 2-designs, the variance of each symmetrized coefficient equals the sum of the coefficient variances in its orbit. For single-layer QFMs with $\varepsilon$-approximate 2-design trainable layers, we bound the deviation from this identity. The resulting bound for individual Fourier coefficients can be exponentially tighter than an existing bound. The hyperoctahedral group provides an example of orbit growth that can mitigate vanishing expressivity of the symmetrized coefficients. Symmetrization of QFMs over an elementary abelian 2-group also yields pure multivariate Chebyshev polynomial basis functions. We introduce randomized encoding, which implements invariant models without ancilla qubits or the additional circuit depth for quantum twirling. We evaluate the models as quantum physics-informed neural networks (QPINNs) on two-dimensional screened Poisson and stationary viscous Hamilton-Jacobi equations. Under hard boundary constraints, QPINNs using exact symmetrization and randomized encoding achieve the lowest mean errors in the two benchmarks, respectively.
arXiv·2026-10-01·Shams Ara, Md Fazlul Hoque, Ian Marquette
No generated summary available for this entry.
overview
Original abstract
We study two three-dimensional quantum superintegrable systems in nonvanishing axially symmetric magnetic fields. For each model the integrals generate a quadratic algebra with a Casimir, and finite-dimensional deformed-oscillator representations yield algebraic spectra. The same spectra are recovered by separation of variables. In circular parabolic coordinates the separated equations are sextic biconfluent-Heun equations with finite polynomial sectors. We formulate them as Sturm eigenvalue problems with the physical energy as a parameter and the separation constant diagonalized. After gauge transformation, each equation admits an $sl(2)$ algebraization and reduces to a finite tridiagonal matrix. We also construct a pre-separation Sturm representation of each complete Hamiltonian, taking the inverse-square coupling as the Sturm eigenvalue. The transformed integrals remain commuting and, after fixing the axial integral, changing variables and gauge rotating, the two-variable Sturm Hamiltonian and its non-central integrals belong to the universal enveloping algebra $U(sl(3))$. We thus obtain three complementary algebraic descriptions: the quadratic-algebra/deformed-oscillator representation of the original Hamiltonian, the $sl(2)$ algebraization after parabolic separation, and the $sl(3)$ algebraization of the complete Sturm problem before separation. Although the two magnetic Hamiltonians are distinct in the original classification, fixing the axial integral reduces them to the same singular 2:1 oscillator normal form with different effective parameter embeddings. This explains the common $sl(3)$ structure without implying equivalence of the original magnetic systems. These results show how distinct hidden algebraic structures and exact or quasi-exact solvability can emerge at different stages of a multiseparable superintegrable system.
arXiv·2026-10-01·Mohsen Alishahiha
No generated summary available for this entry.
overview
Original abstract
We study coherent release from a finite serial Krylov sector into an exact conformal tail with asymptotically linear Lanczos coefficients. We derive an exact finite-cut occupation kernel and its locally uniform moving-cut limit, whose derivative is the squared modulus of a filtered boundary-emission amplitude. The tail sets the filtering kernel and logarithmic transit scale, while the release profile also depends on the finite sector. Its early edge records the number of serial steps before emission, whereas its late edge reflects slow resonances, interference, and logarithmic enhancements from merged poles. A one- and two-site family can share the same leading continued-fraction pole while exhibiting inequivalent profiles. We further consider a thermal AdS$_2$ realization in which, in the weak-coupling limit, the dressed oscillator measure approaches a two-site shallow sector followed by the conformal tail, with the leading complex pole reproduced through second order.
arXiv·2026-10-01·Amir-Reza Negari et al.
No generated summary available for this entry.
overview
Original abstract
A recurring principle in many-body physics is that sufficiently distributed interactions or correlations lead to an effectively mean-field description. For fermionic Gaussian states, we establish a quantitative version of this principle directly at the level of Majorana covariance matrices. The main observation is that the admissibility condition for fermionic covariance matrices imposes a quantitative monogamy constraint on two-point correlations: a fixed region has only a bounded covariance budget to distribute among many disjoint regions. We use this principle in three directions. First, for quadratic fermionic Hamiltonians on finite simple graphs of high degree, we obtain product-state approximations to both the ground-state energy and the finite-temperature free energy, with error of order \(D^{-1/2}\) for \(D\)-regular graphs. Second, we prove a finite fermionic Gaussian de Finetti theorem: a \(k\)-copy Gaussian state that is \(n\)-exchangeable under graded fermionic copy permutations is \(O(k/n)\)-close in trace norm to the product of its one-copy marginal. In particular, infinite exchangeability within the Gaussian class implies exact product structure. Third, for spatial fermionic Gaussian states with exponentially clustering mutual information, we prove that the conditional mutual information across a separating buffer decays as \(O(r^{-1})\), and hence, by recoverability, the state admits an \(O(r^{-1/2})\) trace-norm approximation by a recovered state. These results show that product and de Finetti approximations and recoverability estimates for fermionic Gaussian systems can all be derived directly from covariance-level structure.
arXiv·2026-10-01·Augusto Gerolin, Zhiyi Lin
No generated summary available for this entry.
overview
Original abstract
We develop a Quantum Optimal Transport (QOT) barycenter framework for quantum states, as an analog of Wasserstein barycenters~\cite{AguCar}, and establish existence and duality results for a broad class of possibly unbounded transport costs on separable Hilbert spaces. Our framework provides, in particular, a unified treatment of $2$-quantum Wasserstein (QW) barycenters in both the quantum-state and quantum-channel formulations by specializing to the canonical quadratic cost operators associated with the $2$-quantum Wasserstein distances of Caglioti--Golse--Mouhot--Paul~\cite{caglioti2021towards,Golse-Mouhot-Paul:2016} and De Palma--Trevisan~\cite{DPaTre19}. The central results concern Gaussian input states and, in particular, Gaussian rigidity: whether Gaussian input states force the 2-QW barycenter itself to be Gaussian and uniquely determined when the minimization is taken over all quantum states. We first show that the barycenter problem admits a Gaussian minimizer and reduces to a finite-dimensional convex optimization problem over covariance matrices. The main difficulty is that uniqueness of the optimal covariance does not, in general, imply uniqueness of the underlying quantum state. We bridge this gap through a state-reconstruction principle under covariance complementary slackness that upgrades uniqueness of the optimal covariance to uniqueness of the full quantum state, and thereby prove a global rigidity theorem: if at least one Gaussian input is faithful, then the barycenter is unique among all quantum states and is necessarily Gaussian. Faithfulness is sufficient but not necessary: families of pure inputs still determine a unique barycenter, whereas partially pure nonfaithful Gaussian inputs may admit multiple barycenters.
arXiv·2026-10-01·Minki Hhan, Hojune Lee
No generated summary available for this entry.
overview
Original abstract
Random Clifford operators have numerous applications in quantum computing, including randomized benchmarking, classical shadows, and quantum authentication. However, sampling and implementing uniformly random $n$-qubit Clifford incur near-quadratic complexity due to the size of Clifford group. We introduce a cryptographic way to overcome these barriers: trapdoored Clifford operator distributions whose samples are computationally indistinguishable from uniformly random Cliffords, yet implementing them can be much faster given the trapdoor. We construct a distribution of trapdoored Clifford operators whose elements can be sampled and implemented in near-linear time under a variant of the learning parity with noise assumption. Our constructions allow fast tableau action on Pauli labels for classical simulation, and also can be optimized to admit polylogarithmic-depth implementation. Along the way, we construct trapdoored matrices over finite fields that support efficient multiplication by both a matrix and its inverse, resolving an open question left by Vaikuntanathan and Zamir [SODA'26]. We use these constructions to obtain faster protocols based on random Cliffords. We also explore their applications to the worst-case to average-case reductions for matrix and Clifford problems including the iterated matrix multiplication and Clifford circuit synthesis. In particular, we show the hardness of batching Clifford circuits: synthesizing circuits that apply the same Clifford to multiple registers is at least as hard as worst-case matrix multiplication, even when synthesis succeeds on a small constant fraction of random Cliffords. This extends to approximate implementations by general quantum circuits.
arXiv·2026-10-01·Ameur Dhahri et al.
No generated summary available for this entry.
overview
Original abstract
Our study connects root-mean-square ballistic transport to potential-theoretic recurrence for finite-range open quantum random walks. In homogeneous walks with primitive local channels, finitely many simple periodic Fourier peripheral eigenvalues, no nonzero stationary Fourier mode, and a nondegenerate quadratic spectral term, we prove a periodic uniform local limit theorem and recover exponential finite-set return bounds for nonzero drift. The centered case yields strong Green-function asymptotics in at least three dimensions, as well as potential-kernel asymptotics in one and two dimensions. According to these assumptions, the RMS ballistic speed equals the drift norm, nonzero drift indicates transience, and centered walks are recurring in effective dimensions one and two but transitory in higher dimensions. The low-dimensional finding shows a recurrence of the origin projection in TOM. For reducible walks, an explicit harmonic \(h\)-transform converts each absorption component to an OQRW, providing a detailed breakdown of Green occupation potentials. The squared RMS speed is the absorption-weighted mean of squared component drifts, but the reduced drift-dimension classification also needs specific component return estimations. A centered noncommuting family validates the fundamental spectral assumptions in all dimensions and provides explicit potential constants. Exact finite traps and sparse reflecting barriers provide a complementary nonhomogeneous method for zero speed and TOM recurrence.
arXiv·2026-10-01·Zhenyu Shen et al.
No generated summary available for this entry.
overview
Original abstract
Understanding the dynamics of interacting quantum systems is a central goal of quantum simulation. For geometrically local Hamiltonians, locality suggests that digital simulation should retain much of the parallelism of the underlying dynamics. For a target accuracy $ε$, we construct a nearest-neighbor quantum circuit that simulates the dynamics of an $n$-qubit, time-independent, finite-range Hamiltonian with normalized local interaction strength on a fixed-dimensional lattice for time $T\ge1$, with circuit depth $O(T\log(nT/ε))$ and gate count $O(nT\log(nT/ε))$. This reduces the polylogarithmic overhead of Haah, Hastings, Kothari, and Low to a single logarithm. On logarithmic-scale blocks from the Lieb--Robinson decomposition, a shallow but highly accurate implementation is essential for reducing the circuit depth. Our key observation is that spatial localization also controls the cost of high precision. In each block, the error of a constant-order product formula is compensated for by a correction, yielding exponential accuracy. The correction can be implemented with depth proportional to the block diameter, introducing no additional asymptotic depth scale beyond that required by spatial localization. Furthermore, we prove an unconditional circuit-depth lower bound for uniform XXZ Hamiltonians: at fixed evolution time $T$ in the stated regime and sufficiently small fixed error $ε$, any nearest-neighbor quantum circuit simulating these dynamics requires depth $Ω(\log n/\log\log n)$. This matches our $O(\log n)$ upper bound up to a doubly logarithmic factor, establishing near-optimal circuit depth for lattice Hamiltonian simulation in this regime. Together, these results clarify the role of locality and precision in determining the circuit complexity of quantum dynamics and suggest broader principles for spatially constrained quantum computation.
arXiv·2026-10-01·Xiaowan Yang et al.
No generated summary available for this entry.
overview
Original abstract
Wheeler's delayed-choice experiment demonstrates wave-particle duality of particles using different experimental configurations of a Mach-Zehnder interferometer. In a quantum version of this experiment, the wave-particle behavior of photons can be observed by controlling presence or absence of the second beam splitter. Here, we implement a delayed-choice experiment with dual selections based on entangled photons, experimentally controlling both of two beam splitters in the Mach-Zehnder interferometer, where the presence and absence of the second beam splitter are simultaneously controlled through path encoding. Our experiment reveals the wave-particle behavior of single photons under different configurations of two beam splitters. We further discuss the scenario when two beam splitters are in a quantum superposition of being present and absent, photons will be in a wave-particle quantum superposition state.
arXiv·2026-10-01·Debika Debnath, Fernando Dominguez, Patrik Recher
No generated summary available for this entry.
overview
Original abstract
Nonreciprocal supercurrents in interacting nanostructures can arise when the positive and negative critical currents probe inequivalent portions of a phase-dependent many-body spectrum. We study this mechanism in a parallel double-quantum-dot Josephson junction with strong intradot Coulomb repulsion, where local and non-local Cooper-pair transfer coexist. Using exact diagonalization of a zero-bandwidth Hamiltonian with explicit superconducting orbitals, we show that orbital flux and the gauge-invariant tunnel-sign parity control the interference between local Josephson processes and non-local exchange. For detuned dots, this produces flux-tunable singlet, triplet, and doublet ground-state spectral branches and two rectification regimes. Near the boundaries of the charge sector with singly occupied dots [(1,1) sector], doublet branches compete with singlet or triplet branches, yielding diode efficiencies approaching 40%. Within the triplet-dominated (1,1) sector, nearby singlet crossings asymmetrically reshape the ground-state envelope even when both critical-current extrema lie on the triplet-like branch, producing a broader response of order 10-15%. Finite temperature generally suppresses charge-crossover rectification, however, for intermediate temperatures we find an enhancement of both the normalized efficiency and the absolute critical-current asymmetry in the triplet regime. These results establish phase-dependent many-body branch competition as a gate-, flux-, and tunnel-parity-sensitive source of Josephson nonreciprocity.
arXiv·2026-10-01·Said Lantigua et al.
No generated summary available for this entry.
overview
Original abstract
General operator learning for parametric partial differential equations (PDEs) is a fundamental challenge at the intersection of artificial intelligence and physics-based modeling. Physics-informed Deep Operator Networks (PI-DeepONets) incorporate governing equations into learning, but face optimization difficulties in high dimensions. Quantum extensions offer additional representational capacity, yet their trainability can be hindered by barren plateaus. Here, we introduce QPI-DeepONet-MAC, a hybrid quantum-classical architecture that integrates parameterized quantum circuits into PI-DeepONets through a multiplicative-and-additive coupling (MAC) of classical representations and quantum expectation values. We prove analytically that the proposed architecture retains universal operator approximation capabilities. Furthermore, we derive bounds on quantum parameter gradients, establishing explicit conditions to avoid barren plateaus alongside a scaling criterion for trainability. Additionally, we derive a lower bound on the number of sensors required for a target accuracy, directly linking sampling requirements to input function regularity, domain dimension, and PDE dynamical growth. Finally, we propose an informational regularization scheme based on quantum coherence and state fidelity dynamics to prevent coherence loss and preserve quantum structure during training. Together, these results establish a theoretical foundation for quantum-enhanced physics-informed operator learning and position QPI-DeepONet-MAC as a scalable, stable framework for solving parametric PDEs.
arXiv·2026-10-01·Jacob Werner
No generated summary available for this entry.
overview
Original abstract
Collision models provide a flexible framework for studying open quantum systems and introducing non-Markovianity. We present a novel class of collision models, which we term Markovian impurity models, motivated by physical scenarios in which information backflow is periodically blocked. Using the Breuer-Laine-Piilo (BLP) measure of non-Markovianity, we show that if a $p$-impurity model is non-Markovian, then the corresponding $(p+1)$-impurity model is also non-Markovian, implying the existence of a critical $p$ at which the process transitions from Markovian to non-Markovian. Numerical simulations are used to investigate how this critical parameter depends on the system-ancilla and ancilla-ancilla interaction strengths. We find that, altough exceptions exist, increasing either interaction strength generally lowers the critical $p$, while sufficiently weak ancilla-ancilla interactions lead to a regime in which the dynamics remain Markovian even in the absence of impurities. Finally, we briefly introduce the complementary non-Markovian impurity model.
arXiv·2026-10-01·Marcel Mordarski et al.
No generated summary available for this entry.
overview
Original abstract
Quantum key distribution (QKD) links are provisioned from security analyses of stationary channels, whereas the devices that determine the channel drift between recalibrations. Whether an eavesdropper who cannot alter the channel's own noise gains by following that drift has not been quantified. Adaptive eavesdropping is posed here as a constrained Markov decision process in which the attacker selects one circuit per round while the noise level follows an Ornstein--Uhlenbeck process and the abort condition is a budget over each block of rounds. The value of adaptation is bounded by the best fixed circuit and a dynamic-programming upper bound. The actions are learnt attacks. Whereas Decker et al. trained a parametrised circuit on a fixed gate template against a fixed channel, here the gate structure and rotation angles are searched jointly. This yields circuits compact enough to form a discrete action set, extending the construction to noise models lacking a known template, including the amplitude damping channel. On device-independent E91 under bilateral depolarising noise, a reinforcement-learning attacker raises her Holevo information from $0.135$ for the best fixed circuit to $0.348$ at zero detection, $98\%$ of the upper bound. On BB84 under a drifting bit-flip channel, she exceeds a conservative noise-indexed rule by $0.024$ in fidelity, reaching $99\%$ of the upper bound. Under stationary noise, the attacker's gain from basis asymmetry changes sign between an averaged and a per-basis error-rate constraint. The search, started from random gate sequences, recovers the analytical cloners and the collective-attack key rate, and meets the lower bound of the Winick--Lütkenhaus--Coles objective from above.
arXiv·2026-10-01·Jacob Werner
No generated summary available for this entry.
overview
Original abstract
Informational steady states (ISSs) arise when the rate at which information is gained from continuous measurements is exactly balanced by the rate at which information from earlier measurements is lost to the environment. While ISSs have been studied in Markovian settings, relatively little is known about how memory effects influence their formation and steady-state properties. In this work, we investigate non-Markovian effects on ISSs within the framework of continuously monitored collision models. We model the environment as a sequence of two-qubit ancillas and find that, for this specific model, the steady-state information gain per measurement is negatively correlated with the degree of non-Markovianity. Numerical results further characterize how the system-ancilla and ancilla-ancilla interaction parameters influence both the degree of non-Markovianity and the steady-state information gain.
arXiv·2026-10-01·Shihan Zhao et al.
No generated summary available for this entry.
overview
Original abstract
The growing scale and accessibility of quantum hardware exposed new reliability and security challenges in the quantum computing workflow, such as the run-time fault injection attacks in cloud-based quantum computing platforms. However, existing works fail to identify vulnerabilities with gate-level precision or adapt to run-time environments. In this work, we formulate gate-level fault analysis as a learning-guided prioritization problem under restricted fidelity budgets. The framework uses a circuit-DAG-based GNN backbone to predict the vulnerability score of each gate to each type of injected fault, defined as the impact of the gate-fault pair on circuit fidelity. The gate-fault pairs are then ranked by their vulnerability score. Experiments on QASMbench and HamLib MaxCut show that QUFIG recovers high-impact vulnerable gate-fault pairs with fewer inspections than random and depth-based heuristics. Our results show that QUFIG can reduce the number of gates requiring inspection by 2.9--19.8% while maintaining effective fault identification, allowing quantum circuit designers to identify vulnerabilities and apply targeted defenses more efficiently.
arXiv·2026-10-01·Hengzhun Chen, Benchi Zhao, Yingzhou Li
No generated summary available for this entry.
overview
Original abstract
The entanglement-assisted Hadamard test (EHT) is a practical method for estimating a quantum phase by amplifying the phase signal. However, the feasible amplification is fundamentally limited by the accuracy of the reference phase, such that the method is inefficient in the high-precision regime. In this work, we propose an algorithm, called adaptive entanglement-assisted Hadamard test (AEHT), that iteratively refines the reference phase, enabling progressively stronger amplification as the iteration goes by. We further consider the imperfect eigenstate preparation scenario, where a systematic bias is unavoidable when estimating the quantum phase with the conventional EHT. Such a bias can be suppressed by the proposed AEHT. Moreover, taking physical implementation into consideration, we adopt device-restart count to measure the cost of quantum phase estimation, rather than shot count. The numerical experiments confirm the effectiveness of the proposed AEHT compared with conventional methods under this measure. By unlocking the full amplification power of large entangled states, this work offers an efficient method to estimate high-precision quantum phase on near-term quantum processors.
arXiv·2026-10-01·Chandrima Kayal, Sayantan Sen, Dániel Szabó
No generated summary available for this entry.
overview
Original abstract
In this work, we study bipartiteness and expansion testing, two canonical problems in graph property testing in the bounded-degree model through the lens of quantum query complexity. In the classical setting, it is known that $\widetildeΘ(\sqrt{N})$ queries are necessary and sufficient for both these testing problems (Goldreich and Ron, 1999, 2000 & 2002), where $N$ denotes the number of vertices of the input graph. Due to their significance, (Ambainis, Childs, and Liu, 2011) initiated the study of these problems in the quantum setting and designed quantum algorithms for bipartiteness and expansion testing that perform $\widetilde{O}(N^{1/3})$ queries, showing a polynomial speedup. They also proved that $\widetildeΩ(N^{1/4})$ queries are necessary for expansion testing, but the possibility of an exponential quantum advantage for bipartiteness testing remained open. Despite significant effort, there has been no improvement in these results in the last decade and a half. In this work, we prove essentially tight $\widetildeΩ(N^{1/3})$ quantum query lower bounds for both bipartiteness and expansion testing, thereby completely characterizing the quantum query complexity of these problems up to polylogarithmic factors. While our proofs use the polynomial method similarly to Ambainis, Childs, and Liu, we use intermediate problems that we relate to the main problems via reductions, and perform a more precise analysis of the resulting polynomials, leading to the near-optimal lower bounds.
arXiv·2026-10-01·Etienne Granet, Henrik Dreyer
No generated summary available for this entry.
overview
Original abstract
Quantum algorithms are usually optimized for gate count or circuit depth. We find on Quantinuum System Model H2 quantum computer that for a tight-binding chain ground state preparation, there is a system size $N$ beyond which the adiabatic evolution reaches significantly lower energies than the Fermionic Fourier Transform (FFT), with the same number of gates, and with the same circuit depth. We attribute this high noise sensitivity of the FFT to its high precision, being able to distinguish momenta by $1/N$. This high resolution in momentum space requires long-range couplings in real space, which propagates errors faster. In contrast, although local and physical circuits such as the adiabatic evolution have a coarser momentum resolution, they also propagate errors more slowly. For physical applications, high momentum resolution is rarely required and is often worth trading for low noise sensitivity. We also introduce a momentum measurement scheme that although less precise than FFT, is less costly and less noisy. We show that it achieves better performance than FFT for spectral function measurement on Quantinuum System Model H2 quantum computer. Our work emphasizes the importance of reducing the noise sensitivity of quantum algorithms, beyond the number of gates or circuit depth.
arXiv·2026-10-01·Cecilia De Fazio, Igor Lesanovsky, Gabriele Perfetto
No generated summary available for this entry.
overview
Original abstract
We study the interplay between local stroboscopic measurements and the unitary quantum circuit dynamics of the deterministic Floquet-quantum East model. We derive exact analytical results for the probability of first detecting a subset of qubits back in their initial state. This is achieved via a renewal equation linking the first-detection probability to the subsystem Loschmidt echo, which encodes the effective open dynamics of the monitored qubits. The resulting statistics exhibit two regimes set by the competition between the measurement probing time and the relaxation timescale of the unitary circuit dynamics: while infrequent monitoring leads to geometric first-detection statistics, frequent monitoring induces correlations that manifest as deviations from this geometric behavior. These results provide a rare exact characterization of how local measurement backaction reshapes detection statistics in an interacting quantum many-body system. In our local protocol, return probabilities are controlled by the size of the monitored subregion and can therefore be accessed on digital quantum simulators via local mid-circuit measurements.
arXiv·2026-10-01·Xinyu Xu et al.
No generated summary available for this entry.
overview
Original abstract
Exploring the world of Bell inequalities requires numerical methods that scale effectively with the number of parties, inputs, and outputs. Such methods can be used to study large-scale Bell inequalities beyond the reach of analytic methods, to design experiments for violating more complicated Bell inequalities, and to enable applications of Bell inequality violation. Such applications include randomness generation and multi-agent coordination with restricted communication. However, current general purpose optimizers such as the see-saw method struggle to handle Bell inequalities with only a dozen inputs and outputs. We introduce an optimizer for the quantum value of a Bell inequality based on batched gradient descent (BGD). More precisely, our BGD optimizer is a differentiable search over feasible quantum strategies in which states and projective measurements are generated from unconstrained variables. The Bell expression is evaluated by a direct tensor contraction without forming the prohibitively large Bell operator. This formulation makes parallel random restarts inexpensive and is thus naturally implemented by a GPU. We evaluate our optimizer against the see-saw method and find a significant speedup for a wide variety of Bell inequality families. Implemented on a GPU, our BGD optimizer can optimize Bell inequalities in our numerical experiments with more than a thousand inputs or outputs within minutes. For these large-scale Bell inequalities, we also efficiently compute the classical value by enumerating possible strategies using a GPU or expressing the optimization as a mixed-integer linear program. Our optimizers can serve as numerical evaluation tools for Bell experiments and multi-agent coordination problems modeled by Bell inequalities with many inputs and outputs, a common feature of real-world scenarios such as high frequency trading and distributed systems.
arXiv·2026-10-01·Markus Teller et al.
No generated summary available for this entry.
overview
Original abstract
Electric-field noise in microfabricated surface ion traps contributes to gate errors in trapped-ion quantum computers, but this noise has been challenging to predict. Here, we present a method to predict the electric-field noise arising from fluctuations in the bulk of dielectric and metallic materials. The method is valid for arbitrary trap geometries, and the only relevant material property is energy loss. We apply it to an ion trap with an electrically floating electrode and find the contribution from dielectrics to be dominant. Our model predicts the observed noise for this trap within a factor of four. In addition, we apply our model to typical surface trap designs and analyze how the electrode structures shield the noise.
arXiv·2026-10-01·Sugata Adhya, Benchao Yang
No generated summary available for this entry.
overview
Original abstract
In this paper, a mentor-initiated bidirectional asymmetric quantum teleportation protocol is proposed. Unlike existing schemes that restrict the two-qubit state transmitted from Bob to Alice to a Bell-like form $α|00\rangle+β|11\rangle$, our protocol allows an arbitrary two-qubit state to be teleported from Bob to Alice within the mentor-initiated framework. The required entangled resources are constructed using standard quantum gates, and the protocol is illustrated through its quantum-circuit implementation in Qiskit.
arXiv·2026-10-01·Federico Alberto Astolfi, Guido Pupillo
No generated summary available for this entry.
overview
Original abstract
We present POLYMECHANON, a graph neural network (GNN) decoder for quantum error correction whose only input is the detection error model (DEM) of a quantum code under a given noise model. We represent the DEM as a tripartite graph of detectors, error mechanisms and logical observables, where every input feature is computed by using the quantum code as data rather than design choice. In this way, the same architecture decodes in principle any stabiliser code, under any noise model that can be expressed as a detection error model, once trained on the DEM. We test this approach along four directions. Firstly, on the rotated surface code the decoder outperforms correlated MWPM under both phenomenological and circuit-level noise, with up to $25\%$ fewer logical failures. Secondly, on a family of high-rate qLDPC codes it matches BP+OSD on the smaller codes and surpasses it on the larger ones, with up to $16\%$ fewer logical failures on $[\![130,4,6]\!]$. Thirdly, its decoding time does not depend on the physical error rate, whereas that of BP+OSD grows with it: on $[\![130,4,6]\!]$ its effective cost per shot is of the order of a few ms on a single GPU against a few tens of milliseconds for BP+OSD on a single CPU core, and its fixed computational graph makes it a candidate for real-time decoding on neutral-atom processors. Finally, a single model trained across codes of different families outperforms uncorrelated MWPM on the graph-like codes seen during training and stays within $10\%$ of BP+OSD on the others, while it tends to fail to generalize to unseen codes, particularly larger ones. Its probabilistic output enables confidence-based post-selection, lowering the logical error rate by more than an order of magnitude on the surface code while keeping more than $90\%$ of the shots. Since only the DEM changes, new codes and noise models can be decoded without redesigning the decoder.
arXiv·2026-10-01·Marius Lemm, Tim Möbus
No generated summary available for this entry.
overview
Original abstract
Closed bosonic lattice systems do not generally admit operator norm Lieb--Robinson bounds uniformly in the initial state. The reason is that the information propagation velocity can grow with the local boson occupancy, which can be macroscopically large. Here, we show that local dissipation restores an operator-norm Lieb--Robinson bound. We consider the dissipative Bose--Hubbard model described by a Lindbladian operator with on-site $\ell$-photon loss, $\ell>2$ and, for our main result, we establish an almost-ballistic Lieb-Robinson bound. Dissipation rapidly depletes highly occupied sites, thus regularizing the state on the Sobolev-type scale of local particle moments. The resulting moment bounds diverge as time approaches zero but remain integrable near zero at sufficiently low orders. We extend these ideas to treat cat-code dissipation and, for initial states in the code space, we prove a local adiabatic approximation uniform in the total volume. Further consequences include local channel approximation, a thermodynamic limit, and efficient digital quantum simulation. The point is that these applications are now available \textit{uniformly in the input state}, as for quantum spin systems, but in contrast to closed Bose--Hubbard systems.
arXiv·2026-10-01·Mikio Fujiwara et al.
No generated summary available for this entry.
overview
Original abstract
Actual quantum key distribution network nodes may be vulnerable to side-channel attacks such as electromagnetic leakage. In this study, we measured electromagnetic emissions from a prototype quantum key distribution device implementing a time-bin decoy-state BB84 protocol with Y and Z bases. We measured the electromagnetic spectra and waveforms at distances of 0 m and 3 m from the transmitter and receiver inside an anechoic chamber. The results showed that the transmitter was the primary source of electromagnetic leakage, and distinct differences were observed between the quantum states generated at the third harmonic of the 1241.6 MHz clock.
arXiv·2026-10-01·Marc Maußner, Volker Reers
No generated summary available for this entry.
overview
Original abstract
This paper investigates the performance scalability and adversarial robustness of Quantum Machine Learning (QML) models deployed on noise-model-based fake simulators. We conduct a dual-phased study, first benchmarking the computational throughput of Qiskit's Aer simulation engine across varying hardware architectures, and second, evaluating the effectiveness of Projected Gradient Descent (PGD) attacks and adversarial retraining strategies under realistic noise conditions. Our results quantify the runtime tradeoffs and scaling behavior for medium-scale simulations (projected up to 8 qubits) and demonstrate that high adversarial-to-benign retraining ratios (50/50) are essential for achieving practical model robustness for 4-qubit classifiers under realistic noise conditions.
arXiv·2026-10-01·Francesco Beccarini, Claudio Conti
No generated summary available for this entry.
overview
Original abstract
In the quantum inverse scattering method, the sine-Gordon model is solved on a lattice, and its continuum and infinite-volume limits become uniform only after the length of the box is rescaled. We show that this rescaling, supplemented by an on-shell condition, defines a renormalization scheme. The whole dependence on the cut-off is absorbed into a factor $Z_L$ multiplying the length of the box, with an exponent fixed by the scaling dimension of the vertex operator; neither the field nor the coupling $β$ is renormalized, no subtraction scale is introduced, and the mass parameter receives a finite renormalization, fixed by requiring that the lightest breather has the mass of the boson in the linearized theory. The soliton and breather masses follow from the eigenvalues of the monodromy operator as functions of parameters that do not run, and reduce to the classical and semiclassical results as $β\rightarrow0$. In particular, the mass ratios are produced directly from the regularized construction, while the relation between the lattice parameters and the physical scale is absorbed into $Z_L$ and never needs to be computed. The scheme is a reparameterization of the theory which makes explicit the interplay between integrability and renormalization. We compare it with Coleman's normal ordering and with conformal perturbation theory, and we argue that it extends to ultralocal integrable theories with a massive spectrum, possibly including asymptotically free models that admit an ultralocal lattice regularization.
arXiv·2026-10-01·Zhenhuan Liu et al.
No generated summary available for this entry.
overview
Original abstract
Time-reversal symmetry is a fundamental principle of physics describing the invariance of physical laws under reversal of the direction of time. We formulate a Bell-inequality-like test of this antiunitary symmetry using only forward access and trusted quantum operations: entanglement converts temporal input--output relations into measurable spatial exchange symmetry. For $n$-qubit unitary dynamics, we prove that reliably distinguishing the time-reversal-symmetric circular ensembles from Haar-random dynamics requires $Ω(\min\{2^{n/2},2^{n-e}\})$ queries for any classically adaptive protocol. Here, $e=\min\{e_{\mathrm s},e_{\mathrm m}\}$ with $e_{\mathrm s}$ and $e_{\mathrm m}$ representing the probe and measurement logarithmic entanglement negativities, respectively. Maximally entangled probes and SWAP measurements reduce this cost to a constant number of queries. Furthermore, we develop a time-reversal symmetry test for arbitrary fixed, compatible probes and measurements, relate its query complexity to their logarithmic negativities, and match the lower-bound scaling in the high-entanglement regime by optimizing the probe and measurement. Our results establish a quantitative connection between entanglement and time-reversal symmetry, bridging two central concepts in quantum information science and fundamental physics.
arXiv·2026-10-01·Lukas Haßfurth et al.
No generated summary available for this entry.
overview
Original abstract
Nuclear quantum effects are critical for describing proton transfer and hydrogen bonding, but their incorporation into quantum chemistry calculations is often computationally prohibitive on classical hardware. A promising alternative are quantum computers due to their linear scaling in the space requirements with system size. We introduce a novel hybrid quantum-classical algorithm for ab-initio molecular dynamics that incorporates nuclear quantum effects via the nuclear-electronic orbital method. The proposed algorithm evaluates ground state energies and forces on the quantum computer using a variational quantum eigensolver, while the molecular geometries are updated classically. We validate our approach through simulations of $\text{H}_2$, $\text{H}_2\text{O}$ and the Zundel ion $\text{H}_5\text{O}_2^+$, comparing the simulated vibrational spectra with experimental data. Upon inclusion of nuclear quantum effects, the proton shuttling movement in the Zundel ion becomes effectively barrierless, and errors in the simulated frequencies improve significantly. Employing compact hardware-efficient ansatz circuits we achieve results comparable to the more accurate UCCSD ansatzes, which hints towards the feasibility of executing our algorithm on near-term quantum devices.
arXiv·2026-10-01·Bingrun Wang, Qi Ye, Chi-Fang Chen
No generated summary available for this entry.
overview
Original abstract
Learning quantum interactions from finite-temperature many-body systems is a central task in emerging quantum platforms. Recently, the problem of learning from lattice quantum Gibbs states has found rigorous, efficient protocols. Nevertheless, exact Gibbs states, as the input premise, are in fact computationally intractable to prepare and may not faithfully represent generic finite-temperature quantum systems. In contrast, a system coupled to a heat bath can be stuck at an approximate stationary state (metastable state) long before it truly equilibrates. Here, we formulate a physically and algorithmically consistent alternative: learning from such metastable states of detailed-balanced master equations (Lindbladians) arising from system-bath interactions. We distill the algorithmic mechanism and structural condition underlying Gibbs-state learning and extend it in full to metastable states, attaining nearly optimal sample and computational complexity (in the system size and the precision). More broadly, we sharpen notions of metastability and develop a unified framework for finite-temperature learning.
arXiv·2026-10-01·Behnam Talari, Rouhollah Karimzadeh
No generated summary available for this entry.
overview
Original abstract
Orbital angular momentum (OAM) multiplexing provides an infinite-dimensional discrete Hilbert space ideally suited for high-capacity free-space quantum key distribution (QKD). Nevertheless, pure scalar spatial modes carrying topological charge ($|\ell| \ge 1$) undergo severe decoherence when transmitted through terrestrial atmospheric turbulence. Turbulent refractive-index eddies split high-order vortex singularities, induce catastrophic intermodal crosstalk across adjacent topological channels, and rapidly drive the quantum bit error rate (QBER) well above the unconditional 11% security threshold associated with individual cloning attacks. Here, we demonstrate that hybrid polarization-OAM entangled states, known as vector vortex beams (VVBs), provide intrinsic, hardware-free immunity against turbulent perturbations. Because the optical anisotropy of terrestrial air is exceedingly small ($Δn < 10^{-9}$), refractive-index fluctuations couple symmetrically to orthogonal circular polarization modes as an identical common-mode scalar phase screen that cancels in the relative polarization-phase degree of freedom. By numerically propagating modal fields through modified power-spectral phase screens over turbulence strengths ranging from $D/r_0 = 0$ to $3.0$, we show that the VVB encoding protocol suppresses the asymptotic QBER from 42.0% to 4.8%, yielding an error-suppression factor of approximately 11.6 without requiring active adaptive optics or deformable mirrors.
arXiv·2026-10-01·He Wang
No generated summary available for this entry.
overview
Original abstract
Traditional discrete randomized compiling (RC) tailors errors with random control frames at logical-gate boundaries, but fails to capture intra-instrument control evolution or persistent system-environment coupling. In memory-bearing environments, errors correlate across times, not just single gates. We build continuous-process randomized compilation (CPRC) in the continuous process tensor (cPT) framework, unifying random unitary control trajectories, pointwise-covariant finite-duration instruments, and environmental dynamics on one time axis. We study four protocols: fixed Pauli refresh, bounded Cayley paths, unitary Brownian motion, Ornstein-Uhlenbeck driving. We obtain three key results: (1) Pointwise covariance ensures each trajectory exactly reproduces the target logic without system-environment coupling; a closed-frame counterexample proves endpoint-only compensation causes first-order instrument errors. (2) Independent Pauli conjugations over full intervals diagonalize error histories at boundaries, but classical labels retain environment-induced correlations, confirmed by an exact static-bath solution. (3) We derive a total-variation error bound for full adaptive output records under bounded centered coupling and mixing conditions. We prove convergence of trajectory-averaged cPT coefficients in fixed particle sectors for finite non-Gaussian environments and Gaussian baths with time-integrable covariance, including the uncut Drude spectrum. We numerically validate the theory in a qubit model via output probabilities, operator conditional mutual information, and all two-particle coefficients for both qubit and thermal Drude baths. This work extends RC from discrete circuits to continuous-time memory-bearing quantum processes, offering a unified framework, quantitative tools, implementable schemes, and benchmarks for non-Markovian error tailoring.
arXiv·2026-10-01·Aaron Amire
No generated summary available for this entry.
overview
Original abstract
Most proposals for $Z_3$ parafermions in fractional quantum Hall-superconductor structures used the spin-unpolarized $ν= 2/3$ Halperin $(1,1,2)$ state. The fractional quantum anomalous Hall (FQAH) states of twisted MoTe$_2$ and rhombohedral graphene are believed to be spin- and valley-polarized Jain states, with the same topological order but a different spin structure. We analyze a trench between two polarized $ν= 2/3$ edges. Among the pairing and tunneling bilinears of the edge-mode electrons, exactly two of each have zero conformal spin. Pairing is compatible only with the neutral-mode superconductivity channel and tunneling only with neutral-mode backscattering, whereas in the unpolarized state singlet pairing and tunneling select the same channel. Since the two channels condense the same neutral anyon up to a local operator, the domain walls carry $Z_3$ parafermions, with 3 protected states per pair, whether or not the neutral channel changes between regions; fixing the fermion parity does not enlarge this count. Before the neutral gap forms, pairing is at best marginal for repulsive inter-edge coupling unless an attractive neutral coupling favors its channel; once the gap has formed, both charge terms are relevant for an inter-edge Coulomb coupling below 7/25 of the intra-edge one. The superconductor must supply even-frequency, equal-spin, intravalley pairing, which an s-wave singlet superconductor with only Ising spin-orbit coupling does not provide at leading order, whereas chiral $p+ip$ and $f+if$ states do. The $Z_3$ label is carried by a quasiparticle of the FQAH state, so no process confined to a junction whose tunneling segments are not FQAH can change it, and we expect a $6π$-periodic Josephson current with or without fixed fermion parity.
arXiv·2026-10-01·Vu-Quoc-Minh Nguyen et al.
No generated summary available for this entry.
overview
Original abstract
The Pauli twirl of amplitude damping (AD) is generalized amplitude damping at infinite temperature: it keeps the contraction of AD and removes its non-unital term, so comparing the two in variational circuits isolates the zero-temperature bias, which acts mainly through the scale of the features. For random parameters, features under AD settle on a floor, which at strong damping is set by the last layer, has a closed form, and at fixed $T_1$ falls with temperature as $\tanh(\hbarω/2k_BT)$; under the twirls they shrink by a constant factor per layer, up to eight qubits. A trainable output scale removes most of the resulting accuracy differences, leaving AD ahead of its twirls by at most about three percentage points in our simulations; what it removes reappears as a cost in measurement shots: trained and tested with $10^3$ shots per image, a four-qubit classifier under AD at $p=0.3$ stays within 1.5 points of noiseless accuracy, while the twirled classifiers lose up to 33. At weaker damping the separation depth grows roughly as $(np)^{-1}\ln(1/p)$. The damping direction is a gauge when the damping follows complete entangling layers and the circuit boundaries are trainable; in an eigensolver it becomes physical inside a decomposed two-qubit gate.
arXiv·2026-10-01·Yanglin Hu et al.
No generated summary available for this entry.
overview
Original abstract
Indefinite causal order is known to offer enhancements in quantum metrology, notably including an unbounded advantage in the measurement of a geometric phase of a harmonic oscillator. This advantage, however, is specific to the infinite dimensional setting, and its finite dimensional analogue remains elusive, with recent findings suggesting that advantages in finite dimensions may be fundamentally limited to bounded constant factors. Here we show that, in fact, arbitrarily large advantages arise for finite dimensional systems in the finite sample regime. Specifically, we establish an unbounded separation between definite and indefinite causal order in the estimation of a geometric phase associated to two sets of $N$ displacements generated by discrete position and momentum operators on a $d$-dimensional quantum system: for any given constant $R$, there exist values of $N$ and $d=Ω(N^2)$ such that a strategy with indefinite order uses an initial probe with $R$ times less energy than the probe required by every strategy with definite order achieving the same mean squared error, whenever the number of measurement shots $ν$ is bounded as $ν=\mathcal{O}(\exp(πd/16)/\mathrm{poly}(d))$. In other words, indefinite order offers an energy saving that grows arbitrarily large with the parameters of the problem. To prove this result, we establish an approximate Weyl relation for discrete Gaussian wavepackets, which is of independent technical interest.
arXiv·2026-10-01·Melvin Strobl et al.
No generated summary available for this entry.
overview
Original abstract
Barren plateaus hinder training of parameterized quantum circuits by making loss gradients exponentially small in the number of qubits. For angle-encoded product states, we show how the input distribution affects output variation through algebraic input purity, i.e. the input's overlap with the circuit's dynamical Lie algebra. With the specified readouts and Haar or exact group 2-design sampling, matchgate circuits on $n$ qubits retain output variance of order $1/n$ for every pure product input. The off-diagonal family instead has zero output on computational-basis inputs at any depth and for every parameter choice. Independent uniform angles yield mean variance of the same order as matchgates. A count of diagonal Pauli strings identifies these zero-output endpoints. For any fixed dataset of nonzero inputs with at least $2n$ coordinates, we construct a classical preprocessing certificate. A shared random rotation is accepted only when the dataset's mean purity passes a computable threshold. This certifies mean output variance of order $1/n$ for the off-diagonal family before circuit execution, with a constant expected number of trials. Binary and ternary weighted encodings also recover the independent-angle mean purity from one uniform scalar input. Numerical experiments examine training behavior and extensions to larger algebras. The guarantee concerns output variance averaged over inputs, while successful learning also depends on the task and information preserved by the encoding.
arXiv·2026-10-01·Zhili Chen, Rahul Jain, YaoNan Zhang
No generated summary available for this entry.
overview
Original abstract
Assuming post-quantum one-way functions, we construct device-independent (DI) oblivious transfer (OT) and bit commitment: honest parties use only trusted classical computation to operate untrusted quantum devices, which may share arbitrary entanglement and behave non-IID. Security is simulation-based against quantum polynomial-time adversaries and composes sequentially with efficient simulators. One protocol skeleton serves both, in two regimes. With isolated laboratories and coordinate-local measurements in the honest receiver's device, it tolerates a constant rate of honest-device faults. With polylogarithmically many qubits of adaptive leakage between the laboratories and arbitrary joint measurements, it tolerates an inverse-polylogarithmic rate. Each elementary DI call uses a fresh, isolated batch of polylogarithmically many device coordinates, and total device use in the compiled OT protocol is polynomial. The commitment has efficient simulators against both parties and yields DI coin tossing with abort. Because OT is complete for secure computation, the construction yields a DI protocol, with abort, for every efficiently computable classical functionality on a fixed number of parties, secure against static corruption of any proper subset of them. The commitment's extractor changes a public parity relation through classical equivocation and leaves the device execution, hence its leakage, unchanged. A commit-and-prove functionality, disjoint audits, and an affine consistency check link the certified correlations to ideal OT. Sender security rests on a selector-aware parallel-repetition bound for the Magic Square game, which we derive from the two-round threshold theorem of Kundu and Tan.
arXiv·2026-10-01·Wangjun Lu et al.
No generated summary available for this entry.
overview
Original abstract
We find the optimal initial states of a linearized cavity-optomechanical system for estimating the single-photon coupling by quantum Fisher information. In the red-detuned (beam-splitter) regime the interaction exchanges excitations between the two modes, and for pure inputs the Fisher information is four times the variance of the excitation-exchange operator, reducing the optimization to variance maximization with a closed-form solution. With the mechanical mode in a Fock state the probe is degenerate: any state saturating the photon-number constraint is optimal, and a Fock reference with many phonons enhances the per-photon sensitivity linearly. For an arbitrary fixed mechanical reference it becomes a phase-matched squeezed vacuum, from an exact bound on that coherence obtained by a Lagrange-dual argument. Jointly optimizing both modes at fixed total excitation number, the quantum Fisher information obeys a Heisenberg bound quadratic in the energy, saturated by equal superpositions of the two extremal eigenstates of the generator, equivalently a two-mode NOON state after a balanced beam splitter; balanced product Fock states reach only a linear enhancement. Exact diagonalization in truncated Fock spaces confirms all the results, the familiar single-photon input being the simplest saturating case. Three extensions are worked out: the blue sideband has an unbounded two-mode-squeezing spectrum, so the entangled optimum becomes impossible and the balanced product Fock state is exactly optimal at definite energy; under cavity loss the information accumulation turns linear on the cavity-lifetime timescale, at a renewal-optimal duration of about two and a half lifetimes; and for a state-of-the-art quantum-coherent coupling experiment the per-hour relative precision lies between one part in a million and ten parts in a million, number and thermal references being the most robust.
arXiv·2026-10-01·Domenico Giuliano et al.
No generated summary available for this entry.
overview
Original abstract
Co-propagating chiral Majorana edge modes are predicted to exist in proximity-coupled quantum anomalous Hall systems. They combine the exciting prospects of edge vortices as flying non-Abelian Ising anyons, with their fully electrical detection through anyon fusion processes. In this setup, electrical transport arises from the interference of a pair of Majorana edge states. By bosonizing the model with an additional replica sector, we generalize previous treatments to fully asymmetric configurations. We analyze a Mach-Zehnder interferometer and show that while the DC conductance does not exhibit signatures of edge-vortex interference, at low frequencies, this interference manifests as an effective capacitance. This quantity is sensitive to the non-Abelian anyon statistics of edge vortices and, in particular, carries signatures of their topological spin and nontrivial conformal dimension. We demonstrate that the thermal length $l_T = \hbar v/(πk_B T)$ is the relevant scale at low temperatures $T$, analogous to quasiparticle transport in conventional quantum Hall edge states with velocity $v$. As long as the interferometer arm lengths match within this length scale, transport signatures of the non-Abelian statistics of edge vortices remain visible.
arXiv·2026-10-01·Álvaro Álvarez-Domínguez et al.
No generated summary available for this entry.
overview
Original abstract
We analyze the correlations of the vacuum state of a charged scalar field by constructing localized observables in two disjoint regions. We consider a time-dependent homogeneous electric field and examine the time evolution of correlations by relating it with the particle-antiparticle creation through the Schwinger effect. Our results show that the electric field increases the mixedness of the states and enhances total correlations, while the distillable entanglement among the regions decreases, vanishing at a finite time for sufficiently intense pulses within the non-perturbative pair-production regime. We also discuss the effect of anisotropy induced by the external background, showing that the distribution of correlations acquires a nontrivial directional dependence.
arXiv·2026-10-01·Longyan Gong, Jing Zhang, Yongtao Li
No generated summary available for this entry.
overview
Original abstract
Charging uniformity across distinct trials is an essential requirement for reliable quantum batteries. Nevertheless, intrinsic quantum stochasticity poses a fundamental challenge to this goal. This work investigates a two-qubit quantum battery within the framework of cascaded collision models. We propose an adaptive measurement on the charger after each collision, yielding two conditional battery states of equal expected stored energy. For chargers prepared in the excited state, we analytically prove that complete suppression of trajectory-dependent stored-energy fluctuations is attainable; for chargers prepared in general superposition states, our theory reveals that full suppression is fundamentally prohibited owing to battery-phase-dependent recursive dynamics. Numerical simulations are in excellent quantitative agreement with theoretical predictions. These findings provide a feasible pathway toward high-uniformity quantum-battery charging.
arXiv·2026-10-01·Chao-Hsien Wu, Franco Nori, Huan-Yu Ku
No generated summary available for this entry.
overview
Original abstract
Measurement incompatibility is a fundamental quantum resource that enables advantages in many quantum information tasks, including cryptography and communication. However, unavoidable interactions between a system and its environment can degrade or even completely destroy measurement incompatibility; such a process is referred to as a measurement-incompatibility-annihilating channel. Recently, the capability of noisy quantum dynamics to preserve measurement incompatibility has been characterized within the resource theory of measurement incompatibility preservability. This motivates studying how to purify the preservation of measurement incompatibility and how to activate it from a measurement-incompatibility-annihilating channel. To this end, we first introduce our figures of merit as robustness-based resource monotones within this resource theory. We demonstrate that while pre-filtering operations can strengthen measurement incompatibility preservability, they cannot activate it from an incompatibility-annihilating channel, establishing a no-go theorem. Furthermore, we explicitly demonstrate that an incompatibility-annihilating channel can be stochastically activated via post-filtering operations. Our results provide a practical framework for exploiting measurement incompatibility in quantum information processing.
arXiv·2026-10-01·Rachel Yun Zhang
No generated summary available for this entry.
overview
Original abstract
We construct quantum CSS codes with rate-distance tradeoff approaching the CSS GV bound, which can be encoded by a quantum circuit of logarithmic depth and a linear number of gates. Our construction is heavily inspired by a work of Brehm and Resch and can be viewed as a quantum analogue of classical repeat multiple accumulate codes. The encoder has a particularly simple structure, consisting of a single constant depth outer quantum circuit followed by several classical accumulation and inverse-accumulation layers.
arXiv·2026-10-01·Bisma Majid, Shabir Ahmed Sofi, Mir Mohammad Yousuf
No generated summary available for this entry.
overview
Original abstract
Quantum Reinforcement Learning (QRL) integrates reinforcement learning with parameterized quantum circuits and is a promising approach to combinatorial optimization. On Noisy Intermediate-Scale Quantum (NISQ) devices, however, decoherence, gate imperfections, and measurement errors reduce policy quality and make learning less reliable. Existing error mitigation techniques are generally applied as fixed corrections that do not adapt to changing noise conditions or to the evolving state of training. This work presents Adaptive Policy-Guided Error Mitigation (APGEM) as a context-aware orchestration layer of the hybrid quantum-classical training loop that dynamically selects the most suitable mitigation strategy during QRL training. APGEM evaluates Zero-Noise Extrapolation (ZNE), Probabilistic Error Cancellation (PEC), Clifford Data Regression (CDR), and Readout Error Mitigation (REM) using policy-level indicators, including quantum-state fidelity, policy entropy, cumulative reward, and approximation ratio, and integrates the selected strategy directly into the reinforcement learning loop. The framework is evaluated on the Capacitated Vehicle Routing Problem (CVRP), a representative NP-hard problem in urban logistics, under a range of NISQ noise models and noise levels. APGEM consistently outperforms conventional static mitigation methods, reaches approximately 94% of the utility of an oracle strategy, maintains higher quantum-state fidelity as noise increases, and produces more stable learning behaviour throughout training. Ablation studies show that the framework learns context-aware mitigation policies that adapt to different noise environments and circuit execution conditions. These findings demonstrate that integrating adaptive error mitigation into the learning process substantially improves the robustness and reliability of QRL on NISQ hardware.
arXiv·2026-10-01·Yu-Yuan Chen, Ling-An Wu, Yu-xi Liu
No generated summary available for this entry.
overview
Original abstract
Establishing effective spatial correlations between distinct quantum fields is essential for multi-physics quantum sensing.~We here propose a correlation imaging approach based on the hybrid entanglement between microwave photons and microwave surface acoustic wave phonons generated via a superconducting quantum circuit.~At matched microwave frequencies, the five order-of-magnitude wavelength disparity between photons and phonons leads to a unique quantum entanglement resource, which allows the optimal field for probing an object to be distinct from that used for readout.~This resource enables two imaging modalities with giant spatial scaling: a $10^{-8}-10^{-6}$-fold demagnification of macroscopic object profiles onto microscopic phononic chips, and conversely, a $10^{4}-10^{6}$-fold magnification of microscopic object profiles into macroscopic photonic readout devices. By interfacing free-space long-wavelength microwaves with on-chip short-wavelength surface acoustic waves, our correlation imaging approach provides a general framework for cross-scale quantum sensing.
arXiv·2026-10-01·Shihao Xia, Ahsan Nazir, Harry J. D. Miller
No generated summary available for this entry.
overview
Original abstract
We explore the fundamental limits on finite-time driving in quantum critical systems described by boundary conformal field theory. We show that stochastic work fluctuations arising from external driving are a resource for speedy control, and derive an exact, saturable fluctuation-based speed limit in weakly driven boundary conformal field theories at finite temperature. The bound and saturating protocol can be expressed entirely in terms of the universal scaling dimension, and the result interpolates between the Kibble--Zurek regime,where temporal correlations are strongly nonlocal, and an adiabatic regime where linear driving becomes optimal. For small scaling dimension, the enhanced temporal correlations produce pronounced departures from linear protocols and a larger optimization advantage. These results establish a universal work precision--time tradeoff for boundary-critical control, applicable to quantum impurity, fractional quantum Hall, and superconducting-circuit platforms.
arXiv·2026-10-01·Tianle Zheng et al.
No generated summary available for this entry.
overview
Original abstract
We present a direct experimental verification of quantum coherence for a set of quantum states in a basis-independent manner. We find that the theory of quantum coherence for a set of quantum states matches our experimental results perfectly and can be applied to protocols like BB84 and quantum secure direct communication. Using a Sagnac interferometer, we experimentally quantify the quantum coherence for two sets of experimental states. Moreover, we introduce a novel application of set coherence, illustrating that the states employed in the BB84 protocol exhibit maximal set coherence. Our results pave the way for wider applications of quantum coherence for a set of quantum states, including quantum key distribution protocols and probabilistic quantum cloning.
arXiv·2026-10-01·Songyang Pu, Liangtao Peng, Shaffique Adam
No generated summary available for this entry.
overview
Original abstract
The composite-fermion framework maps the strongly correlated fractional quantum Hall state onto a weakly interacting integer quantum Hall state in a reduced effective magnetic field. We ask how this framework is modified for fractional Chern insulators, where the role of a uniform magnetic field is replaced by the nonuniform Berry curvature of a Chern band. Specifically, we construct composite-fermion wave functions for Jain states and their quasiparticles and quasiholes in Aharonov-Casher bands, a widely used model for ideal Chern bands. We find that these states overlap closely with exact eigenstates over a broad range of field modulation. Using these wave functions, we demonstrate that the emergent composite-fermion band structure goes beyond the conventional picture of effective Landau levels, correctly capturing the quasiparticle dispersion. Remarkably, we find that an isolated quasiparticle band carries a total Berry flux that is different from a Landau level. These results establish a composite-fermion description for mobile fractional Chern insulator anyons and provide a framework to understand their stability.
arXiv·2026-10-01·Ning Sun, Pengfei Zhang
No generated summary available for this entry.
overview
Original abstract
Measuring part of a many-body wave function generates a projected ensemble of pure quantum states on the unmeasured subsystem. Recent advances in deep thermalization have shown that, in chaotic systems, this ensemble universally converges to the maximally random ensemble compatible with its average density matrix, known as the Scrooge ensemble. By contrast, free-fermion systems are nonchaotic, and their quantum states are constrained to remain Gaussian. Motivated by this distinction, we introduce the fermionic Gaussian Scrooge ensemble to describe deep thermalization in generic free-fermion systems. This ensemble is defined as a distortion of the Gaussian Haar ensemble by the average density matrix, and its moments reveal an enlarged symmetry of Gaussian states in the replicated Hilbert space. We demonstrate the emergence of the fermionic Gaussian Scrooge ensemble in two complementary settings: (1) we analytically prove that the projected ensemble of the SYK$_2$ model follows the fermionic Gaussian Scrooge ensemble at arbitrary evolution times; (2) we provide numerical evidence that it emerges at sufficiently long times in random Gaussian circuits with charge conservation. Our results establish the fermionic Gaussian Scrooge ensemble as a universal description of deep thermalization in free-fermion systems.
arXiv·2026-10-01·Ran-Bo Yang et al.
No generated summary available for this entry.
overview
Original abstract
The coherent dynamics of lattice waves is of significant importance for exploring the nonadiabatic phenomena of the electron-phonon coupling under nonequilibrium conditions. Here, we propose a theoretical model for phonon interference induced by a defect pair, in which lattice waves with the selective modes are launched independently by each of defects due to the strongly local electron-phonon coupling. We find that the intensities of phonon interference fringes could be directly evaluated by a measurable quantity in experiments--Huang-Rhys factor, and the geometry of interference patterns could be modified by the internal parameters of defect pair, including the charge states, spatial distance, energy-level depth and localization strength. In particular, several novel quantum states, such as the Dirac-like and nodal-line topological states are emerged for the appropriate internal parameters. Furthermore, using Huang-Rhys model, we simulate the ultrafast optical spectroscopy in the phonon interference duration when defect pairs are excited as the color centers, where interference fringes are perfectly matched by intensities of spectrum, similar to the $\textit{lock-key}$ pattern. These results show that defect pair, serving as the driven force for the coherent dynamical processes for multidegrees of freedom, offers an ideal platform to explore fundamental quantum phenomena in nonequilibrium and ultrafast physics.
arXiv·2026-10-01·Ziyi Wang et al.
No generated summary available for this entry.
overview
Original abstract
Graphene nanoribbons (GNRs) are a highly tunable class of one-dimensional (1D) quantum materials that can be fabricated through bottom-up synthesis. Precise control over GNR band gaps and band-edge alignments has established them as a promising nanoelectronics platform, but forming high-quality electronic interfaces remains challenging. Here we combine sequential on-surface synthesis and scanning tunneling microscopy (STM)-induced dehydrogenation to directly write metallic 7-iGNR segments into otherwise semiconducting H$_2$-7-iGNRs without changing the GNR width or carbon backbone connectivity. The resulting metallic segments exhibit nonzero spectral weight at the Fermi level ($E_\mathrm{F}$) and spatially extended electronic states, consistent with two dispersive bands crossing $E_\mathrm{F}$. The new metallic states are well described by an extended Su--Schrieffer--Heeger zigzag-ladder Hamiltonian. Scanning tunnelling spectroscopy (STS) and first-principles calculations show that the valence band edge of adjacent, connected semiconducting GNR segments lies close to $E_\mathrm{F}$ for the metallic segments. STS spectra recover bulk GNR properties within $\sim$1 nm on either side of the metal-semiconductor GNR interface, with no discernible depletion region. The observed GNR band edge alignment is consistent with a small energy barrier for hole injection, thus suggesting a possible route towards atomically precise, low-barrier p-type contacts for future GNR-based electronic devices.
arXiv·2026-10-01·Leeseok Kim
No generated summary available for this entry.
overview
Original abstract
We prove that a quasi-local quantum Gibbs sampler rapidly mixes to the Gibbs state of any 1D finite-range Hamiltonian at all finite temperatures in $\mathcal{O}\left(\log (n/\varepsilon)\right)$ time. Each update traces out a contiguous block of constant length and reconstructs it using the Petz recovery map, following early proposals for quantum heat-bath Gibbs samplers by Kastoryano and Brandão~\cite{kastoryano2016quantum}. Our proof directly bounds the distance between the updated state and the target Gibbs state using quantum Wasserstein distance of order $1$. We further provide $\mathcal{O}(\text{polylog}(n/\varepsilon))$ depth of quantum circuits to prepare these Gibbs states. We hope these techniques will facilitate the analysis and design of other Gibbs samplers.
arXiv·2026-10-01·Michael S. Bar et al.
No generated summary available for this entry.
overview
Original abstract
The negatively charged nitrogen-vacancy ($\mathrm{NV}^-$) defect in diamond can be used for quantum information processing via the readout of the radiative decay of the excited state into the ground state. The large refractive index mismatch of diamond and air causes low photon extraction efficiency due to total internal reflection losses. Here, we investigate the photon extraction numerically and report additive solid immersion lenses (SILs) consisting of the high-k dielectric yttria-stabilized-zirconia (YSZ) for surface modification and enhanced light extraction of shallow implanted nitrogen-vacancy centers. We demonstrate an average increase of 63% in saturation intensity using a scalable bottum up room temperature pulsed laser deposition and photolithography structurization process. The average necessary laser intensity for saturation is reduced by 33% by the SILs.
arXiv·2026-10-01·Yu-Hong Yan, Shi-Qiao Wu, Kun-Liang Zhang
No generated summary available for this entry.
overview
Original abstract
We investigate a transverse-field Ising chain with dimerized anisotropic Gamma interactions and demonstrate that, both in the absence and presence of Ising interactions, the competition between Gamma anisotropy and the transverse field gives rise to vector chiral order and dynamical quantum phase transitions. The phase diagram comprises positive and negative vector chiral phases and a paramagnetic phase, characterized by the vector spin chirality and the vector chiral order parameter. In the absence of Ising interactions, we identify a gapless critical line that exhibits no finite-size drift, along which the spin-spin correlations and subsystem entanglement entropy display behavior distinct from that of Ising criticality. Furthermore, we find that the critical times of dynamical quantum phase transitions form periodic or aperiodic sequences, depending on the quench path. Our findings highlight how dimerized off-diagonal exchange enriches both equilibrium ordering and dynamical critical behavior in a quantum Ising chain.
arXiv·2026-10-01·Shakib Daryanoosh
No generated summary available for this entry.
overview
Original abstract
Quantum correlations are fragile under noise, motivating quantitative measures that track not only their presence but also their degradation during physical evolution. We develop a robustness framework for the hierarchy of Bell nonlocality, EPR steering, and entanglement, establishing an ordering of the corresponding robustness measures and relating robustness to noise-induced transition times. We further formulate the instantaneous robustness decay along Lindblad dynamics as a directional derivative determined by both the evolution and the robustness functional. Applications to isotropic depolarizing noise and amplitude damping illustrate, respectively, the resulting resource transition times and the directional dependence of steering robustness. The framework provides an approach to characterizing the degradation and lifetime of bipartite quantum correlations under noisy dynamics.
arXiv·2026-10-01·Sota Hashimoto, Akinori Kawachi
No generated summary available for this entry.
overview
Original abstract
Morohoshi, Nakayama, Manabe, and Mitarai proposed a physically motivated quantum machine learning problem in which the goal is to predict quantities of the form $\operatorname{Tr}[f(H)ρ]$ from classical descriptions of a Hamiltonian $H$ and a quantum state $ρ$, where $f$ is an unknown function. We call this problem Hamiltonian function learning in this paper. They constructed an efficient quantum learning algorithm under suitable conditions, while leaving a rigorous proof of average-case classical hardness open. In this paper, we rigorously prove the average-case classical hardness for two distribution-specific Hamiltonian function learning problems for $f_{\cos,π}(λ)=\cos(πλ)$ and $f_{\exp,β}(λ)=e^{-βλ}$ discussed in the paper of Morohoshi et al. under the assumption of the average-case hardness of factoring random RSA moduli. More specifically, we show that an efficient classical randomized learner under squared loss whose output hypotheses are evaluable in classical polynomial time for either problem would yield a classical randomized polynomial-time algorithm for factoring random RSA moduli.
arXiv·2026-10-01·Guang Hao Low
No generated summary available for this entry.
overview
Original abstract
We develop Multivariate Quantum Signal Processing for designing matrix-valued transformations of multiple noncommuting nonnormal block-encoded matrices. Our framework equips quantum transducers with the analytic structure of multiport Infinite-Impulse-Response (IIR) filters and establishes a transfer-function methodology for designing quantum query algorithms. Efficiently computable analytic bounds that hold uniformly across the oracle promise yield efficient quantum circuits with logarithmic error dependence and near-unity success probability, paralleling the approximation-theoretic guarantees of univariate QSP/QSVT. We provide a complete characterization of achievable transfer functions and a principled library of analytic IIR components. Our modular designs greatly improve or resolve the per-oracle query complexity of open multi-oracle problems: (1) Hamiltonian simulation under $H=\sum_j H_j$ with weighted quasinorm cost $\approx t\langle\vecλ,\vec C\rangle_{1/2}+\mathcal{O}(\|\vec C\|_1\log(1/ε))$ for block-encoding normalizations $\vecλ$ and costs $\vec C$; (2) sparse simulation with optimal time--norm $Θ(\sqrt{d}\|H\|_{\rm 1\to2}t)$ and additive error dependence; (3) solving linear systems and (4) differential equations under minimal matrix assumptions with optimal weighted state-preparation and multi-term cost; (5) ground-state preparation and energy estimation; (6) generalized eigenvalue problems. We apply these to exactly simulate downfolded Hamiltonians with leading cost $t\langle\vecλ_{\rm eff},\vec C_{\rm eff}\rangle_{1/2}$ further reduced by fractional dynamic correlation energy contributions from coarse-grained Hamiltonians, and show similar classical-data-input-reduction results for multiscale graph classification via Kron reduction. We also show the online generalization with anisotropic Kalman filtering of streaming quantum data.
arXiv·2026-10-01·Kohei Yoshimura, Ryusuke Hamazaki
No generated summary available for this entry.
overview
Original abstract
We discover a universal trade-off between the dissipation required to maintain a quantum state more sensitive than a thermal one and the sensitivity gain for a driven single-mode bosonic system under a thermal environment. Specifically, for Gaussian states, we rigorously derive a lower bound on the entropy production rate in the steady state in terms of the quantum Fisher information gain relative to a thermal reference state. Numerical investigations of Kerr nonlinearities further support that these bounds can hold beyond the Gaussian regime. Our results establish a new connection between steady-state thermodynamics and quantum metrological performance.
arXiv·2026-10-01·M. R. Tanvir et al.
No generated summary available for this entry.
overview
Original abstract
Spin qubits are an attractive platform for scalable quantum information processing, and recently, laterally gated quantum dots (QDs) in Ge heterostructures have emerged as a leading implementation of spin qubits. To date, RF single-hole transistors (SHT) and integrated superconducting resonators have been used for spin and charge readout, but their size can pose challenges. Here we demonstrate compact RF gate-dispersive charge readout of a Ge double QD (DQD), and a single hole box (SHB)-DQD system. We resolve QD loading and interdot transitions with both techniques. We find that the SHB enhances the interdot signal-to-noise ratio (SNR) of our 540 MHz circuit by a factor of 20 for a DQD coupling $t_c \approx 5$ GHz, providing a unity-SNR at 135 microseconds, c.f. for 2.7 miliseconds for the direct detection. Power- and temperature-dependent measurements verify that SNR is limited by dielectric loss which compromises impedance matching. These results establish a compact readout approach based on gate-dispersive detection for Ge/SiGe heterostructure QDs.
arXiv·2026-10-01·Seongpyo Hong et al.
No generated summary available for this entry.
overview
Original abstract
Distributed quantum processors could scale variational algorithms beyond single devices, but circuit depth, communication overhead, and noise limit their performance. We compare ladder, mixed-canonical, and brick-wall realizations of matrix-product-state (MPS) pretraining with matched per-layer two-qubit-block resources. Despite comparable ideal variational quantum eigensolver performance and gradient scales, the shallower brick-wall architecture reduces circuit duration, idle-time decoherence, and zero-noise-extrapolation (ZNE) overhead, yielding superior noisy and ZNE-assisted performance. We then extend MPS-pretrained circuits to modular processors with one communication qubit per quantum processing unit (QPU); a nearest-neighbor QPU-path schedule keeps the per-layer depth constant as QPUs are added. Distributed circuits whose inter-QPU links realize long-range interactions of the target Hamiltonian match or outperform the single-processor brick-wall under noise when communication idle time is short compared with the coherence time. These results establish hardware-aware co-design of tensor-network pretraining, circuit scheduling, and communication topology as a principle for variational quantum computation on noisy modular hardware.
arXiv·2026-10-01·Katha Haldar et al.
No generated summary available for this entry.
overview
Original abstract
We consider a cavity quantum electrodynamics (CQED) setup where an ensemble of spin-1 atoms driven by a classical field interacts with two driven cavity field modes. We show that the two sub-systems - the atoms and the two-mode cavity field, exhibit limit-cycle or quantum synchronization depending on the cavity drive strengths and other system parameters. In order to visualize the limit cycle and synchronization in the field, we introduce generalized two-mode field Husimi-Q function using SU(2) coherent states. For atomic spin states, we make use of spin-1 Husimi-Q function to visualize the same. We further corroborate the occurrence of field synchronization and limit cycle by analyzing $U(1)$ symmetry breaking, Wigner quasi-probability distribution, coherence properties of reduced field density matrix. Our results reveal intriguing interplay between the limit-cycle and quantum synchronization behavior, highlighting emergent quantum phenomena in driven dissipative interacting quantum systems. Additionally, we calculate Wehrl mutual information between the two modes and find that the field synchronization and Wehrl mutual information are mutually exclusive. Our study would be important to extract quantum advantages in quantum metrology using coupled atom-cavity systems.
arXiv·2026-10-01·Thiago Bergamaschi
No generated summary available for this entry.
overview
Original abstract
The task of learning the Hamiltonian interactions governing a quantum system, given samples of its thermal (or 'Gibbs') states, is a foundational question at the intersection of quantum learning theory and many-body physics. In this paper, we draw connections to the quantum Gibbs sampling literature to introduce a natural learning algorithm we call the stationarity test: which simply "guesses" the Hamiltonian, and measures the rate-of-change of local observables, under the associated detailed-balanced quantum Markov chain [CKG23]. We leverage the stationarity test to address the following applications: 1. To give the first learning algorithm for the underlying interaction graph, i.e. structure learning, of lattice Hamiltonians at all temperatures, given copies of their Gibbs states. 2. To give the first learning algorithm for the coefficients of a lattice Hamiltonian, given only copies of its thermal metastable states, modeled as the "local minima" of the free energy. 3. In addition, we present a refinement to the recent area law for thermal metastable states [BCV25], which holds in the thermodynamic limit. Our learning algorithms are rigorous, time-efficient, and nearly sample-optimal in system size and accuracy. At a technical level, our arguments are based on new approximate locality and convexity properties for the quantum Fisher information of these Gibbs sampling algorithms.
arXiv·2026-10-01·Mohsen Moradi, Taejoon Kim, Remi A. Chou
No generated summary available for this entry.
overview
Original abstract
Quantum low-density parity-check (QLDPC) codes are promising candidates for low-overhead fault-tolerant quantum computation, but their practical use requires fast, low-complexity, and reliable decoders. Belief propagation (BP) is attractive because of its local message-passing structure, yet standard flooding BP often suffers from convergence failures on QLDPC codes due to short cycles, degeneracy, and symmetric decoding trajectories. Learned sequential BP improves convergence by using a reinforcement-learning policy to choose variable-node update orders, but a single learned trajectory can still be sensitive to unfavorable local Pauli decisions. We propose a learned parallel bit-flipping sequential BP decoder with a new quaternary score combining syndrome gain, a quantized Pauli log-likelihood penalty, and Q-table lookahead at hypothetical post-flip states. Our decoder first runs learned sequential BP for a fixed number of iterations. If the syndrome is not satisfied, it constructs quaternary bit-flipping candidates, each corresponding to changing the current Pauli decision of one qubit. The selected candidates initialize independent learned sequential BP continuations from the same decoder state. Since these continuations are independent, they can be executed in parallel, so testing several candidates mainly increases parallel hardware resources rather than sequential decoding latency. Simulations on representative QLDPC codes over the depolarizing channel show that the proposed decoder improves the reliability of learned sequential BP while having a parallel low-latency structure.
arXiv·2026-10-01·Zitai Xu et al.
No generated summary available for this entry.
overview
Original abstract
Haar-random unitaries provide a canonical model of generic random quantum evolution, but they typically have exponential description and circuit complexity. Although pseudorandom unitaries efficiently emulate a single Haar-random unitary, many tasks require an entire reusable family of independently random-looking operations. We introduce pseudorandom function-like unitaries (PRFU), which generate such a family indexed by public labels using only a single short key. We distinguish classical- and coherent-label access and establish security under adaptive quantum queries. For classical labels, we provide a generic construction from a post-quantum pseudorandom function and a pseudorandom unitary. For coherent labels, we use an indexed path-recording framework to analyze interference across labels and prove security of a construction based on quantum-secure function and permutation primitives. We further show that PRFUs generate pseudorandom channels and quantum combs with private memory, which are secure against adaptive interventions and concurrent sessions. Combining PRFUs with unitary gluing yields a one-key family of pseudorandom unitaries whose supported register widths can be chosen after key generation. Further applications include nonce-resolved quantum authentication, coherently masked QRAM queries, and efficient emulation of random multi-time dynamics. Our results extend quantum pseudorandomness from individual operations to efficiently generated families of random-looking quantum dynamics.
arXiv·2026-10-01·Suvradip Chakraborty, Ronak Ramachandran, Aniruddha Sen
No generated summary available for this entry.
overview
Original abstract
Device-independent conference key agreement (DI-CKA) lets a group of parties establish a shared secret key from untrusted quantum devices, with security certified by non-locality. Existing DI-CKA protocols are each built around a single Bell inequality, typically a multiparty variant of the CHSH game. DI-QKD protocols, in contrast, have been built from a much richer landscape of non-local games, and it has remained unclear how to carry this landscape over to the conference setting. We introduce $\textit{Parity-$G$ games}$, which extend any two-player game $G$ to $N$ players, for every $N$, provided $G$ has an optimal strategy in which one player measures Pauli observables. The extension preserves the quantum and classical values of $G$, and the security of the resulting $N$-party protocol follows from an analysis of the two-player game alone. Our framework recovers the Parity-CHSH game of Ribeiro, Murta and Wehner (Phys. Rev. A, 2018) as a special case. Applied to the Mermin--Peres Magic Square Game, it yields a new $N$-player pseudo-telepathy game, the $\textit{Parity Magic Square Game}$, which ideal devices win in every round. We use it to construct the $\textit{first}$ DI-CKA protocol based on a pseudo-telepathy game. We prove the protocol secure against coherent attacks. It produces up to two key bits per round, and at low noise its key rate exceeds that of the DI-CKA protocol based on the Parity-CHSH game.
arXiv·2026-10-01·Arul Rhik Mazumder
No generated summary available for this entry.
overview
Original abstract
The $T$-count is the dominant cost of fault-tolerant Clifford+$T$ computation. We prove that a layer of $m$ disjoint CCZ gates, the diagonal core of a parallel Toffoli layer, needs exactly $6m+1$ $T$ gates in every Hadamard-free Clifford+$T$ circuit with clean ancillas. Campbell and Howard gave the matching construction. To our knowledge this is the first proof that it is optimal for general $m$ (for $m=1$ the value $7$ is classical, and Campbell and Howard state the value $13$ at $m=2$). On every controlled unitary the same floor comes within one of their exact count, and it recovers their $4m+3$ for a fan-out of $m$ Toffolis from one control. The proof rests on an isotropy constraint: for a pure-cubic phase, the vectors recording which $T$ gates touch each qubit span a totally isotropic subspace. In general the constraint gives the isotropy floor $δ\ge2(n-d^{\ast})-r$ for every diagonal level-three gate, computed from the phase polynomial in polynomial time. The floor is never below stabilizer nullity $ν$, which equals $n-d^{\ast}$ on this class, and a separate parity argument raises it to $2ν+1$ on non-Clifford pure-cubic gates. On the output of the TODD optimizer for the $24$ benchmark circuits it completes, the floor certifies $193$ of its $311$ merged phase-polynomial blocks optimal for their Hadamard layering ($186$ to $193$ across five optimizer seeds), against $113$ for nullity. The floor also holds, under stated conditions, for circuits whose only internal Hadamards form unitarily uncomputed temporary AND blocks, while under adaptive feedforward only $t\geν$ is proved.
arXiv·2026-10-01·Yi-Hsun Chen et al.
No generated summary available for this entry.
overview
Original abstract
Atomic layer deposition (ALD) offers precise, conformal control of thin-film growth and is a workhorse for semiconductor manufacturing, but its use in superconducting quantum circuits is constrained by the need to simultaneously control crystallinity, stoichiometry and interfacial disorder at cryogenic temperatures. Here we develop hydrogen plasma assisted ALD to epitaxially grow superconducting titanium nitride (TiN) thin films, using a hydrogen plasma step to modify the surface chemistry to suppress precursor-derived impurities during each deposition cycle. Synchrotron X-ray scattering reveals semi-coherent epitaxy of TiN on c-plane sapphire, with discrete crystallographic domains and minimal long-range structural disorder. Complementary X-ray spectroscopy and neutron reflectometry show negligible oxygen-related disorder throughout the film and no substantial hydrogen incorporation. The resulting TiN films exhibit a superconducting transition at 2.2 K, a kinetic inductance of 15 pH/sq and a superconducting coherence length of 14.6 nm, comparable to the measured crystal coherence length. These results establish hydrogen plasma assisted ALD as a route to structurally ordered superconducting TiN thin film epitaxy and demonstrate that the nanoscale control of ALD can be extended to materials suitable for cryogenic quantum technologies.
arXiv·2026-10-01·Jakob Günther, Aram W. Harrow
No generated summary available for this entry.
overview
Original abstract
Discretizing electronic degrees of freedom into atomic orbitals is the default choice to accurately model electrons in molecules in a compact and flexible way. We consider the task of simulating such electronic structure models on a quantum computer for $N$ orbitals, keeping the number of orbitals per atom constant. Atomic orbitals give rise to Hamiltonians with potentially up to $\mathcal{O}(N^4)$ terms and little structure, which made it challenging to match the complexity of methods based on plane waves and real-space grids. In this work, we show that a Trotter step for atomic orbitals can be implemented in depth $\mathcal{O}(\mathrm{polylog}(N))$ without ancillas by combining a rigorous treatment of orbital localization, a hierarchical Hamiltonian decomposition based on the Fast Multipole Method, and shallow quantum Fourier arithmetic circuits. By bounding the Trotter error, we obtain sublinear simulation depth, and our total gate count $N^{5/3 + o(1)}$ matches the best scaling known for any basis.
arXiv·2026-10-01·Om Bhamare et al.
No generated summary available for this entry.
overview
Original abstract
One of the most important initial steps in quantum computing is high-fidelity quantum state preparation, because errors in it can affect the final computational result. Therefore, one of the major challenges is to design a quantum circuit that can achieve the desired target state accurately with a smaller number of gates. Traditionally, circuits are designed using predefined rules and mathematical decompositions, but this makes it difficult to design circuits for different and complex target states. This paper presents TATVA, a reinforcement learning (RL) system for synthesizing quantum circuits. TATVA views circuit synthesis as a sequential decision problem in which the agents select one gate at a time and calculate the fidelity after each applied gate, with the gate producing the highest fidelity selected for the circuit. The system introduces a parallel architecture that uses two RL agents, Deep Q-Network (DQN) and Proximal Policy Optimization (PPO), along with Qiskit's statevector simulator. The system can synthesize up to 5 qubits while achieving a fidelity of 0.999999 and producing compact circuits. After achieving the desired fidelity, it performs a post-hoc optimization step that reduces the circuit depth while preserving the achieved fidelity. The circuit is finalized using fidelity, success rate, gate count, and circuit depth. Target states that are not used during training are used to test whether the system has learned effectively and can generalize beyond the training states. This approach aims to enable automatic quantum circuit synthesis with high fidelity using reinforcement learning.
arXiv·2026-10-01·Evgenii Zaitsev et al.
No generated summary available for this entry.
overview
Original abstract
Rare-earth (RE) atoms, such as erbium (Er), have inner-shell optical transitions in the near-infrared, some of which are in the telecom bands. These transitions are largely insensitive to the host environment due to effective shielding by the filled outer shells. Cryogenic rare-gas (RG) solids, such as solid neon (Ne) and argon (Ar), combine high chemical purity with a nearly nuclear-spin-free environment, making them attractive solid hosts for preserving optical and spin coherence. In this work, we isolate neutral Er atoms in solid Ne and Ar at 6 K and characterize their emission by steady-state and time-resolved photoluminescence (PL) spectroscopy. In both hosts, we observe several near-infrared transitions between 1000--1500 nm, including inner-shell emission in the telecom O and E bands. The $4f \rightarrow 5d$ transition near 1299 nm forms a multiplet of narrow components, consistent with crystal-field splitting, and decays on a microsecond timescale. The $4f \rightarrow 4f$ transition near 1437 nm shows a matrix shift below 1 cm$^{-1}$ in both hosts. In solid Ne, its inhomogeneous linewidth is bounded by the spectrometer resolution to < 22 GHz, and its PL lifetime reaches up to 78.9 ms, close to the estimated radiative limit. Thermal annealing extends the 1437 nm lifetime in Ne and suppresses the phonon sidebands relative to the zero-phonon lines in Ar. These results identify RG solids as promising hosts for long-lived telecom-band Er emission and provide a foundation for future spin-photon interfaces and hybrid quantum architectures.
arXiv·2026-10-01·Fatemeh Ghasemi, Kion Kim
No generated summary available for this entry.
overview
Original abstract
Codon optimization is a challenging combinatorial optimization problem with important applications in synthetic biology, protein expression, and biotechnology. While quantum annealing has previously been explored for this problem, the application of gate-based quantum algorithms remains largely unexplored. In this work, we present a gate-based quantum computing framework for codon optimization by formulating the optimization objective as an Ising Hamiltonian and expressing it in terms of Pauli operators suitable for gate-based quantum processors. The proposed framework is investigated using the Variational Quantum Eigensolver (VQE), Sampling Variational Quantum Eigensolver (SVQE), and the Quantum Approximate Optimization Algorithm (QAOA), with benchmarking against exact diagonalization, classical optimization, and quantum annealing. Using a three-amino-acid benchmark, the proposed implementations successfully reproduce the exact ground-state solutions while identifying optimized ansatz selections, optimization strategies, initialization schemes, and hardware execution settings that provide reproducible performance on current noisy quantum hardware. Hardware demonstrations are performed on IBM Quantum processors to evaluate the practical implementation of the proposed workflow. As a work in progress, this study establishes a reproducible computational framework for gate-based quantum codon optimization and provides the foundation for future investigations of larger protein sequences as quantum hardware and algorithms continue to advance.
arXiv·2026-10-01·Clayton Conner et al.
No generated summary available for this entry.
overview
Original abstract
Chemical intercalation provides a powerful route for tuning the electronic and magnetic properties of transition metal dichalcogenides (TMDs), enabling the emergence of magnetic phases and phenomena that are otherwise inaccessible in their pristine forms. Here, we investigate the structural, electronic, and magnetic properties of magnetically intercalated Cr$_{1+x}$Te$_2$ through a combination of scanning tunneling microscopy, angle-resolved photoemission spectroscopy, magnetization, electrical transport, and Lorentz transmission electron microscopy measurements. We uncover a rich magnetic phase diagram comprising paramagnetic, in-plane spin-fluctuation, out-of-plane ferromagnetic, and field-induced Néel-type skyrmion phases. In particular, Lorentz transmission electron microscopy directly reveals the formation of Néel-type skyrmion textures slightly below the Curie temperature, with their configurations evolving strongly with temperature and magnetic field. The skyrmions exhibit pronounced thermal hysteresis and coexist with stripe domains, indicative of a complex magnetic energy landscape arising from the competition among disorder-induced local Dzyaloshinskii-Moriya interactions, perpendicular magnetic anisotropy, and dipolar interactions. Our results demonstrate that chemical intercalation can profoundly reshape the magnetic interactions and phase behavior of TMDs, establishing Cr$_{1+x}$Te$_2$ as a versatile platform for exploring tunable magnetism, skyrmion physics, and unconventional thermodynamic phenomena in low-dimensional quantum materials.
arXiv·2026-10-01·Shuang Cong, Jinmin Yang, Sajede Harraz
No generated summary available for this entry.
overview
Original abstract
A 35 input/single output quantum phase neural network (QPNN) is proposed to recognize the English letters' A 'and' B 'composed 7*5 of pixels. Each node of the proposed QPNN has the input with 0 or 1. Through normalization and quantum phase encoding, each set of 35 with 0 or 1 digital inputs is encoded into a quantum superposition state described by 35 quantum phases. Then, a quantum rotation gate is used to introduce adjustable phase, and a controlled NOT gate is used to entangle the relative phase between the two inputs. The relationship between the input and output of the network is derived. This paper also derived the phase weight learning training algorithm with adaptive learning rate. The solutions with the recognition probability of 1 is designed, and the analytical expressions for all adjustable phase solutions with zero errors are not unique. The experimental performance is verified on the Qiskit platform. This paper uses phase drive to convert the probability calculation into an analytical polynomial function with adjustable rotation angles in the network, avoiding the bottleneck of generating all 2^35 complex exponential amplitudes and providing an effective way to solve the "exponential wall" problem, which provides a new implementation solution for the practical application of multi-input recognition problems.
arXiv·2026-10-01·Ian Teixeira
No generated summary available for this entry.
overview
Original abstract
We construct a two-parameter family of single-error-correcting seven-ququart codes with transversal $\tilde{A_7}$ symmetry, realizing the finite component of a two-qubit super-golden gate set. These $((7,4,3))_4$ codes encode two logical qubits and support non-Clifford operations by applying the same gate to each physical ququart. Our method constructs invariant parent states rather than searching directly for a codespace. For $n$ systems of local dimension $q$, suppose the local symmetry is a unitary $t$-group and the permutation symmetry is $t$-transitive. Maximal mixing of all marginals on at most $t$ sites is then equivalent to linear equations in Schur--Weyl sector weights. Every feasible solution yields parents of pure distance at least $t+1$; puncturing one site produces a $q$-dimensional code of distance at least $t$ with the prescribed local symmetry acting transversally. Steane and the nonstabilizer Fake Steane code reveal why the construction leaves continuous freedom. They share the same prescribed transversal Clifford and permutation symmetries, and their eight-qubit purifications lie on a circle: error correction fixes two invariant-sector norms but leaves the relative phase free. Keeping the same permutation group and replacing Clifford symmetry by $\tilde{A_7}$ $\leq SU(4)$ gives three fixed sector norms and two free relative phases, producing the new ququart family.
arXiv·2026-10-01·Kishor Bharti
No generated summary available for this entry.
overview
Original abstract
The equalities IP = PSPACE and QIP = PSPACE, the latter achievable with three messages, raise a basic question: how much of an interactive proof's power comes from the underlying physical theory? We study interactive proofs in general probabilistic theories, which include classical and quantum theory. The answer depends on what the prover and verifier exchange and how the theory specifies efficient operations. When they exchange only classical messages, protocols in every theory satisfying our standard assumptions decide exactly PSPACE. For protocols with a quantum verifier and quantum messages, allowing a prover to use any theory containing quantum theory does not increase the maximum acceptance probability. Thus, the three-message PSPACE result remains valid against such provers. When messages may be arbitrary systems, the interactive-proof class can strictly exceed PSPACE.
arXiv·2026-10-01·Ritam Basu
No generated summary available for this entry.
overview
Original abstract
The negativity of the Wigner function gives an operationally meaningful measure of the complexity of simulating a quantum state on a classical computer. We study its growth for the Hartle-Hawking state under time evolution in Jackiw-Teitelboim gravity, in the length basis. At the disk level, and to leading order in the semiclassical parameter $β$, the Hartle-Hawking state is a minimum-uncertainty Gaussian wavepacket at rest at the turning point of the Liouville wall, centred at $x=2\log(2β/π)$ with $\langle p^2\rangle=π^2/8β$. Its Wigner function is positive, so its negativity is $1+o(1)$ for all sub-exponential times; it is even in $t$ by time-reversal symmetry, and exactly frozen once the reflected packet decouples from the wall, because free evolution is a Clifford shear. At late times the negativity saturates close to its upper bound, at $\sqrt{2/π}\sqrt{d_{\rm eff}(β)}$ with $d_{\rm eff}(β)=Z(β)^2/Z(2β)$, a value that requires the discrete spectrum. Unlike the spectral form factor, the negativity displays no ramp: the two-boundary wormhole contribution is suppressed by $e^{-2S_0}$ relative to a disk term that, unlike that of the spectral form factor, does not decay. The exact survival amplitude $Z(β+it)/Z(β)$ gives the spread complexity growing as $σ_E^2t^2$, and the seed-normalised negativity is, at the disk level, the inverse of the exact survival probability. We take this as evidence that the length basis is ideally suited for a dual, semi-classical effective description of chaotic quantum dynamics for large $e^{S_0}$ at sub-exponential times.