Related papers: Visualizing Quantum Circuit Probability -- estimat…
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…
The contextuality and noncontextuality notions are considered in framework of probability representation of quantum states. Example of qutrit states and violation of the noncontextuality inequalities are presented by using the spin tomogram…
Quantum circuit complexity-a measure of the minimum number of gates needed to implement a given unitary transformation-is a fundamental concept in quantum computation, with widespread applications ranging from determining the running time…
Quantum Decision Theory, advanced earlier by the authors, and illustrated for lotteries with gains, is generalized to the games containing lotteries with gains as well as losses. The mathematical structure of the approach is based on the…
We introduce a novel software-oriented model of quantum computation motivated by the practical constraints of near-term quantum hardware. In this model, gates are specified by constraints expressed in terms of Pauli observables, with each…
Accurate models for open quantum systems -- quantum states that have non-trivial interactions with their environment -- may aid in the advancement of a diverse array of fields, including quantum computation, informatics, and the prediction…
The computational abilities of theories within the generalised probabilistic theory framework has been the subject of much recent study. Such investigations aim to gain an understanding of the possible connections between physical…
We design a series of quantum circuits that generate absolute maximally entangled (AME) states to benchmark a quantum computer. A relation between graph states and AME states can be exploited to optimize the structure of the circuits and…
A key open question in quantum computing is whether quantum algorithms can potentially offer a significant advantage over classical algorithms for tasks of practical interest. Understanding the limits of classical computing in simulating…
Random quantum circuits take an input quantum state and randomize it. This is a task with a growing number of identified uses in quantum information processing. We suggest a scheme to implement random circuits in a weighted graph state. The…
Recent years have seen unprecedented advance in the design and control of quantum computers. Nonetheless, their applicability is still restricted and access remains expensive. Therefore, a substantial amount of quantum algorithms research…
This paper describes an algorithmic system called SQT for the computer simulation of a wide class of quantum experiments on entangled particles. SQT maintains a hidden internal state for each particle and it provides an initialization…
Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components and assemble them so that they communicate and cooperate.Moreover, to model concurrent and…
Making quantum mechanical equations and concepts come to life through interactive simulation and visualization are commonplace for augmenting learning and teaching. However, graphical visualizations nearly always exhibit a set of hard-coded…
One of the core research questions in the theory of quantum computing is to find out to what precise extent the classical simulation of a noisy quantum circuits is possible and where potential quantum advantages can set in. In this work, we…
A new approach to efficient quantum computation with probabilistic gates is proposed and analyzed in both a local and non-local setting. It combines heralded gates previously studied for atom or atom-like qubits with logical encoding from…
One of the main advantages of an optical approach to quantum computing is the fact that optical fibers can be used to connect the logic and memory devices to form useful circuits, in analogy with the wires of a conventional computer. Here…
The tomographic probability distribution is used to decribe the kinetic equations for open quantum systems. Damped oscillator is studied. Purity parameter evolution for different damping regime is considered.
Parameterized quantum circuits (PQCs), as one of the most promising schemes to realize quantum machine learning algorithms on near-term quantum computers, have been designed to solve machine earning tasks with quantum advantages. In this…
In quantum circuits, qubits and the quantum gates acting on them have traditionally been analysed using matrix algebra and Dirac notation. While powerful, these can be unintuitive for conceptual understanding and rapid problem solving. In…