相关论文: The decohered ZX-calculus

We prove a decomposition theorem of the quantum cohomology D-module of the blowup of a smooth projective variety X along a smooth subvariety Z. The main tools we use are shift operators and Fourier analysis for equivariant quantum…

We present the first local problem that shows a super-constant separation between the classical randomized LOCAL model of distributed computing and its quantum counterpart. By prior work, such a separation was known only for an artificial…

Mixing and decoherence are both manifestations of classicality within quantum theory, each of which admit a very general category-theoretic construction. We show under which conditions these two 'roads to classicality' coincide. This is…

Motivated by applications of rateless coding, decision feedback, and ARQ, we study the problem of universal decoding for unknown channels, in the presence of an erasure option. Specifically, we harness the competitive minimax methodology…

A quantum computer has a clear advantage over a classical computer for exhaustive search. The quantum mechanical algorithm for exhaustive search was originally derived by using subtle properties of a particular quantum mechanical operation…

Reservoir computing is a versatile paradigm in computational neuroscience and machine learning, that exploits the non-linear dynamics of a dynamical system - the reservoir - to efficiently process time-dependent information. Since its…

Hybrid classical-quantum systems are of interest in numerous fields, from quantum chemistry to quantum information science. A fully quantum effective description of them is straightforward to formulate when the classical subsystem is…

The ZX calculus and ZH calculus use diagrams to denote and compute properties of quantum operations, using `rewrite rules' to transform between diagrams which denote the same operator through a functorial semantic map. Different semantic…

Optimizing quantum circuits is a key challenge for quantum computing. The PyZX compiler broke new ground by optimizing circuits via the ZX calculus, a powerful graphical alternative to the quantum circuit model. Still, it carries no…

While the ZX and ZW calculi have been effective as graphical reasoning tools for finite-dimensional quantum computation, the possibilities for continuous-variable quantum computation (CVQC) in infinite-dimensional Hilbert space are only…

We investigate quantum walks in multiple dimensions with different quantum coins. We augment the model by assuming that at each step the amplitudes of the coin state are multiplied by random phases. This model enables us to study in detail…

We introduce a classical-quantum hybrid approach to computation, allowing for a quadratic performance improvement in the decision process of a learning agent. In particular, a quantum routine is described, which encodes on a quantum…

Quantum entanglement is a key resource in many quantum protocols, such as quantum teleportation and quantum cryptography. Yet entanglement makes protocols presented in Dirac notation difficult to verify. This is why Coecke and Duncan have…

Using the squeezed state formalism the coherent state representation of quantum fluctuations in an expanding universe is derived. It is shown that this provides a useful alternative to the Wigner function as a phase space representation of…

We investigate the computational power and unified resource use of hybrid quantum-classical computations, such as teleportation and measurement-based computing. We introduce a physically causal and local graphical calculus for quantum…

The advent of hybrid computing platforms consisting of quantum processing units integrated with conventional high-performance computing brings new opportunities for algorithm design. By strategically offloading select portions of the…

Quantum computing (QC) has gained popularity due to its unique capabilities that are quite different from that of classical computers in terms of speed and methods of operations. This paper proposes hybrid models and methods that…

For a wide set of quantum systems it is demonstrated that the quantum regime can be considered as the transient phase while the final classical statistical regime is a permanent state. A basis where exact matrix decoherence appears for…

An efficient decoding algorithm named `divided decoder' is proposed in this paper. Divided decoding can be combined with any decoder using QR-decomposition and offers different pairs of performance and complexity. Divided decoding provides…

An examination of the concept of using classical degrees of freedom to drive the evolution of quantum computers is given. Specifically, when externally generated, coherent states of the electromagnetic field are used to drive transitions…