Gaussian quantum computation with oracle-decision problems

DOI10.1007/s11128-012-0489-1zbMath1267.81106arXiv1206.1035OpenAlexW3101829088WikidataQ59440999 ScholiaQ59440999MaRDI QIDQ352994

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

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)

Related Items (1)

Quantum computation with coherent spin states and the close Hadamard problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum computation with coherent spin states and the close Hadamard problem
• Coherent states for arbitrary Lie group
• Distilling Gaussian States with Gaussian Operations is Impossible
• Rapid solution of problems by quantum computation
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum algorithms revisited
• Quantum and classical tomography with equidistant reference angles

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