Image de couverture de livre

The Subgraph Isomorphism Problem for Port Graphs and Quantum Circuits

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Mondada, Luca, Andrés-Martínez, Pablo
Format:	Preprint
Publié:	2023
Sujets:	Quantum Physics Computational Complexity Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Scalable Pattern Matching in Computation Graphs
par: Mondada, Luca, et autres
Publié: (2024)

Quantum Algorithms for Approximate Graph Isomorphism Testing
par: Kulkarni, Prateek P.
Publié: (2026)

A SAT Solver and Computer Algebra Attack on the Minimum Kochen-Specker Problem
par: Li, Zhengyu, et autres
Publié: (2023)

Quantum complexity of the Kronecker coefficients
par: Bravyi, Sergey, et autres
Publié: (2023)

Quantum search by continuous-time quantum walk on t-designs
par: Lugão, Pedro H. G., et autres
Publié: (2023)

Algorithmic Cluster Expansions for Quantum Problems
par: Mann, Ryan L., et autres
Publié: (2023)

Complexity Framework For Forbidden Subgraphs V: Beyond Simple Graphs
par: Eagling-Vose, Tala, et autres
Publié: (2025)

Testing Isomorphism of Graphs in Polynomial Time
par: Xue, Rui
Publié: (2023)

Learning stabilizer structure of quantum states
par: Arunachalam, Srinivasan, et autres
Publié: (2025)

Random regular graph states are complex at almost any depth
par: Ghosh, Soumik, et autres
Publié: (2024)

Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs
par: Hsieh, Jun-Ting, et autres
Publié: (2024)

Efficient Algorithms for Weakly-Interacting Quantum Spin Systems
par: Mann, Ryan L., et autres
Publié: (2026)

Quantum k-SAT Related Hypergraph Problems
par: Kremer, Simon-Luca, et autres
Publié: (2025)

Quantum Circuit Optimization by Graph Coloring
par: Lee, Hochang, et autres
Publié: (2025)

The Tensor as an Informational Resource
par: Christandl, Matthias
Publié: (2023)

Polynomial time classical versus quantum algorithms for representation theoretic multiplicities
par: Panova, Greta
Publié: (2025)

Unconditional Quantum Advantage for Sampling with Shallow Circuits
par: Watts, Adam Bene, et autres
Publié: (2023)

Thermodynamic Signature of Logical Depth in Quantum Circuits
par: Ibnouhsein, Issam
Publié: (2025)

Unconditional Pseudorandomness against Shallow Quantum Circuits
par: Ghosh, Soumik, et autres
Publié: (2025)

Direct Product Primality Testing of Graphs is GI-hard
par: Calderoni, Luca, et autres
Publié: (2020)

Improved Circuit Lower Bounds and Quantum-Classical Separations
par: Grewal, Sabee, et autres
Publié: (2024)

Classical Simulability of Quantum Circuits with Shallow Magic Depth
par: Zhang, Yifan, et autres
Publié: (2024)

The Power of Shallow-depth Toffoli and Qudit Quantum Circuits
par: Grilo, Alex Bredariol, et autres
Publié: (2024)

Exact Quantum Circuit Optimization is co-NQP-hard
par: Kjelstrøm, Adam Husted, et autres
Publié: (2025)

Equivalent Dichotomies for Triangle Detection in Subgraph, Induced, and Colored H-Free Graphs
par: Abboud, Amir, et autres
Publié: (2026)

The Fine-Grained Complexity of Graph Homomorphism Problems: Towards the Okrasa and Rzążewski Conjecture
par: Baril, Ambroise, et autres
Publié: (2024)

Monotone Circuit Complexity of Matching
par: Cavalar, Bruno, et autres
Publié: (2025)

Performance of Gaussian Boson Sampling on Planted Bipartite Clique Detection
par: Chen, Yu-Zhen Janice, et autres
Publié: (2025)

Steiner Forest for $H$-Subgraph-Free Graphs
par: Eagling-Vose, Tala, et autres
Publié: (2026)

Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
par: Roberson, David E., et autres
Publié: (2023)

Quantum Advantage from Sampling Shallow Circuits: Beyond Hardness of Marginals
par: Grier, Daniel, et autres
Publié: (2025)

Anti-Concentration for the Unitary Haar Measure and Applications to Random Quantum Circuits
par: Fefferman, Bill, et autres
Publié: (2024)

Complexity Theory for Quantum Promise Problems
par: Chia, Nai-Hui, et autres
Publié: (2024)

Polynomial-Time Classical Simulation of Noisy Quantum Circuits with Naturally Fault-Tolerant Gates
par: Nelson, Jon, et autres
Publié: (2024)

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth
par: Kahanamoku-Meyer, Gregory D., et autres
Publié: (2024)

Tight Bounds for Quantum Phase Estimation and Related Problems
par: Mande, Nikhil S., et autres
Publié: (2023)

Fine-Grained Complexity for Quantum Problems from Size-Preserving Circuit-to-Hamiltonian Constructions
par: Chia, Nai-Hui, et autres
Publié: (2026)

Parameterised Holant Problems
par: Aivasiliotis, Panagiotis, et autres
Publié: (2024)

Hardness of Hypergraph Edge Modification Problems
par: Gishboliner, Lior, et autres
Publié: (2025)

Quantum SAT Problems with Finite Sets of Projectors are Complete for a Plethora of Classes
par: Cardoso, Ricardo Rivera, et autres
Publié: (2025)