English
Related papers

Related papers: RAMBO on diet

200 papers

The well-known Gumbel-Max Trick for sampling elements from a categorical distribution (or more generally a nonnegative vector) and its variants have been widely used in areas such as machine learning and information retrieval. To sample a…

Computation · Statistics 2020-02-04 Yiyan Qi , Pinghui Wang , Yuanming Zhang , Junzhou Zhao , Guangjian Tian , Xiaohong Guan

Recent gravity discussions of a traversable wormhole indicate that in holographic systems signals generated by a source could reappear long after they have dissipated, with the need of only performing some simple operations. In this paper…

High Energy Physics - Theory · Physics 2019-10-23 Ping Gao , Hong Liu

Much of our understanding of gapless quantum matter stems from low-energy descriptions using conformal field theory. This is especially true in 1+1 dimensions, where such theories have an infinite-dimensional parameter space induced by…

Strongly Correlated Electrons · Physics 2026-02-25 Bastien Lapierre , Per Moosavi , Blagoje Oblak

The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial: pure quantum…

Quantum Physics · Physics 2007-05-23 Viv Kendon

A bias-free source-independent quantum random number generator scheme based on the measurement of vacuum fluctuation is proposed to realize the effective elimination of system bias and common mode noise introduced by the local oscillator.…

Quantum Physics · Physics 2020-07-17 Ziyong Zheng , Yi-Chen Zhang , Min Huang , Ziyang Chen , Song Yu , Hong Guo

At present, several models for quantum computation have been proposed. Adiabatic quantum computation scheme particularly offers this possibility and is based on a slow enough time evolution of the system, where no transitions take place. In…

Quantum Physics · Physics 2012-10-12 P. J. Salas Peralta

The Boltzmann model for the random generation of "decomposable" combinatorial structures is a set of techniques that allows for efficient random sampling algorithms for a large class of families of discrete objects. The usual requirement of…

Data Structures and Algorithms · Computer Science 2011-12-23 Philippe Duchon

The Reduced Basis Method (RBM) is a rigorous model reduction approach for solving parametrized partial differential equations. It identifies a low-dimensional subspace for approximation of the parametric solution manifold that is embedded…

Numerical Analysis · Mathematics 2018-09-25 Yanlai Chen , Jiahua Jiang , Akil Narayan

Efficient sampling from a classical Gibbs distribution is an important computational problem with applications ranging from statistical physics over Monte Carlo and optimization algorithms to machine learning. We introduce a family of…

Quantum Physics · Physics 2021-09-08 Dominik S. Wild , Dries Sels , Hannes Pichler , Cristian Zanoci , Mikhail D. Lukin

Due to the undecidability of most type-related properties of System F like type inhabitation or type checking, restricted polymorphic systems have been widely investigated (the most well-known being ML-polymorphism). In this paper we…

Logic in Computer Science · Computer Science 2021-05-04 Paolo Pistone , Luca Tranchini

Quantum engineering of time-separated Raman laser pulses in three-level systems is presented to produce an ultra-narrow optical transition in bosonic alkali-earth clocks free from light shifts and with a significantly reduced sensitivity to…

Atomic Physics · Physics 2015-03-26 T. Zanon-Willette , S. Almonacil , E. de Clercq , A. D. Ludlow , E. Arimondo

Space is a circuit oriented, spatial programming language designed to exploit the massive parallelism available in a novel formal model of computation called the Synchronic A-Ram, and physically related FPGA and reconfigurable…

Computation and Language · Computer Science 2010-08-31 Alex V Berka

Recent research shows that the partition function for a class of models involving fermions can be written as a statistical mechanics of clusters with positive definite weights. This new representation of the model allows one to construct…

High Energy Physics - Lattice · Physics 2007-05-23 Shailesh Chandrasekharan

Quantum tomography can reconstruct fine phase-space structures that are not necessarily resolved by measurement itself. We show that the effective resolution of tomography is determined by a sampling operator linked to the Gram matrix of…

Quantum Physics · Physics 2026-05-29 Zdenek Hradil , Jaroslav Rehacek

Relational particle mechanics models (RPM's) are useful models for the problem of time in quantum gravity and other foundational issues in quantum cosmology. Some concrete examples of scalefree RPM's have already been studied, but it is the…

General Relativity and Quantum Cosmology · Physics 2010-02-15 Edward Anderson

In machine learning, fewer features reduce model complexity. Carefully assessing the influence of each input feature on the model quality is therefore a crucial preprocessing step. We propose a novel feature selection algorithm based on a…

Quantum Physics · Physics 2023-02-22 Sascha Mücke , Raoul Heese , Sabine Müller , Moritz Wolter , Nico Piatkowski

A new quantum algorithm is proposed to solve Satisfiability(SAT) problems by taking advantage of non-unitary transformation in ground state quantum computer. The energy gap scale of the ground state quantum computer is analyzed for 3-bit…

Quantum Physics · Physics 2015-06-26 Wenjin Mao

Phase-randomized optical homodyne detection is a well-known technique for performing quantum state tomography. So far, it has been mainly considered a sophisticated tool for laboratory experiments but unsuitable for practical applications.…

We initiate the systematic study of experimental quantum physics from the perspective of computational complexity. To this end, we define the framework of quantum algorithmic measurements (QUALMs), a hybrid of black box quantum algorithms…

Quantum Physics · Physics 2022-03-09 Dorit Aharonov , Jordan Cotler , Xiao-Liang Qi

We show that certain computational algorithms can be simulated on a quantum computer with exponential efficiency and be insensitive to phase errors. Our explicit algorithm simulates accurately the classical chaotic dynamics for…

Quantum Physics · Physics 2007-05-23 B. Georgeot , D. L. Shepelyansky
‹ Prev 1 4 5 6 7 8 10 Next ›