Related papers: Quantum supremacy in driven quantum many-body syst…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Quantum computational supremacy arguments, which describe a way for a quantum computer to perform a task that cannot also be done by a classical computer, typically require some sort of computational assumption related to the limitations of…
We propose a method to achieve quantum supremacy using ensembles of qubits, using only spin squeezing, basis rotations, and Fock state measurements. Each ensemble is assumed to be controllable only with its total spin. Using a repeated…
A quantum system coupled to a bath at some fixed, finite temperature converges to its Gibbs state. This thermalization process defines a natural, physically-motivated model of quantum computation. However, whether quantum computational…
It is believed that random quantum circuits are difficult to simulate classically. These have been used to demonstrate quantum supremacy: the execution of a computational task on a quantum computer that is infeasible for any classical…
Quantum computing is an exciting field that uses quantum principles, such as quantum superposition and entanglement, to tackle complex computational problems. Superconducting quantum circuits, based on Josephson junctions, is one of the…
Quantum random sampling is the leading proposal for demonstrating a computational advantage of quantum computers over classical computers. Recently, first large-scale implementations of quantum random sampling have arguably surpassed the…
Transmon qubits have traditionally been regarded as limited to random circuit sampling, incapable of performing Fock state boson sampling, a problem known to be classically intractable. This work challenges that assumption by introducing…
Compressible models extend the domain of simulable systems in quantum computers, but little is known about their precise limits of applicability. Using the theory of compressible matchgate circuits, we identify a class of quadratic…
Simulating quantum mechanics is known to be a difficult computational problem, especially when dealing with large systems. However, this difficulty may be overcome by using some controllable quantum system to study another less controllable…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
Closed quantum many-body systems out of equilibrium pose several long-standing problems in physics. Recent years have seen a tremendous progress in approaching these questions, not least due to experiments with cold atoms and trapped ions…
The quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical construction of quantum computers. However, several other…
Quantum many-body systems exhibit a rich and diverse range of exotic behaviours, owing to their underlying non-classical structure. These systems present a deep structure beyond those that can be captured by measures of correlation and…
The recently reported experimental results claiming "quantum supremacy" achieved by Google quantum device are critically discussed. The Google team constructed a quantum chaotic system based on Josephson junction technology which cannot be…
Quantum systems are notoriously difficult to simulate with classical means. Recently, the idea of using another quantum system - which is experimentally more controllable - as a simulator for the original problem has gained significant…
Results on the hardness of approximate sampling are seen as important stepping stones towards a convincing demonstration of the superior computational power of quantum devices. The most prominent suggestions for such experiments include…
A quantum system subject to external fields is said to be controllable if these fields can be adjusted to guide the state vector to a desired destination in the state space of the system. Fundamental results on controllability are reviewed…
We conduct experimental simulations of many body quantum systems using a \emph{hybrid} classical-quantum algorithm. In our setup, the wave function of the transverse field quantum Ising model is represented by a restricted Boltzmann…
This is evident that the controllable quantum systems can be the reliable building blocks for Quantum computation. In reality we are witnessing the progress towards making the idea tractable enough, though optimistic but the threshold is…