Related papers: Symmetries of Dependency Quantified Boolean Formul…
Several classes of quantum circuits have been shown to provide a quantum computational advantage under certain assumptions. The study of ever more restricted classes of quantum circuits capable of quantum advantage is motivated by possible…
Neural networks (NNs) are currently changing the computational paradigm on how to combine data with mathematical laws in physics and engineering in a profound way, tackling challenging inverse and ill-posed problems not solvable with…
In quantum control, quantum speed limits provide fundamental lower bounds on the time that is needed to implement certain unitary transformations. Using Lie algebraic methods, we link these speed limits to symmetries of the control…
In this paper, we investigate the problem of synthesizing resilient supervisors against combined actuator and sensor attacks, for the subclass of cyber-physical systems that can be modelled as discrete-event systems. We assume that the…
We develop the idea of employing localization systems of Boolean coverings, associated with measurement situations, in order to comprehend structures of Quantum Observables. In this manner, Boolean domain observables constitute structure…
In Exact Quantum Query model, almost all of the Boolean functions for which non-trivial query algorithms exist are symmetric in nature. The most well known techniques in this domain exploit parity decision trees, in which the parity of two…
This thesis aims to establish notions of symmetry for quantum states and channels as well as describe algorithms to test for these properties on quantum computers. Ideally, the work will serve as a self-contained overview of the subject. We…
The global symmetries of a $D$-dimensional QFT can, in many cases, be captured in terms of a $(D+1)$-dimensional symmetry topological field theory (SymTFT). In this work we construct a $(D+1)$-dimensional theory which governs the symmetries…
We propose two models of random quantified boolean formulas and their natural random disjunctive logic program counterparts. The models extend the standard models of random k-CNF formulas and the Chen-Interian model of random 2QBFs. The…
Many verification and synthesis approaches rely on solving techniques for quantified Boolean formulas (QBF). Consequently, solution witnesses, in the form of Boolean functions, become more and more important as they represent…
The results, different aspects and applications of our method of quantisation on configuration manifolds - called Borel Quantisation - were presented at meetings of the series `Symmetries in Science' and can be found in the published…
We provide a class of positive and trace-preserving maps based on symmetric measurements. From these positive maps we present separability criteria, entanglement witnesses, as well as the lower bounds of concurrence. We show by detailed…
The use of geometric and symmetry techniques in quantum and classical information processing has a long tradition across the physical sciences as a means of theoretical discovery and applied problem solving. In the modern era, the emergent…
Stabilizer states constitute a set of pure states which plays a dominant role in quantum error correction, measurement--based quantum computation, and quantum communication. Central in these applications are the local symmetries of these…
We use the embedding formalism to study correlation functions of a d-dimensional Euclidean CFT in the presence of a $q$ co-dimensional defect. The defect breaks the global conformal group $SO(d+1,1)$ into $SO(d-q+1,1) \times SO(q)$. We…
Symmetry-resolved entanglement, capturing the refined structure of quantum entanglement in systems with global symmetries, has attracted a lot of attention recently. In this manuscript, introducing the notion of symmetry-resolved…
The Boolean satisfiability problem (SAT) is of central importance in both theory and practice. Yet, most provable guarantees for quantum algorithms rely exclusively on Grover-type methods that cap the possible advantage at only quadratic…
Quantum field theories can exhibit various generalized symmetry structures, among which higher-group symmetries and non-invertible symmetry defects are particularly prominent. In this work, we explore a new general scenario in which these…
High-throughput approximations of quantum mechanics calculations and combinatorial experiments have been traditionally used to reduce the search space of possible molecules, drugs and materials. However, the interplay of structural and…
The boolean satisfiability (SAT) problem asks whether there exists an assignment of boolean values to the variables of an arbitrary boolean formula making the formula evaluate to True. It is well-known that all NP-problems can be coded as…