Imagen de Portada

Complexity of graph-state preparation by Clifford circuits

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kumabe, Soh, Mori, Ryuhei, Yoshimura, Yusei
Formato:	Preprint
Publicado:	2024
Materias:	Quantum Physics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Efficient equivalence checking of Clifford-U circuits with shared single-qubit unitaries
por: Sakamoto, Daisuke, et al.
Publicado: (2026)

Classical simulability of Clifford+T circuits with Clifford-augmented matrix product states
por: Liu, Zejun, et al.
Publicado: (2024)

Sparse identification of quantum Hamiltonian dynamics via quantum circuit learning
por: Tateyama, Yusei, et al.
Publicado: (2026)

Efficient circuits for leaf-separable state preparation
por: Vittal, Sunil, et al.
Publicado: (2025)

Parameterized Quantum Query Algorithms for Graph Problems
por: Terao, Tatsuya, et al.
Publicado: (2024)

Learning dynamic quantum circuits for efficient state preparation
por: Alam, Faisal, et al.
Publicado: (2024)

Dissipation-assisted preparation of Floquet-Laughlin states in superconducting circuits
por: Steinfadt, Luis C., et al.
Publicado: (2026)

Error correction with brickwork Clifford circuits
por: Kroll, Twan, et al.
Publicado: (2026)

Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation
por: Mori, Yusei, et al.
Publicado: (2025)

Drift-resilient mid-circuit measurement and state preparation error mitigation for dynamic circuits
por: Santos, Jader P., et al.
Publicado: (2025)

In-situ benchmarking of fault-tolerant quantum circuits. I. Clifford circuits
por: Xiao, Xiao, et al.
Publicado: (2026)

A graph-state based synthesis framework for Clifford isometries
por: de Brugière, Timothée Goubault, et al.
Publicado: (2022)

Efficient state preparation for multivariate Monte Carlo simulation
por: Mori, Hitomi, et al.
Publicado: (2024)

Quantum negative sampling strategy for knowledge graph embedding with variational circuit
por: Giri, Pulak Ranjan, et al.
Publicado: (2025)

Constant-depth preparation of matrix product states with adaptive quantum circuits
por: Smith, Kevin C., et al.
Publicado: (2024)

Matrix-product entanglement characterizing the optimality of state-preparation quantum circuits
por: Qi, Shuo, et al.
Publicado: (2025)

Fast simulation of planar Clifford circuits
por: Gosset, David, et al.
Publicado: (2020)

Symmetry-accelerated classical simulation of Clifford-dominated circuits
por: Camillo, Giulio, et al.
Publicado: (2025)

Hardware-tailored logical Clifford circuits for stabilizer codes
por: Kuehnke, Eric J., et al.
Publicado: (2025)

Efficient simulation of Clifford circuits with small Markovian errors
por: Miller, Ashe, et al.
Publicado: (2025)

Unitary-transformed projective squeezing: applications for circuit-knitting and state-preparation of non-Gaussian states
por: Anai, Keitaro, et al.
Publicado: (2024)

Quantum circuit synthesis for the preparation of arbitrary and highly sparse mixed quantum states
por: Chen, Bo-Hung, et al.
Publicado: (2024)

Compilation of algorithm-specific graph states for quantum circuits
por: Vijayan, Madhav Krishnan, et al.
Publicado: (2022)

Low-cost noise reduction for Clifford circuits
por: Delfosse, Nicolas, et al.
Publicado: (2024)

Any Clifford+T circuit can be controlled with constant T-depth overhead
por: Kim, Isaac H., et al.
Publicado: (2025)

Iterative Qubit Coupled Cluster using only Clifford circuits
por: Brown, James, et al.
Publicado: (2022)

Clifford circuit based heuristic optimization of fermion-to-qubit mappings
por: Yu, Jeffery, et al.
Publicado: (2025)

Low-depth Clifford circuits approximately solve MaxCut
por: Muñoz-Arias, Manuel H., et al.
Publicado: (2023)

$σ$-VQE: Excited-state preparation of quantum many-body scars with shallow circuits
por: Carolan, Eoin, et al.
Publicado: (2026)

Matchgate circuit representation of fermionic Gaussian states: optimal preparation, approximation, and classical simulation
por: Langer, Marc, et al.
Publicado: (2026)

GraphiQ: Quantum circuit design for photonic graph states
por: Lin, Jie, et al.
Publicado: (2024)

Max-Distance Sparsification for Diversification and Clustering
por: Kumabe, Soh
Publicado: (2024)

Quadratic Kernel for Cliques or Trees Vertex Deletion
por: Kumabe, Soh
Publicado: (2025)

Quantum Circuit Unoptimization
por: Mori, Yusei, et al.
Publicado: (2023)

Learning quantum states prepared by shallow circuits in polynomial time
por: Landau, Zeph, et al.
Publicado: (2024)

On the Complexity of the Matching Problem of Regular Expressions with Backreferences
por: Kumabe, Soh, et al.
Publicado: (2026)

Measurement-induced entanglement in noisy 2D random Clifford circuits
por: Wei, Zhi-Yuan, et al.
Publicado: (2025)

Exact quantum decision diagrams with scaling guarantees for Clifford+$T$ circuits and beyond
por: Quist, Arend-Jan, et al.
Publicado: (2026)

Exponentially robust non-Clifford gate in a driven-dissipative circuit
por: O'Brien, Liam, et al.
Publicado: (2025)

Fast stabilizer state preparation via AI-optimized graph decimation
por: Doherty, Michael, et al.
Publicado: (2026)