Gaussian quantum computation with oracle-decision problems

DOI10.1007/S11128-012-0489-1MaRDI QIDQ352994zbMATH OpenOpenAlexWikidataFDO

Authors Mark R. A. Adcock, Peter Høyer, Barry C. Sanders

Publication date 5 July 2013

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1206.1035

zbMATH Keywords

quantum algorithmsoracle decision problemscontinuous-variable quantum computationsimple-harmonic oscillator quantum computer

Mathematics Subject Classification ID

Quantum computation (81P68)

Abstract: We study a simple-harmonic-oscillator quantum computer solving oracle decision problems. We show that such computers can perform better by using nonorthogonal Gaussian wave functions rather than orthogonal top-hat wave functions as input to the information encoding process. Using the Deutsch-Jozsa problem as an example, we demonstrate that Gaussian modulation with optimized width parameter results in a lower error rate than for the top-hat encoding. We conclude that Gaussian modulation can allow for an improved trade-off between encoding, processing and measurement of the information.

Recommendations

• Adiabatic quantum oracles
• The continuous-variable Deutsch-Jozsa algorithm using realistic quantum systems
• Characterization of quantum computable decision problems by state discrimination
• Quantum Computation over Continuous Variables
• Quantum functional oracles

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 3159824 (Why is no real title available?)
• scientific article; zbMATH DE number 5595151 (Why is no real title available?)
• scientific article; zbMATH DE number 1932707 (Why is no real title available?)
• Coherent states for arbitrary Lie group
• Distilling Gaussian states with Gaussian operations is impossible
• Electromagnetically-induced transparency and squeezed light
• Introduction to algorithms
• Quantum algorithms revisited
• Quantum and classical tomography with equidistant reference angles
• Quantum computation with coherent spin states and the close Hadamard problem
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Rapid solution of problems by quantum computation

Cited in

(7)

• Quantum functional oracles
• Quantum computation with coherent spin states and the close Hadamard problem
• Robust Quantum Algorithms with ε-Biased Oracles
• Gaussian quantum marginal problem
• Compact Gaussian quantum computation by multi-pixel homodyne detection
• Quantum Gauss-Jordan elimination and simulation of accounting principles on quantum computers
• On the quantum Gaussian optimizers conjecture in the case $ q=p$

This page was built for publication: Gaussian quantum computation with oracle-decision problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q352994)