Michael Mills
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Michael Mills has a total of 186 co-authors. Here are the top co-authors by number of shared publications:
- Peter E. Siegfried
Quantinuum, Broomfield, CO, USA
10 shared publications - Joan M. Dreiling
Quantinuum, Broomfield, USA
7 shared publications - Nathan Hewitt
Quantinuum, Broomfield, USA
7 shared publications - Cameron Foltz
Quantinuum, Broomfield, USA
6 shared publications - Thomas M. Gatterman
Quantinuum, Broomfield, USA
6 shared publications Dan Gresh
Quantinuum, Broomfield, CO, USA
5 shared publications
Latest Publications
- 15 July 2026
- Published by Springer Nature in Nature
- Vol. 655 (8123) , 591-597
Universal gates from braiding and fusing anyons on quantum hardware
A quantum computer requires the ability to store and manipulate information globally to protect against local noise. Topologically ordered phases1,2 offer two routes: encoding information in the ground-state subspace3 or in anyonic excitations1,4,5. The toric code1 exemplifies the first approach but does not intrinsically support a universal gate set. The latter-topological quantum computation-implements gates by braiding non-Abelian anyons6 around each other. However, the simplest non-Abelian generalizations of the toric code cannot achieve universality by braiding alone7-9. Here we demonstrate that anyon fusion, used as a computational primitive, renders these minimally non-Abelian topologically ordered states universal. We prepare a 54-qubit ground state of the quantum double of S3, the smallest non-Abelian group, on the H2 processor of Quantinuum. We encode logical information in the global fusion space of non-Abelian anyons, and by combining braiding with fusion, we realize a universal topological gate set and read-out, which we demonstrate by topologically preparing a magic state. This demonstrates that the S3 topologically ordered state is scalably preparable, yet rich enough to support a universal gate set. More broadly, this work opens up new pathways for harnessing the intrinsic properties of quantum matter to manipulate quantum information.
- 15 July 2026
- Published by Springer Nature in Nature
- Vol. 655 (8123) , 591-597
Universal gates from braiding and fusing anyons on quantum hardware
A quantum computer requires the ability to store and manipulate information globally to protect against local noise. Topologically ordered phases1,2 offer two routes: encoding information in the ground-state subspace3 or in anyonic excitations1,4,5. The toric code1 exemplifies the first approach but does not intrinsically support a universal gate set. The latter-topological quantum computation-implements gates by braiding non-Abelian anyons6 around each other. However, the simplest non-Abelian generalizations of the toric code cannot achieve universality by braiding alone7-9. Here we demonstrate that anyon fusion, used as a computational primitive, renders these minimally non-Abelian topologically ordered states universal. We prepare a 54-qubit ground state of the quantum double of S3, the smallest non-Abelian group, on the H2 processor of Quantinuum. We encode logical information in the global fusion space of non-Abelian anyons, and by combining braiding with fusion, we realize a universal topological gate set and read-out, which we demonstrate by topologically preparing a magic state. This demonstrates that the S3 topologically ordered state is scalably preparable, yet rich enough to support a universal gate set. More broadly, this work opens up new pathways for harnessing the intrinsic properties of quantum matter to manipulate quantum information.
- 10 June 2026
- Published by Springer Nature in Nature
- Vol. 654 (8118) , 349-355
Improved quantum processor logical error rates via correction and detection
Performing quantum algorithms for critical problems in physics and chemistry requires substantially lower error rates than the physical error rates of present quantum computers. Achieving such low logical error rates requires quantum error correction1,2 and physical error rates below a critical threshold value3-8. We experimentally demonstrate on a trapped-ion quantum charge-coupled device (QCCD)9,10 improvements in logical error rates ranging from 11× to 800× compared with several physical circuit baselines, including quantum computation on multiple qubits. Our results hinge on two quantum error correction code constructions optimized for an ion-trap processor: a 12-qubit code encoding two qubits inspired by Knill11 and a 16-qubit tesseract colour code encoding four qubits12,13. These constructions are combined with a scalable method of error detection and post-selection to achieve reduced logical error rates. Our results show that state-of-the-art quantum devices are already able to make use of fault tolerance and error correction to strongly suppress errors in non-trivial quantum circuit computations.
- 10 June 2026
- Published by Springer Nature in Nature
- Vol. 654 (8118) , 349-355
Improved quantum processor logical error rates via correction and detection
Performing quantum algorithms for critical problems in physics and chemistry requires substantially lower error rates than the physical error rates of present quantum computers. Achieving such low logical error rates requires quantum error correction1,2 and physical error rates below a critical threshold value3-8. We experimentally demonstrate on a trapped-ion quantum charge-coupled device (QCCD)9,10 improvements in logical error rates ranging from 11× to 800× compared with several physical circuit baselines, including quantum computation on multiple qubits. Our results hinge on two quantum error correction code constructions optimized for an ion-trap processor: a 12-qubit code encoding two qubits inspired by Knill11 and a 16-qubit tesseract colour code encoding four qubits12,13. These constructions are combined with a scalable method of error detection and post-selection to achieve reduced logical error rates. Our results show that state-of-the-art quantum devices are already able to make use of fault tolerance and error correction to strongly suppress errors in non-trivial quantum circuit computations.
- Top Cited Papers
- 29 April 2026
- Published by Springer Nature in Nature
- Vol. 653 (8113) , 56-62
Digital quantum magnetism on a trapped-ion quantum computer
Digital quantum matter—realized when discrete quantum gates approximate continuous time evolution—is susceptible to heating into chaotic, structureless states1. If digitization errors are adequately suppressed, a long-lived transient regime of approximately energy-conserving dynamics2,3,4,5,6,7 can be observed on gate-based quantum computers. Conservation of energy, in turn, enables the exploration of a wide variety of complex behaviours observed in equilibrium systems, ranging from the non-trivial microscopic origins of thermalization itself8 to the stabilization of effective models hosting exotic emergent properties. Here we use Quantinuum’s H2 quantum computer9,10 to simulate digitized dynamics of the quantum Ising model, suppressing digitization errors well enough to observe thermalization on timescales that severely challenge classical simulation methods. Relaxation of an inhomogeneous state reveals an emergent hydrodynamics owing to approximate energy conservation and we compute the associated diffusion constant. By reprogramming our simulations to take place on a triangular lattice with periodic boundary conditions, we observe thermalization consistent with emergent gauge and topological constraints resulting from lattice frustration11,12,13. Our results were enabled by continued advances in two-qubit gate quality (native partial entangler fidelities of 99.94(1)%) and establish digital quantum computers as powerful tools for studying (effectively) continuous-time dynamics.
- 29 April 2026
- Published by Springer Nature in Nature
- Vol. 653 (8113) , 56-62
Top Cited PapersDigital quantum magnetism on a trapped-ion quantum computer
Digital quantum matter—realized when discrete quantum gates approximate continuous time evolution—is susceptible to heating into chaotic, structureless states1. If digitization errors are adequately suppressed, a long-lived transient regime of approximately energy-conserving dynamics2,3,4,5,6,7 can be observed on gate-based quantum computers. Conservation of energy, in turn, enables the exploration of a wide variety of complex behaviours observed in equilibrium systems, ranging from the non-trivial microscopic origins of thermalization itself8 to the stabilization of effective models hosting exotic emergent properties. Here we use Quantinuum’s H2 quantum computer9,10 to simulate digitized dynamics of the quantum Ising model, suppressing digitization errors well enough to observe thermalization on timescales that severely challenge classical simulation methods. Relaxation of an inhomogeneous state reveals an emergent hydrodynamics owing to approximate energy conservation and we compute the associated diffusion constant. By reprogramming our simulations to take place on a triangular lattice with periodic boundary conditions, we observe thermalization consistent with emergent gauge and topological constraints resulting from lattice frustration11,12,13. Our results were enabled by continued advances in two-qubit gate quality (native partial entangler fidelities of 99.94(1)%) and establish digital quantum computers as powerful tools for studying (effectively) continuous-time dynamics.
- Open Access
- 8 July 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-8
Qutrit toric code and parafermions in trapped ions
The development of programmable quantum devices can be measured by the complexity of many-body states that they are able to prepare. Among the most significant are topologically ordered states of matter, which enable robust quantum information storage and processing. While topological orders are more readily accessible with qudits, experimental realizations have thus far been limited to lattice models of qubits. Here, we prepare and measure a ground state of the $${{\mathbb{Z}}}_{3}$$ toric code state on 24 qutrits (obtained by encoding one qutrit into two qubits) in a trapped ion quantum processor with fidelity per qutrit exceeding 96.5(3)%. We manipulate two types of defects which go beyond the conventional qubit toric code: a parafermion, and its bound state which is related to charge conjugation symmetry. We further demonstrate defect fusion and the transfer of entanglement between anyons and defects, which we use to control topological qutrits. Our work opens up the space of long-range entangled states with qudit degrees of freedom for use in quantum simulation and universal error-correcting codes.- 8 July 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-8
Open AccessQutrit toric code and parafermions in trapped ions
The development of programmable quantum devices can be measured by the complexity of many-body states that they are able to prepare. Among the most significant are topologically ordered states of matter, which enable robust quantum information storage and processing. While topological orders are more readily accessible with qudits, experimental realizations have thus far been limited to lattice models of qubits. Here, we prepare and measure a ground state of the $${{\mathbb{Z}}}_{3}$$ toric code state on 24 qutrits (obtained by encoding one qutrit into two qubits) in a trapped ion quantum processor with fidelity per qutrit exceeding 96.5(3)%. We manipulate two types of defects which go beyond the conventional qubit toric code: a parafermion, and its bound state which is related to charge conjugation symmetry. We further demonstrate defect fusion and the transfer of entanglement between anyons and defects, which we use to control topological qutrits. Our work opens up the space of long-range entangled states with qudit degrees of freedom for use in quantum simulation and universal error-correcting codes. - 16 June 2025
- Published by Springer Nature in Nature Physics
- p. 1-7
Experimental demonstration of breakeven for a compact fermionic encoding
- 16 June 2025
- Published by Springer Nature in Nature Physics
- p. 1-7
Experimental demonstration of breakeven for a compact fermionic encoding
- Top Cited PapersOpen Access
- 26 March 2025
- Published by Springer Nature in Nature
- Vol. 640 (8058) , 343-348
Certified randomness using a trapped-ion quantum processor
Although quantum computers can perform a wide range of practically important tasks beyond the abilities of classical computers1,2, realizing this potential remains a challenge. An example is to use an untrusted remote device to generate random bits that can be certified to contain a certain amount of entropy3. Certified randomness has many applications but is impossible to achieve solely by classical computation. Here we demonstrate the generation of certifiably random bits using the 56-qubit Quantinuum H2-1 trapped-ion quantum computer accessed over the Internet. Our protocol leverages the classical hardness of recent random circuit sampling demonstrations4,5: a client generates quantum ‘challenge’ circuits using a small randomness seed, sends them to an untrusted quantum server to execute and verifies the results of the server. We analyse the security of our protocol against a restricted class of realistic near-term adversaries. Using classical verification with measured combined sustained performance of 1.1 × 1018 floating-point operations per second across multiple supercomputers, we certify 71,313 bits of entropy under this restricted adversary and additional assumptions. Our results demonstrate a step towards the practical applicability of present-day quantum computers.
- 26 March 2025
- Published by Springer Nature in Nature
- Vol. 640 (8058) , 343-348
Top Cited PapersOpen AccessCertified randomness using a trapped-ion quantum processor
Although quantum computers can perform a wide range of practically important tasks beyond the abilities of classical computers1,2, realizing this potential remains a challenge. An example is to use an untrusted remote device to generate random bits that can be certified to contain a certain amount of entropy3. Certified randomness has many applications but is impossible to achieve solely by classical computation. Here we demonstrate the generation of certifiably random bits using the 56-qubit Quantinuum H2-1 trapped-ion quantum computer accessed over the Internet. Our protocol leverages the classical hardness of recent random circuit sampling demonstrations4,5: a client generates quantum ‘challenge’ circuits using a small randomness seed, sends them to an untrusted quantum server to execute and verifies the results of the server. We analyse the security of our protocol against a restricted class of realistic near-term adversaries. Using classical verification with measured combined sustained performance of 1.1 × 1018 floating-point operations per second across multiple supercomputers, we certify 71,313 bits of entropy under this restricted adversary and additional assumptions. Our results demonstrate a step towards the practical applicability of present-day quantum computers.
- 9 December 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 110 (6)
Experiments with the four-dimensional surface code on a quantum charge-coupled device quantum computer
- 9 December 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 110 (6)
Experiments with the four-dimensional surface code on a quantum charge-coupled device quantum computer
- Top Cited Papers
- 20 September 2024
- Published by American Association for the Advancement of Science (AAAS) in Science
- Vol. 385 (6715) , 1327-1331
High-fidelity teleportation of a logical qubit using transversal gates and lattice surgery
Quantum state teleportation is commonly used in designs for large-scale quantum computers. Using Quantinuum’s H2 trapped-ion quantum processor, we demonstrate fault-tolerant state teleportation circuits for a quantum error correction code—specifically the Steane code. The circuits use up to 30 qubits at the physical level and employ real-time quantum error correction. We conducted experiments on several variations of logical teleportation circuits using both transversal gates and lattice surgery. We measured the logical process fidelity to be 0.975 ± 0.002 for the transversal teleportation implementation and 0.851 ± 0.009 for the lattice surgery teleportation implementation as well as 0.989 ± 0.002 for an implementation of Knill-style quantum error correction.
- 20 September 2024
- Published by American Association for the Advancement of Science (AAAS) in Science
- Vol. 385 (6715) , 1327-1331
Top Cited PapersHigh-fidelity teleportation of a logical qubit using transversal gates and lattice surgery
Quantum state teleportation is commonly used in designs for large-scale quantum computers. Using Quantinuum’s H2 trapped-ion quantum processor, we demonstrate fault-tolerant state teleportation circuits for a quantum error correction code—specifically the Steane code. The circuits use up to 30 qubits at the physical level and employ real-time quantum error correction. We conducted experiments on several variations of logical teleportation circuits using both transversal gates and lattice surgery. We measured the logical process fidelity to be 0.975 ± 0.002 for the transversal teleportation implementation and 0.851 ± 0.009 for the lattice surgery teleportation implementation as well as 0.989 ± 0.002 for an implementation of Knill-style quantum error correction.
- Open Access
- 5 August 2024
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 5 (3) , 030323
Measuring the Loschmidt Amplitude for Finite-Energy Properties of the Fermi-Hubbard Model on an Ion-Trap Quantum Computer
Calculating the equilibrium properties of condensed-matter systems is one of the promising applications of near-term quantum computing. Recently, hybrid quantum-classical time-series algorithms have been proposed to efficiently extract these properties from a measurement of the Loschmidt amplitude from initial states and a time evolution under the Hamiltonian up to short times . In this work, we study the operation of this algorithm on a present-day quantum computer. Specifically, we measure the Loschmidt amplitude for the Fermi-Hubbard model on a -site ladder geometry (32 orbitals) on the Quantinuum H2-1 trapped-ion device. We assess the effect of noise on the Loschmidt amplitude and implement algorithm-specific error-mitigation techniques. By using a thus-motivated error model, we numerically analyze the influence of noise on the full operation of the quantum-classical algorithm by measuring expectation values of local observables at finite energies. Finally, we estimate the resources needed for scaling up the algorithm.- 5 August 2024
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 5 (3) , 030323
Open AccessMeasuring the Loschmidt Amplitude for Finite-Energy Properties of the Fermi-Hubbard Model on an Ion-Trap Quantum Computer
Calculating the equilibrium properties of condensed-matter systems is one of the promising applications of near-term quantum computing. Recently, hybrid quantum-classical time-series algorithms have been proposed to efficiently extract these properties from a measurement of the Loschmidt amplitude from initial states and a time evolution under the Hamiltonian up to short times . In this work, we study the operation of this algorithm on a present-day quantum computer. Specifically, we measure the Loschmidt amplitude for the Fermi-Hubbard model on a -site ladder geometry (32 orbitals) on the Quantinuum H2-1 trapped-ion device. We assess the effect of noise on the Loschmidt amplitude and implement algorithm-specific error-mitigation techniques. By using a thus-motivated error model, we numerically analyze the influence of noise on the full operation of the quantum-classical algorithm by measuring expectation values of local observables at finite energies. Finally, we estimate the resources needed for scaling up the algorithm. - Top Cited PapersOpen Access
- 31 May 2024
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 10 (22) , eadm6761
Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem
The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm for solving optimization problems on quantum computers. However, the potential of QAOA to tackle classically intractable problems remains unclear. Here, we perform an extensive numerical investigation of QAOA on the low autocorrelation binary sequences (LABS) problem, which is classically intractable even for moderately sized instances. We perform noiseless simulations with up to 40 qubits and observe that the runtime of QAOA with fixed parameters scales better than branch-and-bound solvers, which are the state-of-the-art exact solvers for LABS. The combination of QAOA with quantum minimum finding gives the best empirical scaling of any algorithm for the LABS problem. We demonstrate experimental progress in executing QAOA for the LABS problem using an algorithm-specific error detection scheme on Quantinuum trapped-ion processors. Our results provide evidence for the utility of QAOA as an algorithmic component that enables quantum speedups.
- 31 May 2024
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 10 (22) , eadm6761
Top Cited PapersOpen AccessEvidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem
The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm for solving optimization problems on quantum computers. However, the potential of QAOA to tackle classically intractable problems remains unclear. Here, we perform an extensive numerical investigation of QAOA on the low autocorrelation binary sequences (LABS) problem, which is classically intractable even for moderately sized instances. We perform noiseless simulations with up to 40 qubits and observe that the runtime of QAOA with fixed parameters scales better than branch-and-bound solvers, which are the state-of-the-art exact solvers for LABS. The combination of QAOA with quantum minimum finding gives the best empirical scaling of any algorithm for the LABS problem. We demonstrate experimental progress in executing QAOA for the LABS problem using an algorithm-specific error detection scheme on Quantinuum trapped-ion processors. Our results provide evidence for the utility of QAOA as an algorithmic component that enables quantum speedups.