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.

Quantum computing represents a paradigm shift in computational sciences, leveraging the principles of quantum mechanics to enable processing capabilities far beyond those of classical computers. Unlike traditional binary computation, quantum computation employs qubits that can exist simultaneously in multiple states through superposition, profoundly enhancing computational power and efficiency. This technology paves the way for breakthroughs in complex problem-solving domains, ranging from cryptography and cybersecurity to drug discovery and sustainable energy solutions. As states race to dominate this frontier, Texas’s establishment of a high-level advisory committee underscores its commitment to maintaining competitive advantages in this fast-expanding sector.

Dr. Prevost’s role in this newly formed committee is a direct reflection of his expertise and leadership within the quantum technology sphere. UTSA President Taylor Eighmy emphasized that Dr. Prevost’s appointment not only validates his significant contributions to emerging technologies but also signifies the university’s dedication to addressing some of the most consequential scientific and technological challenges today. His leadership is expected to be instrumental in nurturing the next generation of quantum talent and reinforcing collaborative bridges between academia, industry, and government agencies.

The Texas Quantum Initiative Advisory Committee is envisioned as a multidisciplinary platform comprising experts from academia, industry, and government sectors. Their collective mandate is to design and implement a visionary roadmap that accelerates Texas’s leadership in quantum research, technology development, industry engagement, and workforce development. This strategic assembly will guide investments and policy decisions to foster a thriving quantum ecosystem within the state. Dr. Prevost’s current term on the committee extends to January 31, 2031, reflecting a long-term commitment to quantum advancement and infrastructure development.

Jennifer Potter, PhD, senior executive vice president for research and innovation at UTSA, highlights that Dr. Prevost’s selection exemplifies the growing capacity of UTSA’s research ecosystem. Through pioneering initiatives such as the Open Cloud Institute, UTSA is rigorously building a robust platform of collaborative science and technology partnerships essential for advancing quantum science. This commitment integrates cross-disciplinary research efforts, connecting disparate fields such as artificial intelligence, cybersecurity, and advanced computing, all of which are critical to the maturation of practical quantum applications.

Texas’s quantum trajectory is also bolstered by UTSA’s robust academic infrastructure. Dr. Prevost holds the Cloud Technology Endowed Professorship within the College of AI, Cyber and Computing, an interdisciplinary institution established in 2025. This college was created explicitly to address the escalating demand for experts proficient in quantum computing, artificial intelligence, data science, and cybersecurity. Through this academic lens, Dr. Prevost actively cultivates the intellectual capital necessary to sustain Texas’s competitive edge in quantum technology.

As executive director of OCI, Dr. Prevost has been a pivotal figure in fostering interdisciplinary partnerships that connect researchers, industry stakeholders, government agencies, and national laboratories. These collaborations are designed to tackle emergent challenges in cybersecurity, advanced computing, and quantum technologies, driving innovations that will have profound societal impacts. His leadership at OCI ensures that quantum technology development is integrated with practical considerations of resilience and security, crucial factors for technology adoption and scalability.

Dr. Prevost views his appointment as both an honor and an essential responsibility. He stresses Texas’s unparalleled opportunity to shape quantum innovation’s future by nurturing a comprehensive ecosystem that encompasses research capacity, talent development, and cross-sector collaboration. His vision includes anchoring quantum research not merely in theoretical promise but in real-world applications that address cybersecurity threats, enable novel scientific discoveries, and sustain Texas’s economic competitiveness on a global scale.

Recent efforts under Dr. Prevost’s leadership have included the establishment of the Quantum Institute for Cyber Resilience (QuICR), a consortium that unites academic institutions, industry, government, and national laboratories. QuICR’s mission is to advance quantum technologies while simultaneously bolstering cyber resilience, acknowledging the intertwined nature of these domains in a quantum-enabled future. This initiative exemplifies a forward-thinking approach to quantum innovation, integrating security concerns with technological advancement from the outset.

A salient event demonstrating the state’s momentum in this space was the recent Quantum Cyber Resilience Workshop hosted by OCI in San Antonio. The workshop brought together top-tier experts to explore collaborative opportunities within the quantum landscape, emphasizing Texas’s expanding capabilities in cybersecurity, quantum science, workforce development, and infrastructure resilience. This gathering catalyzed new partnerships and research endeavors, positioning Texas as a focal point for cutting-edge innovation and knowledge exchange.

Dr. Prevost’s strategic vision not only strengthens UTSA’s stature but also deepens its contribution to statewide efforts aimed at nurturing a vibrant quantum technology ecosystem. Initiatives led by OCI and QuICR exemplify a landscape where public and private stakeholders converge to accelerate discovery and address the multifaceted challenges inherent in quantum science. This cross-pollination of ideas and resources empowers Texas to maintain a leadership role in quantum research, securing an innovative and resilient economic future.

In conclusion, as Texas intensifies its investment in quantum research and technology development, the leadership and vision embodied by figures like Dr. Jeff Prevost are instrumental in catalyzing this transformative era. UTSA’s commitment to interdisciplinary collaboration, workforce development, and strategic partnerships encapsulates a holistic approach to quantum innovation. With the guidance of the Texas Quantum Initiative Advisory Committee, Texas is poised not only to participate in but to dictate the future trajectory of quantum technologies on the global stage.

Subject of Research: Quantum Computing and Cybersecurity Innovation in Texas

Article Title: Texas Advances Quantum Innovation with Dr. Jeff Prevost’s Appointment to State Advisory Committee

News Publication Date: Not specified

Web References:

• University of Texas at San Antonio (https://utsa.edu)
• Texas Quantum Initiative Advisory Committee (no direct link provided)

Image Credits: UT San Antonio

Keywords

Quantum computing, cybersecurity, artificial intelligence, advanced computing, quantum research, workforce development, interdisciplinary collaboration, quantum technology, cloud technology, Texas Quantum Initiative, Open Cloud Institute, cyber resilience