Related papers: A solvable model of quantum random optimization pr…
Quantum computers provide a super-exponential speedup for performing a Fourier transform over the symmetric group, an ability for which practical use cases have remained elusive so far. In this work, we leverage this ability to unlock…
In this paper we describe physical properties arising in the vicinity of two coupled quantum phase transitions. We consider a phenomenological model based on two scalar order parameter fields locally coupled biquadratically and having a…
We analyze the response of a complex quantum-mechanical system (e. g., a quantum dot) to a time-dependent perturbation. Assuming the dot energy spectrum and the perturbation to be described by the Gaussian Orthogonal Ensemble of random…
Recent advances in quantum computers are demonstrating the ability to solve problems at a scale beyond brute force classical simulation. As such, a widespread interest in quantum algorithms has developed in many areas, with optimization…
In the process of work it has been found that space-time quantum fluctuations are naturally described in terms of the deformation parameter introduced on going from the well-known quantum mechanics to that at Planck scales and put forward…
In the recent article Phys. Rev. D 100, no. 4, 043533 (2019) a compact phase space generalization of the flat de Sitter cosmology has been proposed. The main advantages of the compactification is that physical quantities are bounded, and…
We present a general framework for finding the time-optimal evolution and the optimal Hamiltonian for a quantum system with a given set of initial and final states. Our formulation is based on the variational principle and is analogous to…
Combinatorial optimization is considered a promising class of problems in which quantum computers can show significant advantages. However, problems of practical relevance typically have more variables than current or foreseeable quantum…
Finding the global minimum in a rugged potential landscape is a computationally hard task, often equivalent to relevant optimization problems. Simulated annealing is a computational technique which explores the configuration space by…
Solid-state spin qubits have emerged as promising platforms for quantum information. Despite extensive efforts in controlling noise in spin qubit quantum applications, one important but less controlled noise source is near-field…
Perturbation theory is an important technique for reducing computational cost and providing physical insights in simulating quantum systems with classical computers. Here, we provide a quantum algorithm to obtain perturbative energies on…
Variational quantum algorithms (VQAs) are a modern family of quantum algorithms designed to solve optimization problems using a quantum computer. Typically VQAs rely on a feedback loop between the quantum device and a classical optimization…
A central challenge in quantum simulation is to prepare low-energy states of strongly interacting many-body systems. In this work, we study the problem of preparing a quantum state that optimizes a random all-to-all, sparse or dense, spin…
We study the thermodynamic phase diagram of a one-dimensional quantum spin chain subjected to both mean-field and nearest-neighbor interactions, and to a transverse magnetic field $h$. The purpose is to determine the effect of the quantum…
We introduce an iterative method to search for time-optimal Hamiltonians that drive a quantum system between two arbitrary, and in general mixed, quantum states. The method is based on the idea of progressively improving the efficiency of…
A semiclassical description of quantum systems is applied to probe the dynamics of the cosmological model of an inflationary universe with quadratic inflaton potential, described in a quantum framework of geometrodynamics. The systematic…
Non-perturbative solutions to the quantum-field theory is a topic of current and broad interest, especially for the heavy ion and laser physics communities, since they investigate particle production in the presence of strong external…
Given a quantum Hamiltonian and its evolution time, the corresponding unitary evolution operator can be constructed in many different ways, corresponding to different trajectories between the desired end-points. A choice among these…
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…