相关论文: Distributed implementation of standard oracle oper…
We show that any classical two-way communication protocol with shared randomness that can approximately simulate the result of applying an arbitrary measurement (held by one party) to a quantum state of $n$ qubits (held by another), up to…
By appropriate choices of elements in the underlying iterated function system, methodology of fractal interpolation entitles one to associate a family of continuous self-referential functions with a prescribed real-valued continuous…
We initiate the study of quantifying nonlocalness of a bipartite measurement by the minimum amount of classical communication required to simulate the measurement. We derive general upper bounds, which are expressed in terms of certain…
In this paper, quantum mechanics on a circle with finite number of {\alpha}-uniformly distributed points is discussed. The angle operator and translation operator are defined. Using discrete angle representation, two types of discrete…
A Hilbert space operator $U$ is called universal (in the sense of Rota) if every Hilbert space operator is similar to a multiple of $U$ restricted to one of its invariant subspaces. It follows that the Invariant Subspace Problem for Hilbert…
Distributed computing is a fastest growing field -- enabling virtual computing, parallel computing, and distributed storage. By exploiting the counterfactual techniques, we devise a distributed blind quantum computation protocol to perform…
An XOR function is a function of the form g(x,y) = f(x + y), for some boolean function f on n bits. We study the quantum and classical communication complexity of XOR functions. In the case of exact protocols, we completely characterise…
An expression is derived characterizing the set of admissible rate pairs for simultaneous transmission of classical and quantum information over a given quantum channel, generalizing both the classical and quantum capacities of the channel.…
In this paper we explore the structure and applicability of the Distributed Measurement Calculus (DMC), an assembly language for distributed measurement-based quantum computations. We describe the formal language's syntax and semantics,…
This paper describes a novel approach to emulate a universal quantum computer with a wholly classical system, one that uses a signal of bounded duration and amplitude to represent an arbitrary quantum state. The signal may be of any…
Quantum computers are considered as a part of the family of the reversible, lineary-extended, dynamical systems (Quanputers). For classical problems an operational reformulation is given. A universal algorithm for the solving of classical…
We obtain sufficient conditions for the efficient simulation of a continuous variable quantum algorithm or process on a classical computer. The resulting theorem is an extension of the Gottesman-Knill theorem to continuous variable quantum…
The universal Baxter operator is an element of the Archimedean spherical Hecke algebra H(G,K), K be a maximal compact subgroup of a Lie group G. It has a defining property to act in spherical principle series representations of G via…
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,…
The basic concepts of classical mechanics are given in the operator form. The dynamical equation for a hybrid system, consisting of quantum and classical subsystems, is introduced and analyzed in the case of an ideal nonselective…
One of the primary goals of information theory is to provide limits on the amount of information it is possible to send through various types of communication channels, and to understand the encoding methods that will allow one to achieve…
Communication scenarios between two parties can be implemented by first encoding messages into some states of a physical system which acts as the physical medium of the communication and then decoding the messages by measuring the state of…
The partial oracles framework is a quantum search algorithm that has the potential to exceed the quadratic speedup of Grover's algorithm, up to a theoretical maximum of an exponential speedup. Until now, however, the framework has lacked an…
Efficient encoding of classical data into quantum state -- currently referred to as quantum encoding -- holds crucial significance in quantum computation. For finite-size databases and qubit registers, a common strategy of the quantum…
We provide a generalization of the idea of unitary designs to cover finite averaging over much more general operations on quantum states. Namely, we construct finite averaging sets for averaging quantum states over arbitrary reductive Lie…