15,367 research outputs found
Exponential Separation of Quantum and Classical Online Space Complexity
Although quantum algorithms realizing an exponential time speed-up over the
best known classical algorithms exist, no quantum algorithm is known performing
computation using less space resources than classical algorithms. In this
paper, we study, for the first time explicitly, space-bounded quantum
algorithms for computational problems where the input is given not as a whole,
but bit by bit. We show that there exist such problems that a quantum computer
can solve using exponentially less work space than a classical computer. More
precisely, we introduce a very natural and simple model of a space-bounded
quantum online machine and prove an exponential separation of classical and
quantum online space complexity, in the bounded-error setting and for a total
language. The language we consider is inspired by a communication problem (the
set intersection function) that Buhrman, Cleve and Wigderson used to show an
almost quadratic separation of quantum and classical bounded-error
communication complexity. We prove that, in the framework of online space
complexity, the separation becomes exponential.Comment: 13 pages. v3: minor change
OTOC, complexity and entropy in bi-partite systems
There is a remarkable interest in the study of Out-of-time ordered
correlators (OTOCs) that goes from many body theory and high energy physics to
quantum chaos. In this latter case there is a special focus on the comparison
with the traditional measures of quantum complexity such as the spectral
statistics, for example. The exponential growth has been verified for many
paradigmatic maps and systems. But less is known for multi-partite cases. On
the other hand the recently introduced Wigner separability entropy (WSE) and
its classical counterpart (CSE) provide with a complexity measure that treats
equally quantum and classical distributions in phase space. We have compared
the behavior of these measures in a system consisting of two coupled and
perturbed cat maps with different dynamics: double hyperbolic (HH), double
elliptic (EE) and mixed (HE). In all cases, we have found that the OTOCs and
the WSE have essentially the same behavior, providing with a complete
characterization in generic bi-partite systems and at the same time revealing
them as very good measures of quantum complexity for phase space distributions.
Moreover, we establish a relation between both quantities by means of a
recently proven theorem linking the second Renyi entropy and OTOCs.Comment: 6 pages, 5 figure
Experimental Quantum Fingerprinting
Quantum communication holds the promise of creating disruptive technologies
that will play an essential role in future communication networks. For example,
the study of quantum communication complexity has shown that quantum
communication allows exponential reductions in the information that must be
transmitted to solve distributed computational tasks. Recently, protocols that
realize this advantage using optical implementations have been proposed. Here
we report a proof of concept experimental demonstration of a quantum
fingerprinting system that is capable of transmitting less information than the
best known classical protocol. Our implementation is based on a modified
version of a commercial quantum key distribution system using off-the-shelf
optical components over telecom wavelengths, and is practical for messages as
large as 100 Mbits, even in the presence of experimental imperfections. Our
results provide a first step in the development of experimental quantum
communication complexity.Comment: 11 pages, 6 Figure
Two Results about Quantum Messages
We show two results about the relationship between quantum and classical
messages. Our first contribution is to show how to replace a quantum message in
a one-way communication protocol by a deterministic message, establishing that
for all partial Boolean functions we
have . This bound was previously
known for total functions, while for partial functions this improves on results
by Aaronson, in which either a log-factor on the right hand is present, or the
left hand side is , and in which also no entanglement is
allowed.
In our second contribution we investigate the power of quantum proofs over
classical proofs. We give the first example of a scenario, where quantum proofs
lead to exponential savings in computing a Boolean function. The previously
only known separation between the power of quantum and classical proofs is in a
setting where the input is also quantum.
We exhibit a partial Boolean function , such that there is a one-way
quantum communication protocol receiving a quantum proof (i.e., a protocol of
type QMA) that has cost for , whereas every one-way quantum
protocol for receiving a classical proof (protocol of type QCMA) requires
communication
Quantum algorithms for highly non-linear Boolean functions
Attempts to separate the power of classical and quantum models of computation
have a long history. The ultimate goal is to find exponential separations for
computational problems. However, such separations do not come a dime a dozen:
while there were some early successes in the form of hidden subgroup problems
for abelian groups--which generalize Shor's factoring algorithm perhaps most
faithfully--only for a handful of non-abelian groups efficient quantum
algorithms were found. Recently, problems have gotten increased attention that
seek to identify hidden sub-structures of other combinatorial and algebraic
objects besides groups. In this paper we provide new examples for exponential
separations by considering hidden shift problems that are defined for several
classes of highly non-linear Boolean functions. These so-called bent functions
arise in cryptography, where their property of having perfectly flat Fourier
spectra on the Boolean hypercube gives them resilience against certain types of
attack. We present new quantum algorithms that solve the hidden shift problems
for several well-known classes of bent functions in polynomial time and with a
constant number of queries, while the classical query complexity is shown to be
exponential. Our approach uses a technique that exploits the duality between
bent functions and their Fourier transforms.Comment: 15 pages, 1 figure, to appear in Proceedings of the 21st Annual
ACM-SIAM Symposium on Discrete Algorithms (SODA'10). This updated version of
the paper contains a new exponential separation between classical and quantum
query complexit
Localization and its consequences for quantum walk algorithms and quantum communication
The exponential speed-up of quantum walks on certain graphs, relative to
classical particles diffusing on the same graph, is a striking observation. It
has suggested the possibility of new fast quantum algorithms. We point out here
that quantum mechanics can also lead, through the phenomenon of localization,
to exponential suppression of motion on these graphs (even in the absence of
decoherence). In fact, for physical embodiments of graphs, this will be the
generic behaviour. It also has implications for proposals for using spin
networks, including spin chains, as quantum communication channels.Comment: 4 pages, 1 eps figure. Updated references and cosmetic changes for v
- …