Quantum News
Sign InSign Up
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,959 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.

Enabling Hybrid HPCQC Workflows with a Heterogeneous Software Stackquantum-computing

Enabling Hybrid HPCQC Workflows with a Heterogeneous Software Stack

--> Quantum Physics arXiv:2608.14827 (quant-ph) [Submitted on 14 Aug 2026] Title:Enabling Hybrid HPCQC Workflows with a Heterogeneous Software Stack Authors:Muhammad Nufail Farooqi, Minh Chung, Burak Mete, Eric Mansfield, Bernd Hoffmann, Teemu Mattsson, Laura Schulz, Jorge Echavarria View a PDF of the paper titled Enabling Hybrid HPCQC Workflows with a Heterogeneous Software Stack, by Muhammad Nufail Farooqi and 7 other authors View PDF HTML (experimental) Abstract:In this work, we demonstrate hybrid High Performance Computing-Quantum Computing (HPCQC) workflows on a production petascale system. The demonstration combines three components: the SuperMUC-NG supercomputer at the Leibniz Supercomputing Centre (LRZ), a 20-qubit superconducting quantum processor provided by IQM Quantum Computers (IQM), and Munich Quantum Valley (MQV)'s Munich Quantum Software Stack (MQSS). Integrating quantum processors into High Performance Computing (HPC) systems requires a heterogeneous software stack capable of orchestrating classical and quantum resources within established supercomputing workflows. MQSS treats Quantum Processing Units (QPUs) as scheduler-managed accelerators and it performs resource coordination following a two-level scheduling scheme. Slurm performs system-level allocation by exposing QPUs as Generic RESources (GRES), while the MQSS Quantum Resource Manager & Compiler Infrastructure (QRM&CI) performs just-in-time compilation and subsequent dispatch of quantum circuits. To integrate with existing HPC operations without modifying the scheduler core, MQSS introduces an open-source SLURM Plugin Suite based on Prolog/Epilog scripts and SPANK modules. Experimental results show that hybrid HPCQC workflows can be executed without significant latency overhead compared to conventional workloads. The presented architecture provides a portable integration model for quantum accelerators on large-scale HPC systems and is directly applicable to next-generation Hewlett Pac

arXiv Quantum PhysicsLoading...0
Qudit-ADAPT-VQE: an adaptive variational algorithm with counterdiabatic-inspired improvements for quditsquantum-computing

Qudit-ADAPT-VQE: an adaptive variational algorithm with counterdiabatic-inspired improvements for qudits

--> Quantum Physics arXiv:2608.14981 (quant-ph) [Submitted on 15 Aug 2026] Title:Qudit-ADAPT-VQE: an adaptive variational algorithm with counterdiabatic-inspired improvements for qudits Authors:Joaquín Molina, Herbert Díaz-Moraga, Dardo Goyeneche, Diego Tancara View a PDF of the paper titled Qudit-ADAPT-VQE: an adaptive variational algorithm with counterdiabatic-inspired improvements for qudits, by Joaqu\'in Molina and 2 other authors View PDF HTML (experimental) Abstract:Variational quantum algorithms based on qudits have attracted significant attention in recent years. However, as in their qubit-based counterparts, challenges such as barren plateaus and the design of efficient ansatz remain major obstacles. In this work, we propose to address these issues through a qudit implementation of the ADAPT-VQE algorithm, which constructs the ansatz iteratively. Specifically, we introduce an operator pool inspired by adiabatic evolution enhanced with counterdiabatic driving for ansatz construction and employ it to solve Max 3-Cut. We show that the warm-start strategy inherent to ADAPT-VQE, together with an ansatz construction based on counterdiabatic operators, achieves higher accuracy and lower native gates implementation than approaches on fixed ansatz. Furthermore, we show that, in qudit-based quantum computing, ADAPT-VQE with a counterdiabatic operator pool can navigate rough optimization landscapes with local traps through the burrowing mechanism, suggesting robustness against barren plateau effects and providing a scalable framework for variational quantum algorithms with qudits. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2608.14981 [quant-ph]   (or arXiv:2608.14981v1 [quant-ph] for this version)   https://doi.org/10.48550/arXiv.2608.14981 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Diego Tancara [view email] [v1] Sat, 15 Aug 2026 02:19:32 UTC (3,065 KB) Full-text links: Access Paper:

arXiv Quantum PhysicsLoading...0
An error-mitigated quantum annealing solution for the weighted Max-Cut problem on a cubic latticequantum-computing

An error-mitigated quantum annealing solution for the weighted Max-Cut problem on a cubic lattice

--> Quantum Physics arXiv:2608.15094 (quant-ph) [Submitted on 15 Aug 2026] Title:An error-mitigated quantum annealing solution for the weighted Max-Cut problem on a cubic lattice Authors:Y. S. Yang, P. Tyson, A. B Murphy View a PDF of the paper titled An error-mitigated quantum annealing solution for the weighted Max-Cut problem on a cubic lattice, by Y. S. Yang and 2 other authors View PDF Abstract:The weighted Max-Cut problem is an NP-hard problem with application implications. It is investigated on a cubic lattice with 113 nodes and mixed-signed random edge weights. For a fixed upper bound on edge weights, it has been demonstrated that the computational difficulty increases as the lower bound on edge weights becomes more negative. The solution time for the problem using a novel error-mitigated quantum annealing approach is compared with standard D-Wave quantum annealing (QA) and BQM hybrid solvers, as well as various classical solvers. For the QPU-embeddable weighted Max-Cut instances with mixed-signed edge weights, it has been quantitatively demonstrated that the SEMO (spin-error mitigation for optimisation) error-mitigated quantum annealing achieved substantially shorter time-to solution than standard D-Wave QA, D-Wave BQM, simulated annealing and Tabu search baselines. The error-mitigated quantum annealing approach presented in this article potentially elevates the efficiency and application scope of quantum annealing and would be applicable in solving other discrete optimisation problems that can be formulated as QUBO or Ising instances. The promising solution time advantage would be particularly impactful for time-critical optimisation applications. Comments: Subjects: Quantum Physics (quant-ph); Mathematical Physics (math-ph) Cite as: arXiv:2608.15094 [quant-ph]   (or arXiv:2608.15094v1 [quant-ph] for this version)   https://doi.org/10.48550/arXiv.2608.15094 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission histor

arXiv Quantum PhysicsLoading...0
Postdoctoral Position in Quantum Computing / Quantum Machine Learning, Yukawa Institute for Theoretical Physics, Kyoto Universityquantum-computing

Postdoctoral Position in Quantum Computing / Quantum Machine Learning, Yukawa Institute for Theoretical Physics, Kyoto University

Postdoctoral Position in Quantum Computing / Quantum Machine Learning, Yukawa Institute for Theoretical Physics, Kyoto University Application deadline: Saturday, October 31, 2026Employer web page: https://ryuhayakawa.github.io/Job type: PostDocTags: quantum computingquantum algorithmsmachine learningApplications are invited for a postdoctoral position in quantum information and quantum machine learning, and topological data analysis, funded by JST ASPIRE. The successful candidate will work with Ryu Hayakawa on quantum-enhanced feature design and algorithm development, with connections to topological data analysis and quantum computational complexity theory. The position is based at the Yukawa Institute for Theoretical Physics, Kyoto University, and includes international collaboration with researchers in the Netherlands. Deadline: October 31, 2026, 9:00 JST Official call: https://www.kyoto-u.ac.jp/sites/default/files/acceptance_teacher/2026-07... JREC-IN: https://jrecin.jst.go.jp/seek/SeekJorDetail?id=D126072243 Contact: ryu.hayakawa[AT]yukawa.kyoto-u.ac.jp Log in or register to post comments

QuantikiLoading...0
Infleqtion: The Execution Phase (Rating Downgrade)quantum-computing

Infleqtion: The Execution Phase (Rating Downgrade)

Sean Daly2.24K FollowersFollowSummaryInfleqtion, Inc. reported 116% YoY revenue growth to $12.6M, raised FY guidance, and maintains $582M in cash with a quarterly burn rate of $14M.INFQ's neutral atom quantum technology underpins unique defense and commercial products, driving government contracts and strategic partnerships with entities like Nvidia, NASA, and Safran.Despite strong execution and a robust patent portfolio, insider selling and SPAC-related risks, plus near-term revenue headwinds, temper immediate upside.I rate INFQ stock a Hold due to recent stock gains, looming Q3 weakness, and a seasonally challenging market backdrop. gorodenkoff/iStock via Getty Images The hype giveth, and the hype taketh away. Since my last report on Infleqtion, Inc. (INFQ), the company has been on a wild ride. New U.S. mandates for quantum investment and a series of newThis article was written bySean Daly2.24K FollowersFollowSean Daly writes on ETFs, biotech and FINTECH solutions in the banking space.  He teaches international finance and financial risk management at Pace University and was a visiting lecturer at Princeton University from 2005 to 2009.  He was educated at Columbia University.  He has also written extensively on real estate and  economic development, exploring issues as diverse as Chinese urbanization, CMI multilateral currency swap arrangements, energy geopolitics, and Asia's sovereign wealth funds.    Global strategy and private equity background. Equity Approach: long/short, event-driven, with a focus on small cap biotech and the emerging markets.Analyst’s Disclosure: I/we have a beneficial long position in the shares of INFQ either through stock ownership, options, or other derivatives. I wrote this article myself, and it expresses my own opinions. I am not receiving compensation for it (other than from Seeking Alpha). I have no business relationship with any company whose stock is mentioned in this article. Seeking

Seeking AlphaLoading...0
Quanta Computer Will Scale Up Quantinuum’s Quantum Systemsquantum-computing

Quanta Computer Will Scale Up Quantinuum’s Quantum Systems

Quanta Computer, a Fortune Global 500 manufacturer, is partnering with quantum computing company Quantinuum to address the challenges of scaling up quantum systems for commercial use. Joint engineering work is already underway between the companies to design hardware infrastructure focused on making future quantum computers more modular, manufacturable, and scalable. “It is time for quantum computing to transition from breakthroughs in physics achieved in the lab to breakthroughs in system manufacturing that can be deployed and operated at scale,” said Dr. Rajeeb Hazra, President and CEO of Quantinuum. This collaboration aims to establish an industrial foundation for large-scale quantum computing, moving beyond theoretical advancements to practical production. Quantinuum’s QCCD Architecture Drives Scalable System Development Central to plans for scaling quantum systems is Quantinuum’s established QCCD architecture. The company is collaborating with manufacturing giant Quanta Computer, and this partnership prioritizes practical deployment of existing technology rather than focusing solely on qubit development; Quantinuum has already commercially released multiple generations of trapped-ion systems built on this architecture. Quanta Computer’s involvement signals a shift toward industrializing quantum computing beyond startup ventures, leveraging their experience with advanced computing platforms, Quantinuum says. Dr. Hazra stated, “Quanta has earned a global reputation for industrializing some of the most advanced computing technologies in the world.” The collaboration aims to ensure supply chains and engineering expertise develop alongside the quantum technology itself. This isn’t merely a research agreement; the companies are co-developing hardware infrastructure to support future generations of Quantinuum’s quantum systems, creating a pathway to commercially viable, large-scale fault-tolerant quantum computers capable of wider adoption. The focus on manufacturabil

Quantum ZeitgeistLoading...0
Global Photonics Economic Forum gathers 400+ CEOs to discuss photonics future.quantum-computing

Global Photonics Economic Forum gathers 400+ CEOs to discuss photonics future.

More than 400 executives and decision-makers will convene in Málaga, Spain, September 24-25 for Optica’s Global Photonics Economic Forum, indicating substantial industry investment in the future of photonics. The forum will bring together leaders examining how photonics drives advances in areas from artificial intelligence to aerospace; early bird registration closes September 4. “Photonics is increasingly recognized as a strategic technology that underpins economic growth, national competitiveness and technological leadership,” said José Pozo, Chief Technology Officer at Optica. The event will also recognize Lumentum’s Michael Hurlston and TRUMPF with the 2026 Optica i4 Prizes for leadership and innovation. Optica’s Global Photonics Economic Forum: Industry Leaders Converge in Málaga The forum, organized by Optica, will take place September 24-25 and focuses on the business strategies needed to translate photonics innovation into marketable products. This event concentrates on the economic and strategic future of optics and photonics, assembling leaders who drive growth within the global ecosystem. The forum’s agenda includes discussions on critical areas such as artificial intelligence infrastructure and the development of resilient supply chains, reflecting the increasing importance of photonics across multiple sectors. Leaders will also address challenges related to industrial policy and maintaining global competitiveness in a rapidly evolving technological landscape. The Global Photonics Economic Forum is the only international forum exclusively dedicated to the economic future of optics and photonics. Attendees will have opportunities to network with CEOs of billion-dollar companies, technology pioneers, investors, and policymakers, fostering collaborations and translating ideas into action through exclusive receptions and an industry exhibition. Registration rates will increase after September 4, with standard rates varying based on membership status and VAT

Quantum ZeitgeistLoading...0
Researchers Simulate Fluid Dynamics on Quantum Processorquantum-computing

Researchers Simulate Fluid Dynamics on Quantum Processor

Scientists José Diogo da Costa Jesus and colleagues at the Hamburg Centre for Ultrafast Imaging, Luruper Chaussee 149, Hamburg D-22761, Germany, and the University of Oxford, have demonstrated a new method realising the time evolution of nonlinear fluid dynamics on a quantum processor. Numerical simulation of nonlinear partial differential equations underpins modern scientific computing, spanning areas from fluid flow and transport to collective dynamics. Extending this capability to quantum computers represents a longstanding challenge because nonlinear and non-Hermitian evolution is fundamentally incompatible with conventional Hamiltonian-based quantum simulation. The difficulty arises because quantum mechanics, at its core, describes systems evolving according to the Schrödinger equation, which is linear and governed by Hermitian operators; representing dissipative or nonlinear forces requires fundamentally different approaches. Quantum simulation accurately models high Reynolds number fluid convection Error rates in reconstructing the time evolution of fluid dynamics dropped to 0.3 per cent for the first timestep, a substantial improvement over previous methods limited by shallower circuits and susceptibility to hardware noise. This reduction in error is critical, as quantum systems are inherently prone to decoherence and gate errors, which rapidly degrade the accuracy of computations. The team achieved this by implementing a hybrid quantum-classical variational framework, directly encoding nonlinear dynamics and circumventing the need for complex linear approximations. Traditional quantum algorithms often rely on mapping the problem onto a Hamiltonian and then evolving it using unitary transformations; however, this approach struggles with nonlinear terms. The variational framework instead uses a parameterised quantum circuit, where the parameters are optimised classically to minimise the difference between the quantum simulation and the desired solution. This

Quantum ZeitgeistLoading...0
Researchers Bound Quantum Circuit Complexity with New Witnessesquantum-computing

Researchers Bound Quantum Circuit Complexity with New Witnesses

A new framework has been developed defining quantum circuit architecture witnesses, certifying the incompatibility of a unitary transformation with a specified quantum circuit architecture. Methods for determining the feasibility of implementing quantum operations are primarily constructive, meaning they attempt to build a circuit to achieve a desired transformation. However, these constructive methods generally do not provide rigorous certificates that a unitary cannot be realised using given implementation resources, leaving open the possibility that a circuit might be fundamentally impossible to construct within the constraints of a particular hardware platform. Raphaël Mothe and Otfried Gühne, at the Institute for Scientific Computing and the Technische Universität Hannover respectively, formulate the witness construction as a semidefinite program by maximising the fidelity between the Choi state of the target unitary and those of tested circuits. The resulting witnesses provide practical and quantitative certificates of incompatibility, implying lower bounds on implementation resources such as the number of gates required and the circuit’s depth. Rigorous certification of seven two-qubit gate quantum circuits using incompatibility witnesses For Clifford unitaries, a specific class of unitary transformations crucial in quantum error correction and measurement-based quantum computation, a new framework enables efficient numerical certification for circuits containing approximately seven two-qubit gates, a substantial improvement over previous methods. Clifford unitaries possess the property that they map qubit states to other qubit states, and are fundamental to many quantum algorithms. Prior approaches lacked rigorous proof of impossibility; they could suggest difficulty in implementation but not definitively prove it, leaving a gap in verifying quantum computation feasibility. This work definitively establishes whether a given quantum operation can be performed

Quantum ZeitgeistLoading...0
Researchers Cut Quantum Resource Demand for Power Grid Islandingquantum-computing

Researchers Cut Quantum Resource Demand for Power Grid Islanding

A new method limits the spread of disturbances in electrical grids through controlled islanding, partitioning a compromised grid into connected, electrically sustainable islands. Classical methods face sharply growing computational costs as network size and island count increase. Quantum optimisation offers an alternative for exploring this combinatorial partition space. However, monolithic quantum formulations encode all assignment decisions in one circuit, causing qubit demand and circuit complexity to scale with network size. In this study, Yuqi Jiang of Tsinghua University and colleagues propose a qubit-bounded sequential distributed quantum approximate optimisation algorithm (QAOA) framework to tackle coherent controlled islanding under limited quantum resources. It formulates the optimal islanding strategy through a series of sequential QAOA optimisations. Distributed quantum algorithm tackles large-scale power grid partitioning with fewer qubits A five-fold reduction in qubits needed for controlled islanding has been achieved, resolving problems with 300 buses, a scale previously inaccessible to monolithic quantum approximate optimisation algorithm (QAOA) approaches. Modern power systems are undergoing a significant transformation with the increasing integration of distributed energy resources (DERs) such as solar photovoltaic arrays, wind turbines, and energy storage systems. While these DERs offer numerous benefits, including increased resilience and reduced carbon emissions, they also introduce substantial variability and uncertainty into the power grid. This variability stems from the intermittent nature of renewable energy sources and the decentralised control of these resources. During disturbances, such as faults or sudden load changes, these effects can intensify generation-load imbalances and potentially lead to cascading failures, resulting in widespread blackouts. Controlled islanding, a proactive grid management technique, aims to mitigate these r

Quantum ZeitgeistLoading...0
Researchers Simulate Systems with Memory Using Quantum Algorithmsquantum-computing

Researchers Simulate Systems with Memory Using Quantum Algorithms

Until now, quantum algorithms have efficiently simulated Markovian dynamical systems, where a system’s future depends only on its current state. IBM Research has, for the first time, developed quantum algorithms to efficiently simulate non-Markovian systems, where future evolution depends on past history. These algorithms provide an exponential speedup in system size compared to existing classical methods when the strength of the memory term, denoted as M, is less than one. Researchers have created new quantum algorithms that model systems influenced by their past states, a characteristic called non-Markovian dynamics. Previously, quantum algorithms could only efficiently simulate systems where only the present state mattered; this work expands those capabilities to a broader range of complex phenomena. These algorithms efficiently simulate linear Volterra integro-differential equations, which describe systems with ‘memory effects’ that are challenging for standard computers to handle. The significance of this advancement lies in its potential to model a wider array of physical and chemical processes accurately, as many real-world systems exhibit non-Markovian behaviour. Classical simulations of such systems often require immense computational resources, scaling polynomially with system size, making them intractable for all but the simplest cases. Researchers at IBM Research have developed new quantum algorithms capable of simulating systems where the future state depends not only on the present, but also on a ‘memory’ of the past. However, simulating these systems becomes computationally difficult when the memory effect is strong, prompting the researchers to explore techniques for converting complex problems into simpler forms, a process they term Markovianization. The ability to accurately model non-Markovian dynamics is crucial in fields like quantum chemistry, where the interactions between electrons can exhibit memory effects, and in materials science, where t

Quantum ZeitgeistLoading...0
Shortcut for simulating logical magic states could accelerate the design of fault-tolerant quantum computersquantum-computing

Shortcut for simulating logical magic states could accelerate the design of fault-tolerant quantum computers

Step by step: A simplified schematic of the simulation framework, showing how circuit-level Pauli errors in noisy magic-state preparation protocols can be propagated and simplified using the underlying algebraic structure, reducing the problem to efficiently simulable logical Clifford errors acting on the output magic state. (Courtesy: Yousra Farhani) Building a useful quantum computer is not simply a matter of adding more qubits. The greater challenge is making these qubits reliable enough to perform long computations without errors overwhelming the result. Quantum error correction addresses this problem by encoding each logical qubit across many physical ones, but it comes at a cost: many of the operations required for a general-purpose or “universal” quantum computer become highly resource intensive once fault-tolerant error correction is introduced. To address this resource challenge, researchers at the University of California, Davis, US have developed a classical simulation method that efficiently models the preparation of some of the most demanding quantum states. The method, which they describe in PRX Quantum, works even for large, high-fidelity protocols that were previously beyond reach. Building a universal quantum computer Logical operations in fault-tolerant (that is, error-corrected) quantum computing architectures fall into two broad categories. The first category is a set of operations known as Clifford gates that are relatively straightforward to implement and, importantly, can be simulated efficiently on a classical computer. By themselves, however, Clifford gates are not computationally universal. For that, you also need non-Clifford operations, which lie outside the set of classically-simulable gates and provide the missing ingredient for universal quantum computation. To realize these non-Clifford operations in a fault-tolerant way, some qubits need to be in a special state known as a magic state. Preparing these magic states with sufficiently h

Physics World QuantumLoading...0
The International Workshop on Quantum Computing, Privacy and Securityquantum-computing

The International Workshop on Quantum Computing, Privacy and Security

The International Workshop on Quantum Computing, Privacy and Security Acronym: IWQPS2026Dates: Tuesday, September 22, 2026 to Friday, September 25, 2026Web page: The International Workshop on Quantum Computing, Privacy and Security (IWQPS2026)Registration deadline: Tuesday, September 1, 2026Submission deadline: Tuesday, August 25, 2026Tags: quantum machine learningquantum computingcybersecurityQuantum computing is expected to significantly reshape the landscape of secure computing and software and network infrastructures. As quantum technologies continue to evolve, traditional security approaches and software design paradigms face new challenges, requiring the development of quantum-aware architectures and resilient software systems. This workshop aims to explore the intersection of quantum computing with privacy and security. It will provide a forum for researchers and practitioners to discuss how emerging quantum technologies, including quantum algorithms, quantum communication protocols, and quantum machine learning, can influence the design and deployment of software systems. Topics of interest include full and hybrid classical–quantum software architectures, quantum-aware security mechanisms and programming models for quantum-enabled platforms. The workshop will also examine how quantum technologies can be integrated into modern computing environments such as cloud infrastructures, distributed systems, and large-scale networked platforms. By bringing together experts from quantum computing, software engineering, artificial intelligence, data science and cybersecurity, the workshop aims to foster interdisciplinary collaboration and identify emerging research challenges and opportunities for building secure, scalable, and intelligent distributed software architectures in the quantum era. We invite submissions describing original research, position papers, or case studies related to the intersection of quantum computing privacy and se

QuantikiLoading...0
MIT Cuts Non-Local Operations in Distributed Quantum Circuitsquantum-computing

MIT Cuts Non-Local Operations in Distributed Quantum Circuits

Tuomas Laakkonen of Finland Ltd. Optimising circuits for distributed quantum architectures has largely focused on qubit and gate placement via teleportation. An asymptotically optimal synthesis method for distributed CNOT and Clifford circuits now minimizes non-local operations regardless of connectivity restrictions. This is achieved by implementing CNOT circuits in a CSS code, encoding n logical qubits in k blocks using O(nk) inter-block transversal CNOTs and intra-block Pauli measurements. A new technique simplifies quantum calculations across multiple, smaller quantum processors. The method concentrates on reducing the need for communication between processors, a key limitation in building larger quantum computers. By optimising how operations are distributed, the approach represents progress towards scalable and dependable quantum technology. The team’s method uses a specific type of circuit, encoding information in blocks and minimising connections between them via transversal CNOT gates and Pauli measurements. A new method simplifies quantum computations performed across multiple, smaller quantum processors. This approach tackles a key challenge: minimising the communication needed between processors, a major hurdle in building larger, more powerful quantum computers. The team’s technique focuses on optimising how operations are distributed, representing a step forward for scalable and reliable quantum technology. A vital element of this work is understanding how a CNOT circuit, a fundamental building block of quantum algorithms, can be efficiently managed. They achieve this by encoding information in blocks, using transversal CNOT gates to efficiently move information between these blocks, and employing Pauli measurements. The following sections detail how this method achieves asymptotically optimal results and minimises non-local operations. Reduced inter-block communication streamlines large-scale quantum error correction circuits Scientists at MIT, collab

Quantum ZeitgeistLoading...0
Virginia Team Measures 3dB Squeezing on a Photonic Chipquantum-computing

Virginia Team Measures 3dB Squeezing on a Photonic Chip

Integrating the generation and measurement of squeezed light onto a single photonic chip previously presented a key challenge due to conflicting material requirements. Haoran Chen of the University of Virginia and colleagues have, for the first time, fully integrated squeezed light generation, routing, and balanced homodyne detection on a single chip using heterogeneous integration. This novel chip design overcomes a longstanding obstacle in quantum photonics by combining light generation and detection. Squeezed light, which enhances precision in measurements, demands materials that both preserve quantum properties and efficiently absorb light for detection; these needs previously required separate components. The design uses a silicon nitride chip combining a light-generating microcavity with photodiodes, achieving approximately 3 decibels of squeezing across 34 quantum modes. Squeezed light, a special state of light where the uncertainty in one property is reduced to enhance measurement sensitivity, is vital for applications like quantum sensing and advanced information processing. Creating and measuring squeezed light previously required separate components due to conflicting material needs; generating it demands materials that preserve quantum properties, while detecting it requires efficient light absorption. This integrated system provides a scalable architecture for quantum technologies, but questions remain regarding the long-term stability and potential for scaling up the number of entangled modes. Integrated quantum microcomb achieves scalable 3 dB squeezing of light Squeezed light measurements now demonstrate 3 dB of squeezing across a two-mode quantum microcomb comprising 34 quantum modes, a substantial improvement over previous systems. Previously, achieving this level of squeezing necessitated a trade-off between preserving delicate quantum states and efficiently detecting photons, limiting scalability. The integrated photonic chip, fabricated using he

Quantum ZeitgeistLoading...0
Researchers Build Integrated Waveguide for Ion Trapsquantum-computing

Researchers Build Integrated Waveguide for Ion Traps

Until now, delivering light to trapped ions required complex free-space optics that become impractical as the number of qubits increases. Now, the researchers have developed an ion-trap platform on borosilicate glass with an integrated femtosecond-laser-written waveguide for on-chip light delivery. This system achieves low-loss curved waveguides down to a radius of curvature of 6mm, and successfully demonstrated trapping, ion shuttling, and coherent operations using 729nm light guided through the integrated waveguide. Researchers have engineered a new ion trap using glass channels to deliver light to individual, electrically charged atoms, known as ions. This system uses femtosecond-laser-written waveguides, tiny pathways created with a laser, integrated directly into the trap’s structure; this separates the light delivery from the electrical controls. The design allows for curved light paths and is compatible with standard manufacturing processes, offering a potential route to building more complex quantum computing devices. Researchers have created a new platform for quantum computing using electrically charged atoms, or ions, held in place by electric fields, a microscopic holding pen for single atoms. Current systems rely on bulky free-space optics to deliver the light needed to control these ions, a method that becomes increasingly difficult as the number of qubits grows. The team’s innovation integrates light delivery directly into the ion trap using microscopic glass tunnels, created with incredibly short pulses of laser light, that guide light like fibre optics. This approach physically separates the light paths from the electrical controls, enabling curved light delivery and compatibility with existing manufacturing techniques. Reduced waveguide curvature facilitates miniaturised ion trap optical circuits Low-loss curved waveguides now operate at radii down to 6mm, previously limited to 8mm, a key threshold for miniaturising complex optical circuits within

Quantum ZeitgeistLoading...0
Researchers Verify and Repair Quantum Ancilla Safety Efficientlyquantum-computing

Researchers Verify and Repair Quantum Ancilla Safety Efficiently

A new framework addresses quantum compilation challenges, utilising ancilla qubits to implement complex operations with fewer gates and reduced depth. Formal verification of this property is computationally key due to state-space explosion with increasing qubit numbers, especially for dirty ancillae which carry unknown initial states and require restoration after use. Jiqi Li of the University of Edinburgh and colleagues propose an end-to-end verification-and-repair framework that rigorously addresses both clean and dirty ancilla safety. Their core contribution is a two-step reduction strategy; they first prove that verifying an m-qubit dirty ancilla register decomposes into 2m independent clean ancilla safety checks, subsequently reducing each clean ancilla safety check. Efficient ancilla verification enables quantum circuits exceeding two thousand qubits Scalability to over two thousand qubits is now possible thanks to a new verification-and-repair framework for ancilla safety in quantum circuits, a strong improvement over prior methods that struggled with even a fraction of this scale. This reduction to algebraic commutativity tests against Pauli-Z and Pauli-X operators enables efficient, parallel verification and actionable diagnosis of errors, classifying them as either logic or phase errors. The significance of this lies in the exponential growth of computational complexity with qubit number; traditional verification methods quickly become intractable as circuit size increases, hindering the development of larger, more powerful quantum computers. Lightweight repair routines, involving single-qubit rotations, were then applied to correct a broad class of local ancilla faults, maintaining circuit functionality in the tested circuits, including benchmarks and Grover’s algorithm. These single-qubit rotations are carefully calibrated to reverse the effects of identified errors without disrupting the overall quantum computation. The application to established benchm

Quantum ZeitgeistLoading...0
Efforts Support Quantum Science Education, Addressing Obstacles for Two US Statesquantum-computing

Efforts Support Quantum Science Education, Addressing Obstacles for Two US States

By 2030, a quantum computer capable of breaking today’s digital encryption is projected to exist, leading Indiana University to launch a “Pathways Plus” program. The initiative introduces Quantum Information Science and Quantum Computing through dual credit courses for high-school and incoming college students. The program addresses a key shortage of skilled professionals, using a set of tools like quantum virtual labs and ZX calculus to visualise complex quantum concepts. Indiana University are pioneering a program to address a growing skills gap in quantum information science and computing. Currently, only a limited number of US states include these topics in secondary school curricula, however, the convergence of artificial intelligence and quantum computing necessitates a broader understanding of these fields. The initiative uses tools like quantum virtual labs and ZX calculus, a visual language for quantum processes, to make complex concepts accessible to students. Dan-Adrian German and colleagues at Indiana University are preparing students for a future profoundly shaped by quantum computing. With predictions suggesting a quantum computer capable of breaking current encryption could exist by 2030, a new approach to cybersecurity education is vital. The team is launching a “Pathways Plus” program to introduce Quantum Information Science and Quantum Computing to high school and undergraduate students. This initiative addresses a key shortage of skilled professionals, utilising new tools to demystify complex concepts; ZX calculus, for example, is a visual language for describing quantum circuits, much like electrical engineers use circuit diagrams to represent electrical systems. Currently, only a handful of US states incorporate these topics into secondary education, but the increasing convergence of artificial intelligence and quantum computing demands a wider understanding. Diagrammatic reasoning with ZX calculus simplifies quantum information education ZX cal

Quantum ZeitgeistLoading...0
Algorithms Require at Least N Rounds to Colour Cycles with Quantum Computersquantum-computing

Algorithms Require at Least N Rounds to Colour Cycles with Quantum Computers

A new lower bound demonstrates that any distributed quantum algorithm solving a 3-coloring problem on a cycle of computers with probability 1 requires Ω(n) communication rounds. Xavier Coiteux-Roy of the University of Waterloo and colleagues have shown that quantum computers offer no speed advantage when solving the 3-coloring of a cycle, a network where computers are connected in a closed loop. The team’s findings isolate quantum computational power, as they do not rely on previous assumptions about the fundamental limits of information transfer. Xavier Coiteux-Roy and colleagues developed a new method to differentiate between computational processes achievable classically and those requiring quantum mechanics. This establishes a definitive limit on the power of quantum computers when tackling the 3-coloring of a cycle. The problem is akin to assigning one of three colours to each node in a ring so that no adjacent nodes share the same colour, a puzzle that becomes increasingly difficult as the ring grows larger. The team proved that any team of quantum computers working together to solve this problem, each communicating with its neighbours, requires at least a number of communication rounds proportional to the number of computers in the network to guarantee a correct solution. Previously, limitations on quantum computation relied on arguments about information transfer, but these could not rule out advantages for this particular problem; this work establishes a “genuinely quantum” lower bound. Symmetry breaking and wishful teleportation reveal limits to quantum algorithm efficiency Karol Bartkiewicz of the University of Warsaw and colleagues at the Centre for Quantum Technologies of Singapore, developed a technique to dissect quantum algorithms and reveal hidden limitations. Their work establishes that a single-round quantum process cannot reliably break symmetry, a key step in colouring the cycle. This initial finding enabled the construction of a “wishful telepo

Quantum ZeitgeistLoading...0
Researchers Limit Decoder Costs for Faster Fault-Tolerant Computationquantum-computing

Researchers Limit Decoder Costs for Faster Fault-Tolerant Computation

Fault-tolerant quantum computation using surface codes previously required syndrome extraction rounds proportional to code distance, denoted as O(d), between logical operations. Shota Ikari from RIKEN and colleagues have created PACE, a decoder-aware scheduling framework for transversal CNOT gates which reduces this requirement to O, accelerating computation for platforms with long-range connectivity. This advancement mitigates increased classical decoding workload through techniques including hybrid window decoding, in-time DEM compilation, and sub-window parallel decoding. PACE is a new framework designed to tackle the substantial computational demands of error correction in functional quantum computers. While advances in quantum gate techniques offer potential for faster calculations, they simultaneously increase the workload for conventional computers verifying the results. PACE optimises this verification process, ensuring that gains in quantum speed are not hampered by limitations in decoding ability. Shota Ikari from RIKEN and colleagues have unveiled PACE, addressing a key bottleneck in quantum computing: increasing demands on classical computers verifying quantum calculations. Improvements in quantum gate technology promise faster processing but also burden systems responsible for checking results for errors. The surface code relies on repeatedly checking relationships between qubits, known as syndrome extraction, to identify and correct errors; this is akin to taking a medical scan without disturbing the patient. However, denser scheduling of operations expands the area needing verification, potentially overwhelming existing capabilities. This expansion arises because each transversal CNOT (TCNOT) gate introduces potential error propagation across multiple physical qubits within the encoded logical qubit. PACE optimises this verification process, mitigating challenges of increased computational load and just-in-time error mapping, detailed prediction of po

Quantum ZeitgeistLoading...0

Related Topics

Quantum AnnealingQuantum Finance BankingQuantum Cloud ServicesQuantum Software Development