Related papers: A Duality Theorem for Classical-Quantum States wit…
According to the Gottesman-Knill theorem, quantum algorithms which utilise only the operations belonging to a certain restricted set are efficiently simulable classically. Since some of the operations in this set generate entangled states,…
We are interested in solving convex optimization problems with large numbers of constraints. Randomized algorithms, such as random constraint sampling, have been very successful in giving nearly optimal solutions to such problems. In this…
The first part of this work established the foundations of a radial duality between nonnegative optimization problems, inspired by the work of (Renegar, 2016). Here we utilize our radial duality theory to design and analyze projection-free…
A new approach to linear programming duality is proposed which relies on quadratic penalization, so that the relation between solutions to the penalized primal and dual problems becomes affine. This yields a new proof of Levin's duality…
Description of nonclassicality of states has hitherto been through violation of Bell inequality and non-separability, with the latter being a stronger constraint. In this paper, we show that this can be further sharpened, by introducing the…
We address the issue of coupling variables which are essentially classical to variables that are quantum. Two approaches are discussed. In the first (based on collaborative work with L.Di\'osi), continuous quantum measurement theory is used…
In this paper, we investigate the fundamental laws of quantum programming. We extend a comprehensive set of Hoare et al.'s basic laws of classical programming to the quantum setting. These laws characterise the algebraic properties of…
In this thesis, we introduce a new quantum Turing machine (QTM) model that supports general quantum operators, together with its pushdown, counter, and finite automaton variants, and examine the computational power of classical and quantum…
We investigate local distinguishability of quantum states by use of the convex analysis about joint numerical range of operators on a Hilbert space. We show that any two orthogonal pure states are distinguishable by local operations and…
Contextuality has been conjectured to be a super-classical resource for quantum computation, analogous to the role of non-locality as a super-classical resource for communication. We show that the presence of contextuality places a lower…
The classical-quantum duality at the basis of quantum theory is here extended to the Planck scale domain. The classical/semiclassical gravity (G) domain is dual (in the precise sense of the classical-quantum duality) to the quantum (Q)…
The main purpose of this paper is to close the gap between the optimal values of an infinite convex program and that of its biconjugate relaxation. It is shown that Slater and continuity-type conditions guarantee such a zero-duality gap.…
We study the convex duality method for robust utility maximization in the presence of a random endowment. When the underlying price process is a locally bounded semimartingale, we show that the fundamental duality relation holds true for a…
** The primary topic of this dissertation is the study of the relationships between parts and wholes as described by particular physical theories, namely generalized probability theories in a quasi-classical physics framework and…
This article studies problems of optimal transport, by embedding them in a general functional analytic framework of convex optimization. This provides a unified treatment of a large class of related problems in probability theory and allows…
Contrary to classical semantics, the disjunction of two experimental propositions relating to pure states of a quantum system ("quantum propositions" for short) can be true even in the case where neither disjunct is true. This suggests that…
Hybrid quantum-classical algorithms hold great promise for solving quantum control problems on near-term quantum computers. In this work, we employ the hybrid framework that integrates digital quantum simulation with classical optimization…
The "quantum duality principle" states that a quantisation of a Lie bialgebra provides also a quantisation of the dual formal Poisson group and, conversely, a quantisation of a formal Poisson group yields a quantisation of the dual Lie…
Semidefinite programs (SDPs) play a crucial role in control theory, traditionally as a computational tool. Beyond computation, the duality theory in convex optimization also provides valuable analytical insights and new proofs of classical…
This paper traces an intellectual journey or \textit{Way} (in the sense of a Tao) that starts with some unfinished work of Gian-Carlo Rota on making a logic of equivalence relations or partitions. Rota understood the category-theoretic…