Cover Image

Uniqueness of imaginarity-assisted transformation from computationally universal to strictly universal quantum computation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nakayama, Yasuaki, Takeuchi, Yuki, Akibue, Seiseki
Format:	Preprint
Published:	2026
Subjects:	Quantum Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Circuit Optimization for Universality Transformation
by: Nakayama, Yasuaki, et al.
Published: (2026)

Existence of universal resource and uselessness of too entangled states for quantum metrology
by: Miyajima, Rina, et al.
Published: (2025)

Duality of extremal quantum states in verification and data hiding
by: Akibue, Seiseki, et al.
Published: (2025)

Non-locality of conjugation symmetry: characterization and examples in quantum network sensing
by: Miyazaki, Jisho, et al.
Published: (2023)

Localization of joint quantum measurements on $\mathbb{C}^d \otimes \mathbb{C}^d$ by entangled resources with Schmidt number at most $d$
by: Akibue, Seiseki, et al.
Published: (2026)

Multi-qubit controlled gate with optimal T-count
by: Yamazaki, Soichiro, et al.
Published: (2026)

Clifford+V synthesis for multi-qubit unitary gates
by: Yamazaki, Soichiro, et al.
Published: (2025)

On the hardness of conversion from entangled proof into separable one
by: Akibue, Seiseki, et al.
Published: (2024)

Probabilistic unitary synthesis with optimal accuracy
by: Akibue, Seiseki, et al.
Published: (2023)

Computing entanglement costs of non-local operations on the basis of algebraic geometry
by: Akibue, Seiseki, et al.
Published: (2025)

Probabilistic state synthesis based on optimal convex approximation
by: Akibue, Seiseki, et al.
Published: (2023)

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

Optimal ancilla-free Clifford+T synthesis for general single-qubit unitaries
by: Morisaki, Hayata, et al.
Published: (2025)

Unconditional verification of quantum computation with classical light
by: Takeuchi, Yuki, et al.
Published: (2024)

An easily computable measure of Gaussian quantum imaginarity
by: Zhang, Ting, et al.
Published: (2025)

Measurement-based quantum computation on weighted graph states with arbitrarily small weight
by: Yamazaki, Tomohiro, et al.
Published: (2025)

Verifying commuting quantum computations via fidelity estimation of weighted graph states
by: Hayashi, Masahito, et al.
Published: (2019)

Rydberg wire gates for universal quantum computation
by: Jeong, Seokho, et al.
Published: (2022)

Extensible universal photonic quantum computing with nonlinearity
by: Yu, Shang, et al.
Published: (2026)

Simulation of open quantum systems on universal quantum computers
by: Liu, Huan-Yu, et al.
Published: (2024)

A compiler for universal photonic quantum computers
by: Zilk, Felix, et al.
Published: (2022)

Scalable modular architecture for universal quantum computation
by: Gago-Encinas, Fernando, et al.
Published: (2025)

Error Crafting in Mixed Quantum Gate Synthesis
by: Yoshioka, Nobuyuki, et al.
Published: (2024)

Architectural mechanisms of a universal fault-tolerant quantum computer
by: Bluvstein, Dolev, et al.
Published: (2025)

Efficient thermalization and universal quantum computing with quantum Gibbs samplers
by: Rouzé, Cambyse, et al.
Published: (2024)

Time evolution of impurity models and their universality for quantum computation
by: Pham, N. C. Mai, et al.
Published: (2026)

Interplay of resources for universal continuous-variable quantum computing
by: Upreti, Varun, et al.
Published: (2025)

From simulatability to universality of continuous-variable quantum computers
by: Calcluth, Cameron
Published: (2025)

Demonstration of measurement-free universal fault-tolerant quantum computation
by: Butt, Friederike, et al.
Published: (2025)

Measurement-free, scalable and fault-tolerant universal quantum computing
by: Butt, Friederike, et al.
Published: (2024)

Sufficient condition for universal quantum computation using bosonic circuits
by: Calcluth, Cameron, et al.
Published: (2023)

Towards fault-tolerant quantum computation with universal continuous-variable gates
by: Blair, Sheron, et al.
Published: (2025)

Machine learning for efficient generation of universal hybrid quantum computing resources
by: Anteneh, Amanuel, et al.
Published: (2023)

Realistic Gottesman-Kitaev-Preskill stabilizer states enable universal quantum computation
by: Hosseinynejad, Fariba, et al.
Published: (2025)

The Hadamard gate cannot be replaced by a resource state in universal quantum computation
by: Jones, Benjamin D. M., et al.
Published: (2023)

Fast Laplace transforms on quantum computers
by: Zylberman, Julien
Published: (2024)

Fast elementary gates for universal quantum computation with Kerr parametric oscillator qubits
by: Kanao, Taro, et al.
Published: (2023)

Classical simulation of universal measurement-based quantum computation using multipartite Bell scenarios
by: Okay, Cihan, et al.
Published: (2024)

Fast, robust and laser-free universal entangling gates for trapped-ion quantum computing
by: Nünnerich, Markus, et al.
Published: (2024)

A universal neutral-atom quantum computer with individual optical addressing and non-destructive readout
by: Radnaev, A. G., et al.
Published: (2024)