Related papers: Minimum quantum degrees with Maya diagrams
Many quantum algorithms, including recently proposed hybrid classical/quantum algorithms, make use of restricted tomography of the quantum state that measures the reduced density matrices, or marginals, of the full state. The most…
The paper deals with some spectral properties of (mostly infinite) quantum and combinatorial graphs. Quantum graphs have been intensively studied lately due to their numerous applications to mesoscopic physics, nanotechnology, optics, and…
The Quantum Approximate Optimization Algorithm (QAOA), which is a variational quantum algorithm, aims to give sub-optimal solutions of combinatorial optimization problems. It is widely believed that QAOA has the potential to demonstrate…
In the past decades, quantum entanglement has been recognized to be the basic resource in quantum information theory. A fundamental need is then the understanding its qualification and its quantification: Is the quantum state entangled, and…
The fractional quantum Hall (FQH) effect arises from strong electron correlations in a quantising magnetic field, and features exotic emergent phenomena such as electron fractionalisation. Using the diagrammatic Monte Carlo approach with…
This work shows that minimizing the depth of a quantum circuit composed of commuting operations reduces to a vertex coloring problem on an appropriately constructed graph, where gates correspond to vertices and edges encode…
A flagship application of quantum computers is the simulation of other quantum systems, including quantum field theories. In this article, we show how quantum computers can be employed to naturally calculate Feynman diagrams and their…
We present a minimal implementation of SU($N$) pure Yang-Mills theory in $3+1$ dimensions for digital quantum simulation, designed to enable quantum advantage. Building on the orbifold lattice simulation protocol with logarithmic scaling in…
We derive a set of genuine multi-mode entanglement criteria for second moments of the quadrature operators. The criteria have a common form of the uncertainty relation between sums of variances of position and momentum quadrature…
Quantum simulation uses a well-known quantum system to predict the behavior of another quantum system. Certain limitations in this technique arise, however, when applied to specific problems, as we demonstrate with a theoretical and…
Phenomenological models of quantum gravity often consider the existence of some form of minimal length. This feature is commonly described in the context of quantum mechanics and using the corresponding formalism and techniques. Although…
We show that quantum computational imaging is advantageous in the setting of low-dose electron microscopy of beam-sensitive specimens. Two qudits placed near the electron beam enable full transfer of quantum information between the electron…
Current quantum computers require algorithms that use limited resources economically. In quantum machine learning, success hinges on quantum feature maps, which embed classical data into the state space of qubits. We introduce Quantum…
In this paper, we consider the parameterized quantum query complexity for graph problems. We design parameterized quantum query algorithms for $k$-vertex cover and $k$-matching problems, and present lower bounds on the parameterized quantum…
We study quantum maps displaying spectral statistics intermediate between Poisson and Wigner-Dyson. It is shown that they can be simulated on a quantum computer with a small number of gates, and efficiently yield information about fidelity…
We motivate the use of quantum algorithms in particle physics and provide a brief overview of the most recent applications at high-energy colliders. In particular, we discuss in detail how a quantum approach reduces the complexity of jet…
Quantum computers hold great promise, but it remains a challenge to find efficient quantum circuits that solve interesting computational problems. We show that finding optimal quantum circuits is essentially equivalent to finding the…
The characterization of quantum processes is a key tool in quantum information processing tasks for several reasons: on one hand, it allows to acknowledge errors in the implementations of quantum algorithms; on the other, it allows to…
We review the question of whether the fundamental laws of nature limit our ability to probe arbitrarily short distances. First, we examine what insights can be gained from thought experiments for probes of shortest distances, and summarize…
One of the most central and controversial element of quantum mechanics is the use of non zero vectors of a Hilbert space (or, more generally, of one dimension subspaces) for representing the state of a quantum system. In particular, the…