Cover Image

Qubit Routing for (Almost) Free

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	de Griend, Arianne Meijer-van
Format:	Preprint
Published:	2026
Subjects:	Quantum Physics Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Comparison of Quantum Compilers using a DAG-based or phase polynomial-based Intermediate Representation
by: van de Griend, Arianne Meijer -
Published: (2023)

Shortest Path in Pauli Forest -- An Algorithm for Decomposing Pauli Exponentials to Quantum Circuits
by: Vuorenkoski, Lauri, et al.
Published: (2026)

Logarithmic Depth Decomposition of Approximate Multi-Controlled Single-Qubit Gates Without Ancilla Qubits
by: Silva, Jefferson D. S., et al.
Published: (2025)

The Space Just Above One Clean Qubit
by: Jacobs, Dale, et al.
Published: (2024)

Pauli Measurements Are Near-Optimal for Single-Qubit Tomography
by: Acharya, Jayadev, et al.
Published: (2025)

Virtual Qudits for Simon's Problem: Dimension-Lifted Algorithms on Qubit Hardware
by: Semre, Abed, et al.
Published: (2025)

A Qubit, a Coin, and an Advice String Walk Into a Relational Problem
by: Aaronson, Scott, et al.
Published: (2023)

Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations
by: Onah, Chinonso, et al.
Published: (2026)

Rounding Almost Commuting Hamiltonians
by: Faisal, Islam, et al.
Published: (2026)

Exposing the hidden layers and interplay in the quantum software stack
by: Stirbu, Vlad, et al.
Published: (2024)

En Route to a Standard QMA1 vs. QCMA Oracle Separation
by: Miloschewsky, David, et al.
Published: (2026)

Architecture-aware Unitary Synthesis
by: Perkkola, Frans, et al.
Published: (2026)

Free Fermion Distributions Are Hard to Learn
by: Nietner, Alexander
Published: (2023)

Optimising quantum circuits is generally hard
by: van de Wetering, John, et al.
Published: (2023)

Solving The Travelling Salesman Problem Using A Single Qubit
by: Goswami, Kapil, et al.
Published: (2024)

Exact Quantum Circuit Optimization is co-NQP-hard
by: Kjelstrøm, Adam Husted, et al.
Published: (2025)

Architecture-Aware Synthesis of Stabilizer Circuits from Clifford Tableaus
by: Winderl, David, et al.
Published: (2023)

The Average Relative Entropy and Transpilation Depth determines the noise robustness in Variational Quantum Classifiers
by: Shinde, Aakash Ravindra, et al.
Published: (2026)

Tight Bounds for Quantum Phase Estimation and Related Problems
by: Mande, Nikhil S., et al.
Published: (2023)

The Impact of Feature Embedding Placement in the Ansatz of a Quantum Kernel in QSVMs
by: Salmenperä, Ilmo, et al.
Published: (2024)

Unconditionally separating noisy $\mathsf{QNC}^0$ from bounded polynomial threshold circuits of constant depth
by: Hsieh, Min-Hsiu, et al.
Published: (2024)

The Power of Shallow-depth Toffoli and Qudit Quantum Circuits
by: Grilo, Alex Bredariol, et al.
Published: (2024)

Redefining Lexicographical Ordering: Optimizing Pauli String Decompositions for Quantum Compiling
by: Huang, Qunsheng, et al.
Published: (2024)

Quantum polymorphism characterisation of commutativity gadgets in all quantum models
by: Culf, Eric, et al.
Published: (2026)

Quantum Advantage in Decision Trees: A Weighted Graph and $L_1$ Norm Approach
by: Grillo, Sebastian Alberto, et al.
Published: (2026)

Existence and nonexistence of commutativity gadgets for entangled CSPs
by: Culf, Eric, et al.
Published: (2025)

Quantum information advantage based on Bell inequalities
by: Jain, Rahul, et al.
Published: (2026)

Efficient quantum circuits for high-dimensional representations of SU(n) and Ramanujan quantum expanders
by: Iyer, Vishnu, et al.
Published: (2026)

$\mathsf{QAC}^0$ Contains $\mathsf{TC}^0$ (with Many Copies of the Input)
by: Grier, Daniel, et al.
Published: (2026)

Quantum state isomorphism problems for groups
by: Gheorghiu, Alexandru, et al.
Published: (2026)

Separating Quantum and Classical Advice with Good Codes
by: Bostanci, John, et al.
Published: (2026)

A Relativizing MIP for BQP
by: Aaronson, Scott, et al.
Published: (2026)

Quantum Interactive Oracle Proofs
by: Sun, Baocheng, et al.
Published: (2026)

Exponential Separation of Quantum and Classical One-Way Numbers-on-Forehead Communication
by: Yang, Guangxu, et al.
Published: (2026)

Classical simulability of quantum circuits followed by sparse classical post-processing
by: Takahashi, Yasuhiro, et al.
Published: (2026)

The Complexity of Stoquastic Sparse Hamiltonians
by: Grilo, Alex B., et al.
Published: (2026)

Parity $\notin$ QAC0 $\iff$ QAC0 is Fourier-Concentrated
by: Gretta, Lucas, et al.
Published: (2026)

Quantum embedding of graphs for subgraph counting
by: Adhikari, Bibhas
Published: (2026)

Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems
by: Guseynov, Nikita, et al.
Published: (2026)

Complexity of Quadratic Bosonic Hamiltonian Simulation: $\mathsf{BQP}$-Completeness and $\mathsf{PostBQP}$-Hardness
by: Zschetzsche, Lilith, et al.
Published: (2026)