Cover Image

Logarithmic Depth Decomposition of Approximate Multi-Controlled Single-Qubit Gates Without Ancilla Qubits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Silva, Jefferson D. S., da Silva, Adenilton J.
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Qubit Routing for (Almost) Free
by: de Griend, Arianne Meijer-van
Published: (2026)

Low-depth Quantum Circuit Decomposition of Multi-controlled Gates
by: Azevedo, Thiago Melo D., et al.
Published: (2024)

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

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

Efficient Matrix Product State Learning in Logarithmic Depth
by: Lin, Chia-Ying, 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)

Analyzing Quantum Circuit Depth Reduction with Ancilla Qubits in MCX Gates
by: Bennakhi, Ahmad, et al.
Published: (2024)

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth
by: Kahanamoku-Meyer, Gregory D., et al.
Published: (2024)

Asymptotic Gate Count Bounds for Ancilla-Free Single-Qubit Synthesis with Arithmetic Gates
by: Sano, Kaoru, et al.
Published: (2025)

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

Tight Bounds on the Spooky Pebble Game: Recycling Qubits with Measurements
by: Kornerup, Niels, et al.
Published: (2021)

Polynomial-Time Classical Simulation of Noisy IQP Circuits with Constant Depth
by: Rajakumar, Joel, et al.
Published: (2024)

On the Need for Large Quantum Depth
by: Chia, Nai-Hui, et al.
Published: (2019)

Bounds on Eventually Universal Quantum Gate Sets
by: Karamchedu, Chaitanya, et al.
Published: (2025)

Polynomial-Time Classical Simulation of Noisy Quantum Circuits with Naturally Fault-Tolerant Gates
by: Nelson, Jon, et al.
Published: (2024)

Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement
by: Hasegawa, Atsuya, et al.
Published: (2025)

Thermodynamic Signature of Logical Depth in Quantum Circuits
by: Ibnouhsein, Issam
Published: (2025)

Constant-Depth Unitary Preparation of Dicke States
by: Joshi, Malvika Raj, et al.
Published: (2026)

Optimal Control of Coupled Sensor-Ancilla Qubits for Multiparameter Estimation
by: Kanamoto, Ayumi, et al.
Published: (2025)

Approximation algorithms for noncommutative CSPs
by: Culf, Eric, et al.
Published: (2023)

Classical Simulability of Quantum Circuits with Shallow Magic Depth
by: Zhang, Yifan, et al.
Published: (2024)

The Communication Complexity of Approximating Matrix Rank
by: Sherstov, Alexander A., et al.
Published: (2024)

Gate-based quantum simulation of Gaussian bosonic circuits on exponentially many modes
by: Barthe, Alice, et al.
Published: (2024)

Quantum Algorithms for Approximate Graph Isomorphism Testing
by: Kulkarni, Prateek P.
Published: (2026)

Query and Depth Upper Bounds for Quantum Unitaries via Grover Search
by: Rosenthal, Gregory
Published: (2021)

Tight Quantum Depth Lower Bound for Solving Systems of Linear Equations
by: Wang, Qisheng, et al.
Published: (2024)

On the Approximate Non-Deterministic Degree of Total Boolean Functions
by: Pednekar, Samruddhi, et al.
Published: (2026)

Quantum First-Order Logics That Capture Logarithmic-Time/Space Quantum Computability
by: Yamakami, Tomoyuki
Published: (2025)

Decomposition of Multi-Qubit Gates for Circuit Cutting
by: Tamura, Ryota, et al.
Published: (2026)

Approximate Degrees of Multisymmetric Properties with Application to Quantum Claw Detection
by: Tani, Seiichiro
Published: (2024)

Single-Qubit Gates Beyond the Rotating-Wave Approximation for Strongly Anharmonic Low-Frequency Qubits
by: Zwanenburg, Martijn F. S., et al.
Published: (2025)

Sampling Frequency Thresholds for Quantum Advantage of Quantum Approximate Optimization Algorithm
by: Lykov, Danylo, et al.
Published: (2022)

Quadratic Lower bounds on the Approximate Stabilizer Rank: A Probabilistic Approach
by: Mehraban, Saeed, et al.
Published: (2023)

Symmetric quantum computation
by: Castro-Silva, Davi, et al.
Published: (2025)

Approximating the quantum value of an LCS game is RE-hard
by: Taller, Aviv, et al.
Published: (2025)

Analytically Solvable Robust Single-Qubit Gates for Multi-Qubit Systems with Unwanted Couplings
by: Zeng, Junkai, et al.
Published: (2025)

Quantum computational complexity of matrix functions
by: Cifuentes, Santiago, et al.
Published: (2024)

ZZ-Interaction-Free Single-Qubit-Gate Optimization in Superconducting Qubits
by: Watanabe, Shu, et al.
Published: (2023)