Related papers: Wasserstein Complexity of Quantum Circuits
A new algorithm for minimization of quantum cost of quantum circuits has been designed. The quantum cost of different quantum circuits of particular interest (eg. circuits for EPR, quantum teleportation, shor code and different quantum…
In this work, we propose a generalization of the current most widely used quantum computing hardware metric known as the quantum volume. The quantum volume specifies a family of random test circuits defined such that the logical circuit…
Quantum technology has been rapidly growing due to its potential revolutionary applications. In particular, superconducting qubits provide a strong light-matter interaction as required for quantum computation and in principle can be scaled…
Quantum coherence is a fundamental property of quantum systems, separating quantum from classical physics. Recently, there has been significant interest in the characterization of quantum coherence as a resource, investigating how coherence…
Motivated by recent studies of holographic complexity, we examine the question of circuit complexity in quantum field theory. We provide a quantum circuit model for the preparation of Gaussian states, in particular the ground state, in a…
Quantum gravity is likely the deepest problem facing current physics. While traditionally associated with short distance nonrenormalizability, it is evident that the long distance problem of unitarity, arising at high energies with black…
We study the problem of the practical realization of an abstract quantum circuit when executed on quantum hardware. By practical, we mean adapting the circuit to particulars of the physical environment which restricts/complicates the…
The existence of a fundamental scale, a lower bound to any output of a position measurement, seems to be a model-independent feature of quantum gravity. In fact, different approaches to this theory lead to this result. The key ingredients…
The concept of quantum computing has inspired a whole new generation of scientists, including physicists, engineers, and computer scientists, to fundamentally change the landscape of information technology. With experimental demonstrations…
Coherence and entanglement are fundamental properties of quantum systems, promising to power the near future quantum computers, sensors and simulators. Yet, their experimental detection is challenging, usually requiring full reconstruction…
Quantum chemistry is among the most promising applications of quantum computing, offering the potential to solve complex electronic structure problems more efficiently than classical approaches. A critical component of any quantum algorithm…
Quantum gravity, and quantum cosmology, is not yet a complete nor consistent theory. One of the reasons for this is that the identification of the quantum of gravity is still very elusive. Here we show that the quantum of gravity is the…
Quantum Computing is a new and exciting field at the intersection of mathematics, computer science and physics. It concerns a utilization of quantum mechanics to improve the efficiency of computation. Here we present a gentle introduction…
One limitation of the variational quantum eigensolver algorithm is the large number of measurement steps required to estimate different terms in the Hamiltonian of interest. Unitary partitioning reduces this overhead by transforming the…
Quantum coherence is a key resource in quantum information processing scenarios, and quantifying coherence is an important task for both quantum foundation and quantum technology. However, until now, all most of coherence measures are…
The search for a theory of quantum gravity is the most fundamental problem in all of theoretical physics, but there are as yet no experimental results at all to guide this endeavor. What seems to be needed is a pragmatic way to test if…
We generalise some well-known graph parameters to operator systems by considering their underlying quantum channels. In particular, we introduce the quantum complexity as the dimension of the smallest co-domain Hilbert space a quantum…
Optimization of circuits is an essential task for both quantum and classical computers to improve their efficiency. In contrast, classical logic optimization is known to be difficult, and a lot of heuristic approaches have been developed so…
In theoretical machine learning, the statistical complexity is a notion that measures the richness of a hypothesis space. In this work, we apply a particular measure of statistical complexity, namely the Rademacher complexity, to the…
Over the last 25 years, techniques based on drift and minorization (d&m) have been mainstays in the convergence analysis of MCMC algorithms. However, results presented herein suggest that d&m may be less useful in the emerging area of…