Graphical quantum Clifford-encoder compilers from the ZX calculus
AB Khesin, JZ Lu, PW Shor - arXiv preprint arXiv:2301.02356, 2023 - arxiv.org
We present a quantum compilation algorithm that maps Clifford encoders, encoding maps
for stabilizer quantum codes, to a unique graphical representation in the ZX calculus …
for stabilizer quantum codes, to a unique graphical representation in the ZX calculus …
Synthesis of and compilation with time-optimal multi-qubit gates
P Baßler, M Zipper, C Cedzich, M Heinrich… - Quantum, 2023 - quantum-journal.org
We develop a method to synthesize a class of entangling multi-qubit gates for a quantum
computing platform with fixed Ising-type interaction with all-to-all connectivity. The only …
computing platform with fixed Ising-type interaction with all-to-all connectivity. The only …
Circuit extraction for ZX-diagrams can be# P-hard
N de Beaudrap, A Kissinger… - arXiv preprint arXiv …, 2022 - arxiv.org
The ZX-calculus is a graphical language for reasoning about quantum computation using ZX-
diagrams, a certain flexible generalisation of quantum circuits that can be used to represent …
diagrams, a certain flexible generalisation of quantum circuits that can be used to represent …
Breaking the cubic barrier in the Solovay-Kitaev algorithm
G Kuperberg - arXiv preprint arXiv:2306.13158, 2023 - arxiv.org
We improve the Solovay-Kitaev theorem and algorithm for a general finite, inverse-closed
generating set acting on a qudit. Prior versions of the algorithm can efficiently find a word of …
generating set acting on a qudit. Prior versions of the algorithm can efficiently find a word of …
Efficient Quantum State Synthesis with One Query
G Rosenthal - Proceedings of the 2024 Annual ACM-SIAM …, 2024 - SIAM
We present a polynomial-time quantum algorithm making a single query (in superposition)
to a classical oracle, such that for every state| ψ〉 there exists a choice of oracle that makes …
to a classical oracle, such that for every state| ψ〉 there exists a choice of oracle that makes …
Hay from the haystack: explicit examples of exponential quantum circuit complexity
Y Jia, MM Wolf - Communications in Mathematical Physics, 2023 - Springer
The vast majority of quantum states and unitaries have circuit complexity exponential in the
number of qubits. In a similar vein, most of them also have exponential minimum description …
number of qubits. In a similar vein, most of them also have exponential minimum description …
Probabilistic unitary synthesis with optimal accuracy
The purpose of unitary synthesis is to find a gate sequence that optimally approximates a
target unitary transformation. A new synthesis approach, called probabilistic synthesis, has …
target unitary transformation. A new synthesis approach, called probabilistic synthesis, has …
Efficient and practical quantum compiler towards multi-qubit systems with deep reinforcement learning
Efficient quantum compiling tactics greatly enhance the capability of quantum computers to
execute complicated quantum algorithms. Due to its fundamental importance, a plethora of …
execute complicated quantum algorithms. Due to its fundamental importance, a plethora of …
Uncloneable Quantum Advice
The famous no-cloning principle has been shown recently to enable a number of
uncloneable functionalities. Here we address for the first time unkeyed quantum …
uncloneable functionalities. Here we address for the first time unkeyed quantum …
Extremal jumps of circuit complexity of unitary evolutions generated by random Hamiltonians
M Kotowski, M Oszmaniec, M Horodecki - arXiv preprint arXiv:2303.17538, 2023 - arxiv.org
We investigate circuit complexity of unitaries generated by time evolution of randomly
chosen strongly interacting Hamiltonians in finite dimensional Hilbert spaces. Specifically …
chosen strongly interacting Hamiltonians in finite dimensional Hilbert spaces. Specifically …