Satoshi Yoshida | LIP6 - Équipe QI

Higher-order quantum computing with known input states

Mon, 15 Dec 2025 00:00:00 +0000

88 pages, 27 figures. A concise overview of the main results is provided in the Sec. 2 (Summary of main results) for a quick read

Exponential separation in quantum query complexity of the quantum switch with respect to simulations with standard quantum circuits

Wed, 10 Dec 2025 00:00:00 +0000

Quantum theory is consistent with a computational model permitting black-box operations to be applied in an indefinite causal order, going beyond the standard circuit model of computation. The quantum switch – the simplest such example – has been shown to provide numerous information-processing advantages. Here, we prove that the action of the quantum switch on two $n$-qubit quantum channels cannot be simulated deterministically and exactly by any causally ordered quantum circuit that uses $M$ calls to one channel and one call to the other, if $M \leq \max(2, 2^n-1)$. This demonstrates an exponential separation in quantum query complexity of indefinite causal order compared to standard quantum circuits.

Simulating the quantum switch with quantum circuits is computationally hard

Thu, 20 Nov 2025 00:00:00 +0000

Higher-order transformations acting on input quantum channels in an indefinite causal order—such as the quantum switch—cannot be described by quantum circuits using the same number of calls to the input channels. A natural question is whether they can be simulated, i.e., whether their action can be exactly and deterministically reproduced by a quantum circuit with more calls to the input channels. Here, we prove that the quantum switch acting on two n-qubit channels cannot be simulated by any quantum circuit using k calls to one channel and one to the other, if k < 2^n. This establishes an exponential separation in quantum query complexity between processes with indefinite causal order and quantum circuits. Moreover, even with one extra call to both input channels, such a simulation remains impossible. We further demonstrate the robustness of this separation by extending the result to probabilistic and approximate simulations scenarios.

Satoshi Yoshida - Analytical lower bound on query complexity for universal transformation of unitary operations

Wed, 21 May 2025 00:00:00 +0000

Analytical lower bound on query complexity for universal transformation of unitary operations

Ce séminaire, donné par Satoshi Yoshida, aura lieu le 21 May 2025, à 14:0. Il aura lieu en salle Not specified.

Vous trouverez un plan du campus ici.

Résumé

Recent developments have revealed deterministic and exact protocols for performing complex conjugation, inversion, and transposition of a general d-dimensional unknown unitary operation using a finite number of queries to a black-box unitary operation. In this work, we establish analytical lower bounds for the query complexity of unitary inversion, transposition, and complex conjugation. Specifically, our lower bound of d^2 for unitary inversion demonstrates the asymptotic optimality of the deterministic exact inversion protocol, which operates with O(d^2) queries. We introduce a novel framework utilizing differentiation to derive these lower bounds on query complexity for general differentiable functions f: SU(d) \to SU(d). As a corollary, we prove that a catalytic protocol – a new concept recently noted in the study of exact unitary inversion – is impossible for unitary complex conjugation. Furthermore, we extend our framework to the probabilistic setting, where transformations must succeed with a certain probability, revealing a potential trade-off between the number of queries and the required success probability. Reference https://arxiv.org/abs/2405.07625

Can the quantum switch be deterministically simulated?

Sun, 06 Oct 2024 00:00:00 +0000

Higher-order transformations that act on a certain number of input quantum channels in an indefinite causal order - such as the quantum switch - cannot be described by standard quantum circuits that use the same number of calls of the input quantum channels. However, the question remains whether they can be simulated, i.e., whether their action on their input channels can be deterministically reproduced, for all arbitrary inputs, by a quantum circuit that uses a larger number of calls of the input channels. Here, we prove that when only one extra call of each input channel is available, the quantum switch cannot be simulated by any quantum circuit. We demonstrate that this result is robust by showing that, even when probabilistic and approximate simulations are considered, higher-order transformations that are close to the quantum switch can be at best simulated with a probability strictly less than one. This result stands in stark contrast with the known fact that, when the quantum switch acts exclusively on unitary channels, its action can be simulated.

Exponential separation in quantum query complexity of the quantum switch with respect to simulations with standard quantum circuits

Sun, 06 Oct 2024 00:00:00 +0000

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

Sat, 21 Sep 2024 00:00:00 +0000

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\psi\rangle$ to teleport a single copy of $\vert\psi\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\psi\rangle$. We prove that the maximal probability of success for teleporting the exact state $\vert\psi\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\psi\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.