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.
Abstract
Continuous-time quantum walks (CTQWs) on dynamic graphs realize quantum gates as sequences of time-evolving graph Hamiltonians, but naive constructions produce long sequences with redundancy. Simplification rules, which are graph rewrite rules that shorten a dynamic graph sequence while preserving the unitary it implements, are the CTQW analogue of circuit identities in the gate model. In this work, we give CTQW realizations of the standard single-qubit gates and introduce new graph rewrite rules. We demonstrate the simplification rules through worked circuit reductions and outline their use as transpilation primitives for converting between the circuit model and the dynamic graph framework.
A systematic multi-stage decomposition of the shift operator for 1D Cayley graphs across three classes of generating sets: inverse-closed without involutions, inverse-closed with an involution, and non-inverse-closed.
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.
Drawing on insights from stochastic calculus, geometric functional analysis, and randomized linear algebra, the approach exploits the circuit's response to variations of individual gates and requires no control over convergence to high-order unitary designs.
Local-unitary (LU) equivalence asks whether two quantum states differ only by independent changes of basis on their qubits. For graph states, whether this relation can be decided in polynomial time has remained open for over a decade. We give a deterministic algorithm that decides LU equivalence for graphs on $n$ label...
This lecture starts the next paradigm for quantum algorithms: quantum walks, which mimic random walks in a way that allows speeding up the algorithmic applications, including sampling from complicated distributions and searching with spatial constraints.
It is proved that a continuous-time quantum walk effected by a generalized Laplacian, which can arise in spin chains, can solve a computational problem more quickly than typical quantum walks governed by the standard Laplacian or adjacency matrix.
Jonas Duda, Thomas G. Wong· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.