Home/Quantum Technology/Quantum Optimization & Logistics: Supply Chain & Routing Applications

Quantum Optimization & Logistics: Supply Chain & Routing Applications

Quantum optimization news: logistics, supply chain quantum, routing optimization, QAOA. Combinatorial optimization & enterprise deployments.

3,521 Articles
Updated Daily

Optimization problems—finding the best solution among millions or billions of possibilities—represent the most immediate commercial application for quantum computing. Logistics, supply chain management, manufacturing, and transportation face combinatorial explosion where classical algorithms struggle.

Quantum approaches include quantum annealing solving optimization natively using quantum tunneling; QAOA (Quantum Approximate Optimization Algorithm) as a gate-based alternative; and quantum-inspired algorithms providing immediate business value on classical hardware.

India's Quantum Optimization Landscape

India's National Quantum Mission prioritizes optimization applications given the country's complex logistics challenges. The Indian Railways, the world's largest employer and passenger carrier, represents a prime use case for quantum scheduling optimization. The NQM Thematic Hub at IIT Bombay focuses on quantum algorithms for optimization problems.

Tata Consultancy Services (TCS) develops quantum optimization solutions for Indian enterprises including supply chain, logistics, and manufacturing applications. The Quantum Valley Tech Park in Andhra Pradesh, anchored by an IBM Quantum System Two with 156-qubit Heron processor, targets optimization applications among its use cases including supply chain resilience and energy optimization.

The NQM specifically targets quantum computing applications in optimization, with intermediate-scale quantum computers expected to demonstrate utility in logistics and scheduling problems within the mission timeline.

RISC-V Vector Engine Addresses 128 Qubits With One Instructionquantum-computing

RISC-V Vector Engine Addresses 128 Qubits With One Instruction

Researchers are forecasting significant advances in quantum control for 2026, centered around a new approach leveraging the RISC-V Vector (RVV) engine. The team reports demonstrating the ability to address 128 qubits with a single instruction, a critical step toward scaling quantum systems beyond current limitations. This vectorized quantum control design also incorporates a hardware-based halt-resume protocol capable of restarting pipeline execution in 80 nanoseconds after a mid-circuit measurement, essential for the rapidly developing field of hybrid quantum-classical algorithms. Comprehensive evaluation using RISC-V toolchains and FPGA prototypes showed a 2.52 times speedup in program execution time compared to baseline designs, suggesting a pathway to overcome the classical control bottleneck hindering quantum processor expansion. Within each circuit family, speedup grows with the number of qubits; for example, performance increased from Bell-4 to Bell-8 by a factor of 52. This progression indicates that larger, more complex quantum algorithms will increasingly benefit from hardware designed to efficiently manage and process a greater number of qubits, moving beyond the limitations of earlier, smaller-scale systems. This capability represents a substantial leap in addressing scalability for quantum systems, moving beyond the sequential control methods that previously limited performance. The ability to operate on a larger qubit space in parallel is critical for realizing the full potential of quantum algorithms, particularly those designed to tackle complex optimization and simulation problems. The hardware-based halt-resume protocol, achieving a restart time of 80 nanoseconds after a mid-circuit measurement, is crucial for enabling rapid iteration in hybrid quantum-classical programs. This speed is essential for minimizing latency and maximizing the efficiency of algorithms that require frequent communication between the quantum processor and classical control

Quantum ZeitgeistLoading...0
PhD proposal in energetic cost of fault-tolerant quantum computingquantum-computing

PhD proposal in energetic cost of fault-tolerant quantum computing

PhD proposal in energetic cost of fault-tolerant quantum computing Application deadline: Sunday, July 26, 2026Employer web page: https://recrutement.inria.fr/public/classic/en/offres/2026-10236Job type: PhDTags: #PhD #quantum computing #energy #fault-tolerance #quantum error-correction #power #energetics #noise #correlated-noise #scalability #theory #PhDThe MOCQUA team at the Loria laboratory in Nancy (France) is looking for a PhD student in quantum computing theory. More details about the offer and platform to apply is provided in the link The goal will be to analyze how the energy consumption of fault-tolerant quantum computers scales as a function of the size of quantum algorithms, in a regime where the computation is specifically optimized to minimize energy consumption rather than qubits or gates counts. The main objective will be to determine whether better energy scaling than that predicted by the quantum threshold theorems [1,2] can be achieved, following the approaches developed in [3,4]. In practice, the PhD student will mostly focus on fault-tolerant quantum computing theory, and interact with other researchers providing the hardware energetic and noise models. Because such models can introduce correlated noise, this project will indirectly help understanding how to better design fault-tolerant circuits to resist such noise. To design more resource-efficient and noise-resilient fault-tolerant circuits, the PhD might use tools from diagrammatic reasoning for quantum circuits currently developed in the group [5], as well as recent developments in fault-tolerant circuit transformations [6]. =============================================== This project will be supervised by Marco Fellous-Asiani (Starting faculty at INRIA Université de Lorraine; expert in energetics of fault-tolerant quantum computing [3,4]), Simon Perdrix (Research director at INRIA Université de Lorraine; expert in diagrammatic reasoning for quantum circuits [5]), and invo

QuantikiLoading...0
Universal purification dynamics of monitored Clifford circuitsquantum-computing

Universal purification dynamics of monitored Clifford circuits

--> Quantum Physics arXiv:2607.06683 (quant-ph) [Submitted on 7 Jul 2026] Title:Universal purification dynamics of monitored Clifford circuits Authors:Beatrice Magni, Federico Gerbino, Xhek Turkeshi, Andrea De Luca View a PDF of the paper titled Universal purification dynamics of monitored Clifford circuits, by Beatrice Magni and 3 other authors View PDF HTML (experimental) Abstract:Quantum circuits under sufficiently weak monitoring purify on a timescale $T_P$ exponentially long in the system size. This slowness underlies a universal purification dynamics, whose quantitative description has so far required the replica trick, with a delicate analytic continuation. We show that monitored Clifford circuits on $L$ qudits of prime dimension $q$ bypass this construction entirely: in the scaling limit at fixed $x = t/T_P(L)$, purification reduces to the Markovian decay of the density-matrix rank, an exactly solvable death process descending from infinity. We compute the full scaling functions in compact form: all Rényi entropies collapse onto a universal curve $\langle S(x) \rangle$. Exact stabilizer simulations at $q=2,3,5$ confirm the predictions, with no fitting parameter for the global model and $T_P$ as the only fitted scale for local brick-wall circuits. Also, the replica problem amounts to a tilted version of the same Markov process, in agreement with exact computations from the Clifford commutant. Finally, the quantization of the rank leaves two hallmarks that distinguish Clifford dynamics from generic monitored circuits: the entropy fluctuations saturate at short scaled times $x\to0$ to an $O(1)$ variance, instead of vanishing, and observables develop a temporal modulation periodic in $\log_q x$, which cannot be captured by the replica approach. Comments: Subjects: Quantum Physics (quant-ph); Statistical Mechanics (cond-mat.stat-mech) Cite as: arXiv:2607.06683 [quant-ph]   (or arXiv:2607.06683v1 [quant-ph] for this version)   https://doi.org/10.48550/ar

arXiv Quantum PhysicsLoading...0
Feynman's clock and hierarchy-informed sampling for quantum error mitigationquantum-computing

Feynman's clock and hierarchy-informed sampling for quantum error mitigation

--> Quantum Physics arXiv:2607.06752 (quant-ph) [Submitted on 7 Jul 2026] Title:Feynman's clock and hierarchy-informed sampling for quantum error mitigation Authors:Theo Saporiti View a PDF of the paper titled Feynman's clock and hierarchy-informed sampling for quantum error mitigation, by Theo Saporiti View PDF HTML (experimental) Abstract:Near-term physical implementations of quantum algorithms require efficient quantum error mitigation schemes to reduce quantum noise. In this letter we propose a new mitigation technique, by extending the applicability of our BBGKY-ISM scheme from quantum simulations of spin chains to arbitrary quantum circuits. We map executions of quantum circuits using Feynman's clock Hamiltonian to the Hamiltonian dynamics of a corresponding quantum system, whose time evolution obeys a BBGKY-like hierarchy of equations informing the BBGKY-ISM mitigation. We show that the method's classical and quantum overheads are polynomial in the circuit size and in the number of qubits. We apply our method to numerical simulations of tunable Bell state preparation circuits under state-of-the-art quantum noise, and numerically demonstrate its systematic and controllable quantum error reduction capability. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2607.06752 [quant-ph]   (or arXiv:2607.06752v1 [quant-ph] for this version)   https://doi.org/10.48550/arXiv.2607.06752 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Theo Saporiti [view email] [v1] Tue, 7 Jul 2026 19:33:58 UTC (421 KB) Full-text links: Access Paper: View a PDF of the paper titled Feynman's clock and hierarchy-informed sampling for quantum error mitigation, by Theo SaporitiView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph < prev   |   next > new | recent | 2026-07 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX cita

arXiv Quantum PhysicsLoading...0
A quantum model for synchronizing finite state transition systemsquantum-computing

A quantum model for synchronizing finite state transition systems

--> Quantum Physics arXiv:2607.06953 (quant-ph) [Submitted on 8 Jul 2026] Title:A quantum model for synchronizing finite state transition systems Authors:Martin Lukac, Khaled El-Fakih, Uraz Turker View a PDF of the paper titled A quantum model for synchronizing finite state transition systems, by Martin Lukac and 2 other authors View PDF Abstract:We propose a quantum model for finding a resetting input sequence (RS) which can take a finite state transition system (FA), to particular state independent of its current state. The complexity of finding such sequences for various types of FA can be NP-Hard or even PSPACE-Complete. To this end, we represent the FA states, inputs, and transition function in quantum space. Accordingly, we propose a model to represent the execution of an input sequence of a particular length $l$ starting form an initial FA state. The model is extended considering the application in superposition of all input sequences of length $l$ to an initial state of the FA. The model is further extended considering the application of all input sequences to all initial states of the FA capturing for every input sequence the collection (ordered list) of states reached by applying the sequence to all states of the FA. The amplitude amplification algorithm is then used as it combines similar collections of reached states while preserving all input sequences that reach these collections. A Grover search for a reached collection where its elements correspond to the same FA state provides a RS for the FA. Our approach offers a quadratic gain over the exponential complexity of traditional brute-force method, which is the only method that can be applied to a general FA class. As a proof of concept we provide results of several simulated FAs on a quantum simulator. Comments: Subjects: Quantum Physics (quant-ph); Emerging Technologies (cs.ET) ACM classes: D.2.5; F.1.1; F.2.1; I.1.2; J.6 Cite as: arXiv:2607.06953 [quant-ph]   (or arXiv:2607.06953v1 [quant-

arXiv Quantum PhysicsLoading...0
Researchers Build Quantum Circuits Using Ising Model and Time-Dependent Fieldsquantum-computing

Researchers Build Quantum Circuits Using Ising Model and Time-Dependent Fields

Matthias Werner at the IUniversity of Barcelona and colleagues have found a fundamental connection between the transverse-field Ising model and standard gate-based quantum computation. The Ising model, when driven by a specifically tailored, time-dependent transverse field, simulates any quantum circuit with a polynomial increase in computational resources. This finding answers a long-standing question regarding the computational power of analogue quantum simulation platforms, such as those employing quantum annealing, and importantly, suggests inherent limitations for classically simulating this type of Ising model. The research also has implications for complexity theory and the control of quantum systems, potentially motivating improvements in simulating quantum circuits using the Ising model. Transverse-field Ising model replicates universal quantum circuits with polynomial overhead A significant advance in quantum simulation has been realised, demonstrating a polynomial increase in time, qubit number, and energy scale when simulating quantum circuits using the transverse-field Ising model. This represents a substantial improvement over previous methods, which lacked a clear pathway to universal quantum computation with predictable resource scaling. The Ising model, driven by a carefully controlled, time-varying transverse field, effectively replicates any quantum circuit, unlocking the potential for utilising analogue quantum simulation platforms for broader computational tasks. The significance of this lies in the potential to move beyond specialised optimisation problems, for which quantum annealers are currently designed, towards a more general-purpose quantum computing paradigm based on analogue principles. Previous attempts to demonstrate universality often suffered from exponential scaling of resources, rendering them impractical. This work establishes a polynomial scaling relationship, offering a more viable route to scalability, although substantial cha

Quantum ZeitgeistLoading...0
SEALSQ and GlobalFoundries Form Alliance to Develop Post-Quantum Semiconductor Blocks and Cryogenic CMOS Infrastructurequantum-computing

SEALSQ and GlobalFoundries Form Alliance to Develop Post-Quantum Semiconductor Blocks and Cryogenic CMOS Infrastructure

SEALSQ and GlobalFoundries Form Alliance to Develop Post-Quantum Semiconductor Blocks and Cryogenic CMOS Infrastructure Post-quantum hardware engineer SEALSQ Corp (Nasdaq: LAES) and foundry group GlobalFoundries (Nasdaq: GFS) have signed a strategic Memorandum of Understanding (MoU) to co-develop secure semiconductor platforms, post-quantum cryptography (PQC) IP, and cryogenic silicon control layers. The development track links GlobalFoundries’ commercial Complementary Metal-Oxide-Semiconductor (CMOS) fabrication processes and bulk manufacturing volume with SEALSQ’s hardware-based certified security cores and PQC-ready root-of-trust modules. The joint initiative focuses on moving quantum computing hardware out of boutique lab setups by manufacturing essential system control units within established, high-volume semiconductor cleanrooms. [ SEALSQ - GlobalFoundries Alliance Matrix ] Manufacturing Hub ──► GlobalFoundries high-volume U.S. and European fabrication facilities. Hardware IP Module ──► Hard macro certified PQC blocks engineered with MIPS architecture. Cryogenic Engine ──► CryoCMOS ASICs for sub-Kelvin quantum processing unit (QPU) control. Sovereign Mandate ──► Secure, traceable supply chain alignment supporting U.S. and European policies. The corporate partnership targets three primary technological segments: Certified PQC Security IP Integration: In collaboration with MIPS (a GlobalFoundries subsidiary), the engineering groups will design pre-certified PQC security IP hard macro blocks and Chiplet Hardware Security Module (CHSM) components. These functional blocks act as hardware-based roots of trust for Secure Enclaves, enabling semiconductor developers to embed hardware-level quantum-resistant protection directly during the initial silicon layout phase rather than implementing it as a post-fabrication software layer. Cryogenic CMOS (CryoCMOS) Architectures: Building on SEALSQ’s quantum ASIC design track and GlobalFoundries’ dedicated Quantum Technology S

Quantum Computing ReportLoading...0
Millisecond coherence times in gigahertz-frequency mechanical oscillatorsquantum-computing

Millisecond coherence times in gigahertz-frequency mechanical oscillators

MainLong-lived phonons are a compelling resource, as they permit numerous quantum operations within their coherence time, which enables high-performance quantum sensors1,2,3,4, transducers5,6,7,8 and memories9,10,11. The efficient control of long-lived phonons using optomechanical12,13,14, electromechanical15,16 and superconducting qubit systems17,18,19 has generated renewed interest in phononic device physics and technologies for quantum applications20,21. Although various mechanical oscillators have produced such long-lived phonons over a range of frequencies21,22, high-frequency (gigahertz) phonons are often desirable, as they have improved immunity to unwanted noise, permit ground-state operation at cryogenic temperatures and are more readily controlled using quantum optics and circuit quantum electrodynamics techniques21,23. In theory, crystalline media are ideal for hosting such long-lived phonons, as they have vanishing internal dissipation at cryogenic temperatures24,25,26,27. However, it has proven difficult to extend the coherence times of such gigahertz-frequency crystalline oscillators to millisecond timescales.Silicon-based nanomechanical phononic crystal resonators have shown long phonon lifetimes (>1 s) at gigahertz frequencies; however, strong coupling between phonons and the two-level system limits their coherence times to ~100 μs (refs. 10,11,14). Tight phonon confinement and strong boundary reflections within these systems make them vulnerable to complex surface interactions that may contribute to excess noise and dephasing14. Alternatively, micro-fabricated high-overtone bulk acoustic-wave resonators (μHBARs) of the type seen in Fig. 1a support gigahertz-frequency phonon modes with orders of magnitude lower surface participation13,28. In principle, lower surface participation could translate to lower dephasing rates and longer coherence times. However, in practice, μHBARs have yielded modest coherence times (<1 ms)13,23, shorter than can be

Nature Physics – QuantumLoading...0
Wu and Colleagues Introduces Cyclic Control Strategy for Fast CZ Gate Fidelityquantum-computing

Wu and Colleagues Introduces Cyclic Control Strategy for Fast CZ Gate Fidelity

A new cyclic control strategy overcomes the trade-off between gate speed and accuracy in quantum computing. Ze-An Zhao and colleagues expand the parameter space for pulse design, enabling strong suppression of coherent errors in a superconducting controlled-Z gate. The average error reduces from 0.27% to 0.12% without extending gate duration. This advancement provides a general pathway towards achieving both fast and high-fidelity quantum gates, representing a key step towards scalable quantum computation. Restored qubit controllability enables high-fidelity, fast superconducting controlled-Z gates Error rates dropped to 0.12%, a significant reduction from 0.27% in superconducting controlled-Z gates, representing a major leap in quantum gate fidelity. The team at University of Science and Technology of China achieved this improvement without increasing gate duration, surpassing the conventional speed-fidelity trade-off which previously demanded slower gate speeds for higher accuracy. By addressing distortions in control pulses, tiny imperfections disrupting precise qubit operation, they expanded the range of adjustable parameters during gate operation, effectively restoring controllability. A novel cyclic control strategy provides a general pathway towards building faster and more reliable quantum computers, circumventing a key limitation in current superconducting quantum circuit designs. Validation of the approach used cross-entropy benchmarking, a method for assessing quantum gate performance by measuring preservation of quantum information. This revealed a reduction in coherent errors, stemming from imperfections within the quantum system, and successful suppression of leakage, unwanted transitions to unintended quantum states, alongside phase errors, all without extending gate operation duration, a critical step towards practical quantum computation. The team discovered that short-term distortions in control pulses disrupt the time-reflection symmetry of wavefo

Quantum ZeitgeistLoading...0
Max Planck Institute for the Science of Light: Researchers Use AI to Design Improved Quantum Error Correction Codesquantum-computing

Max Planck Institute for the Science of Light: Researchers Use AI to Design Improved Quantum Error Correction Codes

A new method for building quantum error-correcting codes, key for unlocking the potential of quantum computation, has been devised by Zidu Liu and Florian Marquardt at the Max Planck Institute for the Science of Light, in collaboration with Friedrich-Alexander University and 1Max Planck Institute. Their work presents structured concept evolution (SCE), a framework using large language models to discover families of quantum low-density parity-check (qLDPC) codes. The method moves beyond traditional, challenging discrete design problems by evolving algebraic specifications alongside executable programs, resulting in the identification of competitive code families, including those utilising non-abelian groups, and demonstrating the potential of artificial intelligence in advancing quantum information science. Discovery of efficient quantum error correction via language model guided code search A reduction in the cost per logical qubit by roughly an order of magnitude has been achieved compared to the surface code, overcoming a key obstacle to scalable quantum computation. Previously, the surface code’s quadratic overhead in physical qubits limited progress as quantum platforms approached the thousand-qubit threshold; this new advancement enables constant-rate codes, offering a pathway to fault-tolerant computation with sharply reduced resource requirements. At the Institute for the Science of Light, in collaboration with Friedrich-Alexander University, scientists developed structured concept evolution (SCE), a framework combining large language models with algebraic mutation grammar to discover lifted-product code families, a type of quantum low-density parity-check (qLDPC) code. Quantum error correction is crucial because qubits, the fundamental units of quantum information, are inherently susceptible to noise and decoherence, leading to errors in computation. Without effective error correction, even small error rates would quickly overwhelm quantum algorithms, render

Quantum ZeitgeistLoading...0
Jin and Colleagues Develop Learning-Based Methods for Quantum Sensing and Networkingquantum-computing

Jin and Colleagues Develop Learning-Based Methods for Quantum Sensing and Networking

A thorough review of the increasingly intertwined fields of artificial intelligence and quantum information has been completed by Min Chen of University of Pittsburgh and colleagues. The review details how AI acts as a set of tools for advancing quantum system learning, design, control, and verification, whilst quantum information presents new computational models and learning paradigms for AI development. This survey organises recent advances around key tasks including information extraction from limited measurements, quantum algorithm training and discovery, hardware stabilisation, workflow automation, and the extension of learning methods to sensing and networking. Furthermore, the work examines the impact of quantum computation and quantum-inspired structures on learning, considering algorithmic speedups, expressivity, and neural-network design, highlighting the vital need for integrated theory, experiment, and hybrid quantum-classical systems to enable overcoming challenges in reproducibility and scalability. Using tensor networks for advances in quantum and machine learning Tensor-network representations proved central to enabling these advances, functioning as a way of organising complex data into a network of interconnected nodes, similar to how a family tree shows relationships between individuals. Data represented in this interconnected format reduced the computational burden of processing high-dimensional information, a key challenge in both quantum simulations and advanced AI algorithms. These networks were used to model the intricate connections within quantum states and machine learning models, allowing for more efficient computation and analysis. The fields of artificial intelligence and quantum information are becoming increasingly intertwined. A recent survey details progress in using AI to improve quantum systems, focusing on tasks like interpreting limited measurements and training quantum algorithms. The team also examined how quantum computation

Quantum ZeitgeistLoading...0
Jin and Colleagues Designs Quantum Circuit for Simulating Incompressible Stokes Flowquantum-computing

Jin and Colleagues Designs Quantum Circuit for Simulating Incompressible Stokes Flow

A new quantum algorithm tackles the key computational challenges of simulating incompressible Stokes flow, a process vital for understanding microfluidics and low-Reynolds number hydrodynamics. Shi Jin of the University of Science and Technology of China and colleagues use the Schrödingerisation technique and artificial compressibility to reduce the costs of high-dimensional simulations. Their approach designs an explicit quantum circuit encoding the regularised system, showing an exponential speedup in problem dimensionality and validating the method through numerical simulations on Qiskit. The algorithm offers a promising pathway towards efficient simulation of complex fluid dynamics using quantum computation. Quantum algorithm circumvents dimensionality limitations in Stokes equation modelling The developed quantum algorithm achieves an exponential speedup in problem dimensionality, a significant contrast to previous methods hampered by the curse of dimensionality in high-dimensional Stokes equation simulations. This breakthrough overcomes classical computational constraints, enabling the modelling of fluid dynamics in scenarios previously intractable due to the exponential growth of required resources with increasing dimensions. The computational cost of classical methods for solving the Stokes equations scales poorly with dimensionality, often requiring resources that grow exponentially with the number of dimensions. This limitation severely restricts the ability to model complex systems accurately. Combining Schrödingerisation with artificial compressibility, researchers designed an explicit quantum circuit to efficiently encode the regularised system, offering a unified framework for solving these complex equations. Schrödingerisation, a technique borrowed from quantum mechanics, transforms the partial differential equation into a time-dependent Schrödinger equation, allowing it to be solved using quantum algorithms. The artificial compressibility method intr

Quantum ZeitgeistLoading...0
Palesi and Colleagues Propose Dependency-Aware Scheduling for Multi-Core Quantum Systemsquantum-computing

Palesi and Colleagues Propose Dependency-Aware Scheduling for Multi-Core Quantum Systems

Scheduling quantum circuits on multicore processors now occurs by assigning each gate as soon as its dependencies and resources are available, enabling greater parallelism across cores. Rajeswari Suance P S of the Indian Institute of Technology Guwahati, Chandigarh University, and the University of Catania and colleagues have devised a method for organising quantum calculations, key as quantum computers increase in size and complexity. Current systems limit the number of qubits, and this approach utilises multiple processing cores to overcome these restrictions. By scheduling each step of a calculation as soon as its requirements are met, the team achieved a 40 per cent reduction in processing time compared to traditional methods, improving how efficiently cores use resources. Rajeswari Suance P S and colleagues tackle the challenge of increasing the processing power of quantum computers by distributing calculations across multiple cores, a strategy mirroring the move to multicore processors in classical computing. As quantum computers grow, simply adding more qubits to a single chip becomes increasingly difficult, and this new approach instead connects smaller processing units, each containing a limited number of qubits, to work in parallel. This is akin to adding more lanes to a motorway to handle increased traffic, improving overall system capacity. The researchers of Technology Guwahati, Chandigarh University, and the University of Catania have developed a scheduling method that assigns each step of a quantum calculation as soon as its requirements are met, unlike traditional ‘layered scheduling’ which organises tasks like an assembly line. Greedy scheduling delivers substantial gains in multicore quantum circuit completion times A 40 per cent reduction in makespan, the total time to complete a quantum circuit, occurred using a new greedy scheduling strategy developed by researchers from University of Catania, Chandigarh University, and Indian Institute of Techn

Quantum ZeitgeistLoading...0
Benhemou and Colleagues Designs Automated Framework for Inter-Code Logical CNOT Synthesisquantum-computing

Benhemou and Colleagues Designs Automated Framework for Inter-Code Logical CNOT Synthesis

Scientists at Quantinuum have developed a new automated framework that establishes connections between diverse quantum error-correcting codes, addressing a fundamental challenge in the construction of practical, large-scale quantum computers. Asmae Benhemou and Noah Berthusen, from Quantum AI, present a system utilising chain maps to generate logical CNOT circuits between arbitrary CSS codes, resolving limitations encountered when integrating different code families. The approach not only rediscovers established connections between codes but also identifies new, low-depth solutions, potentially improving the efficiency of operations such as code switching and Pauli product measurements in heterogeneous quantum architectures. Automated framework enables low-depth connections between arbitrary quantum error correction Quantinuum researchers achieved a five-fold reduction in the complexity of connecting disparate quantum error correction codes, moving from circuits requiring a depth of ten to those with a depth of two in certain instances. Their automated framework, utilising ‘chain maps’, now enables logical CNOT circuits between arbitrary CSS codes, a key step towards building more flexible quantum computers. CSS codes, named after Calderbank-Shor-Steane, are a prominent class of quantum error-correcting codes defined by their structure relating to classical error-correcting codes. The ability to perform logical operations, such as the CNOT gate, between different CSS codes is crucial for modular quantum computation and fault-tolerant quantum information processing. Previously, such connections were largely limited to structurally related code families, hindering the development of heterogeneous quantum systems. The new method not only replicates established connections but also uncovers novel, low-depth solutions, including those preserving or partially preserving error detection capabilities, and can extend these to full code distance with additional measurements.

Quantum ZeitgeistLoading...0
Rigetti's Quantum Reality: Delays, Low Revenue, And An Unjustified Premiumquantum-computing

Rigetti's Quantum Reality: Delays, Low Revenue, And An Unjustified Premium

Melissa Tucker1.5K FollowersFollow5ShareSavePlay(6min)Comments(2)SummaryRigetti Computing faces persistent delays in scaling its superconducting qubit technology, with milestone slippages and underwhelming fidelity improvements.RGTI maintains a robust balance sheet ($570M cash, no debt), but continues to burn ~$20M per quarter with limited revenue visibility and no new meaningful contracts.Despite a $100M Department of Commerce LOI, funding is not the constraint; commercial traction remains weak, with recent contracts appearing as one-offs.RGTI’s premium valuation (248–310x PS) appears unjustified without revenue growth or technical breakthroughs, risking multiple compression toward peer levels. Just_Super/iStock via Getty Images I have covered Rigetti Computing (RGTI) before, where I outlined the company’s background in detail, explained why I didn’t understand all the excitement about the company, and why I considered it a sell. Since the This article was written byMelissa Tucker1.5K FollowersFollowWith a professional background spanning multiple industries, from ecnomocis to logistics and construction to retail, I bring a diverse perspective to investing. My international education and career experiences have provided me with a global outlook and the ability to analyze market dynamics from different cultural and economic perspectives. I have been actively investing for over a decade, honing a strategy that focuses on cyclical industries while maintaining a diversified portfolio that includes bonds, commodities, and forex. My interest in cyclical sectors stems from their potential for significant returns during periods of economic recovery and growth. However, I also recognize the importance of balancing risk, which is why I incorporate fixed-income investments (long or short).Analyst’s Disclosure: I/we have a beneficial long position in the shares of IONQ, INFQ either through stock ownership, options, or other derivatives. I wrote this article myself, and it expr

Seeking AlphaLoading...0
LUMI AI Factory Selects IQM to Deploy Superconducting Quantum Computer for Hybrid HPC-AI Accelerationquantum-computing

LUMI AI Factory Selects IQM to Deploy Superconducting Quantum Computer for Hybrid HPC-AI Acceleration

LUMI AI Factory Selects IQM to Deploy Superconducting Quantum Computer for Hybrid HPC-AI Acceleration The LUMI AI Factory, coordinated by CSC – IT Center for Science, has selected hardware manufacturer IQM Quantum Computers (Nasdaq: IQMX) to deliver and integrate its IQM Halocene H4 superconducting quantum computer. Designated as LUMI-IQ, the system will be deployed at CSC’s data infrastructure center in Kajaani, Finland, with installation scheduled for 2027. The integration contract is jointly financed by the EuroHPC Joint Undertaking alongside the sovereign governments of Finland, Czechia, Norway, and Poland. Financially, the total contract value matches IQM’s full corporate revenue for the fiscal year ended December 31, 2025, as disclosed in the company’s July 1, 2026 public prospectus. [ LUMI-IQ System Integration Matrix ] Hardware Platform ──► IQM Halocene H4 on-premises superconducting processing unit. Initial Capacity ──► 150 qubits combining active error mitigation with NISQ operations. Facility Location ──► CSC IT Center for Science data complex (Kajaani, Finland). Financing Syndicate ──► EuroHPC Joint Undertaking, Finland, Czechia, Norway, and Poland. The procurement marks a structural shift toward full-stack on-premises quantum deployment within high-performance computing (HPC) ecosystems. Rather than operating as an isolated, cloud-accessible sandbox, the initial 150-qubit Halocene processing engine will sit directly adjacent to the pan-European LUMI supercomputer. The physical architecture integrates specialized Quantum Processing Units (QPUs) with automated, low-latency classical control infrastructure. This hardware arrangement enables European research and development teams to execute co-processing workflows, where computationally intensive machine learning loops and molecular calculations bounce seamlessly between high-density classical graphics nodes (GPUs) and quantum processors without routing delays. The engineering roadmap managed by IQM CEO Ja

Quantum Computing ReportLoading...0
BTQ Technologies Gains Quantum Software From 2023 QPerfect Startupquantum-computing

BTQ Technologies Gains Quantum Software From 2023 QPerfect Startup

BTQ Technologies has finalized its acquisition of QPerfect, a French quantum computing company founded in 2023, expanding its quantum software capabilities. The July 8, 2026 announcement details the completion of a deal following a prior strategic investment, bringing QPerfect’s MIMIQ quantum emulator, Digital Twin capabilities, and Quantum Logical Unit directly into BTQ’s technology stack. These additions are intended to strengthen BTQ’s mission of “Building Trusted Quantum Technologies” as organizations prepare for the challenges of post-quantum cryptography. BTQ Technologies, traded on both Nasdaq (BTQ) and CBOE CA (BTQ), believes the transition to quantum security will require optimized hardware, software, simulation, and control layers to enable practical deployment at scale. BTQ Acquisition of QPerfect Advances Trusted Quantum Technologies BTQ Technologies’ completion of its acquisition of QPerfect expands the capabilities available for building practical quantum systems, adding crucial software tools for modeling and testing before hardware deployment. The deal, finalized on July 8, 2026, integrates QPerfect’s specialized technologies directly into BTQ’s infrastructure stack, signaling a strategic push toward verifiable and secure quantum networks. Central to this integration is QPerfect’s MIMIQ quantum emulator, a software platform designed to simulate quantum algorithms on conventional computing infrastructure. BTQ reports that MIMIQ has demonstrated the ability to handle simulations of s + qubit, a significant step toward lowering the barrier to large-scale quantum algorithm development and security testing. Beyond emulation, QPerfect’s Digital Twin technology offers a system modeling capability, allowing researchers to simulate and optimize quantum architectures before physical construction, potentially reducing development costs and accelerating timelines. The third key component is QPerfect’s Quantum Logical Unit (QLU), a multi-layered control framework

Quantum ZeitgeistLoading...0
SEALSQ and GlobalFoundries Align on Trusted Supply Chainsquantum-computing

SEALSQ and GlobalFoundries Align on Trusted Supply Chains

Nasdaq: LAES and Nasdaq: GFS announced a publicly traded investment in future security as SEALSQ Corp and GlobalFoundries announced a strategic partnership to co-develop technologies spanning post-quantum cryptography and quantum computing. The collaboration will focus on pre-certified Post-Quantum Cryptography security IP, developed alongside GlobalFoundries company MIPS, with hard macro blocks and Chiplet Hardware Security Modules targeting applications like Hardware Security Modules and Secure Enclaves. Building on GlobalFoundries’ recent investments in quantum technology, the companies will also advance a CryoCMOS ecosystem to support scalable quantum computing systems. “A shared long-term vision between GF and SEALSQ is that semiconductors, cybersecurity, post-quantum cryptography, and quantum computing are converging into a single technology ecosystem,” said Carlos Moreira, CEO of SEALSQ, emphasizing the alignment of their respective expertise and ambitions. GF & SEALSQ Co-Develop Post-Quantum Cryptography Security IP The strategic Memorandum of Understanding, announced recently, will see the two firms co-develop secure semiconductor platforms and solutions designed to withstand the threat of future quantum computers. This partnership addresses the immediate need to secure data against potential attacks, where adversaries collect encrypted information with the intention of decrypting it once quantum computers become powerful enough. A key component of this effort will involve MIPS, a GlobalFoundries company, working alongside SEALSQ to create pre-certified Post-Quantum Cryptography (PQC) security IP blocks. These hard macro components and Chiplet Hardware Security Modules (CHSM) are specifically targeted for integration into applications demanding high security, such as Hardware Security Modules (HSMs) and Secure Enclaves. Pre-certification is crucial, streamlining the adoption process for clients needing to meet stringent security standards. Beyond bolste

Quantum ZeitgeistLoading...0