Xavier Coiteux-Roy
YOU?
Author Swipe
View article: Factoring an integer with three oscillators and a qubit
Factoring an integer with three oscillators and a qubit Open
A common starting point of traditional quantum algorithm design is the notion of a universal quantum computer with a scalable number of qubits. This convenient abstraction mirrors classical computations manipulating bits. It allows for a d…
View article: Complexity of Gottesman-Kitaev-Preskill States
Complexity of Gottesman-Kitaev-Preskill States Open
We initiate the study of state complexity for continuous-variable quantum systems. Concretely, we consider a setup with bosonic modes and auxiliary qubits, where available operations include Gaussian one- and two-mode operations and single…
View article: Online Locality Meets Distributed Quantum Computing
Online Locality Meets Distributed Quantum Computing Open
We connect three distinct lines of research that have recently explored extensions of the classical LOCAL model of distributed computing: A. distributed quantum computing and non-signaling distributions [e.g. STOC 2024], B. finitely-depend…
View article: Distributed Quantum Advantage for Local Problems
Distributed Quantum Advantage for Local Problems Open
We present the first local problem that shows a super-constant separation between the classical randomized LOCAL model of distributed computing and its quantum counterpart. By prior work, such a separation was known only for an artificial …
View article: The genuinely multipartite nonlocality of graph states is model-dependent
The genuinely multipartite nonlocality of graph states is model-dependent Open
The notion of genuinely multipartite nonlocality (GMNL) was introduced to conceptualize the fact that nonclassical resources involving more than two parties in a nontrivial way may be needed to account for some quantum correlations. In thi…
View article: Temperature as joules per bit
Temperature as joules per bit Open
In statistical mechanics, entropy is defined as a fundamental quantity. However, its unit, J/K, involves that of temperature, which is only subsequently defined—and defined in terms of entropy. This circularity arises with the introduction…
View article: Factoring an integer with three oscillators and a qubit
Factoring an integer with three oscillators and a qubit Open
A common starting point of traditional quantum algorithm design is the notion of a universal quantum computer with a scalable number of qubits. This convenient abstraction mirrors classical computations manipulating finite sets of symbols,…
View article: Single-qubit gate teleportation provides a quantum advantage
Single-qubit gate teleportation provides a quantum advantage Open
Gate-teleportation circuits are arguably among the most basic examples of computations believed to provide a quantum computational advantage: In seminal work \cite{TerhalDiVincenzo04}, Terhal and DiVincenzo have shown that these circuits e…
View article: The complexity of Gottesman-Kitaev-Preskill states
The complexity of Gottesman-Kitaev-Preskill states Open
We initiate the study of state complexity for continuous-variable quantum systems. Concretely, we consider a setup with bosonic modes and auxiliary qubits, where available operations include Gaussian one- and two-mode operations, single- a…
View article: No Distributed Quantum Advantage for Approximate Graph Coloring
No Distributed Quantum Advantage for Approximate Graph Coloring Open
Publisher Copyright: © 2024 Owner/Author.
View article: The genuinely multipartite nonlocality of graph states is model-dependent
The genuinely multipartite nonlocality of graph states is model-dependent Open
Bell's theorem proves that some quantum state correlations can only be explained by bipartite non-classical resources. The notion of genuinely multipartite nonlocality (GMNL) was later introduced to conceptualize the fact that nonclassical…
View article: Temperature as Joules per Bit
Temperature as Joules per Bit Open
In statistical mechanics, entropy is defined as a fundamental quantity. However, its unit, J/K, involves that of temperature, which is only subsequently defined - and defined in terms of entropy. This circularity arises with the introducti…
View article: A colossal advantage: 3D-local noisy shallow quantum circuits defeat unbounded fan-in classical circuits
A colossal advantage: 3D-local noisy shallow quantum circuits defeat unbounded fan-in classical circuits Open
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…
View article: No distributed quantum advantage for approximate graph coloring
No distributed quantum advantage for approximate graph coloring Open
We give an almost complete characterization of the hardness of $c$-coloring $χ$-chromatic graphs with distributed algorithms, for a wide range of models of distributed computing. In particular, we show that these problems do not admit any …
View article: Unconditional Proofs-of-Work and Other Possibilities of Thermodynamic Cryptography
Unconditional Proofs-of-Work and Other Possibilities of Thermodynamic Cryptography Open
In line with advances in recent years about realizing cryptographic functionalities in an information-theoretically secure way from physical phenomena and laws, we propose here to obtain useful tasks from the sole assumption of limited fre…
View article: Single-qubit gate teleportation provides a quantum advantage
Single-qubit gate teleportation provides a quantum advantage Open
Gate-teleportation circuits are arguably among the most basic examples of computations believed to provide a quantum computational advantage: In seminal work [Quantum Inf. Comput., 4(2):134--145], Terhal and DiVincenzo have shown that thes…
View article: Key Agreement and Oblivious Transfer from Free-Energy Limitations
Key Agreement and Oblivious Transfer from Free-Energy Limitations Open
We propose one of the very few constructive consequences of the second law of thermodynamics. More specifically, we present protocols for secret-key establishment and multiparty computation the security of which is based fundamentally on L…
View article: Can't touch this: unconditional tamper evidence from short keys
Can't touch this: unconditional tamper evidence from short keys Open
Storing data on an external server with information-theoretic security, while using a key shorter than the data itself, is impossible. As an alternative, we propose a scheme that achieves information-theoretically secure tamper evidence: T…
View article: Experimental Demonstration that No Tripartite-Nonlocal Causal Theory Explains Nature's Correlations
Experimental Demonstration that No Tripartite-Nonlocal Causal Theory Explains Nature's Correlations Open
Quantum theory predicts the existence of genuinely tripartite-entangled states, which cannot be obtained from local operations over any bipartite entangled states and unlimited shared randomness. Some of us recently proved that this featur…
View article: Any physical theory of nature must be boundlessly multipartite nonlocal
Any physical theory of nature must be boundlessly multipartite nonlocal Open
We introduce the class of Genuinely Local Operation and Shared Randomness (LOSR) Multipartite Nonlocal correlations, that is, correlations between N parties that cannot be obtained from unlimited shared randomness supplemented by any compo…
View article: No Bipartite-Nonlocal Causal Theory Can Explain Nature’s Correlations
No Bipartite-Nonlocal Causal Theory Can Explain Nature’s Correlations Open
We show that some tripartite quantum correlations are inexplicable by any causal theory involving bipartite nonclassical common causes and unlimited shared randomness. This constitutes a device-independent proof that Nature's nonlocality i…
View article: Can't Touch This: unconditional tamper evidence from short keys
Can't Touch This: unconditional tamper evidence from short keys Open
Storing data on an external server with information-theoretic security, while using a key shorter than the data itself, is impossible. As an alternative, we propose a scheme that achieves information-theoretically secure tamper evidence: T…
View article: On the Advantage of Irreversible Processes in Single-System Games
On the Advantage of Irreversible Processes in Single-System Games Open
The CHSH no-signalling game studies Bell nonlocality by showcasing a gap between the win rates of classical strategies, quantum-entangled strategies, and no-signalling strategies. Similarly, the CHSH* single-system game explores the advant…
View article: Proving Erasure
Proving Erasure Open
It seems impossible to certify that a remote hosting service does not leak\nits users' data --- or does quantum mechanics make it possible? We investigate\nif a server hosting data can information-theoretically prove its definite\ndeletion…
View article: Proving Erasure
Proving Erasure Open
It seems impossible to certify that a remote hosting service does not leak its users' data --- or does quantum mechanics make it possible? We investigate if a server hosting data can information-theoretically prove its definite deletion us…
View article: The RGB No-Signalling Game
The RGB No-Signalling Game Open
Introducing the simplest of all No-Signalling Games: the RGB Game where two verifiers interrogate two provers, Alice and Bob, far enough from each other that communication between them is too slow to be possible. Each prover may be indepen…