129 research outputs found
Quantum Optimization Problems
Krentel [J. Comput. System. Sci., 36, pp.490--509] presented a framework for
an NP optimization problem that searches an optimal value among
exponentially-many outcomes of polynomial-time computations. This paper expands
his framework to a quantum optimization problem using polynomial-time quantum
computations and introduces the notion of an ``universal'' quantum optimization
problem similar to a classical ``complete'' optimization problem. We exhibit a
canonical quantum optimization problem that is universal for the class of
polynomial-time quantum optimization problems. We show in a certain relativized
world that all quantum optimization problems cannot be approximated closely by
quantum polynomial-time computations. We also study the complexity of quantum
optimization problems in connection to well-known complexity classes.Comment: date change
An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation
This paper employs a powerful argument, called an algorithmic argument, to
prove lower bounds of the quantum query complexity of a multiple-block ordered
search problem in which, given a block number i, we are to find a location of a
target keyword in an ordered list of the i-th block. Apart from much studied
polynomial and adversary methods for quantum query complexity lower bounds, our
argument shows that the multiple-block ordered search needs a large number of
nonadaptive oracle queries on a black-box model of quantum computation that is
also supplemented with advice. Our argument is also applied to the notions of
computational complexity theory: quantum truth-table reducibility and quantum
truth-table autoreducibility.Comment: 16 pages. An extended abstract will appear in the Proceedings of the
29th International Symposium on Mathematical Foundations of Computer Science,
Lecture Notes in Computer Science, Springer-Verlag, Prague, August 22-27,
200
Method of convex rigid frames and applications in studies of multipartite quNit pure-states
In this Letter we suggest a method of convex rigid frames in the studies of
the multipartite quNit pure-states. We illustrate what are the convex rigid
frames and what is the method of convex rigid frames. As the applications we
use this method to solve some basic problems and give some new results (three
theorems): The problem of the partial separability of the multipartite quNit
pure-states and its geometric explanation; The problem of the classification of
the multipartite quNit pure-states, and give a perfect explanation of the local
unitary transformations; Thirdly, we discuss the invariants of classes and give
a possible physical explanation.Comment: 6 pages, no figur
Quantum Computation Relative to Oracles
The study of the power and limitations of quantum computation remains a major challenge in complexity theory. Key questions revolve around the quantum complexity classes EQP, BQP, NQP, and their derivatives. This paper presents new relativized worlds in which (i) co-RP is not a subset of NQE, (ii) P=BQP and UP=EXP, (iii) P=EQP and RP=EXP, and (iv) EQP is not a subset of the union of Sigma{p}{2} and Pi{p}{2}. We also show a partial answer to the question of whether Almost-BQP=BQP
Search for {\eta}'(958)-nucleus bound states by (p,d) reaction at GSI and FAIR
The mass of the {\eta}' meson is theoretically expected to be reduced at
finite density, which indicates the existence of {\eta}'-nucleus bound states.
To investigate these states, we perform missing-mass spectroscopy for the (p,
d) reaction near the {\eta}' production threshold. The overview of the
experimental situation is given and the current status is discussed.Comment: 6 pages, 3 figures; talk at II Symposium on applied nuclear physics
and innovative technologies, September 24th - 27th, 2014, Jagiellonian
University, Krak\'ow Poland; to appear in Acta Physica Polonica
Spectroscopy of -nucleus bound states at GSI and FAIR --- very preliminary results and future prospects ---
The possible existence of \eta'-nucleus bound states has been put forward
through theoretical and experimental studies. It is strongly related to the
\eta' mass at finite density, which is expected to be reduced because of the
interplay between the anomaly and partial restoration of chiral
symmetry. The investigation of the C(p,d) reaction at GSI and FAIR, as well as
an overview of the experimental program at GSI and future plans at FAIR are
discussed.Comment: 7 pages, 3 figures; talk at the International Conference on Exotic
Atoms and Related Topics (EXA2014), Vienna, Austria, 15-19 September 2014. in
Hyperfine Interactions (2015
Classically time-controlled quantum automata
In this paper we introduce classically time-controlled quantum automata or CTQA, which is a slight but reasonable modification of Moore-Crutchfield quantum finite automata that uses time-dependent evolution operators and a scheduler defining how long each operator will run. Surprisingly enough, time-dependent evolutions provide a significant change in the computational power of quantum automata with respect to a discrete quantum model. Furthermore, CTQA presents itself as a new model of computation that provides a different approach to a formal study of “classical control, quantum data” schemes in quantum computing.CONACYT – Consejo Nacional de Ciencia y TecnologíaPROCIENCI
Computational Indistinguishability between Quantum States and Its Cryptographic Application
We introduce a computational problem of distinguishing between two specific
quantum states as a new cryptographic problem to design a quantum cryptographic
scheme that is "secure" against any polynomial-time quantum adversary. Our
problem, QSCDff, is to distinguish between two types of random coset states
with a hidden permutation over the symmetric group of finite degree. This
naturally generalizes the commonly-used distinction problem between two
probability distributions in computational cryptography. As our major
contribution, we show that QSCDff has three properties of cryptographic
interest: (i) QSCDff has a trapdoor; (ii) the average-case hardness of QSCDff
coincides with its worst-case hardness; and (iii) QSCDff is computationally at
least as hard as the graph automorphism problem in the worst case. These
cryptographic properties enable us to construct a quantum public-key
cryptosystem, which is likely to withstand any chosen plaintext attack of a
polynomial-time quantum adversary. We further discuss a generalization of
QSCDff, called QSCDcyc, and introduce a multi-bit encryption scheme that relies
on similar cryptographic properties of QSCDcyc.Comment: 24 pages, 2 figures. We improved presentation, and added more detail
proofs and follow-up of recent wor
Henoch-Schönlein nephritis associated with streptococcal infection and persistent hypocomplementemia: a case report
<p>Abstract</p> <p>Introduction</p> <p>Henoch-Schönlein purpura is a systemic disease with frequent renal involvement, characterized by IgA mesangial deposits. Streptococcal infection can induce an abnormal IgA immune response like Henoch-Schönlein purpura, quite similar to typical acute post-infectious glomerulonephritis. Indeed, hypocomplementemia that is typical of acute glomerulonephritis has also been described in Henoch-Schönlein purpura.</p> <p>Case presentation</p> <p>We describe a 14-year-old Caucasian Spanish girl who developed urinary abnormalities and cutaneous purpura after streptococcal infection. Renal biopsy showed typical findings from Henoch-Schönlein purpura nephritis. In addition, she had low serum levels of complement (C4 fraction) that persisted during follow-up, in spite of her clinical evolution. She responded to treatment with enalapril and steroids.</p> <p>Conclusion</p> <p>The case described has, at least, three points of interest in Henoch-Schönlein purpura: 1) Initial presentation was preceded by streptococcal infection; 2) There was a persistence of low serum levels of complement; and 3) There was response to steroids and angiotensin-converting enzyme inhibitor in the presence of nephrotic syndrome. There are not many cases described in the literature with these characteristics. We conclude that Henoch-Schönlein purpura could appear after streptococcal infection in patients with abnormal complement levels, and that steroids and angiotensin-converting enzyme inhibitor could be successful treatment for the disease.</p
Dendritic cell-mediated vaccination relies on interleukin-4 receptor signaling to avoid tissue damage after Leishmania major infection of BALB/c mice
Prevention of tissue damages at the site of Leishmania major inoculation can be achieved if the BALB/c mice are systemically given L. major antigen (LmAg)-loaded bone marrow-derived dendritic cells (DC) that had been exposed to CpG-containing oligodeoxynucleotides (CpG ODN). As previous studies allowed establishing that interleukin-4 (IL-4) is involved in the redirection of the immune response towards a type 1 profile, we were interested in further exploring the role of IL-4. Thus, wild-type (wt) BALB/c mice or DC-specific IL-4 receptor alpha (IL-4Rα)-deficient (CD11ccreIL-4Rα−/lox) BALB/c mice were given either wt or IL-4Rα-deficient LmAg-loaded bone marrow-derived DC exposed or not to CpG ODN prior to inoculation of 2×105 stationary-phase L. major promastigotes into the BALB/c footpad. The results provide evidence that IL4/IL-4Rα-mediated signaling in the vaccinating DC is required to prevent tissue damage at the site of L. major inoculation, as properly conditioned wt DC but not IL-4Rα-deficient DC were able to confer resistance. Furthermore, uncontrolled L. major population size expansion was observed in the footpad and the footpad draining lymph nodes of CD11ccreIL-4Rα−/lox mice immunized with CpG ODN-exposed LmAg-loaded IL-4Rα-deficient DC, indicating the influence of IL-4Rα-mediated signaling in host DC to control parasite replication. In addition, no footpad damage occurred in BALB/c mice that were systemically immunized with LmAg-loaded wt DC doubly exposed to CpG ODN and recombinant IL-4. We discuss these findings and suggest that the IL4/IL4Rα signaling pathway could be a key pathway to trigger when designing vaccines aimed to prevent damaging processes in tissues hosting intracellular microorganisms
- …