Related papers: A reply to "Problems with modelling closed timelik…
We recently considered the task of summoning an unknown quantum state and proved necessary and sufficient conditions for Alice to be able to guarantee to complete the task when there may be several possible calls, of which she need only…
If a quantum system is prepared and later post-selected in certain states, "paradoxical" predictions for intermediate measurements can be obtained. This is the case both when the intermediate measurement is strong, i.e. a projective…
We study some aspects of the theory of non-commutative differential calculi over complex algebras, especially over the Hopf algebras associated to compact quantum groups in the sense of S.L. Woronowicz. Our principal emphasis is on the…
We argue that the claim given in quant-ph/9801014 remains untenable in the revised version. The fallacy in the proof is a misinterpretation of the no-cloning and teleportation theorems, which do not involve time and reference frames.
Counterfactual explanations offer an intuitive and straightforward way to explain black-box models and offer algorithmic recourse to individuals. To address the need for plausible explanations, existing work has primarily relied on…
Many problems of practical interest rely on Continuous-time Markov chains~(CTMCs) defined over combinatorial state spaces, rendering the computation of transition probabilities, and hence probabilistic inference, difficult or impossible…
We study the following problem: with the power of postselection (classically or quantumly), what is your ability to answer adaptive queries to certain languages? More specifically, for what kind of computational classes $\mathcal{C}$, we…
The goal of this paper is twofold. In addition to the results stated in the next paragraph, we present some classical results on absoluteness relevant to functional analysis that are well known to logicians but not nearly as well advertised…
This paper is concerned with the well-posedness analysis of the Hartree-Fock system modeling the time evolution of a quantum system comprised of fermions. We consider quantum states with finite mass and finite kinetic energy, and the…
We show that Cutting Planes (CP) proofs are hard to find: Given an unsatisfiable formula $F$, 1) It is NP-hard to find a CP refutation of $F$ in time polynomial in the length of the shortest such refutation; and 2)unless Gap-Hitting-Set…
Building on Lin's breakthrough MIP$^{co}$ = coRE and an encoding of non-local games as universal sentences in the language of tracial von Neumann algebras, we show that locally universal tracial von Neumann algebras have undecidable…
It was recently shown \cite{opposite} that systems with opposite thermodynamic arrows of time could have moderate mutual interaction with neither destroying the order of the other. Such interaction includes signaling. Signals, however, may…
The paper presents probabilistic extensions of interval temporal logic (ITL) and duration calculus (DC) with infinite intervals and complete Hilbert-style proof systems for them. The completeness results are a strong completeness theorem…
We construct connected $2$-arc-transitive covers of the Petersen graph with non-solvable transformation groups, solving the long-standing problem for the existence of such covers.
We bring together the semiclassical approximation, matrix integrals and the theory of symmetric polynomials in order to solve a long standing problem in the field of quantum chaos: to compute transport moments when tunnel barriers are…
The periodic tiling conjecture (PTC) asserts, for a finitely generated Abelian group $G$ and a finite subset $F$ of $G$, that if there is a set $A$ that solves the tiling equation $\mathbb{1}_F * \mathbb{1}_A = 1$, there is also a periodic…
We show that there is a point on a computable arc that does not belong to any computable rectifiable curve. We also show that there is a point on a computable rectifiable curve with computable length that does not belong to any computable…
Kallampally and Tewari showed in 2016 that there can be a trade-off between determinism and time in space-bounded computations. This they did by describing an unambiguous non-deterministic algorithm to solve Directed Graph Reachability that…
A method of a non-stationary description of tunneling of a particle through the one-dimensional and spherically symmetric rectangular barriers on the basis of analisis of multiple internal reflections of wave packets in relation on the…
The semantic paradoxes are associated with self-reference or referential circularity. However, there are infinitary versions of the paradoxes, such as Yablo's paradox, that do not involve this form of circularity. It remains an open…