相关论文: The Robinson-Schensted correspondence as the quant…

Following [OW16], we continue our analysis of: (1) "Quantum tomography", i.e., learning a quantum state, i.e., the quantum generalization of learning a discrete probability distribution; (2) The distribution of Young diagrams output by the…

We consider random bipartite quantum states obtained by tracing out one subsystem from a random, uniformly distributed, tripartite pure quantum state. We compute thresholds for the dimension of the system being traced out, so that the…

The Abbe's diffraction limit restricts the resolution of an optical imaging and lithography system. Coherent Rabi oscillation is shown to be able to overcome the diffraction limit in both optical and atom lithography. In previous studies,…

We discuss the classical and quantum reduction to the space of physical degrees of freedom of Yang--Mills theory on a circle (so that space-time is a cylinder). Although the classical reduced phase space is finite-dimensional, the quantum…

In O'Connell-Pei(2013) a q-weighted version of the Robinson-Schensted algorithm was introduced. In this paper we show that this algorithm has a symmetry property analogous to the well known symmetry property of the normal Robinson-Schensted…

The Robbins-Siegmund theorem is one of the most important results in stochastic optimization, where it is widely used to prove the convergence of stochastic algorithms. We provide a quantitative version of the theorem, establishing a bound…

Several quantum algorithms for linear algebra problems, and in particular quantum machine learning problems, have been "dequantized" in the past few years. These dequantization results typically hold when classical algorithms can access the…

A randomisation of the Berele insertion algorithm is proposed, where the insertion of a letter to a symplectic Young tableau leads to a distribution over the set of symplectic Young tableaux. Berele's algorithm provides a bijection between…

We introduce new rounding methods to improve the accuracy of finite precision quantum arithmetic. These quantum rounding methods are applicable when multiple samples are being taken from a quantum program. We show how to use multiple…

We quantize the Oppenheimer-Snyder model of black hole using the integral quantization method. We treat spatial and temporal coordinates on the same footing both at classical and quantum levels. Our quantization resolves or smears the…

Quantum computers show potential for achieving computational advantage over classical computers, with many candidate applications in combinatorial optimisation. We present an application level benchmarking framework for near-term quantum…

Persistence diagrams are a useful tool from topological data analysis which can be used to provide a concise description of a filtered topological space. What makes them even more useful in practice is that they come with a notion of a…

We present a new algorithm for finding isolated zeros of a system of real-valued functions in a bounded interval in $\mathbb{R}^n$. It uses the Chebyshev proxy method combined with a mixture of subdivision, reduction methods, and…

Kashiwara's crystal graphs have a natural monoid structure that arises by identifying words labelling vertices that appear in the same position of isomorphic components. The celebrated plactic monoid (the monoid of Young tableaux), arises…

We describe a relationship between Robinson-Schensted algorithms defined for standard domino tableaux of unequal rank. The principal idea is the moving-through operation defined on standard domino tableaux by D. Garfinkle. When restricted…

In this paper, we give an explicit combinatorial realization of the crystal B(\lambda) for an irreducible highest weight U_q(q(n))-module V(\lambda) in terms of semistandard decomposition tableaux. We present an insertion scheme for…

We implement the Rayleigh-Ritz method in supersymmetric quantum mechanics with flat directions, and extract the S-matrix and metastable resonances. The effectiveness of the method is demonstrated in two strongly coupled systems: an N=1 toy…

Quadratic unconstrained binary optimization (QUBO) has become the standard format for optimization using quantum computers, i.e., for both the quantum approximate optimization algorithm (QAOA) and quantum annealing (QA). We present a…

Many quantum algorithms seek to output a specific bitstring solving the problem of interest--or a few if the solution is degenerate. It is the case for the quantum approximate optimization algorithm (QAOA) in the limit of large circuit…

The techniques and analysis presented in this paper provide new methods to solve optimization problems posed on Riemannian manifolds. A new point of view is offered for the solution of constrained optimization problems. Some classical…