Related papers: Sampling random quantum circuits: a pedestrian's g…
In recent years, several experimental groups have claimed demonstrations of ``quantum supremacy'' or computational quantum advantage. A notable first claim by Google Quantum AI revolves around a metric called the Linear Cross Entropy…
Quantum computers are designed to outperform standard computers by running quantum algorithms. Areas in which quantum algorithms can be applied include cryptography, search and optimisation, simulation of quantum systems, and solving large…
Quantum versions of random walks have diverse applications that are motivating experimental implementations as well as theoretical studies. However, the main impetus behind this interest is their use in quantum algorithms, which have always…
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…
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 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…
The generation of certifiable randomness is one of the most promising applications of quantum technologies. Furthermore, the intrinsic non-locality of quantum correlations allow us to certify randomness in a device-independent way, i.e. one…
Nyquist-Shannon sampling theorem, instrumental in classical telecommunication technologies, is extended to quantum systems supporting a unitary representation of a finite group $G$. Two main ideas from the classical theory having natural…
We introduce a distributed classical simulation algorithm for general quantum circuits, and present numerical results for calculating the output probabilities of universal random circuits. We find that we can simulate more qubits to greater…
Quantum information processing offers promising advances for a wide range of fields and applications, provided that we can efficiently assess the performance of the control applied in candidate systems. That is, we must be able to determine…
The recent development of quantum computing, which uses entanglement, superposition, and other quantum fundamental concepts, can provide substantial processing advantages over traditional computing. These quantum features help solve many…
Quantum mechanics, with its counterintuitive principles and probabilistic nature, has long been confined to the microscopic realm of atoms and photons. Yet, recent breakthroughs have pushed the boundaries of quantum behavior into the…
We propose a method for the implementation of one-way quantum computing in superconducting circuits. Measurement-based quantum computing is a universal quantum computation paradigm in which an initial cluster-state provides the quantum…
In recent decades, the study of quantum magnets, which feature unconventional behaviour such as exotic quantum phase transitions and quantum spin liquids, and unconventional magnetic states of matter, has made remarkable progress. However,…
Simulating quantum circuits using classical computers lets us analyse the inner workings of quantum algorithms. The most complete type of simulation, strong simulation, is believed to be generally inefficient. Nevertheless, several…
The design of new devices and experiments in science and engineering has historically relied on the intuitions of human experts. This credo, however, has changed. In many disciplines, computer-inspired design processes, also known as…
The idea of the quantum computation is based on paradoxical principles of quantum physics, superposition and entanglement of quantum states. This idea looks well-founded on the microscopic level in spite of the absence of an universally…
Quantum operations are the most widely used tool in the theory of quantum information processing, representing elementary transformations of quantum states that are composed to form complex quantum circuits. The class of quantum…
We prove that a quantum circuit together with measurement apparatuses and EPR sources can be fully verified without any reference to some other trusted set of quantum devices. Our main assumption is that the physical system we are working…
Classical simulation of quantum computation has often been viewed as the method to determine where the horizon of quantum supremacy is located---that is, where quantum computation can no longer be simulated by classical methods. As of now,…