arXiv subjects

Francesco Arzani

Publications and source records attributed to Francesco Arzani.

16 recordsLinked to original sources

arXiv2026

Quantum low-density lattice codes

Gottesman-Kitaev-Preskill (GKP) codes provide a family of promising schemes for encoding discrete quantum information (qudits) into infinite-dimensional bosonic modes based on mathematical lattices. While such codes, when concatenated with discrete-variable codes, are relatively well studied, the construction and decoding of native GKP codes has largely remained open due to the computationally hard problems encountered. To address this challenge, we advocate a strategy of co-designing the decoder and the quantum error-correcting code itself by constructing lattices for which decoding is feasible: The requirement of efficient decoding effectively determines the quantum error-correcting code. This construction is built on classical low-density lattice codes (LDLCs), a lattice analogue of low-density parity-check codes, here lifted to families of GKP codes. Concretely, we introduce quantum versions of classical, randomly constructed LDLCs. We show that after suitable dimensionality reduction these codes have code properties comparable to or better than concatenated GKP-surface codes of equal number of modes. However, the GKP-LDLCs constructed here do not have a strictly sparse parity check matrix, which motivates our study of the performance of natively analog message-passing decoders originally developed for LDLCs when applied to concatenated GKP-LDPC codes. We show that the fully analog, linear-time decoder achieves performances close to state-of-the-art hybrid qubit-analog decoders. To facilitate future research on the structure and performance of general GKP codes, the relevant source code will be released in open-source Julia packages LatticeDecoder.jl and SymplecticGKP.jl.

quant-ph↗

arXiv2026

Improved GKP magic states from error-corrected non-Gaussian quantum states

Gate teleportation, together with magic state distillation, is a promising route towards fault-tolerant, universal computation. In the context of bosonic quantum computation, Baragiola et al. PRL 123(20).200502 (2019) showed that within the framework of Gottesman--Kitaev--Preskill codes, encoded magic states suitable for distillation can be produced by error correcting Gaussian states, such as the vacuum. Here, we show that applying the same framework to simple non-Gaussian input states can significantly improve the quality of the magic states obtained, reducing the overall resources for the complete distillation procedure. We focus on superpositions of coherent states or Fock states, showing that many can lead to improvements in the generation of high-quality encoded magic states, which in some cases reduces the resources required for magic state distillation by about a factor $3$. We also investigate the primary source of these improvements and find that, unlike what was previously conjectured, the suitability of input states is not fully explained by symmetry arguments. Instead, the best states seem to avoid projection near stabilizer states as a result of the error correction procedure.

quant-ph↗

arXiv2026

Detecting quantum non-Gaussianity with a single quadrature

Full reconstruction of quantum states from measurement samples is often a prohibitively complex task, both in terms of the experimental setup and the scaling of the sample size with the system. This motivates the relatively easier task of certifying application-specific quantities using measurements that are not tomographically complete, i.e. that provide only partial information about the state related to the application of interest. Here, we focus on simplifying the measurements needed to certify non-Gaussianity in bosonic systems, a resource related to quantum advantage in various information processing tasks. We show that the statistics of a single quadrature measurement, corresponding to standard homodyne detection in quantum optics, can witness arbitrary degrees of non-Gaussianity as quantified by stellar rank. Our results are based on a version of Hudson's theorem for wavefunctions, proved in a companion paper [arXiv:2507.23468], revealing that the zeros in a homodyne distribution are signatures of quantum non-Gaussianity and higher stellar ranks. The validity of our witnesses is supported by a technical result showing that sets of states with bounded energy and finite stellar rank are compact. We provide an analysis of sample complexity, noise robustness, and experimental prospects. Our work drastically simplifies the setup required to detect quantum non-Gaussianity in bosonic quantum states.

quant-ph↗

arXiv2026

A hidden bottleneck in classical and quantum linear reservoir computing

We identify a hidden bottleneck in the information processing capacity of linear reservoir computers. When the measured features evolve linearly in the reservoir and the output is formed by linear readout with bias, we show that the capacity available at any fixed delay is limited by what is already present in the preprocessed input. Linear reservoir dynamics can therefore redistribute features, but cannot create new fixed-delay expressive power on their own. This limitation is hidden by global capacity measures, since contributions from different delays can accumulate even when each individual delay is strongly constrained. As an experimentally important realization of this general result, we derive the corresponding Gaussian limit for covariance-based continuous-variable quantum reservoirs. Numerical experiments show that experimentally accessible single-photon operations surpass this limit, establishing them as a genuine resource for quantum reservoir computing. The resulting excess capacity also provides an operational witness of non-Gaussian processing in black-box continuous-variable systems under minimal assumptions.

quant-ph↗

arXiv2025

On the complex zeros of the wavefunction

The Schrödinger wavefunction is ubiquitous in quantum mechanics, quantum chemistry, and bosonic quantum information theory. Its zero-set for fermionic systems is well-studied and central for determining chemical properties, yet for bosonic systems the zero-set is less understood, especially in the context of characterizing non-classicality. Here we study the zeros of such wavefunctions and give them a novel information-theoretic interpretation. Our main technical result is showing that the wavefunction of most bosonic quantum systems can be extended to a holomorphic function over the complex plane, allowing the application of powerful techniques from complex analysis. As a consequence, we prove a version of Hudson's theorem for the wavefunction and characterize Gaussian dynamics as classical motion of the wavefunction zeros. Our findings suggest that the non-Gaussianity of quantum optical states can be detected by measuring a single quadrature of the electromagnetic field, which we demonstrate in a companion paper [arXiv:2507.23005]. More generally, our results show that the non-Gaussian features of bosonic quantum systems are encoded in the zeros of their wavefunction.

quant-ph↗

arXiv2025

Towards fault-tolerant quantum computation with universal continuous-variable gates

Continuous-variable (CV) systems have shown remarkable potential for quantum computation, particularly excelling in scalability and error correction through bosonic encoding. Within this framework, the foundational notion of computational universality was introduced in [Phys. Rev. Lett. 82, 1784 (1999)], and has proven especially successful since it allows for the identification of finite sets of universal CV gates independent of the encoding scheme. However, achieving the critical objective of fault-tolerant computation requires some form of encoding, and to date there has been no proof that these universal CV gates can lead to encoded fault tolerance. We present compelling evidence in this direction by utilizing the Gottesman-Kitaev-Preskill (GKP) encoding. Specifically, we numerically optimize the generation of GKP states from vacua using circuits comprised solely of universal CV gates. We demonstrate that these states can be attained with sufficient quality to exhibit error probabilities lower than the threshold needed to achieve a fault-tolerant memory via concatenated GKP-stabilizer codes.

quant-ph↗

arXiv2025

Can effective descriptions of bosonic systems be considered complete?

Bosonic statistics give rise to remarkable phenomena, from the Hong-Ou-Mandel effect to Bose-Einstein condensation, with applications spanning fundamental science to quantum technologies. Modeling bosonic systems relies heavily on effective descriptions: typical examples include truncating their infinite-dimensional state space and restricting their dynamics to a simple class of Hamiltonians, such as polynomials of canonical operators, which are used to define quantum computing over bosonic modes. However, many natural bosonic Hamiltonians do not belong to this simple class, and some quantum effects harnessed by bosonic computers inherently require infinite-dimensional spaces, questioning the validity of such effective descriptions of bosonic systems. How can we trust results obtained with such simplifying assumptions to capture real effects? Driven by the increasing importance of bosonic systems for quantum technologies, we solve this outstanding problem by showing that these effective descriptions do in fact capture the relevant physics of bosonic systems. Our technical contribution is twofold: firstly, we prove that any physical, bosonic unitary evolution can be strongly approximated by a finite-dimensional unitary evolution; secondly, we show that any finite-dimensional unitary evolution can be generated exactly by a bosonic Hamiltonian that is a polynomial of canonical operators. Beyond their fundamental significance, our results have implications for classical and quantum simulations of bosonic systems, they provide universal methods for engineering bosonic quantum states and Hamiltonians, they show that polynomial Hamiltonians do generate universal gate sets for quantum computing over bosonic modes, and they lead to an infinite-dimensional Solovay--Kitaev theorem.

quant-ph↗

arXiv2022

Exploiting symmetry in variational quantum machine learning

Variational quantum machine learning is an extensively studied application of near-term quantum computers. The success of variational quantum learning models crucially depends on finding a suitable parametrization of the model that encodes an inductive bias relevant to the learning task. However, precious little is known about guiding principles for the construction of suitable parametrizations. In this work, we holistically explore when and how symmetries of the learning problem can be exploited to construct quantum learning models with outcomes invariant under the symmetry of the learning task. Building on tools from representation theory, we show how a standard gateset can be transformed into an equivariant gateset that respects the symmetries of the problem at hand through a process of gate symmetrization. We benchmark the proposed methods on two toy problems that feature a non-trivial symmetry and observe a substantial increase in generalization performance. As our tools can also be applied in a straightforward way to other variational problems with symmetric structure, we show how equivariant gatesets can be used in variational quantum eigensolvers.

quant-ph↗

arXiv2022

Gottesman-Kitaev-Preskill codes: A lattice perspective

We examine general Gottesman-Kitaev-Preskill (GKP) codes for continuous-variable quantum error correction, including concatenated GKP codes, through the lens of lattice theory, in order to better understand the structure of this class of stabilizer codes. We derive formal bounds on code parameters, show how different decoding strategies are precisely related, propose new ways to obtain GKP codes by means of glued lattices and the tensor product of lattices and point to natural resource savings that have remained hidden in recent approaches. We present general results that we illustrate through examples taken from different classes of codes, including scaled self-dual GKP codes and the concatenated surface-GKP code.

quant-ph↗

arXiv2019

Random coding for sharing bosonic quantum secrets

We consider a protocol for sharing quantum states using continuous variable systems. Specifically we introduce an encoding procedure where bosonic modes in arbitrary secret states are mixed with several ancillary squeezed modes through a passive interferometer. We derive simple conditions on the interferometer for this encoding to define a secret sharing protocol and we prove that they are satisfied by almost any interferometer. This implies that, if the interferometer is chosen uniformly at random, the probability that it may not be used to implement a quantum secret sharing protocol is zero. Furthermore, we show that the decoding operation can be obtained and implemented efficiently with a Gaussian unitary using a number of single-mode squeezers that is at most twice the number of modes of the secret, regardless of the number of players. We benchmark the quality of the reconstructed state by computing the fidelity with the secret state as a function of the input squeezing.

quant-ph↗

arXiv2019

High-dimensional quantum encoding via photon-subtracted squeezed states

We introduce a high-dimensional quantum encoding based on coherent mode-dependent single-photon subtraction from multimode squeezed states. This encoding can be seen as a generalization to the case of non-zero squeezing of the standard single-photon multi-rail encoding. The advantage is that the presence of squeezing enables the use of common tools in continuous-variable quantum processing, which in turn allows to show that arbitrary $d$-level quantum states can be generated and detected via simply tuning the classical fields that gates the photon-subtraction scheme. Therefore, the scheme is suitable for mapping arbitrary classical data in quantum mechanical form. Regardless the dimension of the data set alphabet, the mapping is conditioned on the subtraction of a single photon only, making it nearly unconditional. We prove that this encoding can be used to calculate vector distances, a pivotal primitive in various quantum machine learning algorithms.

quant-ph↗

arXiv2018

Reconfigurable optical implementation of quantum complex networks

Network theory has played a dominant role in understanding the structure of complex systems and their dynamics. Recently, quantum complex networks, i.e. collections of quantum systems in a non-regular topology, have been explored leading to significant progress in a multitude of diverse contexts including, e.g., quantum transport, open quantum systems, quantum communication, extreme violation of local realism, and quantum gravity geometries. However, the question on how to produce and control general quantum complex networks in experimental laboratory has remained open. Here we propose an all optical and reconfigurable implementation of quantum complex networks. The experimental proposal is based on optical frequency combs, parametric processes, pulse shaping and multimode measurements allowing the arbitrary control of the number of the nodes (optical modes) and topology of the links (interactions between the modes) within the network. Moreover, we also show how to simulate quantum dynamics within the network combined with the ability to address its individual nodes. To demonstrate the versatility of these features, we discuss the implementation of two recently proposed probing techniques for quantum complex networks and structured environments. Overall, our general method for implementing quantum complex networks with reconfigurable set-up has potential to define an experimental playground for designing and controlling complex networks -- and dynamics therein -- for several quantum physical frameworks.

quant-ph↗

arXiv2018

Violating Bell inequalities with entangled optical frequency combs and multi-pixel homodyne detection

We have theoretically investigated the possibility of using any of several continuous-variable Bell-type inequalities - for which the dichotomic measurements are achieved with coarse-grained quadrature (homodyne) measurements - in a multi-party configuration where each participant is given a section, in the frequency domain, of the output of an optical parametric oscillator which has been synchronously-pumped with a frequency comb. Such light sources are undergoing intense study due to their novel properties, including the potential for production of light entangled in many hundreds of physical modes - a critical component for many proposals in optical or hybrid-optical quantum computation proposals. The situation we study notably uses only highly-efficient optical homodyne detection, meaning that in such systems the fair-sampling loophole would be relatively easy to avoid.

quant-ph↗

arXiv2018

Versatile engineering of multimode squeezed states by optimizing the pump spectral profile in spontaneous parametric down-conversion

We study the quantum correlations induced by spontaneous parametric down-conversion (SPDC) of a frequency comb. We derive a theoretical method to find the output state corresponding to a pump with an arbitrary spectral profile. After applying it to the relevant example of a spectrally chirped pump, we run an optimization algorithm to numerically find the pump profiles maximizing some target functions. These include the number of independently squeezed modes and the variances of nullifiers defining cluster states used in many continuous-variable quantum information protocols. To assess the advantages of pump-shaping in real experiments we take into account the physical limitations of the pulse shaper.

quant-ph↗

arXiv2017

Polynomial approximation of non-Gaussian unitaries by counting one photon at a time

In quantum computation with continous-variable systems, quantum advantage can only be achieved if some non-Gaussian resource is available. Yet, non-Gaussian unitary evolutions and measurements suited for computation are challenging to realize in the lab. We propose and analyze two methods to apply a polynomial approximation of any unitary operator diagonal in the amplitude quadrature representation, including non-Gaussian operators, to an unknown input state. Our protocols use as a primary non-Gaussian resource a single-photon counter. We use the fidelity of the transformation with the target one on Fock and coherent states to assess the quality of the approximate gate.

quant-ph↗

arXiv2017

A direct approach to Gaussian measurement based quantum computation

In this work we introduce a general scheme for measurement based quantum computation in continuous variables. Our approach does not necessarily rely on the use of ancillary cluster states to achieve its aim, but rather on the detection of a resource state in a suitable mode basis followed by digital post-processing, and involves an optimization of the adjustable experimental parameters. After introducing the general method, we present some examples of application to simple specific computations.

quant-ph↗