1,152 research outputs found
Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
Most work in quantum circuit optimization has been performed in isolation
from the results of quantum fault-tolerance. Here we present a polynomial-time
algorithm for optimizing quantum circuits that takes the actual implementation
of fault-tolerant logical gates into consideration. Our algorithm
re-synthesizes quantum circuits composed of Clifford group and T gates, the
latter being typically the most costly gate in fault-tolerant models, e.g.,
those based on the Steane or surface codes, with the purpose of minimizing both
T-count and T-depth. A major feature of the algorithm is the ability to
re-synthesize circuits with additional ancillae to reduce T-depth at
effectively no cost. The tested benchmarks show up to 65.7% reduction in
T-count and up to 87.6% reduction in T-depth without ancillae, or 99.7%
reduction in T-depth using ancillae.Comment: Version 2 contains substantial improvements and extensions to the
previous version. We describe a new, more robust algorithm and achieve
significantly improved experimental result
On the half-plane property and the Tutte group of a matroid
A multivariate polynomial is stable if it is non-vanishing whenever all
variables have positive imaginary parts. A matroid has the weak half-plane
property (WHPP) if there exists a stable polynomial with support equal to the
set of bases of the matroid. If the polynomial can be chosen with all of its
nonzero coefficients equal to one then the matroid has the half-plane property
(HPP). We describe a systematic method that allows us to reduce the WHPP to the
HPP for large families of matroids. This method makes use of the Tutte group of
a matroid. We prove that no projective geometry has the WHPP and that a binary
matroid has the WHPP if and only if it is regular. We also prove that T_8 and
R_9 fail to have the WHPP.Comment: 8 pages. To appear in J. Combin. Theory Ser.
Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids
To each linear code over a finite field we associate the matroid of its
parity check matrix. We show to what extent one can determine the generalized
Hamming weights of the code (or defined for a matroid in general) from various
sets of Betti numbers of Stanley-Reisner rings of simplicial complexes
associated to the matroid
Natural realizations of sparsity matroids
A hypergraph G with n vertices and m hyperedges with d endpoints each is
(k,l)-sparse if for all sub-hypergraphs G' on n' vertices and m' edges, m'\le
kn'-l. For integers k and l satisfying 0\le l\le dk-1, this is known to be a
linearly representable matroidal family.
Motivated by problems in rigidity theory, we give a new linear representation
theorem for the (k,l)-sparse hypergraphs that is natural; i.e., the
representing matrix captures the vertex-edge incidence structure of the
underlying hypergraph G.Comment: Corrected some typos from the previous version; to appear in Ars
Mathematica Contemporane
- …