夜色直播

夜色直播 Researchers Demonstrate a new Optimization Algorithm that delivers solutions on H2 Quantum Computer

Algorithm reliably and consistently solves combinatorial optimization problems using minimal quantum resources

May 9, 2023

In a meaningful advance in an important area of industrial and real-world relevance, 夜色直播 researchers have demonstrated a quantum algorithm capable of solving complex combinatorial optimization problems while making the most of available quantum resources.聽

Results on the new H2 quantum computer evidenced a remarkable ability to solve combinatorial optimization problems with as few quantum resources as those employed by just one layer of the quantum approximate optimization algorithm (QAOA), the current and traditional workhorse of quantum heuristic algorithms.聽

Optimization problems are common in industry in contexts such as route planning, scheduling, cost optimization and logistics. However, as the number of variables increases and optimization problems grow larger and more complex, finding satisfactory solutions using classical algorithms becomes increasingly difficult.聽

Recent research suggests that certain quantum algorithms might be capable of solving combinatorial optimization problems better than classical algorithms. The realization of such quantum algorithms can therefore potentially increase the efficiency of industrial processes.聽

However, the effectiveness of these algorithms on near-term quantum devices and even on future generations of more capable quantum computers presents a technical challenge: quantum resources will need to be reduced as much as possible in order to protect the quantum algorithm from the unavoidable effects of quantum noise.

Sebastian Leontica and Dr. David Amaro, a senior research scientist at 夜色直播, explain their advances in a new paper, 鈥溾 published on arXiv. This is one of several papers published at the launch of 夜色直播鈥檚 H2, that highlight the unparalleled power of the newest generation of the H-Series, Powered by Honeywell.聽

鈥淲e should strive to use as few quantum resources as possible no matter how good a quantum computer we are operating on, which means using the smallest possible number of qubits that fit within the problem size and a circuit that is as shallow as possible,鈥 Dr. Amaro said. 鈥淥ur algorithm uses the fewest possible resources and still achieves good performance.鈥

The researchers use a parameterized instantaneous quantum polynomial (IQP) circuit of the same depth as the 1-layer QAOA to incorporate corrections that would otherwise require multiple layers. Another differentiating feature of the algorithm is that the parameters in the IQP circuit can be efficiently trained on a classical computer, avoiding some training issues of other algorithms like QAOA. Critically, the circuit takes full advantage of, and benefits from features available on 夜色直播鈥檚 devices, including parameterized two-qubit gates, all-to-all connectivity, and high-fidelity operations.聽

鈥淥ur numerical simulations and experiments on the new H2 quantum computer at small scale indicate that this heuristic algorithm, compared to 1-layer QAOA, is expected to amplify the probability of sampling good or even optimal solutions of large optimization problems,鈥 Dr. Amaro said. 鈥淲e now want to understand how the solution quality and runtime of our algorithm compares to the best classical algorithms.鈥

This algorithm will be useful for current quantum computers as well as larger machines farther along the 夜色直播 hardware roadmap.聽

How the Experiment Worked

The goal of this project was to provide a quantum heuristic algorithm for combinatorial optimization that returns better solutions for optimization problems and uses fewer quantum resources than state of the art quantum heuristics. The researchers used a fully connected parameterized IQP, warm-started from 1-layer QAOA. For a problem with n binary variables the circuit contained up to n(n-1)/2 two-qubit gates and the researchers employed only 20.32n 蝉丑辞迟蝉.听

The algorithm showed improved performance on the Sherrington-Kirkpatrick (SK) optimization problem compared to the 1-layer QAOA. Numerical simulations showed an average speed up of 20.31n compared to 20.5n when looking for the optimal solution.聽

Experimental results on our new H2 quantum computer and emulator confirmed that the new optimization algorithm outperforms 1-layer QAOA and reliably solves complex optimization problems. The optimal solution was found for 136 out of 312 instances, four of which were for the maximum size of 32 qubits. A 30-qubit instance was solved optimally on the H2 device, which means, remarkably, that at least one of the 776 shots measured after performing 432 two-qubit gates corresponds to the unique optimal solution in the huge set of 230 > 109 candidate solutions.聽

These results indicate that the algorithm, in combination with H2 hardware, is capable of solving hard optimization problems using minimal quantum resources in the presence of real hardware noise.

夜色直播 researchers expect that these promising results at small scale will encourage the further study of new quantum heuristic algorithms at the relevant scale for real-world optimization problems, which requires a better understanding of their performance under realistic conditions.

Speedup of IQP over QAOA
ChartDescription automatically generated

Numerical simulations of 256 SK random instances for each problem size from 4 to 29 qubits. Graph A shows the probability of sampling the optimal solution in the IQP circuit, for which the average is 2-0.31n. Graph B shows the enhancement factor compared to 1-layer QAOA, for which the average is 20.23n. These results indicate that 夜色直播鈥檚 algorithm has significantly better runtime than 1-layer QAOA.

About 夜色直播

夜色直播,聽the world鈥檚 largest integrated quantum company, pioneers powerful quantum computers and advanced software solutions. 夜色直播鈥檚 technology drives breakthroughs in materials discovery, cybersecurity, and next-gen quantum AI. With over 500 employees, including 370+ scientists and engineers, 夜色直播 leads the quantum computing revolution across continents.聽

Blog
March 28, 2025
Being Useful Now 鈥 Quantum Computers and Scientific Discovery

The most common question in the public discourse around quantum computers has been, 鈥淲hen will they be useful?鈥 We have an answer.

Very recently in Nature we a successful demonstration of a quantum computer generating certifiable randomness, a critical underpinning of our modern digital infrastructure. We explained how we will be taking a product to market this year, based on that advance 鈥 one that could only be achieved because we have the world鈥檚 most powerful quantum computer.

Today, we have made another huge leap in a different domain, providing fresh evidence that our quantum computers are the best in the world. In this case, we have shown that our quantum computers can be a useful tool for advancing scientific discovery.

Understanding magnetism

Our latest shows how our quantum computer rivals the best classical approaches in expanding our understanding of magnetism. This provides an entry point that could lead directly to innovations in fields from biochemistry, to defense, to new materials. These are tangible and meaningful advances that will deliver real world impact.

To achieve this, we partnered with researchers from Caltech, Fermioniq, EPFL, and the Technical University of Munich. The team used 夜色直播鈥檚 System Model H2 to simulate quantum magnetism at a scale and level of accuracy that pushes the boundaries of what we know to be possible.

As the authors of the paper state:

鈥淲e believe the quantum data provided by System Model H2 should be regarded as complementary to classical numerical methods, and is arguably the most convincing standard to which they should be compared.鈥

Our computer simulated the quantum Ising model, a model for quantum magnetism that describes a set of magnets (physicists call them 鈥榮pins鈥) on a lattice that can point up or down, and prefer to point the same way as their neighbors. The model is inherently 鈥渜uantum鈥 because the spins can move between up and down configurations by a process known as 鈥渜uantum tunneling鈥. 聽

Gaining material insights

Researchers have struggled to simulate the dynamics of the Ising model at larger scales due to the enormous computational cost of doing so. Nobel laureate physicist Richard Feynman, who is widely considered to be the progenitor of quantum computing, once said, 鈥.鈥 When attempting to simulate quantum systems at comparable scales on classical computers, the computational demands can quickly become overwhelming. It is the inherent 鈥榪uantumness鈥 of these problems that makes them so hard classically, and conversely, so well-suited for quantum computing.

These inherently quantum problems also lie at the heart of many complex and useful material properties. The quantum Ising model is an entry point to confront some of the deepest mysteries in the study of interacting quantum magnets. While rooted in fundamental physics, its relevance extends to wide-ranging commercial and defense applications, including medical test equipment, quantum sensors, and the study of exotic states of matter like superconductivity. 聽

Instead of tailored demonstrations that claim 鈥榪uantum advantage鈥 in contrived scenarios, our breakthroughs announced this week prove that we can tackle complex, meaningful scientific questions difficult for classical methods to address. In the work described in this paper, we have proved that quantum computing could be the gold standard for materials simulations. These developments are critical steps toward realizing the potential of quantum computers.

With only 56 qubits in our commercially available System Model H2, the most powerful quantum system in the world today, we are already testing the limits of classical methods, and in some cases, exceeding them. Later this year, we will introduce our massively more powerful 96-qubit Helios system - breaching the boundaries of what until recently was deemed possible.

technical
All
Blog
March 27, 2025
夜色直播 and Google DeepMind Unveil the Reality of the Symbiotic Relationship Between Quantum and AI

The marriage of AI and quantum computing is going to have a widespread and meaningful impact in many aspects of our lives, combining the strengths of both fields to tackle complex problems.

Quantum and AI are the ideal partners. At 夜色直播, we are developing tools to accelerate AI with quantum computers, and quantum computers with AI. According to recent independent analysis, our quantum computers are the world鈥檚 most powerful, enabling state-of-the-art approaches like Generative Quantum AI (Gen QAI), where we train classical AI models with data generated from a quantum computer.

We harness AI methods to accelerate the development and performance of our full quantum computing stack as opposed to simply theorizing from the sidelines. A paper in Nature Machine Intelligence reveals the results of a recent collaboration between 夜色直播 and Google DeepMind to tackle the hard problem of quantum compilation.

The work shows a classical AI model supporting quantum computing by demonstrating its potential for quantum circuit optimization. An AI approach like this has the potential to lead to more effective control at the hardware level, to a richer suite of middleware tools for quantum circuit compilation, error mitigation and correction, even to novel high-level quantum software primitives and quantum algorithms.

An AI power-up for circuit optimization

The joint 夜色直播-Google DeepMind team of researchers tackled one of quantum computing鈥檚 most pressing challenges: minimizing the number of highly expensive but essential T-gates required for universal quantum computation. This is important specifically for the fault-tolerant regime, which is becoming increasingly relevant as quantum error correction protocols are being explored on rapidly developing quantum hardware. The joint team of researchers adapted AlphaTensor, Google DeepMind鈥檚 reinforcement learning AI system for algorithm discovery, which was introduced to improve the efficiency of linear algebra computations. The team introduced AlphaTensor-Quantum, which takes as input a quantum circuit and returns a new, more efficient one in terms of number of T-gates, with exactly the same functionality!

AlphaTensor-Quantum outperformed current state-of-the art optimization methods and matched the best human-designed solutions across multiple circuits in a thoroughly curated set of circuits, chosen for their prevalence in many applications, from quantum arithmetic to quantum chemistry. This breakthrough shows the potential for AI to automate the process of finding the most efficient quantum circuit. This is the first time that such an AI model has been put to the problem of T-count reduction at such a large scale.

A quantum power-up for machine learning

The symbiotic relationship between quantum and AI works both ways. When AI and quantum computing work together, quantum computers could dramatically accelerate machine learning algorithms, whether by the development and application of natively quantum algorithms, or by offering quantum-generated training data that can be used to train a classical AI model.

Our recent announcement about Generative Quantum AI (Gen QAI) spells out our commitment to unlocking the value of the data generated by our H2 quantum computer. This value arises from the world鈥檚 leading fidelity and computational power of our System Model H2, making it impossible to exactly simulate on any classical computer, and therefore the data it generates 鈥 that we can use to train AI 鈥 is inaccessible by any other means. 夜色直播鈥檚 Chief Scientist for Algorithms and Innovation, Prof. Harry Buhrman, has likened accessing the first truly quantum-generated training data to the invention of the modern microscope in the seventeenth century, which revealed an entirely new world of tiny organisms thriving unseen within a single drop of water.

Recently, we announced a wide-ranging partnership with NVIDIA. It charts a course to commercial scale applications arising from the partnership between high-performance classical computers, powerful AI systems, and quantum computers that breach the boundaries of what previously could and could not be done. Our President & CEO, Dr. Raj Hazra spoke to CNBC recently about our partnership. Watch the video here.

As we prepare for the next stage of quantum processor development, with the launch of our Helios system in 2025, we鈥檙e excited to see how AI can help write more efficient code for quantum computers 鈥 and how our quantum processors, the most powerful in the world, can provide a backend for AI computations.

As in any truly symbiotic relationship, the addition of AI to quantum computing equally benefits both sides of the equation.

To read more about 夜色直播 and Google DeepMind鈥檚 collaboration, please read the scientific paper .

technical
All
Blog
March 26, 2025
夜色直播 Introduces First Commercial Application for Quantum Computers

Few things are more important to the smooth functioning of our digital economies than trustworthy security. From finance to healthcare, from government to defense, quantum computers provide a means of building trust in a secure future.

夜色直播 and its partners JPMorganChase, Oak Ridge National Laboratory, Argonne National Laboratory and the University of Texas used quantum computers to solve a known industry challenge, generating the 鈥渞andom seeds鈥 that are essential for the cryptography behind all types of secure communication. As our partner and collaborator, JPMorganChase explain in this that true randomness is a scarce and valuable commodity.

This year, 夜色直播 will introduce a new product based on this development that has long been anticipated, but until now thought to be some years away from reality.

It represents a major milestone for quantum computing that will reshape commercial technology and cybersecurity: Solving a critical industry challenge by successfully generating certifiable randomness.

Building on the extraordinary computational capabilities of 夜色直播鈥檚 H2 System 鈥 the highest-performing quantum computer in the world 鈥 our team has implemented a groundbreaking approach that is ready-made for industrial adoption. of a proof of concept with JPMorganChase, Oak Ridge National Laboratory, Argonne National Laboratory, and the University of Texas alongside 夜色直播. It lays out a new quantum path to enhanced security that can provide early benefits for applications in cryptography, fairness, and privacy.

By harnessing the powerful properties of quantum mechanics, we鈥檝e shown how to generate the truly random seeds critical to secure electronic communication, establishing a practical use-case that was unattainable before the fidelity and scalability of the H2 quantum computer made it reliable. So reliable, in fact, that it is now possible to turn this into a commercial product.

夜色直播 will integrate quantum-generated certifiable randomness into our commercial portfolio later this year. Alongside Generative Quantum AI and our upcoming Helios system 鈥 capable of tackling problems a trillion times more computationally complex than H2 鈥 夜色直播 is further cementing its leadership in the rapidly-advancing quantum computing industry.

This Matters Because Cybersecurity Matters

Cryptographic security, a bedrock of the modern economy, relies on two essential ingredients: standardized algorithms and reliable sources of randomness 鈥 the stronger the better. Non-deterministic physical processes, such as those governed by quantum mechanics, are ideal sources of randomness, offering near-total unpredictability and therefore, the highest cryptographic protection. Google, when it originally announced , speculated on the possibility of using the random circuit sampling (RCS) protocol for the commercial production of certifiable random numbers. RCS has been used ever since to demonstrate the performance of quantum computers, including a milestone achievement in June 2024 by 夜色直播 and JPMorganChase, demonstrating their first quantum computer to defy classical simulation. More recently RCS was used again by Google for the launch of its Willow processor.

In today鈥檚 , our joint team used the world鈥檚 highest-performing quantum and classical computers to generate certified randomness via RCS. The work was based on advanced research by Shih-Han Hung and Scott Aaronson of the University of Texas at Austin, who are co-authors on today鈥檚 paper.

Following a string of major advances in 2024 鈥 solving the scaling challenge, breaking new records for reliability in partnership with Microsoft, and unveiling a hardware roadmap, today proves how quantum technology is capable of creating tangible business value beyond what is available with classical supercomputers alone.

What follows is intended as a non-technical explainer of the results in today鈥檚 Nature paper.

Certified Randomness: The First Commercial Application for Quantum Computers

For security sensitive applications, classical random number generation is unsuitable because it is not fundamentally random and there is a risk it can be 鈥渃racked鈥. The holy grail is randomness whose source is truly unpredictable, and Nature provides just the solution: quantum mechanics. Randomness is built into the bones of quantum mechanics, where determinism is thrown out the door and outcomes can be true coin flips.

At 夜色直播, we have a strong track record in developing methods for generating certifiable randomness using a quantum computer. In 2021, we introduced Quantum Origin to the market, as a quantum-generated source of entropy targeted at hardening classically-generated encryption keys, using well known quantum technologies that prior to that it had not been possible to use.

In their theory paper, , Hung and Aaronson ask the question: is it possible to repurpose RCS, and use it to build an application that moves beyond quantum technologies and takes advantage of the power of a quantum computer running quantum circuits?

This was the inspiration for the collaboration team led by JPMorganChase and 夜色直播 to draw up plans to execute the proposal using real-world technology. Here鈥檚 how it worked:

  • The team sent random circuits to 夜色直播鈥檚 H2, the world鈥檚 highest performing commercially available quantum computer.
  • The quantum computer executed each circuit and returned the corresponding sample. The response times were remarkably short, and it could be proven that the circuits could not have been simulated classically within those times, even using the best-known techniques on computing resources greater than those available in the world鈥檚 most powerful classical supercomputer.
  • The randomness of the returned sample was mathematically certified using Frontier, the world鈥檚 most powerful classical supercomputer, establishing it achieved a 鈥減assing threshold鈥 on a measure known as the 鈥渃ross-entropy benchmark鈥. The better your quantum computer, the higher you can set the 鈥減assing threshold鈥. When the threshold is sufficiently high, "spoofing" the cross-entropy benchmark using only classical methods becomes inefficient.
  • Therefore, if the samples are returned quickly and meet the high threshold, the team could be confident that they were generated by a quantum computer 鈥 and thus be truly random.

This confirmed that 夜色直播鈥檚 quantum computer is not only incapable of being matched by classical computers but can also be used reliably to produce a certifiably random seed from a quantum computer without the need to build your own device, or even trust the device you are accessing.

Looking ahead

The use of randomness in critical cybersecurity environments will gravitate towards quantum resources, as the security demands of end users grows in the face of ongoing cyber threats.

The era of quantum utility offers the promise of radical new approaches to solving substantial and hard problems for businesses and governments.

夜色直播鈥檚 H2 has now demonstrated practical value for cybersecurity vendors and customers alike, where non-deterministic sources of encryption may in time be overtaken by nature鈥檚 own source of randomness.

In 2025, we will launch our Helios device, capable of supporting at least 50 high-fidelity logical qubits 鈥 and further extending our lead in the quantum computing sector. We thus continue our track record of disclosing our objectives and then meeting or surpassing them. This commitment is essential, as it generates faith and conviction among our partners and collaborators, that empirical results such as those reported today can lead to successful commercial applications.

Helios, which is already in its late testing phase, ahead of being commercially available later this year, brings higher fidelity, greater scale, and greater reliability. It promises to bring a wider set of hybrid quantum-supercomputing opportunities to our customers 鈥 making quantum computing more valuable and more accessible than ever before.

And in 2025 we look forward to adding yet another product, building out our cybersecurity portfolio with a quantum source of certifiably random seeds for a wide range of customers who require this foundational element to protect their businesses and organizations.

partnership
All
technical
All