Related papers: The Structure of Sum-Over-Paths, its Consequences,…
We propose an approach to represent the second-quantized electronic Hamiltonian in a compact sum-of-products (SOP) form. The approach is based on the canonical polyadic decomposition (CPD) of the original Hamiltonian projected onto the…
We develop a novel theoretical framework for understating OT schemes respecting a class structure. For this purpose, we propose a convex OT program with a sum-of-norms regularization term, which provably recovers the underlying class…
Control theory uses `signal-flow diagrams' to describe processes where real-valued functions of time are added, multiplied by scalars, differentiated and integrated, duplicated and deleted. These diagrams can be seen as string diagrams for…
All known proofs of the PCP theorem rely on multiple "composition" steps, where PCPs over large alphabets are turned into PCPs over much smaller alphabets at a (relatively) small price in the soundness error of the PCP. Algebraic proofs,…
This paper is an introduction to diagrammatic methods for representing quantum processes and quantum computing. We review basic notions for quantum information and quantum computing. We discuss topological diagrams and some issues about…
Verification proofs encode complete program behavior, yet we discard them after checking correctness. We present compiling by proving, a paradigm that transforms these proofs into optimized execution rules. By constructing All-Path…
The landscape of applications and subroutines relying on shortest path computations continues to grow steadily. This growth is driven by the undeniable success of shortest path algorithms in theory and practice. It also introduces new…
Structural subtyping and parametric polymorphism provide similar flexibility and reusability to programmers. For example, both features enable the programmer to provide a wider record as an argument to a function that expects a narrower…
Input-output theory is a well-known tool in quantum optics and ubiquitous in the description of quantum systems probed by light. Owing to the generality of the setup it describes, the theory finds application in a wide variety of…
Of crucial importance to the development of quantum computing and information has been the construction of a quantum operations formalism that admits a description of quantum noise while simultaneously revealing the behavior of an open…
Pull-tabbing is an evaluation approach for functional logic computations, based on a graph transformation recently proposed, which avoids making irrevocable non-deterministic choices that would jeopardize the completeness of computations.…
We perform a systematic study of $SU(2)$ flavor amplitude sum rules with particular emphasis on $U$-spin. This study reveals a rich mathematical structure underlying the sum rules that allows us to formulate an algorithm for deriving all…
Any deformation of a Weyl or Clifford algebra A can be realized through a `deforming map', i.e. a formal change of generators in A. This is true in particular if A is covariant under a Lie algebra g and its deformation is induced by some…
Sampling-based motion planners have proven to be efficient solutions to a variety of high-dimensional, geometrically complex motion planning problems with applications in several domains. The traditional view of these approaches is that…
A sup-interpretation is a tool which provides an upper bound on the size of a value computed by some symbol of a program. Sup-interpretations have shown their interest to deal with the complexity of first order functional programs. For…
Compilers use control flow graph (CFG) representations of low-level programs because they are suited to program analysis and optimizations. However, formalizing the behavior and metatheory of CFG programs is non-trivial: CFG programs don't…
This paper introduces a novel abstraction for programming quantum operations, specifically projective Cliffords, as functions over the qudit Pauli group. Generalizing the idea behind Pauli tableaux, we introduce a type system and lambda…
It is pointed out that there are some fundamental difficulties with the frequently used continuous-time formalism of the spin-coherent-state path integral. They arise already in a single-spin system and at the level of the "classical…
This paper aims at carrying out termination proofs for simply typed higher-order calculi automatically by using ordering comparisons. To this end, we introduce the computability path ordering (CPO), a recursive relation on terms obtained by…
We develop a path integral representation for the dynamics of quantum systems with a finite-dimensional Hilbert space, formulated entirely within a discrete phase space. Starting from the discrete Wigner function defined on $\mathbb{Z}_d…