93 citations · 178 across the 12 of their papers we have counts for
12 papers
Optimized measurement-free and fault-tolerant quantum error correction for neutral atoms
Stefano Veroni, Markus Müller, Giacomo Giudice
A major challenge in performing quantum error correction (QEC) is implementing reliable measurements and conditional feed-forward operations. In quantum computing platforms support…
Lift-Connected Surface Codes
Josias Old, Manuel Rispler, Markus Müller
We use the recently introduced lifted product to construct a family of Quantum Low Density Parity Check Codes (QLDPC codes). The codes we obtain can be viewed as stacks of surface…
Accurate optimal quantum error correction thresholds from coherent information
Luis Colmenarez, Ze-Min Huang, Sebastian Diehl +1
Quantum error correcting (QEC) codes protect quantum information from decoherence, as long as error rates fall below critical error thresholds. In general, obtaining thresholds imp…
Algebraic Localization from Power-Law Interactions in Disordered Quantum Wires
Thomas Botzung, Davide Vodola, Piero Naldesi +3
We analyze the effects of disorder on the correlation functions of one-dimensional quantum models of fermions and spins with long-range interactions that decay with distance …
Quantum Google Algorithm: Construction and Application to Complex Networks
G. D. Paparo, M. Müller, F. Comellas +1
We review the main findings on the ranking capabilities of the recently proposed Quantum PageRank algorithm (G.D. Paparo et al., Sci. Rep. 2, 444 (2012) and G.D. Paparo et al., Sci…
Efficient algorithm to compute the Berry conductivity
A. Dauphin, M. Müller, M. A. Martin-Delgado
We propose and construct a numerical algorithm to calculate the Berry conductivity in topological band insulators. The method is applicable to cold atom systems as well as solid st…
Quantum Google in a Complex Network
G. D. Paparo, M. Mueller, F. Comellas +1
We investigate the behavior of the recently proposed quantum Google algorithm, or quantum PageRank, in large complex networks. Applying the quantum algorithm to a part of the real…
How to Add a Noninteger Number of Terms: From Axioms to New Identities
Markus Mueller, Dierk Schleicher
Starting from a small number of well-motivated axioms, we derive a unique definition of sums with a noninteger number of addends. These "fractional sums" have properties that gener…
Effective complexity of stationary process realizations
Nihat Ay, Markus Mueller, Arleta Szkola
The concept of effective complexity of an object as the minimal description length of its regularities has been initiated by Gell-Mann and Lloyd. The regularities are modeled by me…
Quantum Bit Strings and Prefix-Free Hilbert Spaces
Markus Mueller, Caroline Rogers
We give a mathematical framework for manipulating indeterminate-length quantum bit strings. In particular, we define prefixes, fragments, tensor products and concatenation of such…
Stationary Algorithmic Probability
Markus Mueller
Kolmogorov complexity and algorithmic probability are defined only up to an additive resp. multiplicative constant, since their actual values depend on the choice of the universal…
Fractional Sums and Euler-like Identities
Markus Mueller, Dierk Schleicher
We introduce a natural definition for sums of the form \[ \sum_{ν=1}^x f(ν) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory in…