680 research outputs found
Adaptive versus non-adaptive strategies for quantum channel discrimination
We provide a simple example that illustrates the advantage of adaptive over
non-adaptive strategies for quantum channel discrimination. In particular, we
give a pair of entanglement-breaking channels that can be perfectly
discriminated by means of an adaptive strategy that requires just two channel
evaluations, but for which no non-adaptive strategy can give a perfect
discrimination using any finite number of channel evaluations.Comment: 11 page
Quantum computation via translation-invariant operations on a chain of qubits
A scheme of universal quantum computation on a chain of qubits is described
that does not require local control. All the required operations, an Ising-type
interaction and spatially uniform simultaneous one-qubit gates, are
translation-invariant.Comment: Comment after Eq. (2) inserted, journal versio
Measurement in control and discrimination of entangled pairs under self-distortion
Quantum correlations and entanglement are fundamental resources for quantum
information and quantum communication processes. Developments in these fields
normally assume these resources stable and not susceptible of distortion. That
is not always the case, Heisenberg interactions between qubits can produce
distortion on entangled pairs generated for engineering purposes (e. g. for
quantum computation or quantum cryptography). Experimental work shows how to
produce entangled spin qubits in quantum dots and electron gases, so its
identification and control are crucial for later applications. The presence of
parasite magnetic fields modifies the expected properties and behavior for
which the pair was intended. Quantum measurement and control help to
discriminate the original state in order to correct it or, just to try of
reconstruct it using some procedures which do not alter their quantum nature.
Two different kinds of quantum entangled pairs driven by a Heisenberg
Hamiltonian with an additional inhomogeneous magnetic field which becoming
self-distorted, can be reconstructed without previous discrimination by adding
an external magnetic field, with fidelity close to 1 (with respect to the
original state, but without discrimination). After, each state can be more
efficiently discriminated. The aim of this work is to show how combining both
processes, first reconstruction without discrimination and after discrimination
with adequate non-local measurements, it's possible a) improve the
discrimination, and b) reprepare faithfully the original states. The complete
process gives fidelities better than 0.9. In the meanwhile, some results about
a class of equivalence for the required measurements were found. This property
lets us select the adequate measurement in order to ease the repreparation
after of discrimination, without loss of entanglement.Comment: 6 figure
The Dynamical Additivity And The Strong Dynamical Additivity Of Quantum Operations
In the paper, the dynamical additivity of bi-stochastic quantum operations is
characterized and the strong dynamical additivity is obtained under some
restrictions.Comment: 9 pages, LaTeX, change the order of name
NP-hardness of decoding quantum error-correction codes
Though the theory of quantum error correction is intimately related to the
classical coding theory, in particular, one can construct quantum error
correction codes (QECCs) from classical codes with the dual containing
property, this does not necessarily imply that the computational complexity of
decoding QECCs is the same as their classical counterparts. Instead, decoding
QECCs can be very much different from decoding classical codes due to the
degeneracy property. Intuitively, one expect degeneracy would simplify the
decoding since two different errors might not and need not be distinguished in
order to correct them. However, we show that general quantum decoding problem
is NP-hard regardless of the quantum codes being degenerate or non-degenerate.
This finding implies that no considerably fast decoding algorithm exists for
the general quantum decoding problems, and suggests the existence of a quantum
cryptosystem based on the hardness of decoding QECCs.Comment: 5 pages, no figure. Final version for publicatio
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
Recommended from our members
Nonribosomal peptides, key biocontrol components for Pseudomonas fluorescens In5, isolated from a Greenlandic suppressive soil.
UnlabelledPotatoes are cultivated in southwest Greenland without the use of pesticides and with limited crop rotation. Despite the fact that plant-pathogenic fungi are present, no severe-disease outbreaks have yet been observed. In this report, we document that a potato soil at Inneruulalik in southern Greenland is suppressive against Rhizoctonia solani Ag3 and uncover the suppressive antifungal mechanism of a highly potent biocontrol bacterium, Pseudomonas fluorescens In5, isolated from the suppressive potato soil. A combination of molecular genetics, genomics, and matrix-assisted laser desorption ionization-time of flight (MALDI-TOF) imaging mass spectrometry (IMS) revealed an antifungal genomic island in P. fluorescens In5 encoding two nonribosomal peptides, nunamycin and nunapeptin, which are key components for the biocontrol activity by strain In5 in vitro and in soil microcosm experiments. Furthermore, complex microbial behaviors were highlighted. Whereas nunamycin was demonstrated to inhibit the mycelial growth of R. solani Ag3, but not that of Pythium aphanidermatum, nunapeptin instead inhibited P. aphanidermatum but not R. solani Ag3. Moreover, the synthesis of nunamycin by P. fluorescens In5 was inhibited in the presence of P. aphanidermatum. Further characterization of the two peptides revealed nunamycin to be a monochlorinated 9-amino-acid cyclic lipopeptide with similarity to members of the syringomycin group, whereas nunapeptin was a 22-amino-acid cyclic lipopeptide with similarity to corpeptin and syringopeptin.ImportanceCrop rotation and systematic pest management are used to only a limited extent in Greenlandic potato farming. Nonetheless, although plant-pathogenic fungi are present in the soil, the farmers do not experience major plant disease outbreaks. Here, we show that a Greenlandic potato soil is suppressive against Rhizoctonia solani, and we unravel the key biocontrol components for Pseudomonas fluorescens In5, one of the potent biocontrol bacteria isolated from this Greenlandic suppressive soil. Using a combination of molecular genetics, genomics, and microbial imaging mass spectrometry, we show that two cyclic lipopeptides, nunamycin and nunapeptin, are important for the biocontrol activity of P. fluorescens In5 both in vitro and in microcosm assays. Furthermore, we demonstrate that the synthesis of nunamycin is repressed by the oomycete Pythium aphanidermatum. Overall, our report provides important insight into interkingdom interference between bacteria and fungi/oomycetes
Quantum computation with devices whose contents are never read
In classical computation, a "write-only memory" (WOM) is little more than an
oxymoron, and the addition of WOM to a (deterministic or probabilistic)
classical computer brings no advantage. We prove that quantum computers that
are augmented with WOM can solve problems that neither a classical computer
with WOM nor a quantum computer without WOM can solve, when all other resource
bounds are equal. We focus on realtime quantum finite automata, and examine the
increase in their power effected by the addition of WOMs with different access
modes and capacities. Some problems that are unsolvable by two-way
probabilistic Turing machines using sublogarithmic amounts of read/write memory
are shown to be solvable by these enhanced automata.Comment: 32 pages, a preliminary version of this work was presented in the 9th
International Conference on Unconventional Computation (UC2010
Single-shot discrimination of quantum unitary processes
We formulate minimum-error and unambiguous discrimination problems for
quantum processes in the language of process positive operator valued measures
(PPOVM). In this framework we present the known solution for minimum-error
discrimination of unitary channels. We derive a "fidelity-like" lower bound on
the failure probability of the unambiguous discrimination of arbitrary quantum
processes. This bound is saturated (in a certain range of apriori
probabilities) in the case of unambiguous discrimination of unitary channels.
Surprisingly, the optimal solution for both tasks is based on the optimization
of the same quantity called completely bounded process fidelity.Comment: 11 pages, 1 figur
Zero-Knowledge Proof Systems for QMA
© 2016 IEEE. Prior work has established that all problems in NP admit classical zero-knowledge proof systems, and under reasonable hardness assumptions for quantum computations, these proof systems can be made secure against quantum attacks. We prove a result representing a further quantum generalization of this fact, which is that every problem in the complexity class QMA has a quantum zero-knowledge proof system. More specifically, assuming the existence of an unconditionally binding and quantum computationally concealing commitment scheme, we prove that every problem in the complexity class QMA has a quantum interactive proof system that is zero-knowledge with respect to efficient quantum computations. Our QMA proof system is sound against arbitrary quantum provers, but only requires an honest prover to perform polynomial-time quantum computations, provided that it holds a quantum witness for a given instance of the QMA problem under consideration
- …