Quantum computation with coherent spin states and the close Hadamard problem

DOI10.1007/s11128-015-1229-0zbMath1338.81127arXiv1112.1446OpenAlexW3105872779WikidataQ59440951 ScholiaQ59440951MaRDI QIDQ291464

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

Publication date: 10 June 2016

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

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

zbMATH Keywords

quantum algorithmscontinuous variable quantum computationoracle decision problemssimple harmonic oscillator quantum computer

Mathematics Subject Classification ID

Quantum computation (81P68) Coherent states (81R30) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (9)

Efficient quantum algorithms of finding the roots of a polynomial function ⋮ Creating very true quantum algorithms for quantum energy based computing ⋮ Gaussian quantum computation with oracle-decision problems ⋮ Quantum cryptography based on the Deutsch-Jozsa algorithm ⋮ Necessary and sufficient condition for quantum computing ⋮ Quantum communication based on an algorithm of determining a matrix ⋮ New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm ⋮ Some theoretically organized algorithm for quantum computers ⋮ Quantum algorithm for the root-finding problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gaussian quantum computation with oracle-decision problems
• Cluster-state quantum computation
• Quantum computational networks
• Rapid solution of problems by quantum computation
• Semi-automorphisms of Hadamard matrices
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum and classical tomography with equidistant reference angles
• Quantum complexity theory

This page was built for publication: Quantum computation with coherent spin states and the close Hadamard problem