No abstract

Reversible or information-lossless circuits have applications in digital signal processing, communication, computer graphics and cryptography. They are also a fundamental requirement in the emerging field of quantum computation. We investigate the synthesis of reversible circuits that employ a minimum number of gates and contain no redundant input-output line-pairs (temporary storage channels). We prove constructively that every even permutation can be implemented without temporary storage using NOT, CNOT and TOFFOLI gates. We describe an algorithm for the synthesis of optimal circuits and study the reversible functions on three wires, reporting the distribution of circuit sizes. Finally, in an application important to quantum computing, we synthesize oracle circuits for Grover's search algorithm, and show a significant improvement over a previously proposed synthesis algorithm.

The pressure of fundamental limits on classical computation and the promise of exponential speedups from quantum effects have recently brought quantum circuits [10] to the attention of the Electronic Design Automation community [18,28,7,27,17]. We discuss efficient quantum logic circuits which perform two tasks: (i) implementing generic quantum computations and (ii) initializing quantum registers. In contrast to conventional computing, the latter task is nontrivial because the state-space of an n-qubit register is not finite and contains exponential superpositions of classical bit strings. Our proposed circuits are asymptotically optimal for respective tasks and improve earlier published results by at least a factor of two.The circuits for generic quantum computation constructed by our algorithms are the most efficient known today in terms of the number of difficult gates (quantum controlled-NOTs). They are based on an analogue of the Shannon decomposition of Boolean functions and a new circuit block, quantum multiplexor, that generalizes several known constructions. A theoretical lower bound implies that our circuits cannot be improved by more than a factor of two. We additionally show how to accommodate the severe architectural limitation of using only nearest-neighbor gates that is representative of current implementation technologies. This increases the number of gates by almost an order of magnitude, but preserves the asymptotic optimality of gate counts.

We give quantum circuits that simulate an arbitrary two-qubit unitary operator up to a global phase. For several quantum gate libraries we prove that gate counts are optimal in the worst and average cases. Our lower and upper bounds compare favorably to previously published results. Temporary storage is not used because it tends to be expensive in physical implementations. For each gate library, the best gate counts can be achieved by a single universal circuit. To compute the gate parameters in universal circuits, we use only closed-form algebraic expressions, and in particular do not rely on matrix exponentials. Our algorithm has been coded in C++.

We introduce a class of Liouville manifolds with boundary which we call Liouville sectors. We define the wrapped Fukaya category, symplectic cohomology, and the openclosed map for Liouville sectors, and we show that these invariants are covariantly functorial with respect to inclusions of Liouville sectors. From this foundational setup, a local-to-global principle for Abouzaid's generation criterion follows.

We study the unwrapped Fukaya category of Lagrangian branes ending on a Legendrian knot. Our knots live at contact infinity in the cotangent bundle of a surface, the Fukaya category of which is equivalent to the category of constructible sheaves on the surface itself. Consequently, our category can be described as constructible sheaves with singular support controlled by the front projection of the knot. We use a theorem of Guillermou-Kashiwara-Schapira to show that the resulting category is invariant under Legendrian isotopies, and conjecture it is equivalent to the representation category of the Chekanov-Eliashberg differential graded algebra. We also find two connections to topological knot theory. First, drawing a positive braid closure on the annulus, the moduli space of rank-n objects maps to the space of local systems on a circle. The second page of the spectral sequence associated to the weight filtration on the pushforward of the constant sheaf is the (colored-by-n) triply-graded Khovanov-Rozansky homology. Second, drawing a positive braid closure in the plane, the number of points of our moduli spaces over a finite field with q elements recovers the lowest coefficient in 'a' of the HOMFLY polynomial of the braid closure.Comment: 92 pages, final journal version, Inventiones Mathematicae (2016

ABSTRACT. We conjecturally extract the triply graded Khovanov-Rozansky homology of the (m, n) torus knot from the unique finite dimensional simple representation of the rational DAHA of type A, rank n − 1, and central character m/n. The conjectural differentials of Gukov, Dunfield and the third author receive an explicit algebraic expression in this picture, yielding a prescription for the doubly graded Khovanov-Rozansky homologies. We match our conjecture to previous conjectures of the first author relating knot homology to q, t-Catalan numbers, and of the last three authors relating knot homology to Hilbert schemes on singular curves.

No abstract