Related papers: RAMBO on diet
We study partitions on three dimensional manifolds which minimize the total geodesic perimeter. We propose a relaxed framework based on a $\Gamma$-convergence result and we show some numerical results. We compare our results to those…
We propose a quantum algorithm, inspired by ADAPT-VQE, to variationally prepare the ground state of a quantum Hamiltonian, with the desirable property that if it fails to find the ground state, it still yields a physically meaningful…
Efficient and coherent data retrieval and storage are essential for harnessing quantum algorithms' speedup. Such a fundamental task is addressed by a quantum Random Access Memory (qRAM). Despite their promising scaling properties, current…
Nonadiabatic geometric quantum computation in decoherence-free subspaces has received increasing attention due to the merits of its high-speed implementation and robustness against both control errors and decoherence. However, all the…
Particle-in-cell merging algorithms aim to resample dynamically the six-dimensional phase space occupied by particles without distorting substantially the physical description of the system. Whereas various approaches have been proposed in…
Quantum phase estimation is at the heart of most quantum algorithms with exponential speedup. In this letter we demonstrate how to utilize it to compute the dynamical response functions of many-body quantum systems. Specifically, we design…
Scrambling processes, which rapidly spread entanglement through many-body quantum systems, are difficult to investigate using standard techniques, but are relevant to quantum chaos and thermalization. In this Letter, we ask if quantum…
Finite coherent quantum systems exhibit a nontrivial response to local sources of phase curvature, which cannot be reduced to conventional forces, disorder-induced localization, or simple gap opening. Here we show that, in finite fermionic…
Mathematical method of quantum phase space is very useful in physical applications like quantum optics and non-relativistic quantum mechanics. However, attempts to generalize it for the relativistic case lead to some difficulties. One of…
Bayesian optimization techniques have been successfully applied to robotics, planning, sensor placement, recommendation, advertising, intelligent user interfaces and automatic algorithm configuration. Despite these successes, the approach…
Flatness of discrete-time systems can be characterized by two simple properties. There exists a map, a submersion, from the flat coordinates and their forward shifts to the state and the input of the discrete-time system, such that the…
A widely used strategy to reduce the computational cost in quantum-chemical calculations is to partition the system into an active subsystem, which is the focus of the computational efforts and an environment that is treated at a lower…
We describe a method to train a generative model with latent factors that are (approximately) independent and localized. This means that perturbing the latent variables affects only local regions of the synthesized image, corresponding to…
Accurate quantum gates are basic elements for building quantum computers. There has been great interest in designing quantum logic gates by using blockade effect of Rydberg atoms recently. The fidelity and operation speed of these gates,…
Particle discretizations of partial differential equations are advantageous for high-dimensional kinetic models in phase space due to their better scalability than continuum approaches with respect to dimension. Complex processes…
A quantum computing algorithm for rhythm generation is presented, which aims to expand and explore quantum computing applications in the arts, particularly in music. The algorithm maps quantum random walk trajectories onto a rhythmspace --…
We study the superselection sectors of two quantum lattice systems stacked onto each other in the operator algebraic framework. We show in particular that all irreducible sectors of a stacked system are unitarily equivalent to a product of…
Several planners have been proposed to compute robot paths that reach desired goal regions while avoiding obstacles. However, these methods fail when all pathways to the goal are blocked. In such cases, the robot must reason about how to…
Weighted pushdown automata (WPDAs) are at the core of many natural language processing tasks, like syntax-based statistical machine translation and transition-based dependency parsing. As most existing dynamic programming algorithms are…
This paper presents a general-purpose formulation of a large class of discrete-time planning problems, with hybrid state and control-spaces, as factored transition systems. Factoring allows state transitions to be described as the…