Related papers: Cartoon Computation: Quantum-like computing withou…
It is becoming increasingly clear that, if a useful device for quantum computation will ever be built, it will be embodied by a classical computing machine with control over a truly quantum subsystem, this apparatus performing a mixture of…
The ability to perform a universal set of quantum operations based solely on static resources and measurements presents us with a strikingly novel viewpoint for thinking about quantum computation and its powers. We consider the two major…
We present a quantum algorithm that additively approximates the value of a tensor network to a certain scale. When combined with existing results, this provides a complete problem for quantum computation. The result is a simple new way of…
We report the first experimental demonstration of an all-optical one-way implementation of Deutsch's quantum algorithm on a four-qubit cluster state. All the possible configurations of a balanced or constant function acting on a two-qubit…
Quantum computations are easily represented in the graphical notation known as the ZX-calculus, a.k.a. the red-green calculus. We demonstrate its use in reasoning about measurement-based quantum computing, where the graphical syntax…
Quantum computing promises to solve some important problems faster than conventional computations ever could. Currently available NISQ devices on which first practical applications are already executed demonstrate the potential -- with…
The characterization of quantum dynamics is a fundamental and central task in quantum mechanics. This task is typically addressed by quantum process tomography (QPT). Here we present an alternative "direct characterization of quantum…
We present a quantum algorithm for the f-conditioned phase transform which does not require any initialization of ancillary register. We also develop a quantum algorithm that can solve the generalized Deutsch-Jozsa problem by a single…
Quantum computers are designed to outperform standard computers by running quantum algorithms. Areas in which quantum algorithms can be applied include cryptography, search and optimisation, simulation of quantum systems, and solving large…
A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum…
We demonstrate that locally connected networks of machines that have primitive learning capabilities can be used to perform a deterministic, event-based simulation of quantum computation. We present simulation results for basic quantum…
We investigate the computational power of creating steady-states of quantum dissipative systems whose evolution is governed by time-independent and local couplings to a memoryless environment. We show that such a model allows for efficient…
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…
Numerical simulation of quantum systems is crucial to further our understanding of natural phenomena. Many systems of key interest and importance, in areas such as superconducting materials and quantum chemistry, are thought to be described…
We develop a scheme for quantum computation with neutral atoms, based on the concept of "marker" atoms, i.e., auxiliary atoms that can be efficiently transported in state-independent periodic external traps to operate quantum gates between…
Quantum computing is a promising approach of computation that is based on equations from Quantum Mechanics. A simulator for quantum algorithms must be capable of performing heavy mathematical matrix transforms. The design of the simulator…
The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones polynomial and arise in Witten-Chern-Simons…
In this expository paper we present a brief introduction to the geometrical modeling of some quantum computing problems. After a brief introduction to establish the terminology, we focus on quantum information geometry and ZX-calculus,…
It is proposed that the ability for a quantum circuit to thermalize under time evolution is a valid way to compute linear algebra problems. The algorithm makes use of the eigenstate thermalization hypothesis and full ergodicity in quantum…
The geometric formulation of quantum mechanics is a very interesting field of research which has many applications in the emerging field of quantum computation and quantum information, such as schemes for optimal quantum computers. In this…