9 research outputs found
Recommended from our members
Algebraic Statistics
Algebraic Statistics is concerned with the interplay of techniques from commutative algebra, combinatorics, (real) algebraic geometry, and related fields with problems arising in statistics and data science. This workshop was the first at Oberwolfach dedicated to this emerging subject area. The participants highlighted recent achievements in this field, explored exciting new applications, and mapped out future directions for research
Quantum Theory from Principles, Quantum Software from Diagrams
This thesis consists of two parts. The first part is about how quantum theory
can be recovered from first principles, while the second part is about the
application of diagrammatic reasoning, specifically the ZX-calculus, to
practical problems in quantum computing. The main results of the first part
include a reconstruction of quantum theory from principles related to
properties of sequential measurement and a reconstruction based on properties
of pure maps and the mathematics of effectus theory. It also includes a
detailed study of JBW-algebras, a type of infinite-dimensional Jordan algebra
motivated by von Neumann algebras. In the second part we find a new model for
measurement-based quantum computing, study how measurement patterns in the
one-way model can be simplified and find a new algorithm for extracting a
unitary circuit from such patterns. We use these results to develop a circuit
optimisation strategy that leads to a new normal form for Clifford circuits and
reductions in the T-count of Clifford+T circuits.Comment: PhD Thesis. Part A is 135 pages. Part B is 95 page
New Directions for Contact Integrators
Contact integrators are a family of geometric numerical schemes which
guarantee the conservation of the contact structure. In this work we review the
construction of both the variational and Hamiltonian versions of these methods.
We illustrate some of the advantages of geometric integration in the
dissipative setting by focusing on models inspired by recent studies in
celestial mechanics and cosmology.Comment: To appear as Chapter 24 in GSI 2021, Springer LNCS 1282
Graphs for Pattern Recognition
This monograph deals with mathematical constructions that are foundational in such an important area of data mining as pattern recognition. By using combinatorial and graph theoretic techniques, a closer look is taken at infeasible systems of linear inequalities, whose generalized solutions act as building blocks of geometric decision rules for pattern recognition.
Infeasible systems of linear inequalities prove to be a key object in pattern recognition problems described in geometric terms thanks to the committee method. Such infeasible systems of inequalities represent an important special subclass of infeasible systems of constraints with a monotonicity property – systems whose multi-indices of feasible subsystems form abstract simplicial complexes (independence systems), which are fundamental objects of combinatorial topology.
The methods of data mining and machine learning discussed in this monograph form the foundation of technologies like big data and deep learning, which play a growing role in many areas of human-technology interaction and help to find solutions, better solutions and excellent solutions