Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Paykin, Jennifer"'
Autor:
Winnick, Sam, Paykin, Jennifer
We provide a careful analysis of the structure theorem for the $n$-qudit projective Clifford group and various encoding schemes for its elements. In particular, we derive formulas for evaluation, composition, and inversion. Our results apply to all i
Externí odkaz:
http://arxiv.org/abs/2407.16861
Autor:
Paykin, Jennifer, Winnick, Sam
This paper introduces a novel abstraction for programming quantum operations, specifically projective Cliffords, as functions over the qudit Pauli group. We define a categorical semantics for projective Cliffords based on Pauli encodings in terms of
Externí odkaz:
http://arxiv.org/abs/2407.16801
Autor:
Schmitz, Albert T., Ibrahim, Mohannad, Sawaya, Nicolas P. D., Guerreschi, Gian Giacomo, Paykin, Jennifer, Wu, Xin-Chuan, Matsuura, A. Y.
The Pauli-based Circuit Optimization, Analysis and Synthesis Toolchain (PCOAST) was recently introduced as a framework for optimizing quantum circuits. It converts a quantum circuit to a Pauli-based graph representation and provides a set of optimiza
Externí odkaz:
http://arxiv.org/abs/2305.09843
This paper presents the Pauli-based Circuit Optimization, Analysis, and Synthesis Toolchain (PCOAST), a framework for quantum circuit optimizations based on the commutative properties of Pauli strings. Prior work has demonstrated that commuting Cliff
Externí odkaz:
http://arxiv.org/abs/2305.10966
Seminal work by Cortadella, Kondratyev, Lavagno, and Sotiriou includes a hand-written proof that a particular handshaking protocol preserves flow equivalence, a notion of equivalence between synchronous latch-based specifications and their desynchron
Externí odkaz:
http://arxiv.org/abs/2004.10655
Autor:
Paykin, Jennifer, Mertens, Eric, Tullsen, Mark, Maurer, Luke, Razet, Benoît, Bakst, Alexander, Moore, Scott
Weird machines---the computational models accessible by exploiting security vulnerabilities---arise from the difference between the model a programmer has in her head of how her program should run and the implementation that actually executes. Previo
Externí odkaz:
http://arxiv.org/abs/1911.00157
Autor:
Paykin, Jennifer, Zdancewic, Steve
This paper presents an equational theory for the QRAM model of quantum computation, formulated as an embedded language inside of homotopy type theory. The embedded language approach is highly expressive, and reflects the style of state-of-the art qua
Externí odkaz:
http://arxiv.org/abs/1904.04371
Publikováno v:
EPTCS 287, 2019, pp. 299-312
Common quantum algorithms make heavy use of ancillae: scratch qubits that are initialized at some state and later returned to that state and discarded. Existing quantum circuit languages let programmers assert that a qubit has been returned to the |0
Externí odkaz:
http://arxiv.org/abs/1901.10118
Publikováno v:
EPTCS 266, 2018, pp. 119-132
We describe an embedding of the QWIRE quantum circuit language in the Coq proof assistant. This allows programmers to write quantum circuits using high-level abstractions and to prove properties of those circuits using Coq's theorem proving features.
Externí odkaz:
http://arxiv.org/abs/1803.00699
Autor:
Paykin, Jennifer, Zdancewic, Steve
Publikováno v:
EPTCS 176, 2015, pp. 9-23
This paper defines a new proof- and category-theoretic framework for classical linear logic that separates reasoning into one linear regime and two persistent regimes corresponding to ! and ?. The resulting linear/producer/consumer (LPC) logic puts t
Externí odkaz:
http://arxiv.org/abs/1502.04770