Related papers: Quantum Oracles in Constant Depth with Measurement…
This work investigates the oracle separation between the physically motivated complexity class of noisy quantum circuits, inspired by definitions such as those presented by Chen, Cotler, Huang, and Li (2022). We establish that with a…
In the formalism of measurement based quantum computation we start with a given fixed entangled state of many qubits and perform computation by applying a sequence of measurements to designated qubits in designated bases. The choice of…
Quantum search is among the most important algorithms in quantum computing. At its core is quantum amplitude amplification, a technique that achieves a quadratic speedup over classical search by combining two global reflections: the oracle,…
We provide an overview of a canonical formalism that describes mixed quantum-classical systems in terms of statistical ensembles on configuration space, and discuss applications to measurement theory. It is shown that the formalism allows a…
Quantum computing offers significant acceleration capabilities over its classical counterpart in various application domains. Consequently, there has been substantial focus on improving quantum computing capabilities. However, to date, the…
Quantum computations usually take place under the control of the classical world. We introduce a Classically-controlled Quantum Turing Machine (CQTM) which is a Turing Machine (TM) with a quantum tape for acting on quantum data, and a…
Quantum polyhedra constructed from angular momentum operators are the building blocks of space in its quantum description as advocated by Loop Quantum Gravity. Here we extend previous results on the semiclassical properties of quantum…
In this paper a didactic approach is described which immediately leads to an understanding of those postulates of quantum mechanics used most frequently in quantum computation. Moreover, an interpretation of quantum mechanics is presented…
We present a novel automated technique for parallelizing quantum circuits via forward and backward translation to measurement-based quantum computing patterns and analyze the trade off in terms of depth and space complexity. As a result we…
The relevance of shallow-depth quantum circuits has recently increased, mainly due to their applicability to near-term devices. In this context, one of the main goals of quantum circuit complexity is to find problems that can be solved by…
We study measurement-based quantum computation (MQC) using as quantum resource the planar code state on a two-dimensional square lattice (planar analogue of the toric code). It is shown that MQC with the planar code state can be efficiently…
Traditional refrigeration is driven either by external force or an information-feedback mechanism. Surprisingly, the quantum measurement and collapse, which are generally detrimental, can also be used to power a cooling engine even without…
Entanglement is essential for quantum computation. However, disentanglement is also necessary. It can be achieved without the need of classical operations (measurements). Two examples are analyzed: the discrete Fourier transform and error…
Measurement-based quantum computation (MBQC) is a framework for quantum information processing in which a computational task is carried out through one-qubit measurements on a highly entangled resource state. Due to the indeterminacy of the…
One-way measurement based quantum computations (1WQC) may describe unitary transformations, via a composition of CPTP maps which are not all unitary themselves. This motivates the following decision problems: Is it possible to determine…
This paper explores the problem of quantum measurement complexity. In computability theory, the complexity of a problem is determined by how long it takes an effective algorithm to solve it. This complexity may be compared to the difficulty…
Quantum reservoir computing has emerged as a promising paradigm within the field of quantum machine learning, harnessing the inherent properties of quantum systems to optimise and enhance information processing capabilities. Here, we…
Quantum walks, both discrete (coined) and continuous time, on a general graph of N vertices with undirected edges are reviewed in some detail. The resource requirements for implementing a quantum walk as a program on a quantum computer are…
In Loop Quantum Gravity, the quantum action of the volume operator is crucial in understanding quantum dynamics. In this work, we implement a generalized numerical algorithm that can compute the quantum action of the volume operator on a…
We define a class of stochastic processes based on evolutions and measurements of quantum systems, and consider the complexity of predicting their long-term behavior. It is shown that a very general class of decision problems regarding…