Universal parity quantum computing
We propose a universal gate set for quantum computing with all-to-all connectivity and
intrinsic robustness to bit-flip errors based on parity encoding. We show that logical …
intrinsic robustness to bit-flip errors based on parity encoding. We show that logical …
Surface code compilation via edge-disjoint paths
We provide an efficient algorithm to compile quantum circuits for fault-tolerant execution. We
target surface codes, which form a two-dimensional grid of logical qubits with nearest …
target surface codes, which form a two-dimensional grid of logical qubits with nearest …
Frobenius light cone and the shift unitary
We bound the time necessary to implement the shift unitary on a one-dimensional ring, both
by using local Hamiltonians and those with power-law interactions. This time is constrained …
by using local Hamiltonians and those with power-law interactions. This time is constrained …
Applications of universal parity quantum computation
We demonstrate the applicability of a universal gate set in the parity encoding, which is a
dual to the standard gate model, by exploring several quantum gate algorithms such as the …
dual to the standard gate model, by exploring several quantum gate algorithms such as the …
Quantum routing in planar graph using perfect state transfer
S Dutta - Quantum Information Processing, 2023 - Springer
In quantum communication, the perfect state transfer (PST) is a crucial tool for transferring
information. But it is not readily applicable to communicate between any pair of vertices in an …
information. But it is not readily applicable to communicate between any pair of vertices in an …
Harnessing the Power of Long-Range Entanglement for Clifford Circuit Synthesis
In superconducting architectures, limited connectivity remains a significant challenge for the
synthesis and compilation of quantum circuits. We consider models of entanglement …
synthesis and compilation of quantum circuits. We consider models of entanglement …
Harnessing Quantum Entanglement: Comprehensive Strategies for Enhanced Communication and Beyond in Quantum Networks
Quantum communication represents a revolutionary advancement over classical information
theory, which leverages unique quantum mechanics properties like entanglement to achieve …
theory, which leverages unique quantum mechanics properties like entanglement to achieve …
Resource Bounds for Quantum Circuit Mapping via Quantum Circuit Complexity
M Steinberg, M Bandic, S Szkudlarek… - arXiv preprint arXiv …, 2024 - arxiv.org
Efficiently mapping quantum circuits onto hardware is an integral part of the quantum
compilation process, wherein a quantum circuit is modified in accordance with the stringent …
compilation process, wherein a quantum circuit is modified in accordance with the stringent …
How to fault-tolerantly realize any quantum circuit with local operations
SH Choe, R Koenig - arXiv preprint arXiv:2402.13863, 2024 - arxiv.org
We show how to realize a general quantum circuit involving gates between arbitrary pairs of
qubits by means of geometrically local quantum operations and efficient classical …
qubits by means of geometrically local quantum operations and efficient classical …
Minimal entanglement for injecting diagonal gates
V Kliuchnikov, E Schoute - arXiv preprint arXiv:2403.18900, 2024 - arxiv.org
Non-Clifford gates are frequently exclusively implemented on fault-tolerant architectures by
first distilling magic states in specialised magic-state factories. In the rest of the architecture …
first distilling magic states in specialised magic-state factories. In the rest of the architecture …