### Computing with highly mixed statesComputing with highly mixed states

Access Restriction
Subscribed

 Author Ambainis, Andris ♦ Schulman, Leonard J. ♦ Vazirani, Umesh Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©2006 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Subject Keyword Quantum Computation Abstract Device initialization is a difficult challenge in some proposed realizations of quantum computers, and as such, must be treated as a computational resource. The degree of initialization can be quantified by $\textit{k},$ the number of clean qubits in the initial state of the register. In this article, we show that unless $\textit{m}∈\textit{O}(\textit{k}$ + log $\textit{n}),$ oblivious (gate-by-gate) simulation of an ideal $\textit{m}-qubit$ quantum circuit by an $\textit{n}-qubit$ circuit with $\textit{k}$ clean qubits is impossible. Effectively, this indicates that there is no avoiding physical initialization of a quantity of qubits proportional to that required by the best ideal quantum circuit. ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 2006-05-01 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 53 Issue Number 3 Page Count 25 Starting Page 507 Ending Page 531
Source: ACM Digital Library