The Subgraph Isomorphism Problem for Port Graphs and Quantum Circuits

by   Luca Mondada, et al.
University of Oxford

We study a variant of the subgraph isomorphism problem that is of high interest to the quantum computing community. Our results give an algorithm to perform pattern matching in quantum circuits for many patterns simultaneously, independently of the number of patterns. After a pre-computation step in which the patterns are compiled into a decision tree, the running time is linear in the size of the input quantum circuit. More generally, we consider connected port graphs, in which every edge e incident to v has a label L_v(e) unique in v. Jiang and Bunke showed that the subgraph isomorphism problem H ⊆ G for such graphs can be solved in time O(|V(G)| · |V(H)|). We show that if in addition the graphs are directed acyclic, then the subgraph isomorphism problem can be solved for an unbounded number of patterns simultaneously. We enumerate all m pattern matches in time O(P)^P+3/2· |V(G)| + O(m), where P is the number of vertices of the largest pattern. In the case of quantum circuits, we can express the bound obtained in terms of the maximum number of qubits N and depth δ of the patterns : O(N)^N + 1/2·δlogδ· |V(G)| + O(m).


page 16

page 19

page 20


Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal

The Subgraph Isomorphism problem is of considerable importance in comput...

An experimental study of algorithms for obtaining a singly connected subgraph

A directed graph G = (V,E) is singly connected if for any two vertice...

Rewindable Quantum Computation and Its Equivalence to Cloning and Adaptive Postselection

We define rewinding operators that invert quantum measurements. Then, we...

Deterministic Algorithms for Compiling Quantum Circuits with Recurrent Patterns

Current quantum processors are noisy, have limited coherence and imperfe...

FrozenQubits: Boosting Fidelity of QAOA by Skipping Hotspot Nodes

Quantum Approximate Optimization Algorithm (QAOA) is one of the leading ...

Revisited Containment for Graph Patterns

We consider the class of conditional graph patterns (CGPs) that allow us...

Jointly learning relevant subgraph patterns and nonlinear models of their indicators

Classification and regression in which the inputs are graphs of arbitrar...

Please sign up or login with your details

Forgot password? Click here to reset