SearcharxivSearch

arXiv subjects

Janis Nötzel

Publications and source records attributed to Janis Nötzel.

At least 19 recordsLinked to original sources

Phase-Drift Limits and Adaptive Quadrature Readout in Programmable Photonic Processors

Phase fluctuations between optical inputs limit programmable photonic processors because their output powers depend on coherent interference. We study the phase-drift penalty that arises when sine and cosine quadratures are measured sequentially rather than simultaneously. The analysis is motivated by measurements from an eight-mode programmable photonic processor, including 35 free-running recordings of 300 s acquired at approximately 125 samples per second per channel. These recordings provide an empirical route for estimating the phase-increment variance at a selected reconfiguration interval. The estimate is defined at the time of the second measurement. For fixed quadrature order, perturbation of the atan2 reconstruction gives $e_{C\to S}=-δ_τ\sin^2ϕ_0+O(δ_τ^2)$ and $e_{S\to C}=-δ_τ\cos^2ϕ_0+O(δ_τ^2)$. Writing $Q_τ=\operatorname{Var}(δ_τ)$, uniform phase averaging gives the first-order drift mean-square error $3Q_τ/8$. A phase-predicted ordering rule measures the locally less informative quadrature first and the more informative quadrature second. Its uniform first-order penalty is $(3/8-1/π)Q_τ$, which is 84.9 percent below the fixed-order value. We also derive an increment-aware estimator from a local state-space model. Marginalizing the unknown phase increment increases the variance of a stale phase observation by $Q_τ$, reducing its Fisher information from $I$ to $I/(1+IQ_τ)$. For ideal balanced Poisson detection, the Fisher information of each quadrature equals its detected signal-photon number. This yields dimensionless architecture boundaries in spatial information and phase-increment variance. Nonlinear Monte Carlo simulations validate the perturbative laws, quantify robustness to prediction error, and compare simultaneous, fixed-order, increment-aware, and adaptive receivers under a common noise model.

physics.optics

Quantum-Limited Blind Source Separation of Classical Light

Using the framework of quantum multiparameter estimation, we study the problem of separating independent thermal optical sources mixed by an unknown passive linear transformation, which is known as blind source separation in signal processing. We propose a sensing-assisted method that iteratively estimates and suppresses optical correlations directly within the unit cells of a programmable interferometer. We show that collective quantum measurements exhibit a substantial advantage over conventional detection methods by constructing collective measurements that asymptotically achieve the Holevo Cramér--Rao bound in a unit cell of the interferometer for the respective sub-problem. By systematically arranging multiple such cells in a photonic mesh, our proposal implements an in situ Jacobi diagonalization of the input multimode correlation matrix. We contrast our method with a conventional approach where heterodyne detection is used to reconstruct the full covariance matrix and subsequently diagonalize it on a classical computer. A comparison with this heterodyne tomography approach shows that our sensing-based method is particularly advantageous in the weak-light regime.

quant-ph

Local Variance-Based Calibration of Programmable Photonic Interferometer Meshes

Programmable photonic interferometer meshes enable reconfigurable linear optical transformations, but their performance depends critically on accurate calibration of Mach-Zehnder interferometers and phase shifters. Conventional methods often require node isolation, dedicated routing paths, orthogonal training states, reference channels, or prior phase-voltage characterization, which become increasingly difficult in large thermally tuned meshes. We introduce a local variance-based self-calibration method using intensity-only measurements. Controlled phase perturbations are applied, and calibration points are identified from minima of the measured output-power variance. For Mach-Zehnder interferometers, the variance follows a characteristic |sin(theta)| dependence, allowing bar and cross operating points to be found without conventional node isolation. For phase shifters, balanced interference produces a complementary |cos(phi)| variance signature, enabling quadrature calibration through the same statistical principle. We validate the method experimentally on an 8 x 8 silicon nitride programmable photonic processor using a fully automated two-stage procedure. Starting from random phase settings, all Mach-Zehnder interferometers are calibrated first, followed by phase-shifter calibration under balanced-interference conditions. As a system-level test, we implement an embedded 4 x 4 Hadamard transformation on the 8 x 8 processor using a Clements decomposition. These results establish local output variance as a simple calibration observable for programmable photonic meshes. The method is compatible with discrete random phase ensembles and requires neither conventional node isolation nor orthogonal training fields, making it a practical calibration primitive for scalable self-stabilizing photonic processors.

physics.optics

Modeling and Analysis of Phase Instability in Photonic Processor

Achieving both reconfigurability and stable output signals is a critical challenge in the development of integrated photonic circuits for large-scale optical quantum information processing. This has led to the creation of multimode photonic processors, also known as reconfigurable multimode interferometers, which have wide-ranging applications in quantum and classical information processing. However, maintaining phase stability in multi-port input signals remains a significant hurdle, particularly due to the phase instabilities introduced by active cooling systems and temperature drifts in the photonic processor. In this study, we propose theoretical models to simulate phase instability in photonic processors and validate them against experimental results. Two distinct modeling approaches were employed: a Brownian random walk and phase reconstruction based on experimentally observed oscillating harmonics. Additionally, we verified and applied our model to a specific application for input phase correction using self-feedback control within the photonic processor.

physics.optics

Generalized Kerr-Cat Qubit Codes

We present a systematic study of Schrödinger cat codes constructed from Kerr-type coherent states, including displaced Kerr coherent states and Barut--Girardello Kerr coherent states, each admitting two distinct families determined by the sign of the Kerr nonlinearity. By tuning the Kerr parameter and coherent-state amplitude, these states interpolate between $\mathfrak{su}(2)$, $\mathfrak{su}(1,1)$ coherent states, providing a unified and versatile foundation for this type of bosonic quantum error correction. Unlike standard two-component Schrödinger cat codes, where a single photon-loss event induces an uncorrectable bit-flip, the nonlinear phase-space structure of Kerr cat states enables simultaneous detection and correction of both photon-loss and dephasing errors within a unified recovery framework, with optimal recovery operations determined via convex optimization. We demonstrate that Kerr cat encodings significantly outperform conventional cat codes under combined loss and dephasing noise, and that judicious parameter optimization can suppress both error channels to a level that reduces the overhead of additional error correction layers. We further show that Kerr-deformed coherent-state manifolds under engineered two-photon driving emerge as effective steady states of driven-dissipative dynamics, with single-photon decoherence strongly suppressed and leakage outside the protected manifold appearing only as higher-order corrections in the deformation strength. Our extended formalism identifies generalized Kerr Schrödinger cat codes as promising candidates for fault-tolerant bosonic quantum computation in experimental platforms such as nonlinear photonics.

quant-ph

Energy-Efficient Satellite Wake-Up via Bosonic Identification: The Role of Synchronization

The information-theoretic concept of identification describes a sender-receiver architecture in which the receiver only checks whether a particular message was sent or not, thereby promising a low-energy receiver design. In low received-energy regimes, quantum receivers are a promising tool for studying the system limits. However, the known information-theoretically optimal identification codes typically assume perfect synchronization. In this work, we study deterministic identification in a satellite setting under explicit synchronization constraints, where a satellite broadcasts the signature of a specific User Equipment (UE) which it assumes to be attached to one out of several possible Ground Station (GS), with the goal of establishing communication with the target UE. Within the proposed design, and assuming a specific phase-encoded coherent-state clock scheme in which the discrete time index is represented by equidistant phase rotations on the unit circle, our results reveal a fundamental asymmetry: At any transmission power, identification performance improves with blocklength, whereas synchronization accuracy degrades. In particular, the energy needed for transmitting the satellite clock to the GS can be several orders of magnitude higher than the one needed for the identification signal. This indicates that synchronization strongly impacts identification performance and motivates the investigation of the error-correcting capabilities of bosonic codes under jitter.

quant-ph

Opportunistic QKD: Exploiting Idle Capacity of Classical WDM Systems

While QKD has been proven in lab environments, large-scale implementation requires integration with existing infrastructure. This paper proposes an opportunistic QKD framework that takes advantage of idle spectral capacity, that is, unused channels in classical fibers, to perform QKD while prioritizing classical traffic. To mitigate crosstalk during the co-propagation of classical and quantum signals, we require a guardband of unused channels between classical and quantum signals. We propose a stochastic traffic model, with a deterministic day-night cycle and fractional Gaussian noise. Monte-Carlo simulations of an 80-channel WDM system with our stochastic traffic model demonstrate that 45-65\% of unused spectrum can be repurposed for QKD, depending on the traffic conditions. We also model a key reservoir, with available and recovery states. We define the Reliability Horizon as the 3σ depletion threshold. We find a trade-off between buffer reset levels: increasing the buffer reset level extends the reliability horizon but linearly increases recovery time, resulting in longer service "dark windows". Furthermore, simulations indicate that the first-passage time follows a heavy-tailed distribution, which is accurately characterized by a composite model combining a diurnal trend and a Bihill transition function. This framework enables network operators to optimize buffer parameters for specific Service Level Agreements (SLAs) in real-world environments.

quant-ph

Fundamental Limits of Eavesdropper Detection and Localization in Optical Fiber via Stimulated Brillouin Scattering

Recent work investigated the use of Stimulated Brillouin Scattering (SBS) to measure changes in fiber parameters, thereby enhancing the security of a Quantum Key Distribution (QKD) system. In this work, we focus solely on the impact of quantum technology on the task of intrusion-detection. We derive an effective input-output model for the SBS interaction, and utilize it to compare three detection methods: First, the established state of the art. Second, a photon-counting based method which will likely be available in the near future and, finally, the ultimate quantum limit. We illustrate the potential benefit from modern quantum technology within two different mathematical frameworks: First by using the quantum error exponent of asymmetric hypothesis testing, and second in the context of parameter-estimation and quantum metrology.

quant-ph

Entanglement Enabled Data Transmission over an Arbitrarily Varying Channel

Shared randomness is the central ingredient for stabilizing symmetrizable communication systems against arbitrarily varying jammers. Given the presence of the jammer, however, the question arises how this precious resource could have been distributed. Several works discuss the use of external sources for this task. In this work, we show, based on the most standard optical communication model, how the sender and receiver can employ entangled two-mode squeezed states to counter the jamming attack of an energy-limited jammer during the distribution phase when both the sender and jammer are allowed to use binary phase shift keying and two-mode squeezed vacuum states.

quant-ph

Deterministic Multi-User Identification over Bosonic Channels

We study deterministic multi-user identification over bosonic channels using coherent-state signatures. Each user is assigned a coherent product state under an average energy constraint, and identification is performed by a user-specific binary quantum test. In contrast to classical multi-user identification models based on shared codebooks, this formulation associates each receiver with a geometric signature in high-dimensional phase space. Using metric entropy bounds, we show that the identification capacity exhibits a near-k log k scaling behavior.

quant-ph

Distance-Security Tradeoffs for Repeaterless End-to-End QKD Networks

Quantum Key Distribution (QKD) offers provably secure, information-theoretic key exchange, but in long-distance scenarios without quantum repeaters, Trusted Nodes (TNs) are commonly employed despite introducing critical security risks. We propose a redundant key management method for QKD network that combines Twin Field QKD (TF-QKD) (or Measurement-Device Independent (MDI)-QKD) with a novel key-routing scheme to eliminate the need for truly trusted TNs. Quantum measurements are handled entirely within the network, minimizing end-user hardware requirements. Multiple QKD links connect intermediate nodes such that a successful attack requires the collusion of multiple adversarial nodes, greatly enhancing security over the traditional TN model. In this contribution, we discuss the tradeoff between security, key rates, and distances supported by the new method. Our analysis reveals that the improved redundant key management system may enable true end-to-end connectivity over several thousand kilometers while maintaining high security standards.

quant-ph

Entangled Photon Pair Generator via Biexciton-Exciton Cascade in Semiconductor Quantum Dots and its Simulation

The generation of entangled photon pairs is highly useful for many types of quantum technologies. In this work an entangled photon pair generator that utilises the biexciton-exciton cascade in semiconductor quantum dots is described on a physical, mathematical, and software level. The system is implemented and simulated as a self-contained component in a framework for bigger quantum optical experiments. Thus, it is a description to further the holistic understanding of the system for interdisciplinary audiences in a hopefully simple yet sufficient manner. It is described from the condensed matter physics fundamentals, over the most important quantum optical properties, to a mathematical description of the used model, and finally a software description and simulation, making it an executable description of such a system. We provide a compact description in the Kraus operator formalism to seamlessly incorporate such an entangled photon pair generator simulation component into bigger simulations consisting of multiple components at a reasonable computational cost. The simulation accommodates a wide range of parameter regimes and makes it possible to simulate many different excitation strategies. This includes resonant two-photon excitation, adiabatic rapid passage chirped excitation, and dichromatic pulsed excitation.

quant-ph

End-to-End QKD Using LEO Satellite Networks

We propose a satellite-based Quantum Key Distribution (QKD) network that enables global-scale, end-to-end secure key exchange without relying on trusted intermediate nodes. The network is formed by a ring constellation of satellites that maintain persistent inter-satellite connectivity and support two configurations: a polar Type-I constellation providing global coverage, and an equatorial Type-II constellation offering continuous, terrestrial-like operation. End-to-end secrecy is achieved through the use of Twin-field Quantum Key Distribution (TF-QKD) and a redundant XOR-based key-forwarding protocol, in which each forwarding step incorporates independently generated QKD keys from ground-satellite and inter-satellite links. As a result, the final secret key is never exposed to any intermediate satellite, eliminating the single-point vulnerabilities inherent in trusted-node networks. Scaling the network offers two benefits: improved security and higher key rates. Increasing the constellation size enhances security by forcing an adversary to compromise a larger number of nodes to break the protocol, while simultaneously improving link availability and key throughput. Using realistic uplink and Inter-Satellite Link (ISL) models, we compute finite-size secret-key lengths based on the Sending-or-not-sending (SNS)-TF-QKD protocol. Our results show that the achievable key rates scale favourably with constellation size, with Type-II constellations reaching operational continuity and generating multi-gigabit secret keys per day, demonstrating a practical route toward secure global quantum communication.

quant-ph

Transmitting Correlation for Data Transmission over the Bosonic Arbitrarily Varying Channel

Shared randomness is the central ingredient for stabilizing symmetrizable communication systems against arbitrarily varying jammers. Given the presence of the jammer, however, the question arises how this precious resource could have been distributed. Several works discuss the use of external sources for this task. In this work, we show, based on the most standard optical communication model, how the sender and receiver can employ either classically correlated thermal light or entangled two-mode squeezed states created at and transmitted by the sender to counter the jamming attack of an energy-limited jammer during the distribution phase. Both sender and receiver are only allowed to use homodyne detection in our model, and the sender has to obey a power limit as well.

quant-ph

Phase-Based Bit Commitment Protocol

With the rise of artificial intelligence and machine learning, a new wave of private information is being flushed into applications. This development raises privacy concerns, as private datasets can be stolen or abused for non-authorized purposes. Secure function computation aims to solve such problems by allowing a service provider to compute functions of datasets in the possession of a a data provider without reading the data itself. A foundational primitive for such tasks is Bit Commitment (BC), which is known to be impossible to realize without added assumptions. Given the pressing nature of the topic, it is thus important to develop BC systems and prove their security under reasonable assumptions. In this work, we provide a novel quantum optical BC protocol that uses the added assumption that the network provider will secure transmission lines against eavesdropping. Under this added assumption, we prove security of our protocol in the honest but curious setting and discuss the hardness of Mayer's attack in the context of our protocol.

cs.CR

Secure authentication via Quantum Physical Unclonable Functions: a review

Quantum Physical Unclonable Functions (QPUFs) offer a physically grounded approach to secure authentication, extending the capabilities of classical PUFs. This review covers their theoretical foundations and key implementation challenges - such as quantum memories and Haar-randomness -, and distinguishes QPUFs from Quantum Readout PUFs (QR-PUFs), more experimentally accessible yet less robust against quantum-capable adversaries. A co-citation-based selection method is employed to trace the evolution of QPUF architectures, from early QR-PUFs to more recent Hybrid PUFs (HPUFs). This method further supports a discussion on the role of information-theoretic analysis in mitigating inconsistencies in QPUF responses, underscoring the deep connection between secret-key generation and authentication. Despite notable advances, achieving practical and robust QPUF-based authentication remains an open challenge.

quant-ph

Practical quantum tokens: challenges and perspectives

The concept of quantum tokens dates back alongside quantum cryptography to Stephen Wiesner's seminal work in 1983[1]. Already this initial work proposes society-relevant applications such as secure quantum banknotes, which can be exchanged between a bank and a customer. This quantum currency is based on various physical states that can be easily verified but is protected from being copied by the fundamental quantum laws. Four decades later, these ideas have flourished in the field of quantum information, and the concept of quantum banknotes has not only adopted many varying names, such as quantum money, quantum coins, quantum-digital payments, and quantum tokens, but also reached its first experimental demonstrations. In this perspective article, we discuss the current state-of-the-art of quantum tokens in the field of quantum information, as well as their future perspectives. We present a number of physical realizations of quantum tokens with integrated quantum memories and their applicability scenarios in detail. Finally, we discuss how quantum tokens fit into the information security ecosystem and consider their relationship to post-quantum cryptography.

quant-ph

Detecting Symmetrizability in Physical Systems

We study the problem of data transmission under the influence of a jammer, which is typical for wireless systems and commonly modeled as an arbitrarily varying channel (AVC) in information theory. AVC fulfilling a certain set of linear equations are called symmetrizable and are known to be prone to denial of service attacks. Recent work has shown that deciding if a given AVC is symmetrizable or not is a non-Turing computable problem. By relaxing the formulation of symmetrizability, we show the existence of a polynomial-time algorithm that determines whether a given AVC is non-symmetrizable, but displays a critical dependence on the number of jammer input states. We then show how imposing an energy constraint on the jammer allows the same algorithm to efficiently identify large classes of AVCs which are non-symmetrizable.

quant-ph