Searcharxiv⌕ Search

arXiv subjects

Frédéric Grosshans

Publications and source records attributed to Frédéric Grosshans.

At least 19 recordsLinked to original sources

Private training in quantum machine learning

With the emergence of machine learning (ML) models trained on large datasets containing potentially sensitive data, a major question in AI safety is how to make learning private with respect to the training data. Similar to classical machine learning, quantum machine learning (QML) models are not devoid of privacy vulnerabilities. Differential privacy (DP) is a standard tool for training ML models on sensitive data, but its impact in QML remains poorly understood. In this work we study private training in hybrid variational QML models using a classical private DP-SGD optimizer applied to pipelines with classical inputs and outputs. We analyze the interplay between gradient clipping and calibrated noise addition in DP-SGD, and its impact on optimization and accuracy for noisy and noiseless quantum models. We first explain why quantum noise does not provide a satisfactory replacement for the calibrated noise in DP-SGD for ensuring privacy. We then show how the deterministic bounds on gradient norms for a wide class of quantum models translate into explicit control of the detrimental clipping bias introduced by DP-SGD. Finally, we formulate a numerical comparison protocol under fixed clipping threshold and privacy budget and evaluate it on synthetic and image-classification tasks for equivalent quantum and classical models. Our results suggest that quantum models can retain higher accuracy in private-training regimes where the formal privacy guarantee is ensured by a classical DP-SGD mechanism.

quant-ph↗

Qudit Clauser-Horne-Shimony-Holt Inequality and Nonlocality from Wigner Negativity

Nonlocality is an essential concept that distinguishes quantum from classical models and has been extensively studied in systems of qubits. For higher-dimensional systems, certain results for their two-level counterpart, like Bell violations with stabilizer states and Clifford operators, do not generalize. On the other hand, similar to continuous variable systems, Wigner negativity is necessary for nonlocality in qudit systems. We propose a new generalization of the CHSH inequality for qudits by inquiring correlations related to the Wigner negativity of stabilizer states under the adjoint action of a generalization of the qubit $π/8$-gate. A specified stabilizer state maximally violates the inequality among all qudit states based on its Wigner negativity. The Bell operator not only serves as a measure for the singlet fraction but also quantifies the volume of Wigner negativity. Additionally, we show how a bipartite entangled qudit state can serve as a witness for contextuality when it exhibits Wigner negativity. Furthermore, we identify rational-phase diagonal unitaries as the key resource that exactly reproduce the CGLMP and SATWAP violation with the maximally entangled state through simple phase-difference alignment.

quant-ph↗

Multicopy quantum state teleportation with application to storage and retrieval of quantum programs

This work considers a teleportation task for Alice and Bob in a scenario where Bob cannot perform corrections. In particular, we analyse the task of \textit{multicopy state teleportation}, where Alice has $k$ identical copies of an arbitrary unknown $d$-dimensional qudit state $\vertψ\rangle$ to teleport a single copy of $\vertψ\rangle$ to Bob using a maximally entangled two-qudit state shared between Alice and Bob without Bob's correction. Alice may perform a joint measurement on her half of the entangled state and the $k$ copies of $\vertψ\rangle$. We prove that the maximal probability of success for teleporting the exact state $\vertψ\rangle$ to Bob is $p(d,k)=\frac{k}{d(k-1+d)}$ and present an explicit protocol to attain this performance. Then, by utilising $k$ copies of an arbitrary target state $\vertψ\rangle$, we show how the multicopy state teleportation protocol can be employed to enhance the success probability of storage and retrieval of quantum programs, which aims to universally retrieve the action of an arbitrary quantum channel that is stored in a state. Our proofs make use of group representation theory methods, which may find applications beyond the problems addressed in this work.

quant-ph↗

A unified framework for Bell inequalities from continuous-variable contextuality

Although the original EPR paradox was formulated in terms of position and momentum, most studies of these phenomena have focused on measurement scenarios with only a discrete number of possible measurement outcomes. Here, we present a framework for studying non-locality that is agnostic to the dimension of the physical systems involved, allowing us to probe purely continuous-variable, discrete-variable, or hybrid non-locality. Our approach allows us to find the optimal Bell inequality for any given measurement scenario and quantifies the amount of non-locality that is present in measurement statistics. This formalism unifies the existing literature on continuous-variable non-locality and allows us to identify new states in which Bell non-locality can be probed through homodyne detection. Notably, we find the first example of continuous-variable non-locality that cannot be mapped to a CHSH Bell inequality. Moreover, we provide several examples of simple hybrid DV-CV entangled states that could lead to near-term violation of Bell inequalities.

quant-ph↗

Self-Testing Graph States Permitting Bounded Classical Communication

Self-testing identifies quantum states and correlations that exhibit nonlocality, distinguishing them, up to local transformations, from other quantum states. Due to their strong nonlocality, it is known that all graph states can be self-tested in the standard setting - where parties are not allowed to communicate. Recently it has been shown that graph states display nonlocal correlations even when bounded classical communication on the underlying graph is permitted, a feature that has found applications in proving a circuit-depth separation between classical and quantum computing. In this work, we develop self testing in the framework of bounded classical communication, and we show that certain graph states can be robustly self-tested even allowing for communication. In particular, we provide an explicit self-test for the circular graph state and the honeycomb cluster state - the latter known to be a universal resource for measurement based quantum computation. Since communication generally obstructs self-testing of graph states, we further provide a procedure to robustly self-test any graph state from larger ones that exhibit nonlocal correlations in the communication scenario.

quant-ph↗

Robustly self-testing all maximally entangled states in every finite dimension

We establish a device-independent, noise-tolerant certification of maximally entangled states in every finite dimension $d$. The core ingredient is a $d$-input, $d$-outcome Bell experiment that generalizes the Clauser-Horne-Shimony-Holt test from qubits to qudits, where each setting is a non-diagonal Heisenberg-Weyl observable. For every odd prime $d \geq 3$, the associated Bell operator has an exact sum-of-positive-operators decomposition, yielding the Cirelson bound in closed form, from which we reconstruct the Heisenberg-Weyl commutation relations on the support of the state. We then extend the Mayers-Yao local isometry from qubits to prime-dimensional systems and show that any $ε$-near-optimal strategy below that bound is, up to local isometries, within trace distance $δ= \mathcal{O}(\sqrtε)$ of the ideal maximally entangled state; the implemented measurements are correspondingly close to the target observables. Via a tensor-factor argument, the prime-dimension result extends the self-testing protocol to every composite dimension $d$. The protocol uses standard Heisenberg-Weyl operations and non-Clifford phase gates that are diagonal in the computational basis, making it directly applicable to high-dimensional photonic and atomic platforms.

quant-ph↗

Entanglement Swapping in Orbit: a Satellite Quantum Link Case Study

Satellite quantum communication is a promising way to build long distance quantum links, making it an essential complement to optical fiber for quantum internetworking beyond metropolitan scales. A satellite point to point optical link differs from the more common fiber links in many ways, both quantitative (higher latency, strong losses) and qualitative (nonconstant parameter values during satellite passage, intermittency of the link, impossibility to set repeaters between the satellite and the ground station). We study here the performance of a quantum link between two ground stations, using a quantum-memory-equipped satellite as a quantum repeater. In contrast with quantum key distribution satellite links, the number of available quantum memory slots m, together with the unavoidable round-trip communication latency t of at least a few milliseconds, severely reduces the effective average repetition rate to m/t -- at most a few kilohertz for foreseeable quantum memories. Our study uses two approaches, which validate each other: 1) a simple analytical model of the effective rate of the quantum link; 2) an event-based simulation using the open source Quantum Internet Simulation Package (QuISP). The important differences between satellite and fiber links led us to modify QuISP itself. This work paves the way to the study of hybrid satellite- and fiber-based quantum repeater networks interconnecting different metropolitan areas.

quant-ph↗

A Linear Algebraic Framework for Dynamic Scheduling Over Memory-Equipped Quantum Networks

Quantum Internetworking is a recent field that promises numerous interesting applications, many of which require the distribution of entanglement between arbitrary pairs of users. This work deals with the problem of scheduling in an arbitrary entanglement swapping quantum network - often called first generation quantum network - in its general topology, multicommodity, loss-aware formulation. We introduce a linear algebraic framework that exploits quantum memory through the creation of intermediate entangled links. The framework is then employed to apply Lyapunov Drift Minimization (a standard technique in classical network science) to mathematically derive a natural class of scheduling policies for quantum networks minimizing the square norm of the user demand backlog. Moreover, an additional class of Max-Weight inspired policies is proposed and benchmarked, reducing significantly the computation cost at the price of a slight performance degradation. The policies are compared in terms of information availability, localization and overall network performance through an ad-hoc simulator that admits user-provided network topologies and scheduling policies in order to showcase the potential application of the provided tools to quantum network design.

quant-ph↗

Linear optical logical Bell state measurements with optimal loss-tolerance threshold

Quantum threshold theorems impose hard limits on the hardware capabilities to process quantum information. We derive tight and fundamental upper bounds to loss-tolerance thresholds in different linear-optical quantum information processing settings through an adversarial framework, taking into account the intrinsically probabilistic nature of linear optical Bell measurements. For logical Bell state measurements - ubiquitous operations in photonic quantum information - we demonstrate analytically that linear optics can achieve the fundamental loss threshold imposed by the no-cloning theorem even though, following the work of Lee et al., (Phys. Rev. A 100, 052303 (2019)), the constraint was widely assumed to be stricter. We spotlight the assumptions of the latter publication and find their bound holds for a logical Bell measurement built from adaptive physical linear-optical Bell measurements. We also give an explicit even stricter bound for non-adaptive Bell measurements.

quant-ph↗

Non-Destructive Zero-Knowledge Proofs on Quantum States, and Multi-Party Generation of Authorized Hidden GHZ States

We propose the first generalization of the famous Non-Interactive Zero-Knowledge (NIZK) proofs to quantum languages (NIZKoQS) and we provide a protocol to prove advanced properties on a received quantum state non-destructively and non-interactively (a single message being sent from the prover to the verifier). In our second orthogonal contribution, we improve the costly Remote State Preparation protocols [CCKW18,CCKW19,GV19] that can classically fake a quantum channel (this is at the heart of our NIZKoQS protocol) by showing how to create a multi-qubits state from a single superposition. Finally, we generalize these results to a multi-party setting and prove that multiple parties can anonymously distribute a GHZ state in such a way that only participants knowing a secret credential can share this state, which could have applications to quantum anonymous transmission, quantum secret sharing, quantum onion routing and more.

quant-ph↗

Inflated Graph States Refuting Communication-Assisted LHV Models

Standard Bell inequalities hold when distant parties are not allowed to communicate. Barrett et al. found correlations from Pauli measurements on certain network graphs refute a local hidden variable (LHV) description even allowing some communication along the graph. This has recently found applications in proving separation between classical and quantum computing, in terms of shallow circuits, and distributed computing. The correlations presented by Barrett et al. can be understood as coming from an extension of three party GHZ state correlations which can be embedded on a graph state. In this work, we propose systematic extensions of any graph state, which we dub inflated graph states such that they exhibit correlations which refute any communication assisted LHV model. We further show the smallest possible such example, with a 7-qubit linear graph state, as well as specially crafted smaller examples with 5 and 4 qubits. The latter is the smallest possible violation using binary inputs and outputs.

quant-ph↗

A Linear Algebraic Framework for Quantum Internet Dynamic Scheduling

Future quantum internet aims to enable quantum communication between arbitrary pairs of distant nodes through the sharing of end-to-end entanglement, a universal resource for many quantum applications. As in classical networks, quantum networks also have to resolve problems related to routing and satisfaction of service at a sufficient rate. We deal here with the problem of scheduling when multiple commodities must be served through a quantum network based on first generation quantum repeaters, or quantum switches. To this end, we introduce a novel discrete-time algebraic model for arbitrary network topology, including transmission and memory losses, and adapted to dynamic scheduling decisions. Our algebraic model allows the scheduler to use the storage of temporary intermediate links to optimize the performance, depending on the information availability, ranging from full global information for a centralized scheduler to partial local information for a distributed one. As an illustrative example, we compare a simple greedy scheduling policy with several Max-Weight inspired scheduling policies and illustrate the resulting achievable rate regions for two competing pairs of clients through a network.

cs.NI↗

Witnessing Wigner Negativity

Negativity of the Wigner function is arguably one of the most striking non-classical features of quantum states. Beyond its fundamental relevance, it is also a necessary resource for quantum speedup with continuous variables. As quantum technologies emerge, the need to identify and characterize the resources which provide an advantage over existing classical technologies becomes more pressing. Here we derive witnesses for Wigner negativity of single-mode and multimode quantum states, based on fidelities with Fock states, which can be reliably measured using standard detection setups. They possess a threshold expectation value indicating whether the measured state has a negative Wigner function. Moreover, the amount of violation provides an operational quantification of Wigner negativity. We phrase the problem of finding the threshold values for our witnesses as an infinite-dimensional linear optimisation problem. By relaxing and restricting the corresponding linear programs, we derive two converging hierarchies of semidefinite programs, which provide numerical sequences of increasingly tighter upper and lower bounds for the threshold values. We further show that our witnesses form a complete family - each Wigner negative state is detected by at least one witness - thus providing a reliable method for experimentally witnessing Wigner negativity of quantum states from few measurements. From a foundational perspective, our findings provide insights on the set of positive Wigner functions which still lacks a proper characterisation.

quant-ph↗

Efficient verification of Boson Sampling

The demonstration of quantum speedup, also known as quantum computational supremacy, that is the ability of quantum computers to outperform dramatically their classical counterparts, is an important milestone in the field of quantum computing. While quantum speedup experiments are gradually escaping the regime of classical simulation, they still lack efficient verification protocols and rely on partial validation. Here we derive an efficient protocol for verifying with single-mode Gaussian measurements the output states of a large class of continuous-variable quantum circuits demonstrating quantum speedup, including Boson Sampling experiments, thus enabling a convincing demonstration of quantum speedup with photonic computing. Beyond the quantum speedup milestone, our results also enable the efficient and reliable certification of a large class of intractable continuous-variable multimode quantum states.

quant-ph↗

Error-correcting entanglement swapping using a practical logical photon encoding

Several emerging quantum technologies, including quantum networks, modular and fusion-based quantum computing, rely crucially on the ability to perform photonic Bell state measurements. Therefore, photon losses and the 50\% success probablity upper bound of Bell state measurements pose a critical limitation to photonic quantum technologies. Here, we develop protocols that overcome these two key challenges through logical encoding of photonic qubits. Our approach uses a tree graph state logical encoding, which can be produced deterministically with a few quantum emitters, and achieves near-deterministic logical photonic Bell state measurements while also protecting against errors including photon losses, with a record loss-tolerance threshold.

quant-ph↗

Classical simulation of Gaussian quantum circuits with non-Gaussian input states

We consider Gaussian quantum circuits supplemented with non-Gaussian input states and derive sufficient conditions for efficient classical strong simulation of these circuits. In particular, we generalise the stellar representation of continuous-variable quantum states to the multimode setting and relate the stellar rank of the input non-Gaussian states, a recently introduced measure of non-Gaussianity, to the cost of evaluating classically the output probability densities of these circuits. Our results have consequences for the strong simulability of a large class of near-term continuous-variable quantum circuits.

quant-ph↗

Classical-quantum network coding: a story about tensor

We study here the conditions to perform the distribution of a pure state on a quantum network using quantum operations which can succeed with a non-zero probability, the Stochastic Local Operation and Classical Communication (SLOCC) operations. In their pioneering 2010 work, Kobayashi et al. showed how to convert any classical network coding protocol into a quantum network coding protocol. However, they left open whether the existence of a quantum network coding protocol implied the existence of a classical one. Motivated by this question, we characterize the set of distribution tasks achievable with non zero probability for both classical and quantum networks. We develop a formalism which encompasses both types of distribution protocols by reducing the solving of a distribution task to the factorization of a tensor with complex coefficients or real positive ones. Using this formalism, we examine the equivalences and differences between both types of distribution protocols exhibiting several elementary and fundamental relations between them as well as concrete examples of both convergence and divergence. We answer by the negative to the issue previously left open: some tasks are achievable in the quantum setting, but not in the classical one. We believe this formalism to be a useful tool for studying the extent of quantum network ability to perform multipartite distribution tasks.

quant-ph↗

Certification of non-Gaussian states with operational measurements

We derive a theoretical framework for the experimental certification of non-Gaussian features of quantum states using double homodyne detection. We rank experimental non-Gaussian states according to the recently defined stellar hierarchy and we propose practical Wigner negativity witnesses. We simulate various use-cases ranging from fidelity estimation to witnessing Wigner negativity. Moreover, we extend results on the robustness of the stellar hierarchy of non-Gaussian states. Our results illustrate the usefulness of double homodyne detection as a practical measurement scheme for retrieving information about continuous variable quantum states.

quant-ph↗