Quantum compiling by deep reinforcement learning

The general problem of quantum compiling is to approximate any unitary transformation that describes the quantum computation as a sequence of elements selected from a finite base of universal quantum gates. The Solovay-Kitaev theorem guarantees the existence of such an approximating sequence. Though, the solutions to the quantum compiling problem suffer from a tradeoff between the length of the sequences, the precompilation time, and the execution time. Traditional approaches are time-consuming, unsuitable to be employed during computation. Here, we propose a deep reinforcement learning method as an alternative strategy, which requires a single precompilation procedure to learn a general strategy to approximate single-qubit unitaries. We show that this approach reduces the overall execution time, improving the tradeoff between the length of the sequence and execution time, potentially allowing real-time operations.

Balancing Straight-line Programs

We show that a context-free grammar of size that produces a single string of length (such a grammar is also called a string straight-line program) can be transformed in linear time into a context-free grammar for of size , whose unique derivation tree has depth . This solves an open problem in the area of grammar-based compression, improves many results in this area, and greatly simplifies many existing constructions. Similar results are shown for two formalisms for grammar-based tree compression: top dags and forest straight-line programs. These balancing results can be all deduced from a single meta-theorem stating that the depth of an algebraic circuit over an algebra with a certain finite base property can be reduced to with the cost of a constant multiplicative size increase. Here, refers to the size of the unfolding (or unravelling) of the circuit. In particular, this results applies to standard arithmetic circuits over (noncommutative) semirings.

Finite representability of semigroups with demonic refinement

The motivation for using demonic calculus for binary relations stems from the behaviour of demonic turing machines, when modelled relationally. Relational composition (; ) models sequential runs of two programs and demonic refinement ($$\sqsubseteq $$ ⊑ ) arises from the partial order given by modeling demonic choice ($$\sqcup $$ ⊔ ) of programs (see below for the formal relational definitions). We prove that the class $$R(\sqsubseteq , ;)$$ R ( ⊑ , ; ) of abstract $$(\le , \circ )$$ ( ≤ , ∘ ) structures isomorphic to a set of binary relations ordered by demonic refinement with composition cannot be axiomatised by any finite set of first-order $$(\le , \circ )$$ ( ≤ , ∘ ) formulas. We provide a fairly simple, infinite, recursive axiomatisation that defines $$R(\sqsubseteq , ;)$$ R ( ⊑ , ; ) . We prove that a finite representable $$(\le , \circ )$$ ( ≤ , ∘ ) structure has a representation over a finite base. This appears to be the first example of a signature for binary relations with composition where the representation class is non-finitely axiomatisable, but where the finite representation property holds for finite structures.

Degeneration of Kummer surfaces

We prove that a Kummer surface defined over a complete strictly Henselian discretely valued field K of residue characteristic different from 2 admits a strict Kulikov model after finite base change. The Kulikov models we construct will be schemes, so our results imply that the semistable reduction conjecture is true for Kummer surfaces in this setup, even in the category of schemes. Our construction of Kulikov models is closely related to an earlier construction of Künnemann, which produces semistable models of Abelian varieties. It is well known that the special fibre of a strict Kulikov model belongs to one of three types, and we shall prove that the type of the special fibre of a strict Kulikov model of a Kummer surface and the toric rank of a corresponding Abelian surface are determined by each other. We also study the relationship between this invariant and the Galois representation on the second ℓ-adic cohomology of the Kummer surface. Finally, we apply our results, together with earlier work of Halle–Nicaise, to give a proof of the monodromy conjecture for Kummer surfaces in equal characteristic zero.

Equational properties of fixed-point operations in cartesian categories: An overview

Several fixed-point models share the equational properties of iteration theories, or iteration categories, which are cartesian categories equipped with a fixed point or dagger operation subject to certain axioms. After discussing some of the basic models, we provide equational bases for iteration categories and offer an analysis of the axioms. Although iteration categories have no finite base for their identities, there exist finitely based implicational theories that capture their equational theory. We exhibit several such systems. Then we enrich iteration categories with an additive structure and exhibit interesting cases where the interaction between the iteration category structure and the additive structure can be captured by a finite number of identities. This includes the iteration category of monotonic or continuous functions over complete lattices equipped with the least fixed-point operation and the binary supremum operation as addition, the categories of simulation, bisimulation, or language equivalence classes of processes, context-free languages, and others. Finally, we exhibit a finite equational system involving residuals, which is sound and complete for monotonic or continuous functions over complete lattices in the sense that it proves all of their identities involving the operations and constants of cartesian categories, the least fixed-point operation and binary supremum, but not involving residuals.

Geometry of the Kahan discretizations of planar quadratic Hamiltonian systems

Kahan discretization is applicable to any quadratic vector field and produces a birational map which approximates the shift along the phase flow. For a planar quadratic canonical Hamiltonian vector field, this map is known to be integrable and to preserve a pencil of cubic curves. Generically, the nine base points of this pencil include three points at infinity (corresponding to the asymptotic directions of cubic curves) and six finite points lying on a conic. We show that the Kahan discretization map can be represented in six different ways as a composition of two Manin involutions, corresponding to an infinite base point and to a finite base point. As a consequence, the finite base points can be ordered so that the resulting hexagon has three pairs of parallel sides which pass through the three base points at infinity. Moreover, this geometric condition on the base points turns out to be characteristic: if it is satisfied, then the cubic curves of the corresponding pencil are invariant under the Kahan discretization of a planar quadratic canonical Hamiltonian vector field.

DUALITY FOR COHOMOLOGY OF CURVES WITH COEFFICIENTS IN ABELIAN VARIETIES

In this paper, we formulate and prove a duality for cohomology of curves over perfect fields of positive characteristic with coefficients in Néron models of abelian varieties. This is a global function field version of the author’s previous work on local duality and Grothendieck’s duality conjecture. It generalizes the perfectness of the Cassels–Tate pairing in the finite base field case. The proof uses the local duality mentioned above, Artin–Milne’s global finite flat duality, the nondegeneracy of the height pairing and finiteness of crystalline cohomology. All these ingredients are organized under the formalism of the rational étale site developed earlier.