activity
20232025
most citedQuantum computing topological invariants of two-dimensional quantum matter

8 citations · 26 across the 6 of their papers we have counts for

collaborators

6 papers

quant-ph2025

Quantum circuit algorithm for topological invariants of second order topological many-body quantum magnets

Sebastián Domínguez-Calderón, Marcel Niedermeier, Jose L. Lado +1

Topological quantum matter represents a flexible playground to engineer unconventional excitations. While non-interacting topological single-particle systems have been studied in d…

quant-ph2025★ 3 cited

Solving the Gross-Pitaevskii equation on multiple different scales using the quantics tensor train representation

Marcel Niedermeier, Adrien Moulinas, Thibaud Louvet +2

Solving partial differential equations of highly featured problems represents a formidable challenge, where reaching high precision across multiple length scales can require a proh…

cond-mat.str-el2025★ 2 cited

Self-consistent tensor network method for correlated super-moiré matter beyond one billion sites

Yitao Sun, Marcel Niedermeier, Tiago V. C. Antão +2

Moiré and super-moiré materials provide exceptional platforms to engineer exotic correlated quantum matter. The vast number of sites required to model moiré systems in real space r…

cond-mat.mes-hall2024★ 5 cited

Correlated states in super-moiré materials with a kernel polynomial quantics tensor cross interpolation algorithm

Adolfo O. Fumega, Marcel Niedermeier, Jose L. Lado

Super-moiré materials represent a novel playground to engineer states of matter beyond the possibilities of conventional moiré materials. However, from the computational point of v…

quant-ph2024★ 8 cited

Quantum computing topological invariants of two-dimensional quantum matter

Marcel Niedermeier, Marc Nairn, Christian Flindt +1

Quantum algorithms provide a potential strategy for solving computational problems that are intractable by classical means. Computing the topological invariants of topological matt…

quant-ph2023★ 8 cited

Simulating the quantum Fourier transform, Grover's algorithm, and the quantum counting algorithm with limited entanglement using tensor-networks

Marcel Niedermeier, Jose L. Lado, Christian Flindt

Quantum algorithms reformulate computational problems as quantum evolutions in a large Hilbert space. Most quantum algorithms assume that the time-evolution is perfectly unitary an…