Related papers: An Algorithm for Constructing Polynomial Systems W…
Polynomial systems over the binary field have important applications, especially in symmetric and asymmetric cryptanalysis, multivariate-based post-quantum cryptography, coding theory, and computer algebra. In this work, we study the…
This paper describes a Buchberger-style algorithm to compute a Groebner basis of a polynomial ideal, allowing for a selection strategy based on "signatures". We explain how three recent algorithms can be viewed as different strategies for…
We present a framework for the synthesis of phase polynomials that addresses both cases of full connectivity and partial connectivity for NISQ architectures. In most cases, our algorithms generate circuits with lower CNOT count and CNOT…
Standard integration-by-parts (IBP) reduction methods typically yield Feynman integral bases where the reduction of some integrals gives rise to coefficients singular as the dimensional regulator $\epsilon\rightarrow 0$. These singular…
Quantum algorithms to solve practical problems in quantum chemistry, materials science, and matrix inversion often involve a significant amount of arithmetic operations which act on a superposition of inputs. These have to be compiled to a…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
The Clifford$+T$ gate set is commonly used to perform universal quantum computation. In such setup the $T$ gate is typically much more expensive to implement in a fault-tolerant way than Clifford gates. To improve the feasibility of…
Following the recent approach of using order domains to construct Grobner bases from general projective varieties, we examine the parity and time-reversal arguments relating de Witt and Lyman's assertion that all path weights associated…
A motivation to study Gr\"{o}bner theory for fields with valuations comes from tropical geometry, for example, they can be used to compute tropicalization of varieties \citep{maclagan2009introduction}. The computational aspect of this…
We apply a hybrid evolutionary algorithm to minimize the depth of circuits in quantum computing. More specifically, we evaluate two different variants of the algorithm. In the first approach, we combine the evolutionary algorithm with an…
We present a classical algorithm that, for any 3D geometrically-local, polylogarithmic-depth quantum circuit $C$ acting on $n$ qubits, and any bit string $x\in\{0,1\}^n$, can compute the quantity $|< x |C|0^{\otimes n}>|^2$ to within any…
We present a method for optimizing quantum circuits architecture. The method is based on the notion of "quantum comb", which describes a circuit board in which one can insert variable subcircuits. The method allows one to efficiently…
The motivation for this paper is to study the complexity of constant-width arithmetic circuits. Our main results are the following. 1. For every k > 1, we provide an explicit polynomial that can be computed by a linear-sized monotone…
We construct a completely analog framework that emulates universal quantum gates and quantum algorithms. It is based on electronic circuits made of operational amplifiers, resistors and capacitors. In these circuits, input and output lines…
What is the computational power of a quantum computer? We show that determining the output of a quantum computation is equivalent to counting the number of solutions to an easily computed set of polynomials defined over the finite field…
We develop a new eigenvalue method for solving structured polynomial equations over any field. The equations are defined on a projective algebraic variety which admits a rational parameterization by a Khovanskii basis, e.g., a Grassmannian…
In this paper, we study the complexity of solving generic over-determined bilinear systems over a finite field $\mathbb{F}$. Given a generic bilinear sequence $B \in \mathbb{F}[\mathbf{x},\mathbf{y}]$, with respect to a partition of…
We present a general technique to implement products of many qubit operators communicating via a joint harmonic oscillator degree of freedom in a quantum computer. By conditional displacements and rotations we can implement Hamiltonians…
This paper presents a program analysis method that generates program summaries involving polynomial arithmetic. Our approach builds on prior techniques that use solvable polynomial maps for summarizing loops. These techniques are able to…
Given an arbitrary $2^w \times 2^w$ unitary matrix $U$, a powerful matrix decomposition can be applied, leading to four different syntheses of a $w$-qubit quantum circuit performing the unitary transformation. The demonstration is based on…