Quantum-to-Quantum Bernoulli Factory

Abstract

Given a coin with unknown bias p∈ [0,1], can we exactly simulate another coin with bias f(p)? The exact set of simulable functions has been well characterized 20 years ago. In this paper, we ask the quantum counterpart of this question: Given the quantum coin |p=p|0+1-p|1, can we exactly simulate another quantum coin |f(p)=f(p)|0+1-f(p)|1? We give the full characterization of simulable quantum state k0(p)|0+k1(p)|1 from quantum coin |p=p|0+1-p|1, and present an algorithm to transform it. Surprisingly, we show that simulable sets in the quantum-to-quantum case and classical-to-classical case have no inclusion relationship with each other.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…