Related papers: RAMBO on diet
In this article we describe an algorithm that can be applied for the generation of various classes of maps on orientable surfaces. It uses existing generators for abstract graphs and combines them with an efficient embedding and isomorphism…
We introduce the ramified partition algebra, which is a physically motivated and natural generalization of the partition algebra. We investigate its representation theory and demonstrate quasi--heredity under certain conditions. Under these…
Quantum metrology aims to exploit quantum phenomena to overcome classical limitations in the estimation of relevant parameters. We consider a probe undergoing a phase shift $\varphi$ whose generator is randomly sampled according to a…
We study the power of uncontrolled random molecular movement in the nubot model of self-assembly. The nubot model is an asynchronous nondeterministic cellular automaton augmented with rigid-body movement rules (push/pull, deterministically…
Geometric phases arise in a number of physical situations and often lead to systematic shifts in frequencies or phases measured in precision experiments. We describe, by working through some simple examples, a method to calculate geometric…
Random batch algorithms are constructed for quantum Monte Carlo simulations. The main objective is to alleviate the computational cost associated with the calculations of two-body interactions, including the pairwise interactions in the…
Quantum coherence, a basic feature of quantum mechanics residing in superpositions of quantum states, is a resource for quantum information processing. Coherence emerges in a fundamentally different way for nonidentical and identical…
We develop Random Batch Methods for interacting particle systems with large number of particles. These methods use small but random batches for particle interactions, thus the computational cost is reduced from $O(N^2)$ per time step to…
We develop a new perspective on the discretization of the phase space structure of gravity in 2+1 dimensions as a piecewise-flat geometry in 2 spatial dimensions. Starting from a subdivision of the continuum geometric and phase space…
We present efficient circuits that can be used for the phase space tomography of quantum states. The circuits evaluate individual values or selected averages of the Wigner, Kirkwood and Husimi distributions. These quantum gate arrays can be…
We experimentally demonstrate a bias-free optical quantum random number generator with real-time randomness extraction to directly output uniform distributed random numbers by measuring the vacuum fluctuation of quantum state. A phase…
The 1-parameter family of transformations identified by Barbero and Immirzi plays a significant role in non-perturbative approaches to quantum gravity, among them Loop Quantum Gravity and Spin Foams. It facilitates the loop quantization…
We present an efficient quantum algorithm for preparing a pure state on a quantum computer, where the quantum state corresponds to that of a molecular system with a given number $m$ of electrons occupying a given number $n$ of spin…
Motivated for the fault tolerant quantum computation, quantum gate by adiabatic geometric phase shift is extensively investigated. In this paper, we demonstrate the nonadiabatic scheme for the geometric phase shift and conditional geometric…
The barren plateau phenomenon is one of the main obstacles to implementing variational quantum algorithms in the current generation of quantum processors. Here, we introduce a method capable of avoiding the barren plateau phenomenon in the…
Adiabatic geometric phase gates offer enhanced robustness against fluctuations compared to con- ventional Rydberg blockade-based phase gates that rely on dynamical phase accumulation. We theoretically demonstrate two- and multi-qubit phase…
Massive MIMO opens up new avenues for enabling highly efficient random access (RA) by offering abundance of spatial degrees of freedom. In this paper, we investigate the grant-free RA with massive MIMO and derive the analytic expressions of…
In [Fleurat, Salvy 2024], we introduced a model of block-weighted random maps that undergoes a phase transition as the density of separating elements changes. The purpose of this note is to demonstrate that the methodology we developed can…
The Markov Chain Monte Carlo method is at the heart of efficient approximation schemes for a wide range of problems in combinatorial enumeration and statistical physics. It is therefore very natural and important to determine whether…
Standard formulations of GANs, where a continuous function deforms a connected latent space, have been shown to be misspecified when fitting different classes of images. In particular, the generator will necessarily sample some low-quality…