All News

Stay updated with the latest quantum computing developments from around the world

India National Quantum Mission

Explore India's ₹6,003 Crore quantum initiative - 4 thematic hubs, leading startups, and latest developments

From Quantum Authors

71076 articles found
Sort By:
USC and Quantum Elements Demonstrate Surface Code Scaling on IBM Heavy-Hex Processors - Quantum Computing Reportquantum-computing

USC and Quantum Elements Demonstrate Surface Code Scaling on IBM Heavy-Hex Processors - Quantum Computing Report

USC and Quantum Elements Demonstrate Surface Code Scaling on IBM Heavy-Hex Processors Surface code on heavy-hex. Researchers from the University of Southern California (USC) and quantum software developer Quantum Elements have demonstrated subthreshold surface code scaling on non-native processor geometries, publishing their peer-reviewed findings in Nature Communications. Executed across 156-qubit IBM Heron-generation superconducting QPUs, the study confirms that physical quantum processors do not require a native square-grid lattice to achieve distance-scaling error suppression under topological quantum memory codes. IBM’s heavy-hex architecture, arranged on the sites and links of a honeycomb lattice, introduces routing delays and idle gaps that typically cause non-Markovian dephasing and coherent ZZ crosstalk to accumulate. To overcome these connectivity constraints, the research team co-designed a depth-minimizing “fold-unfold” SWAP embedding using bridge ancillas alongside robust dynamical decoupling (DD). Implemented via Quantum Elements’ Orbit Qiskit Function, the DD protocol suppressed idle-time noise, allowing directional subthreshold scaling as the surface code distance expanded from d = 3 (37 qubits) to anisotropic (dx, dz) = (3, 5) and (5, 3) configurations (65 qubits). [ IBM Heavy-Hex Surface Code Demonstration & Benchmarking Metrics ]Hardware & Embedding SpecsError Suppression & Mitigation StackDemonstrated Subthreshold Scaling• QPU: IBM Heron 156-Qubit Processors• Connectivity: Heavy-Hex Honeycomb Lattice• Embedding: SWAP-based Fold-Unfold• Software Layer: Orbit Qiskit Function• Control Technique: Gap-Aware Robust DD• Noise Suppressed: ZZ Crosstalk & Dephasing• Scale: d = 3 (37Q) → (3,5) & (5,3) (65Q)• QEC Execution: Up to 10 Cycles (Depth >140)• Operation Count: 2,200 Entangling Gates Co-authored by Daniel Lidar (USC Center for Quantum Information Science & Technology Director and Quantum Elements CSO) and Arian Vezvaee, th

Google News – Quantum ComputingLoading...0
Here's What $1,000 Invested in IonQ Stock Could Be Worth by 2030quantum-computing

Here's What $1,000 Invested in IonQ Stock Could Be Worth by 2030

IonQ (IONQ +9.50%) shares have fallen by around 35% over the last 12 months, giving back all of the gains they made in 2025, when optimism about the future of quantum computing was at its peak. However, with a market cap of roughly $15 billion, the company is still one of the leading pure-play stocks in the sector. And it stands out because of its rapid revenue growth and unusual approach to the nascent technology. Has the 44% dip it has taken from the 2026 peak it hit this summer created a long-term buying opportunity, or is it a sign for investors to stay away? Let's explore the pros and cons of IonQ as an investment, and try to predict what a $1,000 position opened in the stock today could be worth by the end of the decade. ExpandNYSE: IONQIonQPremium FeatureMoneyball Superscore63/100Today's Change(9.50%) $3.50Current Price$40.34Key Data Points*:nth-last-child(-n+2)]:border-b-0">Market Cap$16BMarket cap calculated using publicly traded shares outstanding only. Does not include unlisted, private, or dual-class non-traded shares. Implied market cap may vary.Day's Range$38.09 - $40.7852wk Range$25.89 - $84.64Volume22.5MAvg Vol20.5MGross Margin-3317.96% The next tech megatrend? Quantum computing has the potential to be one of those once-in-a-generation technology megatrends capable of radically changing the global economy -- similar to recent breakthroughs like generative AI or the internet. But it's too early to know for sure how much of that perceived potential will translate into reality. While traditional computers and digital devices manipulate data in bits -- 1s and 0s -- quantum computers use "qubits" (quantum bits) that leverage the counterintuitive properties of quantum mechanics to temporarily hold states that are neither 1 nor 0, but complex probability amplitudes.  This allows them to perform computations in ways that bear little resemblance to classical machines, and gives them the potential to quickly solve problems that would take the world's

The Motley FoolLoading...0
Riverlane Establishes U.S. Headquarters in Maryland’s Discovery District to Scale Real-Time QEC Deploymentsquantum-computing

Riverlane Establishes U.S. Headquarters in Maryland’s Discovery District to Scale Real-Time QEC Deployments

Riverlane Establishes U.S. Headquarters in Maryland’s Discovery District to Scale Real-Time QEC Deployments Quantum error correction (QEC) technology developer Riverlane has announced plans to establish its official U.S. headquarters in the Discovery District Maryland in College Park. Located adjacent to the University of Maryland (UMD) campus, the facility will house executive offices, laboratory space, and customer integration facilities to support Riverlane’s North American expansion, commercial business development, and research collaborations with U.S. government and commercial partners. The facility embeds Riverlane directly within the Mid-Atlantic quantum technology corridor, anchored by the Joint Center for Quantum Information and Computer Science (JCIQS)—a partnership between UMD and NIST—alongside the U.S. Army Research Laboratory, Johns Hopkins University Applied Physics Laboratory, and commercial hardware providers such as IonQ and Microsoft. Supported by Maryland’s state-backed Capital of Quantum initiative, the expansion builds on Riverlane’s existing U.S. office in Boston and deepens existing joint QEC integration projects with hardware partners including IQM and Quantum Motion. [ Riverlane Maryland Headquarters & Operational Profile ]Corporate & Facility FootprintRegional Ecosystem & Funding AnchorCore QEC Product Stack• U.S. HQ: Discovery District Maryland (College Park)• State Initiative: Capital of Quantum ($1B 2030 Target)• Deltaflow™ Real-Time FPGA QEC System• Academic Partner: University of Maryland (UMD)• Federal Partners: NIST, JCIQS, ARL, JHU-APL• Deltakit™ QEC Software Development Kit• Global Sites: Cambridge (UK), Boston, Delft• Total Capital Raised: $120M+ ($85M Series C)• Real-Time Decoding & QEC Chips Concurrently, Riverlane and UMD have launched a strategic collaboration focused on QEC workforce development, student fellowships, and joint research on real-time decoding algorithms. Riverlane’s flagship QEC platform, Delt

Quantum Computing ReportLoading...0
Oxford Quantum Circuits Releases Erado: An Open-Source Qiskit Simulator for Erasure Noise and Post-Selectionquantum-computing

Oxford Quantum Circuits Releases Erado: An Open-Source Qiskit Simulator for Erasure Noise and Post-Selection

Oxford Quantum Circuits Releases Erado: An Open-Source Qiskit Simulator for Erasure Noise and Post-Selection Superconducting quantum computing hardware provider Oxford Quantum Circuits (OQC) has released erado, an open-source Python library designed to simulate erasure noise, dual-rail qubit encodings, and post-selection strategies on arbitrary Qiskit circuits. Integrated directly into OQC’s Quantum Computing as a Service (QCaaS) SDK as a 16-qubit AerSimulator backend, the tool allows algorithm developers and researchers to benchmark erasure-aware noise models and evaluate quantum error mitigation techniques ahead of physical execution. The release is accompanied by a companion research paper titled “The limits of erasure-based postselection for quantum error mitigation“ (Griffiths et al., arXiv:2606.31428). The study demonstrates that postselection can fully mitigate the erasure channel when erasure check error rates remain below 3.0%. Crucially, the authors show that a postselected dual-rail system can surpass the fundamental noise floor at the kiloquop (1,000 quantum operations) scale where a comparable single-rail architecture fails, justifying the approach for Noisy Intermediate-Scale Quantum (NISQ) algorithms prior to full Quantum Error Correction (QEC). Beyond OQC, erasure-detection methodologies and dual-rail architectures are being actively pursued across the ecosystem, including by D-Wave Systems (following its acquisition of Quantum Circuits Inc.) and Q-CTRL. [ OQC Erado Simulator Architectural & Configuration Parameters ]Parameter / FlagFunctional SpecificationSimulation Mechanics & Impacterasure_ratePer-gate erasure probability (0.0 to 1.0)Triggers non-computational state transition; compounds with total erasable gate count.post_selectionBoolean filter flag (Default: False)When enabled, discards detected erasure shots and automatically retries until target shot count is met.false_negative_rateDetector inaccuracy probability (0.0 to 1.0)Models mi

Quantum Computing ReportLoading...0
Qupertino: Pure MLX Array Kernels versus Hand-Tuned Metal Shaders for Quantum Circuit Simulation on Apple Siliconquantum-computing

Qupertino: Pure MLX Array Kernels versus Hand-Tuned Metal Shaders for Quantum Circuit Simulation on Apple Silicon

--> Quantum Physics arXiv:2609.19147 (quant-ph) [Submitted on 9 Jul 2026] Title:Qupertino: Pure MLX Array Kernels versus Hand-Tuned Metal Shaders for Quantum Circuit Simulation on Apple Silicon Authors:Shlomo Kashani View a PDF of the paper titled Qupertino: Pure MLX Array Kernels versus Hand-Tuned Metal Shaders for Quantum Circuit Simulation on Apple Silicon, by Shlomo Kashani View PDF HTML (experimental) Abstract:We present Qupertino, an open-source quantum circuit simulator for Apple Silicon, and use it to ask how far a simulator written purely in MLX array operations can go and what remains for hand-tuned Metal shaders. The framework ships two measured tiers. The pure tier dispatches structured gates to specialized MLX kernels: diagonal gates run as broadcast phase multiplies, controlled gates as masked half-state updates, and SWAP as an axis permutation; a paired dense-path ablation attributes a 25-33x speedup to this dispatch alone. The opt-in shader tier adds hand-written Metal kernels for every structured layer family in our benchmarks, including phase-LUT diagonals, GF(2) affine permutation gathers, fused tensor-product single-qubit layers, radix-4 QFT and Walsh-Hadamard butterflies, and basis-conjugated XX/YY Trotter layers; runtime fusion detectors route work to them while preserving circuit semantics exactly, confirmed by parity tests. In a four-way interleaved campaign on M1 Max (two warmups, ten measured repeats per cell), the shader tier is fastest by mean runtime in all 18 comparison cells against same-machine Qiskit Aer CPU and PennyLane this http URL. At 25 qubits, gate-stream QFT runs in 0.0591 +/- 0.0029 s (paired 47.2x over Aer, 95.3x over PennyLane) and TFIM Trotter evolution in 0.495 +/- 0.035 s (36.2x and 67.2x). Across a 29-workload suite, the shader tier's paired speedup over pure MLX reaches 25x, with 25 of 29 workloads accelerating above parity. The framework also supports variational ansatz workloads, QAOA, QCBM, Trotter-Suzuki Hamiltoni

arXiv Quantum PhysicsLoading...0
AlchemQ: Proof-Carrying Quantum Circuit Optimization with Per-Result Equivalence Certificatesquantum-computing

AlchemQ: Proof-Carrying Quantum Circuit Optimization with Per-Result Equivalence Certificates

--> Quantum Physics arXiv:2609.19160 (quant-ph) [Submitted on 24 Aug 2026] Title:AlchemQ: Proof-Carrying Quantum Circuit Optimization with Per-Result Equivalence Certificates Authors:Adam Laabs View a PDF of the paper titled AlchemQ: Proof-Carrying Quantum Circuit Optimization with Per-Result Equivalence Certificates, by Adam Laabs View PDF HTML (experimental) Abstract:We present AlchemQ v0.5, a proof-of-concept system that couples an untrusted beam-search optimizer with a machine-checkable per-result certification layer and a versioned certificate protocol (0.2.0), so that every optimized circuit ships with a verifiable artifact rather than a bare claim. The certifier proves equivalence up to global phase by ZX-calculus full reduction, with a numeric-tensor fallback based on the optimal Hilbert-Schmidt overlap. Certificates are self-contained and tamper-evident: canonical gate-canon-v1 hashes, measured residuals, tri-state verdicts (certified/rejected/inconclusive), and versioned phase-note schemas for cross-platform reproducibility. The agent aggregates three fuzzy t-norms, cannot return an uncertified circuit, and since v0.4 guarantees no componentwise regression against the original. On a benchmark of 100 circuits, all 400 optimizations terminate without error, every returned circuit is certified, every mutation is detected, and a 2998-test suite passes on two platforms. The PyZX baseline is strong (21.4% mean T-count reduction over 82 circuits) and the agent is strictly better on 9/100; the three t-norms return identical circuits on all 100 standard instances, diverging only on 4/38 of an adversarial suite. Two case studies are new: a false negative root-caused to a pivot-normalization bug in PyZX's compare_tensors (pivot 4.7e-9; the optimal-overlap residual is 7.4e-11), and eight certificates rejected on macOS due to BLAS-dependent floats in phase_note. Both were fixed; all artifact sets validate 400/400 on both platforms. A pilot run on IBM Heron r2 gives a c

arXiv Quantum PhysicsLoading...0
Holomorphic Quantum Error Correction Codesquantum-computing

Holomorphic Quantum Error Correction Codes

--> Quantum Physics arXiv:2609.19162 (quant-ph) [Submitted on 25 Aug 2026] Title:Holomorphic Quantum Error Correction Codes Authors:M.W. AlMasri View a PDF of the paper titled Holomorphic Quantum Error Correction Codes, by M.W. AlMasri View PDF HTML (experimental) Abstract:We develop a holomorphic representation of quantum error correction codes (QECCs) within the Segal--Bargmann space. By encoding qubits into Schwinger boson modes $(z_{a_j}, z_{b_j})$ subject to a degree-one homogeneity constraint, we derive closed-form differential operator representations for stabilizers, syndrome extraction, and recovery for fundamental codes (three-, five-, seven-, and nine-qubit codes). Quantum errors are characterized as holomorphic perturbations violating this constraint, while syndrome measurement projects onto eigenspaces of commuting differential operators. Restricting to unit-magnitude variables ($|z|=1$) reveals a toroidal space $\T^{2n}$ where error syndromes manifest as discrete translations in winding number space $\Z^{2n}$, and recovery acts as Hamiltonian flows restoring the winding configuration. In the full Segal--Bargmann space, the code space is a holomorphic submanifold of $\CP^{2^n-1}$, with correctable errors as transverse normal directions. Consequently, the Knill--Laflamme condition becomes a Fubini--Study orthogonality condition between the code submanifold and its error-translated images. Topological protection emerges from the $U(1)^n$ fiber bundle structure: global phase noise along fibers is unobservable, while base-space errors require active correction. Finally, we establish a path-integral formulation for semiclassical error correction dynamics and show that geometric entanglement via the Segre embedding naturally quantifies code distance. This framework unifies algebraic, geometric, and topological perspectives on fault-tolerant quantum protocols. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2609.19162 [quant-ph]   (or arXiv:

arXiv Quantum PhysicsLoading...0
Suzuki-Trotter Decompositions and other Methods for Quantum Time Evolutionquantum-computing

Suzuki-Trotter Decompositions and other Methods for Quantum Time Evolution

--> Quantum Physics arXiv:2609.19184 (quant-ph) [Submitted on 15 Sep 2026] Title:Suzuki-Trotter Decompositions and other Methods for Quantum Time Evolution Authors:Johann Ostmeyer View a PDF of the paper titled Suzuki-Trotter Decompositions and other Methods for Quantum Time Evolution, by Johann Ostmeyer View PDF Abstract:(Suzuki-)Trotter decompositions, splitting methods, (Lie) product formulae... The most common numerical methods for the time evolution of quantum systems come with many names. And they are used practically everywhere with applications ranging from the solution of classical equations of motion and various Monte Carlo simulations to the real and imaginary time evolution on classical as well as quantum computers. Here we review the state of the art of said methods, focussing especially on the progress made over the last few years. We highlight recently discovered efficient time evolution algorithms and explain how best to use them in practice. A central part of this work is the estimation of error bounds that has improved greatly within the past decade. The relevance of time evolution methods for quantum computing is discussed with a focus on noisy hardware. Finally, a comprehensive overview of generalisations, related methods and alternatives to Trotterization is provided. This includes time-dependent Hamiltonian dynamics, processed methods, multi-product formulae, symplectic integrators, TDVP for tensor networks, quantum signal processing, Crouch-Grossman methods and more. The overall perspective in this work is that of a theoretical physicist. All mathematical proofs as well as some technical details are omitted for easier readability. Instead, this review serves as a hands-on guide and, of course, as a starting point for references that provide further details. Comments: Subjects: Quantum Physics (quant-ph); Statistical Mechanics (cond-mat.stat-mech); Strongly Correlated Electrons (cond-mat.str-el); High Energy Physics - Lattice (hep-lat); Computa

arXiv Quantum PhysicsLoading...0
Lazy training of quantum physics informed neural networksquantum-computing

Lazy training of quantum physics informed neural networks

--> Quantum Physics arXiv:2609.19239 (quant-ph) [Submitted on 16 Sep 2026] Title:Lazy training of quantum physics informed neural networks Authors:Anderson Melchor Hernandez, Giacomo De Palma View a PDF of the paper titled Lazy training of quantum physics informed neural networks, by Anderson Melchor Hernandez and Giacomo De Palma View PDF HTML (experimental) Abstract:We study the gradient-flow training dynamics of quantum physics-informed neural networks (QPINNs) for the solution of second-order elliptic partial differential equations with Dirichlet boundary conditions. We consider parameterized quantum circuits as function approximators and analyze their overparameterized regime through the lens of the neural tangent kernel (NTK). Our contribution is a nonasymptotic lazy-training theory for QPINNs and their variational formulation: we prove that, for sufficiently large circuit width, the nonlinear gradient flow is quantitatively approximated by a linearized NTK model, with explicit bounds depending on the number of qubits, circuit depth, circuit light-cone geometry, and the dimension of the domain of the solution to the PDE. Subjects: Quantum Physics (quant-ph); Mathematical Physics (math-ph); Probability (math.PR) MSC classes: 81P45, 49Q22, 60F05 Cite as: arXiv:2609.19239 [quant-ph]   (or arXiv:2609.19239v1 [quant-ph] for this version)   https://doi.org/10.48550/arXiv.2609.19239 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Anderson Melchor Hernandez [view email] [v1] Wed, 16 Sep 2026 17:12:54 UTC (62 KB) Full-text links: Access Paper: View a PDF of the paper titled Lazy training of quantum physics informed neural networks, by Anderson Melchor Hernandez and Giacomo De PalmaView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph < prev   |   next > new | recent | 2026-09 Change to browse by: math math-ph math.MP math.PR References & Citations INS

arXiv Quantum PhysicsLoading...0
Achieving the limits of automorphism gatesquantum-computing

Achieving the limits of automorphism gates

--> Quantum Physics arXiv:2609.19250 (quant-ph) [Submitted on 16 Sep 2026] Title:Achieving the limits of automorphism gates Authors:Jin Ming Koh, Shayan Majidy, Aranya Chakraborty, Anqi Gong, Shi Jie Samuel Tan, Norman Y. Yao View a PDF of the paper titled Achieving the limits of automorphism gates, by Jin Ming Koh and 5 other authors View PDF HTML (experimental) Abstract:Universal fault-tolerant quantum computing combines versatile but expensive operations with specialized but cheap ones. Its efficiency depends on how much computation can be pushed onto the cheap operations and on the size of the code needed to do so. Automorphism gates provide such cheap operations using only physical single-qubit Clifford gates and qubit permutations. Yet no general theory characterizes their maximum logical power or the minimum code size needed to attain it. We develop such a theory. For stabilizer codes encoding $k\geq3$ logical qubits, we show that the largest logical group attainable by automorphisms is generated by all addressable $S$ and $\mathrm{CX}$ gates, and we construct codes attaining it. While this group contains exponentially fewer gates than the full Clifford group, adding one suitable non-Clifford gate yields universality. We further classify the largest logical groups attainable using qubit permutations, physical single-qubit Cliffords, or both across general stabilizer and CSS codes, and derive refined bounds for self-dual CSS subclasses. Achieving the maximum-size logical group through automorphisms requires $n=\Theta(2^k)$ physical qubits. By contrast, all addressable diagonal Clifford gates, generated by $S$ and $\mathrm{CZ}$, require only $n=\Theta(k^2)$ physical qubits when implemented using physical single-qubit Cliffords alone. Both bounds are tight. This polynomial qubit cost extends beyond Cliffords to all addressable diagonal gates at any fixed level of the Clifford hierarchy, using physical single-qubit diagonal gates. Thus, for full addressability, t

arXiv Quantum PhysicsLoading...0
Theory of post-selected entanglement transitions in monitored bosonsquantum-computing

Theory of post-selected entanglement transitions in monitored bosons

--> Quantum Physics arXiv:2609.19251 (quant-ph) [Submitted on 16 Sep 2026] Title:Theory of post-selected entanglement transitions in monitored bosons Authors:Ilia Komissarov, Emanuele G. Dalla Torre, Ahana Chakraborty View a PDF of the paper titled Theory of post-selected entanglement transitions in monitored bosons, by Ilia Komissarov and 2 other authors View PDF HTML (experimental) Abstract:Entanglement phase transitions driven by quantum measurements have emerged as a central paradigm in open quantum many-body physics. Such phase transitions are well established for systems with finite local Hilbert-space dimensions, such as qubits and fermions, while their realization in bosonic systems with unbounded local occupation numbers remains poorly understood. Even in the absence of interactions, number states of bosons are intrinsically non-Gaussian, preventing the use of standard correlation-matrix approaches. To address this problem, we develop a replica-free Keldysh field-theoretic framework that expresses the Renyi entropy of bosonic systems initialized in on-site Fock states in terms of permanents of matrices constructed from single-particle Green's functions. Applying this framework to a continuously monitored one-dimensional cross-stitch lattice conditioned on the no-click trajectory, we uncover a transition from volume-law to logarithmic entanglement scaling. We show that the transition is controlled by a restructuring of the non-Hermitian spectrum that changes the number of long-lived modes from extensive to finite. In the strongly monitored regime, bosons dynamically condense into a microscopic number of slowest-decaying modes, producing logarithmic entanglement scaling, whereas an extensive manifold of long-lived modes at weak monitoring gives rise to volume-law entanglement. Our results establish a distinct mechanism for measurement-induced entanglement transitions in free bosonic systems and provide a computationally efficient diagnostic of the measurement

arXiv Quantum PhysicsLoading...0
Emergent classicality and wavefunction branching in an isolated quantum many-body systemquantum-computing

Emergent classicality and wavefunction branching in an isolated quantum many-body system

--> Quantum Physics arXiv:2609.19254 (quant-ph) [Submitted on 16 Sep 2026] Title:Emergent classicality and wavefunction branching in an isolated quantum many-body system Authors:Saúl Pilatowsky-Cameo, Jordan Cotler, Daniel Ranard, C. Jess Riedel View a PDF of the paper titled Emergent classicality and wavefunction branching in an isolated quantum many-body system, by Sa\'ul Pilatowsky-Cameo and 3 other authors View PDF HTML (experimental) Abstract:Decoherence in quantum systems is conventionally modeled as the effect of interactions with an external environment. However, such a prescription excludes isolated many-body systems, which are also expected to display classical behavior at macroscopic scales. In isolated systems, decoherence must emerge internally from microscopic degrees of freedom that are invisible to the macroscopic description. Here we explicitly show that classicality can emerge in such a fashion. We consider a weakly disordered, $3$-local chaotic kicked top of $N$ qubits, where the collective spin sector serves as the macroscopic description, while the microscopic permutation sector acts as an internal bath, decohering the collective spin sector. Starting from closed unitary dynamics, we derive and numerically confirm an effective Lindblad equation for the collective spin variables. In the thermodynamic limit these reduced dynamics converge to a classical chaotic Fokker--Planck equation with vanishingly small diffusion on the spherical phase space, producing a quantum-classical correspondence beyond the Ehrenfest time. The chaotic dynamics evolve the pure many-body wavefunction into continuously branching components associated with distinct classical trajectories. These branches acquire nearly orthogonal microscopic records in the permutation sector, preventing quantum interferences and ensuring the corresponding histories remain consistent. Comments: Subjects: Quantum Physics (quant-ph); Strongly Correlated Electrons (cond-mat.str-el); Mathematical

arXiv Quantum PhysicsLoading...0