RMRonny Müller

Ronny Müller

*This is an algorithmically generated author record based on publicly available information.

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


Ronny Müller has a total of 24 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Performance of Cascade and LDPC Codes for Information Reconciliation on Industrial Quantum Key Distribution Systems

    by Ronny Mueller, Claudia De Lazzari, Fernando Chirici, Ilaria Vagniluca, Leif Katsuo Oxenløwe, Søren Forchhammer, Alessandro Zavatta, Davide Bacco

    Information reconciliation is a critical component of quantum key distribution, ensuring that mismatches between Alice's and Bob's keys are corrected. In this study, we analyse, simulate, optimise and compare the performance of two prevalent algorithms used for information reconciliation: Cascade and LDPC codes in combination with the blind protocol. We focus on their applicability in practical and industrial settings, operating in realistic and application‐close conditions. The results are further validated through evaluation on a live industrial QKD system.


  • Top Cited Papers
    Open Access

    Practical high-dimensional quantum key distribution protocol over deployed multicore fiber

    by Mujtaba Zahidy, Domenico Ribezzo, Claudia De Lazzari, Ilaria Vagniluca, Nicola Biagi, Ronny Müller, Tommaso Occhipinti, Leif K. Oxenløwe, Michael Galili, Tetsuya Hayashi, et al.

    Quantum key distribution (QKD) is a secure communication scheme for sharing symmetric cryptographic keys based on the laws of quantum physics, and is considered a key player in the realm of cyber-security. A critical challenge for QKD systems comes from the fact that the ever-increasing rates at which digital data are transmitted require more and more performing sources of quantum keys, primarily in terms of secret key generation rate. High-dimensional QKD based on path encoding has been proposed as a candidate approach to address this challenge. However, while proof-of-principle demonstrations based on lab experiments have been reported in the literature, demonstrations in realistic environments are still missing. Here we report the generation of secret keys in a 4-dimensional hybrid time-path-encoded QKD system over a 52-km deployed multicore fiber link forming by looping back two cores of a 26-km 4-core optical fiber. Our results indicate that robust high-dimensional QKD can be implemented in a realistic environment by combining standard telecom equipment with emerging multicore fiber technology.


  • Open Access

    Single-photon-based clock analysis and recovery in quantum key distribution

    by M. Zahidy, D. Ribezzo, R. Müller, J. Riebesehl, A. Zavatta, M. Galili, L. K. Oxenløwe, D. Bacco

    Quantum key distribution is one of the first quantum technologies ready for the market. Current quantum telecommunication systems usually utilize a service channel for synchronizing the transmitter (Alice) and the receiver (Bob). However, the possibility of removing this service channel and exploiting a clock recovery method are intriguing for future implementation, both in fiber and free-space links. In this paper, we investigate criteria to recover the clock in a quantum communication scenario and experimentally demonstrated the possibility of using a quantum-based clock recovery system in a time-bin quantum key distribution protocol. The performance of the clock recovery technique, in terms of quantum bit error rate and secret key rate, is equivalent to using the service channel for clock sharing.


  • Open Access

    Stochastic emulation of quantum algorithms

    by Daniel Braun, Ronny Müller

    Quantum algorithms profit from the interference of quantum states in an exponentially large Hilbert space and the fact that unitary transformations on that Hilbert space can be broken down to universal gates that act only on one or two qubits at the same time. The former aspect renders the direct classical simulation of quantum algorithms difficult. Here we introduce higher-order partial derivatives of a probability distribution of particle positions as a new object that shares these basic properties of quantum mechanical states needed for a quantum algorithm. Discretization of the positions allows one to represent the quantum mechanical state of n bit qubits by 2(n bit + 1) classical stochastic bits. Based on this, we demonstrate many-particle interference and representation of pure entangled quantum states via derivatives of probability distributions and find the universal set of stochastic maps that correspond to the quantum gates in a universal gate set. We prove that the propagation via the stochastic map built from those universal stochastic maps reproduces up to a prefactor exactly the evolution of the quantum mechanical state with the corresponding quantum algorithm, leading to an automated translation of a quantum algorithm to a stochastic classical algorithm. We implement several well-known quantum algorithms, analyse the scaling of the needed number of realizations with the number of qubits, and highlight the role of destructive interference for the cost of the emulation.


  • Perfect quantum-state synchronization

    by Jakub Czartowski, Ronny Müller, Karol Życzkowski, Daniel Braun

    We investigate the most general mechanisms that lead to perfect synchronization of the quantum states of all subsystems of an open quantum system starting from an arbitrary initial state. We provide a necessary and sufficient condition for such “quantum-state synchronization,” prove tight lower bounds on the dimension of the ancilla's Hilbert space in two main classes of quantum-state synchronizers, and give an analytical solution for their construction. The functioning of the found quantum-state synchronizer of two qubits is demonstrated experimentally on an IBM quantum computer and we show that the remaining asynchronicity is a sensitive measure of the quantum computer's imperfection.