1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.CC2020
Eliminating Intermediate Measurements in Space-Bounded Quantum Computation
Bill Fefferman, Zachary Remscrim
A foundational result in the theory of quantum computation known as the "principle of safe storage" shows that it is always possible to take a quantum circuit and produce an equiva…
cs.CC2020★ 1 cited
The Power of a Single Qubit: Two-way Quantum Finite Automata and the Word Problem
Zachary Remscrim
The two-way finite automaton with quantum and classical states (2QCFA), defined by Ambainis and Watrous, is a model of quantum computation whose quantum part is extremely limited;…
cs.CC2020
Lower Bounds on the Running Time of Two-Way Quantum Finite Automata and Sublogarithmic-Space Quantum Turing Machines
Zachary Remscrim
The two-way finite automaton with quantum and classical states (2QCFA), defined by Ambainis and Watrous, is a model of quantum computation whose quantum part is extremely limited;…