Related papers: Minimum quantum degrees with Maya diagrams
Quantum computers and simulators offer unparalleled capabilities of probing quantum many-body states, by obtaining snapshots of the many-body wave function via collective projective measurements. The probability distribution obtained by…
We extend the classification of mixed states of quantum systems composed of arbitrary number of subsystems of arbitrary dimensions. This extended classification is complete in the sense of partial separability and gives 1+18+1 partial…
Graphical calculi such as the ZH-calculus are powerful tools in the study and analysis of quantum processes, with links to other models of quantum computation such as quantum circuits, measurement-based computing, etc. A somewhat compact…
The degree of a polynomial representing (or approximating) a function f is a lower bound for the number of quantum queries needed to compute f. This observation has been a source of many lower bounds on quantum algorithms. It has been an…
We perform quantum Monte Carlo (QMC) calculations to determine minimum energy pathways of simple chemical reactions, and compare the computed geometries and reaction barriers with those obtained with density functional theory (DFT) and…
We prove that the Schubert structure constants of the quantum $K$-theory ring of any minuscule flag variety or quadric hypersurface have signs that alternate with codimension. We also prove that the powers of the deformation parameter $q$…
In variational quantum algorithms (VQAs), the most common objective is to find the minimum energy eigenstate of a given energy Hamiltonian. In this paper, we consider the general problem of finding a sufficient control Hamiltonian structure…
The logical consistency of a description of Quantum Theory in the context of General Relativity, which includes Minimal Coupling Principle, is analyzed from the point of view of Feynman's formulation in terms of path integrals. We will…
Quantum computers have the potential to solve important problems which are fundamentally intractable on a classical computer. The underlying physics of quantum computing platforms supports using multi-valued logic, which promises a boost in…
We present "Diagrams of States", a way to graphically represent and analyze how quantum information is elaborated during the execution of quantum circuits. This introductory tutorial illustrates the basics, providing useful examples of…
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…
In this paper we use three-dimensional gauged linear sigma models to make physical predictions for Whitney-type presentations of equivariant quantum K theory rings of partial flag manifolds, as quantum products of universal subbundles and…
The quantum mechanics is proved to admit no hidden-variable in 1960s, which means the quantum systems are contextual. Revealing the mathematical structure of quantum mechanics is a significant task. We develop the approach of partial…
We propose a numerical algorithm for finding optimal measurements for quantum-state discrimination. The theory of the semidefinite programming provides a simple check of the optimality of the numerically obtained results.
We present two new proofs of the the important q-commuting property holding among certain pairs of quantum minors of an n x n q-generic matrix. The first uses elementary quasideterminantal arithmetic; the second involves paths in an…
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for the bounded error quantum query complexity of Connectivity,…
We survey sufficient degree conditions, for a variety of graph properties, that are best possible in the same sense that Chvatal's well-known degree condition for hamiltonicity is best possible.
The purpose of this text is to set up a few basic notions concerning quantum graphs, to indicate some areas addressed in the quantum graph research, and to provide some pointers to the literature. The pointers in many cases are secondary,…
Partial Boolean algebra underlies the quantum logic as an important tool for quantum contextuality. We propose the notion atom graphs to reveal the graph structure of partial Boolean algebra for finite dimensional quantum systems by proving…
We present a novel benchmark application of a quantum algorithm to Feynman loop integrals. The two on-shell states of a Feynman propagator are identified with the two states of a qubit and a quantum algorithm is used to unfold the causal…