22 research outputs found

    On continuous variable quantum algorithms for oracle identification problems

    Full text link
    We establish a framework for oracle identification problems in the continuous variable setting, where the stated problem necessarily is the same as in the discrete variable case, and continuous variables are manifested through a continuous representation in an infinite-dimensional Hilbert space. We apply this formalism to the Deutsch-Jozsa problem and show that, due to an uncertainty relation between the continuous representation and its Fourier-transform dual representation, the corresponding Deutsch-Jozsa algorithm is probabilistic hence forbids an exponential speed-up, contrary to a previous claim in the literature.Comment: RevTeX4, 15 pages with 10 figure

    Symmetry and quantum query-to-communication simulation

    Get PDF
    Buhrman, Cleve and Wigderson (STOC'98) showed that for every Boolean function f : {-1,1}^n to {-1,1} and G in {AND_2, XOR_2}, the bounded-error quantum communication complexity of the composed function f o G equals O(Q(f) log n), where Q(f) denotes the bounded-error quantum query complexity of f. This is in contrast with the classical setting, where it is easy to show that R^{cc}(f o G) We show that the log n overhead is not required when f is symmetric, generalizing a result of Aaronson and Ambainis for the Set-Disjointness function (Theory of Computing'05). This upper bound assumes a shared entangled state, though for most symmetric functions the assumed number of entangled qubits is less than the communication and hence could be part of the communication. To prove this, we design an efficient distributed version of noisy amplitude amplification that allows us to prove the result when f is the OR function. In view of our first result, one may ask whether the log n overhead in the BCW simulation can be avoided even when f is transitive. We give a strong negative answer by showing that the log n overhead is still necessary for some transitive functions even when we allow the quantum communication protocol an error probability that can be arbitrarily close to 1/2. We also give, among other things, a general recipe to construct functions for which the log n overhead is required in the BCW simulation in the bounded-error communication model, even if the parties are allowed to share an arbitrary prior entangled state for free.</p

    Quantum Computation with Coherent Spin States and the Close Hadamard Problem

    Full text link
    We study a model of quantum computation based on the continuously-parameterized yet finite-dimensional Hilbert space of a spin system. We explore the computational powers of this model by analyzing a pilot problem we refer to as the close Hadamard problem. We prove that the close Hadamard problem can be solved in the spin system model with arbitrarily small error probability in a constant number of oracle queries. We conclude that this model of quantum computation is suitable for solving certain types of problems. The model is effective for problems where symmetries between the structure of the information associated with the problem and the structure of the unitary operators employed in the quantum algorithm can be exploited.Comment: RevTeX4, 13 pages with 8 figures. Accepted for publication in Quantum Information Processing. Article number: s11128-015-1229-

    A phase I/II study of acute and late physician assessed and patient-reported morbidity following whole pelvic radiation in high-risk prostate cancer patients

    No full text
    The aim of this study was to assess acute and late morbidity measured by the physician and patient-reported outcomes (PROs) in high-risk prostate cancer (PC) patients receiving whole pelvic intensity-modulated radiotherapy (IMRT) in the setting of a national clinical trial. A total of 88 patients with adenocarcinoma of the prostate and high-risk parameters were enrolled from 2011 to 2013. All patients received 78 Gy in 39 fractions of IMRT delivering simultaneous 78 Gy to the prostate and 56 Gy to the seminal vesicles and lymph nodes. Physician-reported morbidity was assessed by CTCAE v.4.0. PROs were registered for gastro-intestinal (GI) by the RT-ARD score, genito-urinary (GU) by DAN-PSS, sexual and hormonal by EPIC-26, and quality of life (QoL) by EORTC QLQ-C30. Median follow-up (FU) time was 4.6 years. No persistent late CTCAE grade 3+ morbidity was observed. Prevalence of CTCAE grade 2+ GI morbidities varied from 0 to 6% at baseline throughout FU time, except for diarrhea, which was reported in 19% of the patients post-RT. PROs revealed increased GI morbidity (≥1 monthly episode) for "rectal urgency", "use of pads", "incomplete evacuation", "mucus in stool" and "bowel function impact on QoL" all remained significantly different (p Whole pelvic RT resulted in a mild to the moderate burden of late GI morbidities demonstrated by a relatively high prevalence of PROs. Whereas, physician-assessed morbidity revealed a low prevalence of late GI morbidity scores. This emphasizes the importance of using both PROs and physician-reported scoring scales when reporting late morbidity in clinical trials
    corecore