Encoding is one of the first and most consequential decisions in designing a quantum program. Just as classical computers must decide how to represent integers or characters as bits, quantum algorithms must map problem variables—whether they denote colors, routes, or cluster assignments—onto the quantum states of a register. Over the past decade, researchers have adapted classical schemes such as one-hot, binary, and Gray codes to qubits, and have invented quantum-native alternatives like angle encoding, amplitude encoding, and Schmidt decomposition. Each approach embodies a trade-off between the number of qubits consumed and the complexity of the circuits needed to operate on them. One-hot encoding, in which one bit is reserved for every possible value a variable can take and exactly one of those bits is set to 1, is particularly popular because it is simple to encode, decode, and check for validity—even though it is wasteful in qubit count. A variable with four possible values, for instance, needs four qubits under one-hot rules, yielding the four allowed states 0001, 0010, 0100, and 1000.

The insight behind Multi-Unary is disarmingly simple. Instead of requiring that exactly one bit be set to 1, the scheme requires only that at least one bit be set to 1, with the single forbidden state being the all-zero string. Under this relaxation, the four-qubit register above can represent not just four values but fifteen—the full set of non-zero bit strings. Because more than one value can live in the same group of qubits, the Spanish team describes Multi-Unary as a “dense” encoding scheme, and, to their knowledge, it is the first encoding in the quantum computing literature with this property. The consequence is profound for algorithms like Grover’s: a single measured bit string can now encode several valid assignments at once, so the quantum state effectively contains and delivers multiple solutions in a single shot.

Grover’s algorithm, first proposed in 1996, searches an unstructured space of size N containing M solutions with a complexity of O(√(N/M)), a quadratic speedup over any classical method. The algorithm begins by placing the input qubits into an equal superposition of all possible states. It then applies an oracle—a quantum subroutine that recognizes valid solutions and flips their phase by π radians—followed by a diffusion operation that inverts the amplitudes about their mean, amplifying the marked states. Each oracle-plus-diffusion cycle is one Grover iteration, and the probability of measuring a solution after i iterations is given by P = sin²((2i+1)·θg), where θg = arcsin(√(M/N)). The optimal number of iterations scales as R ≤ ⌈(π/4)√(N/M)⌉. Crucially, both the success probability and the required iteration count depend on the ratio M/N: the more states qualify as solutions, the better.

This is exactly where Multi-Unary shines. By enlarging the set of bit strings that count as legitimate solutions, the scheme increases M, which the team proves mathematically raises the success probability P and lowers the required number of Grover iterations R. They derive the partial derivatives of both quantities with respect to M, showing rigorously that P grows monotonically and R shrinks monotonically over the entire operating range. The practical payoff comes in three forms: a higher chance that any given measurement yields a solution, fewer oracle calls needed to maximize that chance, and measured outputs that can bundle multiple solutions into one value, reducing the total number of circuit executions—or “shots”—needed to recover a desired fraction of all solutions.

To demonstrate the idea concretely, the researchers applied Multi-Unary to the graph coloring problem, a canonical combinatorial challenge that asks for the assignment of k colors to the nodes of a graph such that no two adjacent nodes share a color. Graph coloring matters well beyond theory—it underpins scheduling, register allocation, and resource assignment tasks—and it has become a standard benchmark for quantum algorithms, tackled previously with quantum annealing, variational approaches, and Grover-based oracles using both binary and one-hot encodings. In the Spanish team’s demonstration, a six-node, six-edge graph is colored with three colors, the minimum possible.

Their oracle design rests on quantum counters, built from multi-controlled X gates, which tally constraint violations. The logic proceeds in three steps. First, for each node, the counter is incremented if all of that node’s color qubits are zero—penalizing strings that violate the Multi-Unary rule that every variable must carry at least one value. Second, for every edge and every color, the counter is incremented if both endpoints display that same color simultaneously, penalizing genuine coloring conflicts. Third, only strings for which the counter reads zero—strings satisfying every constraint—have their phases rotated by a multi-controlled Z gate, marking them for amplification. A single ancilla qubit acts as a trigger that fires each counter increment and is uncomputed immediately afterward, while the remaining ancillas store the running count. The design also incorporates a subtle optimization: because early counter increments only touch the least significant bits of the count, the number of controls on successive increment gates can be grown gradually, trimming expensive multi-controlled gates.

The resource analysis for the example circuit is instructive. The complete oracle comprises 367 gates, of which 284 are controlled X gates—and 188 of those, fully 66.2 percent, implement the counter alone, underscoring how central counting is to this style of oracle construction. The circuit depth is 287 layers, dominated by the trigger qubit through which every increment must pass. Simulating the full circuit with 36 Grover iterations—the number that maximizes success probability—yielded a 99.88 percent chance of measuring a solution, and a histogram of 1,000 shots in Qiskit’s Aer simulator recovered 126 distinct solution values, with only two spurious non-solutions appearing once each, a rate consistent with statistical expectations.

The headline result is the sheer expansion of the solution space. Under a conventional one-hot oracle, the example graph has exactly 48 valid colorings. With Multi-Unary, the number of solution values jumps to 126—78 additional bit strings that are also valid, thanks to nodes that can carry more than one compatible color. This flexibility arises naturally in real graphs: leaf nodes and nodes with low connectivity often admit several admissible colors, and Multi-Unary lets the quantum state express that freedom directly. Decoding is straightforward: any measured variable whose bits contain more than one 1 is expanded into as many one-hot candidates as there are set bits, each assigning a single value while preserving the rest. In one worked example, the output string 011 010 001 100 010 101—where two nodes each hold two colors—unpacks into four distinct, fully valid colorings of the graph. A single measurement delivered four answers.

The authors are careful to position their contribution honestly. Binary encoding still wins on raw qubit count—a 50-node graph with 10 colors needs 200 binary-encoded input qubits versus 500 for one-hot or Multi-Unary—but binary circuits must then explicitly reject the invalid states corresponding to out-of-range values, adding gates and ancillas that Multi-Unary avoids by construction. Indeed, validity checking is where Multi-Unary beats its closest cousin outright: the only forbidden state under Multi-Unary is the all-zero string, detectable with a simple NOR gate, whereas one-hot verification requires a counter to confirm that exactly one bit is set. Because encoding and decoding work identically in both schemes, the team argues that Multi-Unary could outright replace one-hot encoding, with migration requiring changes only to the oracle’s validity-check portion—and a simpler oracle as a reward. The advantage does taper off for densely connected graphs, where fewer nodes admit multiple colors and the scheme converges back toward plain one-hot behavior.

The implications reach beyond graph coloring. The researchers point to shortest-path, graph coverage, and clustering problems as natural targets, and note that their encoding could slot into emerging frameworks like the discrete quantum intermediate representation proposed for encoding-independent optimization. For today’s noisy, resource-starved quantum hardware, where every ancilla qubit and every additional Grover iteration carries a real cost, a scheme that squeezes multiple solutions into the same qubits—and trims the iteration count as a bonus—offers a rare kind of free lunch. If quantum computing’s near-term future depends on getting the most out of every qubit, Multi-Unary suggests that sometimes the smartest move is not a new algorithm, but a new way of writing the problem down.

Rather than attempting to build one enormous quantum processor, HQAN researchers are developing modular quantum architectures. In this approach, multiple smaller quantum processing units, or QPUs, are connected so that they can operate as a coordinated system. The idea resembles the development of conventional computing, where memory, processors, storage and communication components are integrated instead of being forced into one monolithic device. For quantum computers, modularity could be especially valuable because different platforms excel at different tasks. Superconducting circuits can perform rapid operations, trapped or neutral atoms can offer long-lived quantum states and dense arrays, while optical systems can transport quantum information over distance. Connecting these technologies may provide a more realistic path to achieving quantum advantage than trying to scale a single platform indefinitely.

“The first phase of HQAN has made substantial progress in terms of both research advances and building the quantum workforce of the future,” said Brian DeMarco, an Illinois physics professor and the institute’s director and principal investigator. DeMarco said modular quantum computing was largely unexplored when the center began, but has since appeared on the technology roadmaps of major companies. He also emphasized HQAN’s regional role, highlighting its partnerships with the Chicago Quantum Exchange and its contributions to initiatives such as the Illinois Quantum Microelectronics Park. The institute brings together 45 senior researchers from six institutions, including Illinois, the University of Chicago, the University of Wisconsin–Madison, Northwestern University, Stanford University and MIT Lincoln Laboratory.

During its first five-year phase, NSF HQAN reported a series of advances spanning quantum hardware, networking, algorithms and communications. Researchers created entangled states across a four-node superconducting-circuit network, demonstrating that quantum correlations could be distributed among multiple connected modules. Entanglement is a distinctly quantum resource in which the state of one system is linked to the state of another, even when the systems are physically separated. Although entanglement cannot be used to transmit information faster than light, it is essential to distributed quantum computing, quantum sensing and secure communication. The center also achieved quantum-limited millimeter-wave-to-optical transduction using cold atoms coupled to a superconducting resonator, addressing a difficult interface problem between microwave-based processors and optical communication networks.

Other first-phase achievements focused on making modular machines controllable and useful. The team developed reconfigurable superconducting quantum-computing modules and demonstrated autonomous stabilization of remote entanglement in a network. Stabilization is critical because quantum states are fragile and easily disrupted by environmental noise, imperfect control and interactions with unwanted degrees of freedom. HQAN researchers also implemented the first algorithms on a small neutral-atom array and built atom-array modules containing more than 1,000 sites. In addition, they demonstrated a two-species neutral-atom array with gates between different atomic species and realized quantum secret sharing in a triangular superconducting modular processor. The institute says its researchers have published more than 210 peer-reviewed papers to date.

The second phase will focus on closing the gap between individual demonstrations and a complete modular quantum-computing system. Researchers plan to perform basic computational operations, known as application primitives, across modular platforms. These primitives are the building blocks from which larger applications can be assembled, including simulations, optimization routines and scientific calculations. The program will also lay foundations for software capable of coordinating distributed QPUs, including algorithms, compilers and quantum-error-correction protocols. A compiler for a modular quantum computer must do more than translate instructions into pulses: it must decide where operations should occur, how quantum states should move between modules and how communication delays and hardware differences should be managed.

Quantum error correction will be central to that effort. Quantum information is vulnerable to errors caused by decoherence, control imperfections and thermal fluctuations. Unlike classical bits, quantum bits cannot simply be copied to create backups because of the no-cloning theorem. Instead, quantum-error-correction schemes distribute information across many physical qubits so that errors can be detected and corrected without directly measuring the encoded quantum state. In a modular architecture, the problem becomes even more complicated because errors can arise not only inside individual QPUs but also in the interconnects that link them. HQAN will therefore develop improved interfaces for transmitting quantum information, while studying chip-scale integration, more energy-efficient quantum photonics and compact methods for generating entanglement between distant modules.

The renewed center will include 16 industry partners, among them Google, IBM, IonQ and Quantinuum. Their participation reflects a growing consensus across the quantum sector that useful machines will likely depend on interconnected components rather than unlimited expansion of one hardware platform. “Illinois has made a bold commitment to becoming a global leader in quantum technology,” said Rashid Bashir, dean of the Grainger College of Engineering, where NSF HQAN is hosted. Bashir said the collaboration would advance the architectures required to make quantum computing scalable and useful while strengthening the talent and innovation networks needed to support the emerging industry. Preeti Chalsani, Illinois’ chief quantum officer, described HQAN as a driver of quantum research and workforce development for the state, the Midwest and the nation.

The institute’s ambitions extend beyond laboratories and corporate partnerships. Its education programs have brought quantum science to more than 12,000 participants, including students and teachers across the United States. TeachQuantum gives educators a six-week research experience followed by a year of curriculum-development support, while Wonders of Quantum Physics brings quantum concepts into classrooms through demonstrations, hands-on activities and inquiry-based learning. HQAN also trains graduate students and postdoctoral researchers for careers in academia, national laboratories and industry. The center reports that 27 alumni have moved into high-profile industry positions, 17 have accepted faculty roles and nine have joined national laboratories, illustrating how rapidly demand is growing for specialists who understand both quantum physics and engineering.

The renewed program arrives as governments and companies compete to turn decades of fundamental research into practical quantum technologies. Brian Stone, performing the duties of NSF director, said the agency’s long-term investments in quantum science, sensing and communication had created a foundation for more focused efforts. HQAN’s next phase will attempt to transform that foundation into a coherent pathway for modular quantum computing, combining hardware, networking, software and workforce development. The institute’s researchers will work alongside a related NSF institute, the Quantum Leap Challenge Institute for Physics and Engineering of Practical Quantum Error Correction, led by Yale University. Illinois physics professor Wolfgang Pfaff, who is a member of both initiatives, will contribute expertise in superconducting quantum circuits to efforts aimed at identifying and correcting errors in real quantum systems. If the program succeeds, quantum advantage may emerge not from a single spectacular processor, but from a coordinated network of specialized machines working together.

Subject of Research: Modular quantum computing, quantum networking, quantum interconnects, quantum error correction and workforce development.

Article Title: NSF Renews Illinois-Led Quantum Institute With $37.5 Million to Build Networked Quantum Computers

Web References:
https://www.nsf.gov/news/eight-nsf-research-institutes-propel-us-quantum-science-290m
https://hqan.illinois.edu/
https://physics.illinois.edu/people/directory/profile/bdemarco
https://ece.illinois.edu/about/directory/faculty/rbashir
https://physics.illinois.edu/people/directory/profile/wpfaff

Image Credits: Brian Stauffer, University of Illinois Urbana-Champaign; The Grainger College of Engineering at the University of Illinois Urbana-Champaign.

Keywords: Quantum computing, quantum networking, modular quantum architectures, quantum processors, quantum information science, quantum error correction, superconducting circuits, neutral atoms, quantum photonics, NSF HQAN.

According to Kurian’s research, the computational abilities of both aneural organisms and neurons have been significantly underestimated when viewed solely through the lens of classical information transmission methods. Classical channels, such as ionic fluctuations and action potentials, are notably limited, achieving speeds of only around 10^3 operations per second. However, recent findings from fluorescence quantum yield experiments indicate that large networks of quantum emitters within cellular structures, particularly cytoskeletal polymers, can support superradiant states at room temperature, achieving astonishing processing speeds that range from 10^12 to 10^13 operations per second. This revelation places the computing power of life on Earth within two orders of magnitude of the Margolus-Levitin limit, a threshold for the speed of quantum computing.

Kurian’s research was published in the scholarly journal, Science Advances, highlighting the quantitative comparisons made between the computational potential of superradiant life throughout Earth’s history and that of the entire matter-dominated universe. His findings challenge the established perceptions of computational limits, suggesting that the information-processing capabilities rooted in the interactions of quantum degrees of freedom could redefine our understanding of life and intelligence in cosmic terms. The implications of these revelations extend well beyond biological systems and touch upon questions of existence and intelligence throughout the universe.

Remarkably, as part of the 2025 International Year of Quantum Science and Technology, Kurian’s insights draw upon the pioneering work of Erwin Schrödinger, the renowned physicist who proposed the foundational principles of quantum mechanics concerning the essence of life in his influential 1944 work, What is Life? By revisiting Schrödinger’s assertions through the lens of modern quantum mechanics, Kurian sets forth a new upper bound on the computational capabilities of all carbon-based life forms, encompassing an expansive timeline that spans billions of years.

A key highlight of Kurian’s research is the discovery of quantum effects operating within biological systems, which have long been assumed to exist only under much stricter conditions. Biological environments are characteristically warm and chaotic, leading to skepticism about the potential for quantum properties to manifest. Yet, Kurian’s preliminary findings indicate that quantum superradiance—an effect that enables molecules to emit photons efficiently—can persist even within living systems, particularly in the case of tryptophan networks found in various cellular complexes.

Tryptophan, an amino acid abundant in many proteins, plays a vital role in this quantum processing. Its unique ability to absorb ultraviolet light and re-emit it at longer wavelengths enables large networks of tryptophan within cytoskeletal structures to process information at unprecedented speeds. This mechanism allows eukaryotic cells to communicate and respond to stimuli in a time frame significantly faster—on the order of picoseconds—compared to traditional biochemical signaling processes, which can take milliseconds. Consequently, an entirely new dimension of understanding emerges, suggesting that life in all its forms, including unicellular organisms, engage in remarkably complex computations.

The research also raises compelling questions surrounding the nature of consciousness and intelligence as it relates to life forms devoid of neural structures. For too long, the focus on neuronal circuitry has overshadowed the computational feats of aneural entities such as bacteria, fungi, and plants, which are abundant in Earth’s biosphere and have long contributed to the planet’s computing capacity. The discovery of signatures of quantum emitters throughout the cosmos hints at a broader biological narrative and supports the notion that life may have evolved with the ability to harness quantum phenomena for information processing.

Kurian’s analysis has attracted the interest of both quantum computing researchers and astrophysicists, generating discussions about how biological systems might inform strategies to develop resilient quantum technologies capable of functioning in noisy environments. The presence of quantum effects in living organisms could inspire novel approaches to enhance computational capacities in artificial systems, leading to breakthroughs in fields such as quantum information technology and computational biology.

The implications of the research extend beyond life on Earth and into the cosmic landscape. The relationship drawn between superradiant life forms and the computational power of the observable universe invites a serious reconsideration of how we approach questions regarding extraterrestrial life and intelligence. Kurian posits that understanding the information-processing capabilities of living systems may sharpen our discernment regarding habitable exoplanets and the potential emergence of life beyond our solar system.

Moreover, Kurian’s work elucidates the intrinsic links between the fundamental laws of physics and the processes of life, promoting a paradigm shift within the biological sciences. The intersections of thermodynamics, relativity, and quantum mechanics in relation to biological systems beckon further investigations into the complexities of life and the essence of consciousness itself. His findings invite physicists and biologists alike to engage in a discourse about the very nature of existence and the potential for quantum biology to bridge the gap between disparate scientific disciplines.

As researchers delve deeper into the ramifications of Kurian’s insights, the excitement surrounding the interplay between quantum mechanics and biological processes continues to grow. The work of Kurian and the Quantum Biology Laboratory serves as a clarion call for a comprehensive examination of how life utilizes quantum properties in its functions, an avenue that may unveil new pathways for understanding the mysteries of life itself and its computational prowess.

In this evocative exploration of life and quantum mechanics, Kurian has illuminated an uncharted territory where biology meets physics. His research reinforces the notion that the intricacies of living systems harbor profound intelligence and capabilities that warrant recognition and respect. By redefining the conversation surrounding life’s computations, Kurian’s work prepares the ground for further inquiry into the complexities of nature and consciousness, suggesting that the universe may indeed be entwined with life in ways previously unimagined.

The ongoing dialogue ignited by this research promises to inspire a new generation of scientists to explore the quantum dimensions of life, fostering a spirit of interdisciplinary collaboration that could lead to revolutionary breakthroughs in our understanding of intelligence across the cosmos. As we witness these advancements, humanity stands to gain a more profound appreciation of the intricate dance between life and the fundamental laws that govern the universe, hinting at the extraordinary possibilities that lie ahead.

Subject of Research:
Article Title: Computational Capacity of Life in Relation to the Universe
News Publication Date: 28-Mar-2025
Web References:
References:
Image Credits: Quantum Biology Laboratory, Philip Kurian.
Keywords: quantum biology, computational capacity, superradiance, Schrödinger, life, quantum mechanics, tryptophan, information processing.