Quantum computation with coherent spin states and the close Hadamard problem

DOI10.1007/S11128-015-1229-0zbMATH Open1338.81127arXiv1112.1446OpenAlexW3105872779WikidataQ59440951 ScholiaQ59440951MaRDI QIDQ291464FDOQ291464

Authors: 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)

Abstract: 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.

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

Recommendations

• Quantum computation as geometry
• Resilient quantum computation: error models and thresholds
• Quantum computation: from a programmer's perspective
• scientific article; zbMATH DE number 2156270
• Universal quantum computation with spin-\(1/2\) pairs and Heisenberg exchange

zbMATH Keywords

quantum algorithmscontinuous variable quantum computationoracle decision problemssimple harmonic oscillator quantum computer

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum computational networks
• Title not available (Why is that?)
• Hadamard matrices and their applications
• Rapid solution of problems by quantum computation
• Gaussian quantum computation with oracle-decision problems
• Semi-automorphisms of Hadamard matrices
• Title not available (Why is that?)
• Quantum and classical tomography with equidistant reference angles
• Title not available (Why is that?)
• Quantum complexity theory
• Cluster-state quantum computation

Cited In (11)

• A note of coherence for duality quantum computers acting on pure states
• Necessary and sufficient condition for quantum computing
• Quantum communication based on an algorithm of determining a matrix
• Gaussian quantum computation with oracle-decision problems
• Quantum algorithm for the root-finding problem
• New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm
• Creating very true quantum algorithms for quantum energy based computing
• Efficient quantum algorithms of finding the roots of a polynomial function
• Quantum cryptography based on the Deutsch-Jozsa algorithm
• Universal quantum computation with spin-\(1/2\) pairs and Heisenberg exchange
• Some theoretically organized algorithm for quantum computers

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

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