← Latest papers
⚛️ quantum physics

Certifying bipartite entanglement on a superconducting processor from a corrected QAOA cost layer

This study demonstrates the successful certification of bipartite entanglement in a corrected QAOA cost layer on a nine-qubit superconducting processor through rigorous tomographic negativity and causal manipulation of device physics, while confirming that the algorithm yields no optimization advantage on classically trivial instances at greater depths.

Original authors: Carlos-Miguel Lorenzo

Published 2026-09-10
📖 6 min read🧠 Deep dive

Original authors: Carlos-Miguel Lorenzo

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

In the race to build useful quantum computers, scientists are currently working with machines that are powerful but fragile. These devices, often called noisy intermediate-scale quantum processors, are made of superconducting circuits that can hold information in a state called superposition, where a bit can be both zero and one at the same time. The real magic, however, happens when two or more of these bits become linked in a phenomenon known as entanglement. When particles are entangled, the state of one instantly influences the state of the other, no matter how far apart they are. This connection is the engine that drives quantum algorithms, allowing them to solve certain problems much faster than classical computers ever could. But because these machines are so sensitive to their environment, the links between particles often break or become weak before the computer can finish its work. A major question for the field has been whether the complex circuits researchers design actually create this special link on real hardware, or if the machine is simply failing in a way that looks like success.

A new study from a research team at CUNEF University in Madrid, working on a superconducting processor at the Barcelona Supercomputing Center, provides a definitive answer to that question for a specific setup. The researchers tested a standard quantum algorithm designed to solve optimization problems, which involves arranging a series of operations to find the best solution among many possibilities. They focused on a single layer of this algorithm, a step meant to create a link between two specific qubits. Instead of just checking if the computer gave a good answer, they performed a deep, forensic examination of the machine's output. They reconstructed the exact state of the two qubits after the operation and measured a specific property that proves they were truly entangled. The result was clear: on a well-functioning connection within the chip, the machine did create genuine entanglement. The strength of this link was measured at a value of 0.077, a number that, while small, was statistically significant and confirmed to be real across six different days of testing. Crucially, when they turned off the connection between the qubits, the entanglement vanished completely, proving that the link was not an artifact of the machine's background noise or a trick of the measurement.

The study goes further by showing exactly what controls this fragile link. The researchers treated the machine like a laboratory instrument they could tune, rather than a black box. They deliberately adjusted the strength of the electrical pulse used to create the connection between the qubits. By lowering the amplitude of this pulse, they observed a direct, causal drop in the strength of the entanglement. This confirmed that the physical drive of the machine, not just the abstract design of the code, was the deciding factor. However, they also discovered that this relationship is not a simple straight line that goes on forever. The connection strength peaks at a specific point and then begins to drop if the pulse is pushed too hard, much like a radio signal that gets clearer up to a point and then distorts if the volume is turned up too high. This nuance is vital because it shows that simply increasing the power of the machine does not guarantee better results; the control must be precise.

Perhaps the most important finding of the paper is what happens when the researchers try to make the algorithm deeper and more complex. In the world of quantum computing, adding more layers to an algorithm is often seen as a way to get closer to the perfect answer. In this study, however, the researchers found that adding just two more layers to their circuit caused the entanglement to disappear entirely. The link that was strong at the first step collapsed to zero by the third step, even though the theoretical design suggested it should still be there. This collapse happened so quickly that the machine could not sustain the complex circuit. The team also tested a larger group of problems at this deeper level and found no sign of the computer solving them better than random chance. They were careful to state that the problems they chose were actually very simple and could be solved instantly by a standard computer, so there was no claim of a speed advantage. The value of the work lies not in solving a hard problem, but in rigorously proving what the machine can and cannot do.

The researchers also addressed a common pitfall in the field: the risk that a computer might appear to work because of a mistake in how the instructions were written. They discovered a flaw in a previous attempt where the code they used accidentally canceled out the very connection they were trying to build. To prevent this from happening again, they built a safety check into their process that verifies the instructions are correct before the machine even starts running. They also compared their results to a simpler method of checking for entanglement that is faster but less precise. They found that while this faster method gave a hint that entanglement was present, it was not strong enough to prove it with certainty on this specific machine. This honest assessment of the limits of different measurement tools is a key part of their contribution.

Ultimately, this paper serves as a rigorous report card for a single quantum processor. It confirms that the machine can create the essential quantum link when the conditions are right and the circuit is simple. It proves that this link is controlled by the physical pulses sent to the chip and that it vanishes if those pulses are too weak or if the circuit becomes too deep for the machine to handle. By ruling out errors in the code, showing the direct cause-and-effect of the controls, and admitting where the machine fails, the study offers a clear, unvarnished picture of the current state of quantum hardware. It shows that while the technology is capable of the fundamental physics required for quantum computing, it is still very far from being able to run the complex, multi-step programs needed for practical advantage. The work stands as a model for how to measure and report on these machines, prioritizing proof and transparency over hype.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →