The Quantum Approximate Optimization Algorithm (QAOA) is a near-term quantum algorithm for solving combinatorial optimization problems, but its accuracy and resource requirements may scale poorly with problem size or structure, reducing its utility in practice. Approaches such as the Graph Decomposition for Optimizatio...
M. Brunet, Leah Prepchuk, Rebekah Herrman· 0 citations
Graph theory is a powerful tool in quantum computing, with applications ranging from quantum circuit synthesis and optimization to entanglement mapping. Recent work has shown how one can use edge-colored graphs to model photonic experiments that generate GHZ and W states. However, the latter work also proved that verif...
We introduce a graph invariant obtained from Pauli decompositions of Hamiltonians derived from local graph neighborhoods. Given a rooted h-hop neighborhood, we construct a local adjacency operator, embed it into a common Hilbert space dimension, and define its Pauli-support set as the collection of Pauli strings appear...
Sarah Chehade, Andrew Vlasic, Rebekah Herrman et al.· 0 citations
This work gives CTQW realizations of the standard single-qubit gates and introduces new graph rewrite rules, which are graph rewrite rules that shorten a dynamic graph sequence while preserving the unitary it implements.
Mostafa Atallah, D. Dilley, Jishnu Mahmud et al.· 0 citations
This work trains machine learning models to predict, for a given graph, which of the two decompositions produces the smaller CX gate count, and uses the dominant signal from n_Pauli, a property of the Hamiltonian decomposition rather than an intrinsic property of the graph.