arXiv subjects

Peter van Loock

Publications and source records attributed to Peter van Loock.

At least 37 records · Page 2Linked to original sources

arXiv2025

The Octo-Rail Lattice: a four-dimensional cluster state design

Macronode cluster states are promising for fault-tolerant continuous-variable quantum computation, combining gate teleportation via homodyne detection with the Gottesman-Kitaev-Preskill code for universality and error correction. While the two-dimensional Quad-Rail Lattice offers flexibility and low noise, it lacks the dimensionality required for topological error correction codes essential for fault tolerance. This work presents a four-dimensional cluster state, termed the Octo-Rail Lattice, generated using time-domain multiplexing. This new macronode design combines the noise properties and flexibility of the Quad-Rail Lattice with the possibility to run various topological error correction codes including surface and color codes. Besides, the presented experimental setup is easily scalable and includes only static optical components allowing for a straight-forward implementation. Analysis demonstrates that the Octo-Rail Lattice, when combined with GKP qunaught states and the surface code, exhibits noise performance compatible with a fault-tolerant threshold of 9.75 dB squeezing. This ensures universality and fault-tolerance without requiring additional resources such as other non-Gaussian states or feed-forward operations. This finding implies that the primary challenge in constructing an optical quantum computer lies in the experimental generation of these highly non-classical states. Finally, a generalisation of the design to arbitrary dimensions is introduced, where the setup size scales linearly with the number of dimensions. This general framework holds promise for applications such as state multiplexing and state injection.

quant-ph↗

arXiv2025

Bosonic quantum error correction with microwave cavities for quantum repeaters

Long-distance quantum communication necessitates the use of quantum repeaters, which typically include highly coherent quantum memories. We provide a theoretical analysis of the secret key rates for a quantum repeater system incorporating bosonic error correction and memory components. Specifically, we focus on the application of Binomial codes for two repeater segments. Using these codes, our investigation aims to suppress memory loss errors that commonly affect systems such as atoms and microwave cavities, in contrast to dephasing errors in single-spin memories. We further discuss a physical implementation of such a quantum repeater comprising a microwave cavity and a superconducting transmon, capable of state engineering with high fidelities ($>97\%$) and logical Bell state measurements for successful entanglement swapping. As an alternative approach, we also discuss a realization in the all-optical domain.

quant-ph↗

arXiv2025

Quantum repeaters based on stationary and flying Gottesman-Kitaev-Preskill qudits

There are various approaches to long-range quantum communication based on conceptually different forms of quantum repeaters. Here we explore a quantum repeater scheme that employs quantum error correction (QEC) both on the flying (light) qubits and on the stationary (matter) qubits. The idea is to combine the benefits of encoded one-way and two-way schemes where effective channel transmission and loss scaling are enhanced by means of photon loss codes and encoded quantum memories, respectively, while sacrificing some of their advantages such as high clock rates, independent of classical communication times (one-way), and potentially large segment lengths (two-way). More specifically, we illustrate, propose, and analyze such a quantum repeater using the bosonic Gottesman-Kitaev-Preskill (GKP) code which naturally enables encoding and QEC of qudits, protecting them against transmission and memory loss, the latter, for instance, occuring on collective spin modes of atomic ensembles. While the encoded one-way and two-way schemes on their own either require very high repeater link coupling efficiencies and GKP squeezing or allow for experimentally more feasible, small values of these parameters, respectively, we find that there are intermediate parameter regimes where the combined repeater protocol is superior.

quant-ph↗

arXiv2025

Analytical Fidelity Calculations for Photonic Linear Cluster State Generation

By precisely timed optical excitation of their spin, optical emitters such as semiconductor quantum dots or atoms can be harnessed as sources of linear photonic cluster states. This significantly reduces the required resource overhead to reach fault-tolerant optical quantum computing. Here, we develop an algorithm that analytically tracks the global density matrix through the process of the protocol for generating linear-cluster states by Lindner and Rudolph. From this we derive a model to calculate the entangling gate fidelity and the state fidelity of the generated linear optical cluster states. Our model factors in various sources of error, such as spin decoherence and the finite excited state lifetime. Additionally, we highlight the presence of partial reinitialization of spin coherence with each photon emission, eliminating the hard limitation of coherence time. Our framework provides valuable insight into the cost-to-improvement trade-offs for device design parameters as well as the identification of optimal working points. For a combined state-of-the-art quantum dot with a spin coherence time of T_2^*=535 ns and an excited state lifetime of τ=23 ps, we show that a near-unity entangling gate fidelity as well as near-unity state fidelity for 3-photon and 7-photon linear cluster states can be reached.

quant-ph↗

arXiv2025

Memory-corrected quantum repeaters with adaptive syndrome identification

We address the challenge of incorporating encoded quantum memories into an exact secret key rate analysis for small and intermediate-scale quantum repeaters. To this end, we introduce the check matrix model and quantify the resilience of stabilizer codes of up to eleven qubits against Pauli noise, obtaining analytical expressions for effective logical error probabilities. Generally, we find that the five-qubit and Steane codes either outperform more complex, larger codes in the experimentally relevant parameter regimes or have a lower resource overhead. Subsequently, we apply our results to calculate lower bounds on the asymptotic secret key rate in memory-corrected quantum repeaters when using the five-qubit or Steane codes on the memory qubits. The five-qubit code drastically increases the effective memory coherence time, reducing a phase flip probability of $1\%$ to $0.001\%$ when employing an error syndrome identification adapted to the quantum noise channel. Furthermore, it mitigates the impact of faulty Bell state measurements and imperfect state preparation, lowering the minimally required depolarization parameter for non-zero secret key rates in an eight-segment repeater from $98.4\%$ to $96.4\%$. As a result, the memory-corrected quantum repeater can often generate secret keys in experimental parameter regimes where the unencoded repeater fails to produce a secret key. In an eight-segment repeater, one can even achieve non-vanishing secret key rates up to distances of 2000 km for memory coherence times of $t_c = 10$ s or less using multiplexing. Assuming a zero-distance link-coupling efficiency $p_0 = 0.7$, a depolarization parameter $μ= 0.99$, $t_c = 10$ s, and an 800 km total repeater length, we obtain a secret key rate of 4.85 Hz, beating both the unencoded repeater that provides 1.25 Hz and ideal twin-field quantum key distribution with 0.71 Hz at GHz clock rates.

quant-ph↗

arXiv2025

Tripartite multiphoton Jaynes-Cummings model: Analytical solution and Wigner nonclassicalities

We investigate a generic tripartite quantum system featuring a single qubit interacting concurrently with two quantized harmonic oscillators via nonlinear multiphoton Jaynes-Cummings (MPJC) interactions. Assuming the qubit is initially prepared in a superposition state and the two oscillators are in arbitrary Fock states, we analytically trace the temporal evolution of this tripartite pure initial state. We identify four broad cases, each further divided into two subcases, and derive exact analytical solutions for most cases. Notably, we obtain perfect transfer of excitations between the oscillators by carefully selecting system parameters. In addition, we extensively examine the manner in which the nonclassicalities of various initial oscillator Fock states, quantified by the volume of negative regions in the associated Wigner functions, evolve under the MPJC Hamiltonian, considering diverse system parameters including environmental effects. Besides producing substantial enhancements in the initial value for higher photon number states, our analysis reveals that driven solely by the initial qubit energy, with both oscillators initialized in the vacuum state, the nonlinear MPJC interaction yields a significant amount of nontrivial Wigner negativity in the oscillators. The additional nonlinearity introduced by the multiphoton process plays a pivotal role in surpassing the initial nonclassicalities of the photon number states.

quant-ph↗

arXiv2024

Resource-efficient high-threshold fault-tolerant quantum computation with weak nonlinear optics

Quantum computation with light, compared with other platforms, offers the unique benefit of natural high-speed operations at room temperature and large clock rate, but a big obstacle of photonics is the lack of strong nonlinearities which also makes loss-tolerant or generally fault-tolerant quantum computation (FTQC) complicated in an all-optical setup. Typical current approaches to optical FTQC that aim at building suitable large multi-qubit cluster states by linearly fusing small elementary resource states would still demand either fairly expensive initial resources or rather low loss and error rates. Here we propose reintroducing weakly nonlinear operations, such as a weak cross-Kerr interaction, to achieve small initial resource cost and high error thresholds at the same time. More specifically, we propose an approach to generate a large-scale cluster state by hybridizing Gottesman-Kitaev-Preskill (GKP) and single-photon qubits. Our approach enables us to implement FTQC based on GKP squeezing of 7.4 and 8.4 dB and a photon loss rate of 1.0 and 5.0 %, respectively. In addition, our scheme has a reduced resource cost, i.e., number of physical qubits/photons per logical qubit or initial entanglement, compared to high-threshold FTQC with optical GKP qubits or fusion-based quantum computation with encoded single-photon-qubit states, respectively. Furthermore, our approach, when assuming very low photon loss, allows to employ GKP squeezing as little as 3.8 dB, which cannot be achieved by using GKP qubits alone.

quant-ph↗

arXiv2024

Photonic Quantum Receiver Attaining the Helstrom Bound

We propose an efficient decomposition scheme for a quantum receiver that attains the Helstrom bound in the low-photon regime for discriminating binary coherent states. Our method, which avoids feedback as used in Dolinar's case, breaks down nonlinear operations into basic gates used in continuous-variable quantum computation. We account for realistic conditions by examining the impact of photon loss and imperfect photon detection, including the presence of dark counts, while presenting squeezing as a technique to mitigate these noise sources and maintain the advantage over SQL. Our scheme motivates testing quantum advantages with cubic-phase gates and designing photonic quantum computers to optimize symbol-by-symbol measurements in optical communication.

quant-ph↗

arXiv2024

Generalized fusions of photonic quantum states using static linear optics

Using numerical simulations, we explore generalized fusion measurements, extending them in three key ways. We incorporate ancilla-boosting and code-boosting to optimize fusion measurements, which may, but do not necessarily, correspond to Bell measurements. For ancilla-boosting beyond Bell measurements, we identify a hierarchy of fusion efficiencies involving up to four single-photon ancillas. From this numerical evidence, we conjecture the efficiencies for a larger number of single-photon ancillas. Interestingly, our findings suggest that achieving unit efficiency is impossible without utilizing entangled ancilla states. Additionally, in the context of code-boosting, we present an example of a global measurement that surpasses the best-known, via transversal Bell measurements achievable efficiency for a small instance of the quantum parity code.

quant-ph↗

arXiv2024

Genuine non-Gaussian entanglement of light and quantum coherence for an atom from noisy multiphoton spin-boson interactions

Harnessing entanglement and quantum coherence plays a central role in advancing quantum technologies. In quantum optical light-atom platforms, these two fundamental resources are often associated with a Jaynes-Cummings model description describing the coherent exchange of a photon between an optical resonator mode and a two-level spin. In a generic nonlinear spin-boson system, more photons and more modes will take part in the interactions. Here we consider such a generalization -- the two-mode multiphoton Jaynes-Cummings (MPJC) model. We demonstrate how entanglement and quantum coherence can be optimally generated and subsequently manipulated in experimentally accessible parameter regimes. A detailed comparative analysis of this model reveals that nonlinearities within the MPJC interactions produce genuinely non-Gaussian entanglement, devoid of Gaussian contributions, from noisy resources. More specifically, strong coherent sources may be replaced by weaker, incoherent ones, significantly reducing the resource overhead, though at the expense of reduced efficiency. At the same time, increasing the multiphoton order of the MPJC interactions expedites the entanglement generation process, thus rendering the whole generation scheme again more efficient and robust. We further explore the use of additional dispersive spin-boson interactions and Kerr nonlinearities in order to create spin coherence solely from incoherent sources and to enhance the quantum correlations, respectively. As for the latter, somewhat unexpectedly, there is not necessarily an increase in quantum correlations due to the augmented nonlinearity. Towards possible applications of the MPJC model, we show how, with appropriately chosen experimental parameters, we can engineer arbitrary NOON states as well as the tripartite W state.

quant-ph↗

arXiv2024

Implementing arbitrary multi-mode continuous-variable quantum gates with fixed non-Gaussian states and adaptive linear optics

Non-Gaussian quantum gates are essential components for optical quantum information processing. However, the efficient implementation of practically important multi-mode higher-order non-Gaussian gates has not been comprehensively studied. We propose a measurement-based method to directly implement general, multi-mode, and higher-order non-Gaussian gates using only fixed non-Gaussian ancillary states and adaptive linear optics. Compared to existing methods, our method allows for a more resource-efficient and experimentally feasible implementation of multi-mode gates that are important for various applications in optical quantum technology, such as the two-mode cubic quantum non-demolition gate or the three-mode continuous-variable Toffoli gate, and their higher-order extensions. Our results will expedite the progress toward fault-tolerant universal quantum computing with light.

quant-ph↗

arXiv2024

All-optical quantum computing using cubic phase gates

If suitable quantum optical interactions were available, transforming optical field mode operators in a nonlinear fashion, the all-photonics platform could be one of the strongest contenders for realizing a quantum computer. Unlike other, matter-based (solid-state or atomic) platforms, photonic qubits can be operated at room temperature and high clock rates (GHz or, in principle, even THz). In addition, recent continuous-variable time-domain approaches are extremely well scalable. Moreover, while single-photon qubits may be processed directly, "brighter" logical qubits may be embedded in individual oscillator modes, using so-called bosonic codes, for an in-principle fault-tolerant processing. In this paper, we show how elements of all-optical, universal, and fault-tolerant quantum computation can be implemented using only beam splitters together with single-mode cubic phase gates in reasonable numbers, and possibly off-line squeezed-state or single-photon resources. Our approach is based on a decomposition technique combining exact gate decompositions and approximate Trotterization. This allows for efficient decompositions of certain nonlinear continuous-variable multimode gates into the elementary gates, where the few cubic gates needed may even be weak or all identical, thus facilitating potential experiments. The final gate operations include two-mode controlled phase rotation and three-mode Rabi-type Hamiltonian gates, which are shown to be employable for realizing high-fidelity single-photon two-qubit entangling gates or, as a bosonic-code example, creating high-quality Gottesman-Kitaev-Preskill states. We expect our method of general use with various applications, including those that rely on quartic Kerr-type interactions.

quant-ph↗

arXiv2024

Hacking coherent-one-way quantum key distribution with present-day technology

Recent results have shown that the secret-key rate of coherent-one-way (COW) quantum key distribution (QKD) scales quadratically with the system's transmittance, thus rendering this protocol unsuitable for long-distance transmission. This was proven by using a so-called zero-error attack, which relies on an unambiguous state discrimination (USD) measurement. This type of attack allows the eavesdropper to learn the whole secret key without introducing any error. Here, we investigate the feasibility and effectiveness of zero-error attacks against COW QKD with present-day technology. For this, we introduce two practical USD receivers that can be realized with linear passive optical elements, phase-space displacement operations and threshold single-photon detectors. The first receiver is optimal with respect to its success probability, while the second one can impose stronger restrictions on the protocol's performance with faulty eavesdropping equipment. Our findings suggest that zero-error attacks could break the security of COW QKD even assuming realistic experimental conditions.

quant-ph↗

arXiv2024

Quantum repeaters based on stationary Gottesman-Kitaev-Preskill qubits

Quantum repeaters that incorporate quantum error correction codes have been shown to be a promising alternative compared with the original quantum repeaters that rely upon probabilistic quantum error detection depending on classical communication over remote repeater stations. A particularly efficient way of encoding qubits into an error correction code is through bosonic codes where even a single oscillator mode serves as a sufficiently large, physical system. Here we consider the bosonic Gottesman-Kitaev-Preskill (GKP) code as a natural choice for a loss-correction-based quantum repeater. However, unlike existing treatments, we focus on the excitation loss that occurs in the local, stationary memory qubits as represented by, for instance, collective atomic spin modes. We analyze and assess the performance of such a GKP-based quantum repeater where, apart from the initial state generations and distributions, all operations can be performed via deterministic linear mode transformations, as opposed to other existing memory-based quantum repeater schemes.

quant-ph↗

arXiv2023

Propagating Gottesman-Kitaev-Preskill states encoded in an optical oscillator

A quantum computer with low-error, high-speed quantum operations and capability for interconnections is required for useful quantum computations. A logical qubit called Gottesman-Kitaev-Preskill (GKP) qubit in a single Bosonic harmonic oscillator is efficient for mitigating errors in a quantum computer. The particularly intriguing prospect of GKP qubits is that entangling gates as well as syndrome measurements for quantum error correction only require efficient, noise-robust linear operations. To date, however, GKP qubits have been only demonstrated at mechanical and microwave frequency in a highly nonlinear physical system. The physical platform that naturally provides the scalable linear toolbox is optics, including near-ideal loss-free beam splitters and near-unit efficiency homodyne detectors that allow to obtain the complete analog syndrome for optimized quantum error correction. Additional optical linear amplifiers and specifically designed GKP qubit states are then all that is needed for universal quantum computing. In this work, we realize a GKP state in propagating light at the telecommunication wavelength and demonstrate homodyne meausurements on the GKP states for the first time without any loss corrections. Our GKP states do not only show non-classicality and non-Gaussianity at room temperature and atmospheric pressure, but unlike the existing schemes with stationary qubits, they are realizable in a propagating wave system. This property permits large-scale quantum computation and interconnections, with strong compatibility to optical fibers and 5G telecommunication technology.

quant-ph↗

arXiv2023

Performance of Rotation-Symmetric Bosonic Codes in a Quantum Repeater Network

Quantum error correction codes based on continuous variables play an important role for the implementation of quantum communication systems. A natural application of such codes occurs within quantum repeater systems which are used to combat severe channel losses and local gate errors. In particular, channel loss drastically reduces the distance of communication between remote users. Here we consider a cavity-QED based repeater scheme to address the losses in the quantum channel. This repeater scheme relies on the transmission of a specific class of rotationally invariant error-correcting codes. We compare several rotation-symmetric bosonic codes (RSBCs) being used to encode the initial states of two remote users connected by a quantum repeater network against the convention of the cat codes and we quantify the performance of the system using the secret key rate. In particular, we determine the number of stations required to exchange a secret key over a fixed distance and establish the resource overhead.

quant-ph↗

arXiv2023

Error-corrected quantum repeaters with GKP qudits

The Gottesman-Kitaev-Preskill (GKP) code offers the possibility to encode higher-dimensional qudits into individual bosonic modes with, for instance, photonic excitations. Since photons enable the reliable transmission of quantum information over long distances and since GKP states subject to photon loss can be recovered to some extent, the GKP code has found recent applications in theoretical investigations of quantum communication protocols. While previous studies have primarily focused on GKP qubits, the possible practical benefits of higher-dimensional GKP qudits are hitherto widely unexplored. In this paper, we carry out performance analyses for three quantum repeater protocols based on GKP qudits including concatenations with a multi-qudit quantum polynomial code. We find that the potential data transmission gains for qudits are often hampered by their decreased GKP error-correcting capabilities. However, we also identify parameter regimes in which having access to an increased number of quantum levels per mode can enhance the theoretically achievable secret-key rate of the quantum repeater. Some of our protocols share the attractive feature that local processing and complete error syndrome identification are realizable without online squeezing. Provided a supply of suitable multi-mode GKP states is available, this can be realized with a minimal set of passive linear optical operations, even when the logical qudits are composed of many physical qudits.

quant-ph↗

arXiv2022

Gaussian breeding for encoding a qubit in propagating light

Practical quantum computing requires robust encoding of logical qubits in physical systems to protect fragile quantum information. Currently, the lack of scalability limits the logical encoding in most physical systems, and thus the high scalability of propagating light can be a game changer for realizing a practical quantum computer. However, propagating light also has a drawback: the difficulty of logical encoding due to weak nonlinearity. Here, we propose Gaussian breeding that encodes arbitrary Gottesman-Kitaev-Preskill (GKP) qubits in propagating light. The key idea is the efficient and iterable generation of quantum superpositions by photon detectors, which is the most widely used nonlinear element in quantum propagating light. This formulation makes it possible to systematically create the desired qubits with minimal resources. Our simulations show that GKP qubits above a fault-tolerant threshold, including ``magic states'', can be generated with a high success probability and with a high fidelity exceeding 0.99. This result fills an important missing piece toward practical quantum computing.

quant-ph↗