Manuel G. Algaba
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Manuel G. Algaba has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Fedor Šimkovic
IQM Nymphenburgerstr. 86 80636 Munich Germany
3 shared publications Martin Leib
IQM, Nymphenburgerstr. 86, 80636 Munich, Germany
3 shared publicationsHermanni Heimonen
IQM Quantum Computers Keilaranta 19 FI-02150 Espoo Finland
2 shared publicationsInés de Vega
Georg-Brauchle-Ring 23-25
2 shared publications- Mario Ponce-Martinez
IQM Germany GmbH, Georg-Brauchle-Ring 23-25, 80992 Munich, Germany
2 shared publications P. V. Sriluckshmy
IQM, Nymphenburgerstr. 86, 80636 Munich, Germany
2 shared publications
Latest Publications
- 30 September 2026
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 11 (4) , 045060
Fermion-to-qubit encodings with arbitrary code distance
We introduce a framework which allows to systematically and arbitrarily scale the code distance of local fermion-to-qubit encodings in one and two dimensions without growing the weights of stabilizers. This is achieved by embedding low-distance encodings into the surface code in the form of topological defects. We introduce a family of Ladder Encodings (LE), which is optimal in the sense that the code distance is equal to the weights of density and nearest-neighbor hopping operators of a one-dimensional Fermi–Hubbard model. In two dimensions, we show how to scale the code distance of LE as well as other low-distance encodings such as Verstraete–Cirac and Derby–Klassen. We further introduce Perforated Encodings , which locally encode two fermionic spin modes within the same surface code structure. We show that our strategy is also extendable to other topological codes by explicitly embedding the LE into a 6.6.6 color code.
- 30 September 2026
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 11 (4) , 045060
Fermion-to-qubit encodings with arbitrary code distance
We introduce a framework which allows to systematically and arbitrarily scale the code distance of local fermion-to-qubit encodings in one and two dimensions without growing the weights of stabilizers. This is achieved by embedding low-distance encodings into the surface code in the form of topological defects. We introduce a family of Ladder Encodings (LE), which is optimal in the sense that the code distance is equal to the weights of density and nearest-neighbor hopping operators of a one-dimensional Fermi–Hubbard model. In two dimensions, we show how to scale the code distance of LE as well as other low-distance encodings such as Verstraete–Cirac and Derby–Klassen. We further introduce Perforated Encodings , which locally encode two fermionic spin modes within the same surface code structure. We show that our strategy is also extendable to other topological codes by explicitly embedding the LE into a 6.6.6 color code.
- Open Access
- 30 April 2024
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 8, 1327
Low-depth simulations of fermionic systems on square-grid quantum hardware
We present a general strategy for mapping fermionic systems to quantum hardware with square qubit connectivity which yields low-depth quantum circuits, counted in the number of native two-qubit fSIM gates. We achieve this by leveraging novel operator decomposition and circuit compression techniques paired with specifically chosen low-depth fermion-to-qubit mappings and allow for a high degree of gate cancellations and parallelism. Our mappings retain the flexibility to simultaneously optimize for qubit counts or qubit operator weights and can be used to investigate arbitrary fermionic lattice geometries. We showcase our approach by investigating the tight-binding model, the Fermi-Hubbard model as well as the multi-orbital Hubbard-Kanamori model. We report unprecedentedly low circuit depths per single Trotter layer with up to a 70 % improvement upon previous state-of-the-art. Our compression technique also results in significant reduction of two-qubit gates. We find the lowest gate-counts when applying the XYZ-formalism to the DK mapping. Additionally, we show that our decomposition and compression formalism produces favourable circuits even when no native parameterized two-qubit gates are available.
- 30 April 2024
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 8, 1327
Open AccessLow-depth simulations of fermionic systems on square-grid quantum hardware
We present a general strategy for mapping fermionic systems to quantum hardware with square qubit connectivity which yields low-depth quantum circuits, counted in the number of native two-qubit fSIM gates. We achieve this by leveraging novel operator decomposition and circuit compression techniques paired with specifically chosen low-depth fermion-to-qubit mappings and allow for a high degree of gate cancellations and parallelism. Our mappings retain the flexibility to simultaneously optimize for qubit counts or qubit operator weights and can be used to investigate arbitrary fermionic lattice geometries. We showcase our approach by investigating the tight-binding model, the Fermi-Hubbard model as well as the multi-orbital Hubbard-Kanamori model. We report unprecedentedly low circuit depths per single Trotter layer with up to a 70 % improvement upon previous state-of-the-art. Our compression technique also results in significant reduction of two-qubit gates. We find the lowest gate-counts when applying the XYZ-formalism to the DK mapping. Additionally, we show that our decomposition and compression formalism produces favourable circuits even when no native parameterized two-qubit gates are available.
- Open Access
Low-depth simulations of fermionic systems on square-grid quantum hardware
We present a general strategy for mapping fermionic systems to quantum hardware with square qubit connectivity which yields low-depth quantum circuits, counted in the number of native two-qubit fSIM gates. We achieve this by leveraging novel operator decomposition and circuit compression techniques paired with specifically chosen low-depth fermion-to-qubit mappings and allow for a high degree of gate cancellations and parallelism. Our mappings retain the flexibility to simultaneously optimize for qubit counts or qubit operator weights and can be used to investigate arbitrary fermionic lattice geometries. We showcase our approach by investigating the tight-binding model, the Fermi-Hubbard model as well as the multi-orbital Hubbard-Kanamori model. We report unprecedentedly low circuit depths per single Trotter layer with up to a $70 \%$ improvement upon previous state-of-the-art. Our compression technique also results in significant reduction of two-qubit gates. We find the lowest gate-counts when applying the XYZ-formalism to the DK mapping. Additionally, we show that our decomposition and compression formalism produces favourable circuits even when no native parameterized two-qubit gates are available.Open AccessLow-depth simulations of fermionic systems on square-grid quantum hardware
We present a general strategy for mapping fermionic systems to quantum hardware with square qubit connectivity which yields low-depth quantum circuits, counted in the number of native two-qubit fSIM gates. We achieve this by leveraging novel operator decomposition and circuit compression techniques paired with specifically chosen low-depth fermion-to-qubit mappings and allow for a high degree of gate cancellations and parallelism. Our mappings retain the flexibility to simultaneously optimize for qubit counts or qubit operator weights and can be used to investigate arbitrary fermionic lattice geometries. We showcase our approach by investigating the tight-binding model, the Fermi-Hubbard model as well as the multi-orbital Hubbard-Kanamori model. We report unprecedentedly low circuit depths per single Trotter layer with up to a $70 \%$ improvement upon previous state-of-the-art. Our compression technique also results in significant reduction of two-qubit gates. We find the lowest gate-counts when applying the XYZ-formalism to the DK mapping. Additionally, we show that our decomposition and compression formalism produces favourable circuits even when no native parameterized two-qubit gates are available. - Open Access
Co-Design quantum simulation of nanoscale NMR
Quantum computers have the potential to efficiently simulate the dynamics of nanoscale NMR systems. In this work we demonstrate that a noisy intermediate-scale quantum computer can be used to simulate and predict nanoscale NMR resonances. In order to minimize the required gate fidelities, we propose a superconducting application-specific Co-Design quantum processor that reduces the number of SWAP gates by over 90 % for chips with more than 20 qubits. The processor consists of transmon qubits capacitively coupled via tunable couplers to a central co-planar waveguide resonator with a quantum circuit refrigerator (QCR) for fast resonator reset. The QCR implements the non-unitary quantum operations required to simulate nuclear hyperpolarization scenarios.
Open AccessCo-Design quantum simulation of nanoscale NMR
Quantum computers have the potential to efficiently simulate the dynamics of nanoscale NMR systems. In this work we demonstrate that a noisy intermediate-scale quantum computer can be used to simulate and predict nanoscale NMR resonances. In order to minimize the required gate fidelities, we propose a superconducting application-specific Co-Design quantum processor that reduces the number of SWAP gates by over 90 % for chips with more than 20 qubits. The processor consists of transmon qubits capacitively coupled via tunable couplers to a central co-planar waveguide resonator with a quantum circuit refrigerator (QCR) for fast resonator reset. The QCR implements the non-unitary quantum operations required to simulate nuclear hyperpolarization scenarios.
- Open Access
- 8 November 2022
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 4 (4) , 043089
Co-Design quantum simulation of nanoscale NMR
Quantum computers have the potential to efficiently simulate the dynamics of nanoscale NMR systems. In this work, we demonstrate that a noisy intermediate-scale quantum computer can be used to simulate and predict nanoscale NMR resonances. In order to minimize the required gate fidelities, we propose a superconducting application-specific Co-Design quantum processor that reduces the number of SWAP gates by over 90% for chips with more than 20 qubits. The processor consists of transmon qubits capacitively coupled via tunable couplers to a central co-planar waveguide resonator with a quantum circuit refrigerator (QCR) for fast resonator reset. The QCR implements the nonunitary quantum operations required to simulate nuclear hyperpolarization scenarios.
- 8 November 2022
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 4 (4) , 043089
Open AccessCo-Design quantum simulation of nanoscale NMR
Quantum computers have the potential to efficiently simulate the dynamics of nanoscale NMR systems. In this work, we demonstrate that a noisy intermediate-scale quantum computer can be used to simulate and predict nanoscale NMR resonances. In order to minimize the required gate fidelities, we propose a superconducting application-specific Co-Design quantum processor that reduces the number of SWAP gates by over 90% for chips with more than 20 qubits. The processor consists of transmon qubits capacitively coupled via tunable couplers to a central co-planar waveguide resonator with a quantum circuit refrigerator (QCR) for fast resonator reset. The QCR implements the nonunitary quantum operations required to simulate nuclear hyperpolarization scenarios.