QUROPE Quantum Information Processing and Communication in Europe

We study the effect of electron-electron correlations on the quantum state of the light emitted from high-harmonic generation (HHG). The quantum state of the emitted light is obtained by using a fully quantum mechanical description of both the optical modes as well as the electronic system. This is different from the usual semiclassical description of HHG, which only treats the electronic target system quantum mechanically. Using the generic Fermi-Hubbard model, the strength of the electron-electron correlation can be treated as a parameter enabling us to investigate the two limiting cases of a completely uncorrelated phase and a correlated Mott-insulating phase. In the completely uncorrelated phase, the model reduces to a single-band tight-binding model in which only intraband currents contribute to the spectrum. In this limit, we analytically find that the emitted light is in a classical coherent state. In the Mott-insulating phase, a consideration of the photon statistics and squeezing of the emitted photonic state shows that the inter-Hubbard-subband current generates nonclassical light. In this sense, we show that electron-electron correlation can induce the generation of nonclassical states of light.

The search for long-lived quantum memories, which can be efficiently interfaced with flying qubits is longstanding. One possible solution is to use the electron spin of a color center in diamond to mediate interaction between a long-lived nuclear spin and a photon. Realizing this in a nanodiamond furthermore facilitates the integration into photonic devices and enables the realization of hybrid quantum systems with access to quantum memories. Here, we investigated the spin environment of negatively-charged Silicon-Vacancy centers in a nanodiamond and demonstrate strong coupling of its electron spin, while the electron spin's decoherence rate remained below 1 MHz. We furthermore demonstrate multi-spin coupling with the potential to establish registers of quantum memories in nanodiamonds.

This PhD thesis deals with a number of different problems in mathematical physics with the common thread that they have probabilistic aspects. The problems all stem from mathematical studies of lattice systems in statistical and quantum physics; however beyond that, the selection of the concrete problems is to a certain extent arbitrary. This thesis consists of an introduction and seven papers.

In semiconductor spin quantum bits (qubits), the radio-frequency (RF) gate-based readout is a promising solution for future large-scale integration, as it allows for a fast, frequency-multiplexed readout architecture, enabling multiple qubits to be read out simultaneously. This paper introduces a theoretical framework to evaluate the effect of various parameters, such as the readout probe power, readout chain's noise performance, and integration time on the intrinsic readout signal-to-noise ratio (SNR), and thus readout fidelity of RF gate-based readout systems. By analyzing the underlying physics of spin qubits during readout, this work proposes a qubit readout model that takes into account the qubit's quantum mechanical properties, providing a way to evaluate the trade-offs among the aforementioned parameters. The validity of the proposed model is evaluated by comparing the simulation and experimental results. The proposed analytical approach, the developed model, and the experimental results enable designers to optimize the entire readout chain effectively, thus leading to a faster, lower-power readout system with integrated cryogenic electronics.

Quantum algorithms have begun to surpass classical ones in several computation fields, yet practical application remains challenging due to hardware and software limitations. Here, we introduce a quantum algorithm that quadratically improves spatial discretization within these constraints. Implemented in the quantum software library Pennylane, our algorithm bridges the gap from theoretical models to tangible quantum circuitry. The approach promises enhanced efficiency in quantum spatial analysis, with simulations and hardware experiments validating its potential.

This paper continues the investigation initiated in arXiv:2204.08634 into the quantum thermodynamic properties of space by deriving the vacuum compressibility of a variety of dynamical spacetimes containing massive and massless conformally coupled quantum fields. The quantum processes studied here include particle creation, Casimir effect, and the trace anomaly. The spaces include $S^2, S^3$, and $T^3$ with prescribed time evolution and $S^1$, where the temporal developments are backreaction determined. Vacuum compressibility belongs to the same group of quantum thermodynamic / mechanical response functions as vacuum viscosity, a concept first proposed in 1970 by Zel'dovich for capturing the effects of vacuum particle production on the dynamics of the early universe, made precise by rigorous work of many authors in the following decade using quantum field theory in curved spacetime methodologies and semiclassical gravity theory for treating backreaction effects. Various subtleties in understanding the behavior of the vacuum energies of quantum field origins, negative pressures and novel complicated features of dynamical compressibility are discussed.

Fusion-based photonic quantum computing architectures rely on two primitives: i) near-deterministic generation and control of constant-size entangled states and ii) probabilistic entangling measurements (photonic fusion gates) between entangled states. Here, we demonstrate these key functionalities by fusing resource states deterministically generated using a solid-state spin-photon interface. Repetitive operation of the source leads to sequential entanglement generation, whereby curiously entanglement is created between the quantum states of the same spin at two different instances in time. Such temporal multiplexing of photonic entanglement provides a resource-efficient route to scaling many-body entangled systems with photons.

Quantum signal processing (QSP) is a highly successful algorithmic primitive in quantum computing which leads to conceptually simple and efficient quantum algorithms using the block-encoding framework of quantum linear algebra. Multivariate variants of quantum signal processing (MQSP) could be a valuable tool in extending earlier results via implementing multivariate (matrix) polynomials. However, MQSP remains much less understood than its single-variate version lacking a clear characterization of "achievable" multivariate polynomials. We show that Haah's characterization of general univariate QSP can be extended to homogeneous bivariate (commuting) quantum signal processing. We also show a similar result for an alternative inhomogeneous variant when the degree in one of the variables is at most 1, but construct a counterexample where both variables have degree 2, which in turn refutes an earlier characterization proposed / conjectured by Rossi and Chuang for a related restricted class of MQSP. Finally, we describe homogeneous multivariate (non-commuting) QSP variants that break away from the earlier two-dimensional treatment limited by its reliance on Jordan-like decompositions, and might ultimately lead to the development of novel quantum algorithms.

Symmetries and their anomalies are powerful tools for understanding quantum systems. However, realistic systems are often subject to disorders, dissipation and decoherence. In many circumstances, symmetries are not exact but only on average. This work investigates the constraints on mixed states resulting from non-commuting average symmetries. We will focus on the cases where the commutation relations of the average symmetry generators are violated by nontrivial phases, and call such average symmetry anomalous. We show that anomalous average symmetry implies degeneracy in the density matrix eigenvalues, and present several lattice examples with average symmetries, including XY chain, Heisenberg chain, and deformed toric code models. In certain cases, the results can be further extended to reduced density matrices, leading to a new lower bound on the entanglement entropy. We discuss several applications in the contexts of many body localization, quantum channels, entanglement phase transitions and also derive new constraints on the Lindbladian evolution of open quantum systems.

To achieve scalable universal quantum computing, we need to implement a universal set of logical gates fault-tolerantly, for which the main difficulty lies with non-Clifford gates. We demonstrate that several characteristic features of the reconfigurable atom array platform are inherently well-suited for addressing this key challenge, potentially leading to significant advantages in fidelity and efficiency. Specifically, we consider a series of different strategies including magic state distillation, concatenated code array, and fault-tolerant logical multi-controlled-$Z$ gates, leveraging key platform features such as non-local connectivity, parallel gate action, collective mobility, and native multi-controlled-$Z$ gates. Our analysis provides valuable insights into the efficient experimental realization of logical gates, serving as a guide for the full-cycle demonstration of fault-tolerant quantum computation with reconfigurable atom arrays.

A large amount of effort has recently been put into understanding the barren plateau phenomenon. In this perspective article, we face the increasingly loud elephant in the room and ask a question that has been hinted at by many but not explicitly addressed: Can the structure that allows one to avoid barren plateaus also be leveraged to efficiently simulate the loss classically? We present strong evidence that commonly used models with provable absence of barren plateaus are also classically simulable, provided that one can collect some classical data from quantum devices during an initial data acquisition phase. This follows from the observation that barren plateaus result from a curse of dimensionality, and that current approaches for solving them end up encoding the problem into some small, classically simulable, subspaces. This sheds serious doubt on the non-classicality of the information processing capabilities of parametrized quantum circuits for barren plateau-free landscapes and on the possibility of superpolynomial advantages from running them on quantum hardware. We end by discussing caveats in our arguments, the role of smart initializations, and by highlighting new opportunities that our perspective raises.

We consider a one-dimensional membrane-in-the-middle model for a cavity that consists of two fixed, perfect mirrors and a mobile dielectric membrane between them that has a constant electric susceptibility. We present a sequence of exact cavity angular frequencies that we call {\it structural angular frequencies} and that have the remarkable property that they are independent of the position of the membrane inside the cavity. Furthermore, the case of a thin membrane is considered and simple, approximate, and accurate formulae for the angular frequencies and for the modes of the cavity are obtained. Finally, the cavity electromagnetic potential is numerically calculated and it is found that a multiple scales, analytic solution is an accurate approximation.

Steady technological advances and recent milestones such as intercontinental quantum communication and the first implementation of medium-scale quantum networks are paving the way for the establishment of the quantum internet, a network of nodes interconnected by quantum channels. Here we build upon recent models for quantum networks based on optical fibers by considering the effect of a non-uniform distribution of nodes, more specifically based on the demographic data of the federal states in Brazil. We not only compute the statistical properties of this more realistic network, comparing its features with previous models but also employ it to compute the repetition rates for entanglement swapping, an essential protocol for quantum communication based on quantum repeaters.

The entanglement-induced barren plateau phenomenon is an exponential vanishing of the parameter gradients with system size that limits the use of variational quantum algorithms(VQA). Recently, it was observed that a landscape transition from a barren plateau to no barren plateau occurs if the volume-law growth of entanglement is suppressed by adding measurements with post-selection. This suppression appears to coincide with a measurement-induced phase transition (MIPT) that measurements are known to cause in monitored circuits. From an information theory perspective, we argue that these are different transitions. We back this hypothesis with a numerical study of the cost landscape of such hybrid variational quantum circuits with extensive results on the behavior of cost-gradient variances with and without post-selection, direct visualizations of optimization runs for specific local quantum circuits, and a mutual information measure we introduce and compare with entanglement measures used in the study of MIPT. Specifically, our results show there are two transitions, a measurement-induced landscape transition (MILT) that seems universal across different VQA ansatzes and appears at a lower probability of measurements, and the MIPT that appears at a higher probability of measurements and appears at an ansatz specific location. Finally, to reap the benefits of MILT for optimization, our numerical simulations suggest the necessity of post-selecting measurement outcomes.

We introduce methods of characterizing entanglement, in which entanglement measures are enriched by the matrix representations of operators for observables. These observable operator matrix representations can enrich the partial trace over subsets of a system's degrees of freedom, yielding reduced density matrices useful in computing various measures of entanglement, which also preserve the observable expectation value. We focus here on applying these methods to compute observable-enriched entanglement spectra, unveiling new bulk-boundary correspondences of canonical four-band models for topological skyrmion phases and their connection to simpler forms of bulk-boundary correspondence. Given the fundamental roles entanglement signatures and observables play in study of quantum many body systems, observable-enriched entanglement is broadly applicable to myriad problems of quantum mechanics.

Quantum computing, with its potential to enhance various machine learning tasks, allows significant advancements in kernel calculation and model precision. Utilizing the one-class Support Vector Machine alongside a quantum kernel, known for its classically challenging representational capacity, notable improvements in average precision compared to classical counterparts were observed in previous studies. Conventional calculations of these kernels, however, present a quadratic time complexity concerning data size, posing challenges in practical applications. To mitigate this, we explore two distinct approaches: utilizing randomized measurements to evaluate the quantum kernel and implementing the variable subsampling ensemble method, both targeting linear time complexity. Experimental results demonstrate a substantial reduction in training and inference times by up to 95\% and 25\% respectively, employing these methods. Although unstable, the average precision of randomized measurements discernibly surpasses that of the classical Radial Basis Function kernel, suggesting a promising direction for further research in scalable, efficient quantum computing applications in machine learning.

We investigate the twisted state of an atom and the possible effect of such a state on the properties of the photons emitted as a result of the electron transition in that atom. We first propose a framework for describing the twisted atomic state, and then explore possible differences in the nuclear recoil effects in the twisted atom compared to those in the plane-wave atom. We conclude that if the initial atomic state is twisted, then in a certain observation scheme one can detect a feature of this twist in the distribution of the emitted photons, even in the zero order in $m/M$.

By using the theory of analytic vectors and manifolds modelled on normed spaces, we provide a rigorous symplectic differential geometric approach to $t$-dependent Schr\"odinger equations on separable (possibly infinite-dimensional) Hilbert spaces determined by unbounded $t$-dependent self-adjoint Hamiltonians satisfying a technical condition. As an application, the Marsden--Weinstein reduction procedure is employed to map above-mentioned $t$-dependent Schr\"odinger equations onto their projective spaces. Other applications of physical and mathematical relevance are also analysed.

We show it is possible to obtain quantum pseudorandomness and pseudoentanglement from random subset states -- i.e. quantum states which are equal superpositions over (pseudo)random subsets of strings. This answers an open question of Aaronson et al. [arXiv:2211.00747], who devised a similar construction augmented by pseudorandom phases. Our result follows from a direct calculation of the trace distance between $t$ copies of random subset states and the Haar measure, via the representation theory of the symmetric group. We show that the trace distance is negligibly small, as long as the subsets are of an appropriate size which is neither too big nor too small. In particular, we analyze the action of basis permutations on the symmetric subspace, and show that the largest component is described by the Johnson scheme: the double-cosets of the symmetric group $\mathbb{S}_N$ by the subgroup $\mathbb{S}_t \times \mathbb{S}_{N-t}$. The Gelfand pair property of this setting implies that the matrix eigenbasis coincides with the symmetric group irreducible blocks, with the largest eigenblock asymptotically approaching the Haar average. An immediate corollary of our result is that quantum pseudorandom and pseudoentangled state ensembles do not require relative phases.

We present a computational problem with the following properties: (i) Every instance can be solved with near-certainty by a constant-depth quantum circuit using only nearest-neighbor gates in 3D even when its implementation is corrupted by noise. (ii) Any constant-depth classical circuit composed of unbounded fan-in AND, OR, as well as NOT gates, i.e., an AC0-circuit, of size smaller than a certain subexponential, fails to solve a uniformly random instance with probability greater than a certain constant. Such an advantage against unbounded fan-in classical circuits was previously only known in the noise-free case or without locality constraints. We overcome these limitations, proposing a quantum advantage demonstration amenable to experimental realizations. Subexponential circuit-complexity lower bounds have traditionally been referred to as exponential. We use the term colossal since our fault-tolerant 3D architecture resembles a certain Roman monument.