Related papers: Class Number and Regulator Computation in Purely C…
For a binary quadratic form $Q$, we consider the action of $\mathrm{SO}_Q$ on a two-dimensional vector space. This representation yields perhaps the simplest nontrivial example of a prehomogeneous vector space that is not irreducible, and…
We give an algorithm to compute the conductor for curves of genus 2. It is based on the analysis of 3-torsion of the Jacobian for genus 2 curves over 2-adic fields.
In this paper, we study the computational complexity of the quadratic unconstrained binary optimization (QUBO) problem under the functional problem FP^NP categorization. We focus on four sub-classes: (1) When all coefficients are integers…
Since simulating quantum computers requires exponentially more classical resources, efficient algorithms are extremely helpful. We analyze algorithms that create single qubit and specific controlled qubit matrix representations of gates.…
Combinatorial optimization is considered a promising class of problems in which quantum computers can show significant advantages. However, problems of practical relevance typically have more variables than current or foreseeable quantum…
This paper proposes a single-qudit quantum neural network for multiclass classification, by using the enhanced representational capacity of high-dimensional qudit states. Our design employs an $d$-dimensional unitary operator, where $d$…
In the classification of real singularities by Arnold et al. (1985), normal forms, as representatives of equivalence classes under right equivalence, are not always uniquely determined. We describe the complete structure of the equivalence…
We describe how the quadratic Chabauty method may be applied to explicitly determine the set of rational points on modular curves of genus $g>1$ whose Jacobians have Mordell--Weil rank $g$. This extends our previous work on the split Cartan…
In this paper, we study the close relationship between Reed-Muller codes and single-qubit phase gates from the perspective of $T$-count optimization. We prove that minimizing the number of $T$ gates in an $n$-qubit quantum circuit over CNOT…
We search for efficient disentanglers on random Clifford circuits of two-qubit gates arranged in a brick-wall pattern, using the proximal policy optimization (PPO) algorithm \cite{schulman2017proximalpolicyoptimizationalgorithms}.…
In this paper, we present an algorithm to compute a basis of the space of algebraic modular forms on the maximal order of the definite quaternion algebra of discriminant $2$, and provide a database of such bases. One of our motivations is…
We present a type checking algorithm for establishing a session-based discipline in the pi calculus of Milner, Parrow and Walker. Our session types are qualified as linear or unrestricted. Linearly typed communication channels are…
This thesis discusses the young fields of quantum pseudo-randomness and quantum learning algorithms. We present techniques for derandomising algorithms to decrease randomness resource requirements and improve efficiency. One key object in…
Let $K$ be a number field of degree $n$ over ${\mathbb Q}$. Then the 4-rank of the strict class group of $K$ is at least ${\text{rank}_2 \, } ({ E_{K}^{+} } / E_K^2) - \lfloor n /2 \rfloor$ where $E_K$ and ${ E_{K}^{+} }$ denote the units…
We describe the computation of class groups and unit groups of number fields as implemented in Magma (V2.29). After quickly reviewing the main algorithms based on factor bases, relation collection, and analytic class number evaluation, we…
In this paper we discuss the problem of performing elementary finite field arithmetic on a quantum computer. Of particular interest, is the controlled-multiplication operation, which is the only group-specific operation in Shor's algorithms…
Optimal control theory is a powerful tool for improving figures of merit in quantum information tasks. Finding the solution to any optimal control problem via numerical optimization depends crucially on the choice of the optimization…
This paper presents an adaptation of recently developed algorithms for quadratic forms over number fields in arXiv:1304.0708 to global function fields of odd characteristics. First, we present algorithm for checking if a given…
We consider bilinear optimal control problems, whose objective functionals do not depend on the controls. Hence, bang-bang solutions will appear. We investigate sufficient second-order conditions for bang-bang controls, which guarantee…
Owing to their rich internal structure and significant long-range interactions, ultracold molecules have been widely explored as carriers of quantum information. Several different schemes for encoding qubits into molecular states, both bare…