English
Related papers

Related papers: Sound approximate and asymptotic probabilistic bis…

200 papers

Stabilizer states are fundamental families of quantum states with crucial applications such as error correction, quantum computation, and simulation of quantum circuits. In this paper, we study the problem of testing how close or far a…

Quantum Physics · Physics 2024-11-06 Saeed Mehraban , Mehrdad Tahmasbi

In this work we construct tests that allow a classical user to certify high dimensional entanglement in uncharacterized and possibly noisy quantum devices. We present a family of non-local games $\{G_n\}$ that for all $n$ certify states…

Quantum Physics · Physics 2025-06-09 Rotem Arnon , Henry Yuen

Calculations in field theory are usually accomplished by employing some variants of perturbation theory, for instance using loop expansions. These calculations result in asymptotic series in powers of small coupling parameters, which as a…

High Energy Physics - Phenomenology · Physics 2021-05-05 V. I. Yukalov , E. P. Yukalova

A reliable method for characterizing quantum operations that is suitable for improving and validating their accuracies is indispensable for realizing a practical quantum computer. Known methods are still not sufficient because they lack…

Quantum Physics · Physics 2021-06-25 Takanori Sugiyama , Shinpei Imori , Fuyuhiko Tanaka

It is proved that if $T$ is a $\Sigma_{n+1}$ Definable theory which is $\Sigma_n$-sound and extends $PA$, then $T$ can not prove the sentence $\Sigma_n-sound(T)$ that expresses the $\Sigma_n$-soundness of $T$. Optimality of this result is…

Logic · Mathematics 2016-05-03 Payam Seraji , Conden Chao

We consider statistical inference for a class of mixed-effects models with system noise described by a non-Gaussian integrated Ornstein-Uhlenbeck process. Under the asymptotics where the number of individuals goes to infinity with possibly…

Statistics Theory · Mathematics 2025-11-18 Takumi Imamura , Hiroki Masuda

Given a matrix $A$ and vector $b$ with polynomial entries in $d$ real variables $\delta=(\delta_1,\ldots,\delta_d)$ we consider the following notion of feasibility: the pair $(A,b)$ is locally feasible if there exists an open neighborhood…

Data Structures and Algorithms · Computer Science 2023-05-11 Guy Bresler , Chenghao Guo , Yury Polyanskiy

Milner (1984) defined a process semantics for regular expressions. He formulated a sound proof system for bisimilarity of process interpretations of regular expressions, and asked whether this system is complete. We report conceptually on a…

Logic in Computer Science · Computer Science 2022-11-10 Clemens Grabmayer

We discuss an expansion of the detection probabilities of biphoton states in terms of increasing orders of the joint spectral amplitude. The expansion enables efficient time- or frequency-resolved numerical simulations involving quantum…

Quantum Physics · Physics 2024-12-03 Philipp Kleinpaß , Thomas Walther , Erik Fitzke

By application of the theory for second-order linear differential equations with two turning points developed in \cite{Olver1975}, uniform asymptotic approximations are obtained for the Lam\'{e} and Mathieu functions with a large real…

Classical Analysis and ODEs · Mathematics 2015-07-31 Karen Ogilvie , Adri B. Olde Daalhuis

We study the asymptotics of solutions to a particular class of systems of linear wave equations, namely, of silent equations. We obtain asymptotic estimates of all orders for the solutions, and show that solutions are uniquely determined by…

Analysis of PDEs · Mathematics 2024-10-29 Andrés Franco Grisales

The task of binary quantum hypothesis testing is to determine the state of a quantum system via measurements on it, given the side information that it is in one of two possible states, say $\rho$ and $\sigma$. This task is generally studied…

Quantum Physics · Physics 2021-04-21 Robert Salzmann , Nilanjana Datta

We introduce three general compositionality criteria over operational semantics and prove that, when all three are satisfied together, they guarantee weak bisimulation being a congruence. Our work is founded upon Turi and Plotkin's…

Logic in Computer Science · Computer Science 2021-10-14 Stelios Tsampas , Christian Williams , Andreas Nuyts , Dominique Devriese , Frank Piessens

The existence of a formal particular solution (family of solutions) of oscillating type under certain conditions has been proved for the quasi-linear ordinary differential equations system. The asymptotic nature of this solution (the family…

Classical Analysis and ODEs · Mathematics 2013-07-01 Kirill Vadimovich Amelkin , Alexander Vasilevich Kostin

Bidirectional typechecking, in which terms either synthesize a type or are checked against a known type, has become popular for its applicability to a variety of type systems, its error reporting, and its ease of implementation. Following…

Programming Languages · Computer Science 2020-09-22 Jana Dunfield , Neelakantan R. Krishnaswami

The parametric complexity is the key quantity in the minimum description length (MDL) approach to statistical model selection. Rissanen and others have shown that the parametric complexity of a statistical model approaches a simple function…

Information Theory · Computer Science 2015-10-30 James G. Dowty

Parity and time-reversal (PT ) symmetry is shown as the natural cause of quasi-integrability of deformed integrable models, crucial to represent real physical systems as they posses various irregularities. The condition for asymptotic…

Exactly Solvable and Integrable Systems · Physics 2026-03-24 Kumar Abhinav , Partha Guha , Indranil Mukherjee

We consider the Dirichlet Laplacian in a three-dimensional waveguide that is a small deformation of a periodically twisted tube. The deformation is given by a bending and an additional twisting of the tube, both parametrized by a coupling…

Spectral Theory · Mathematics 2020-02-19 Vincent Bruneau , Pablo Miranda , Daniel Parra , Nicolas Popoff

Scala's type system unifies ML modules, object-oriented, and functional programming. The Dependent Object Types (DOT) family of calculi has been proposed as a new foundation for Scala and similar languages. Unfortunately, it is not clear…

Programming Languages · Computer Science 2016-02-08 Tiark Rompf , Nada Amin

Conjunctive query (CQ) evaluation is NP-complete, but becomes tractable for fragments of bounded hypertreewidth. Approximating a hard CQ by a query from such a fragment can thus allow for an efficient approximate evaluation. While…

Databases · Computer Science 2019-04-02 Pablo Barceló , Miguel Romero , Thomas Zeume
‹ Prev 1 4 5 6 7 8 10 Next ›