Upper bounds on success probabilities in linear optics
Stefan Scheel, Norbert Luetkenhaus
Abstract
We develop an abstract way of defining linear-optics networks designed to perform quantum information tasks such as quantum gates. We will be mainly concerned with the nonlinear sign shift gate, but it will become obvious that all other gates can be treated in a similar manner. The abstract scheme is extremely well suited for analytical as well as numerical investigations since it reduces the number of parameters for a general setting. With that we show numerically and partially analytically for a wide class of states that the success probability of generating a nonlinear sign shift gate does not exceed 1/4 which to our knowledge is the strongest bound to date.
Create a lesson
Related papers
Parallel quantum channel discrimination and numerical ranges in tensor product subspaces
Adam Bílek, Paulina Lewandowska, Ryszard Kukulski
Asymptotically Good Quantum Locally Testable Codes
William Gay, Fernando Granha Jeronimo
All causally separable quantum processes are quantum circuits with classical control of causal order
Julian Wechs, Alastair A. Abbott, Cyril Branciard
Analytic leakage suppression with a single control field: fast two-qubit gates with tunable couplers
Lukas Heunisch, Michael J. Hartmann, Aashish A. Clerk
Procrastinating einselection in non-Markovian quantum dynamics
Michael J. Moody, Tara Kalsi, Agung Budiyono et al.
Quantum Entropy Contraction and Factorization from Hypercontractivity
Li Gao, Lijun Wang