On the solution of trivalent decision problems by quantum state identification

DOI10.1007/S11047-009-9112-5zbMATH Open1192.68284arXiv0707.1257OpenAlexW2079142595WikidataQ58620619 ScholiaQ58620619MaRDI QIDQ734207FDOQ734207

Authors: Karl Svozil, Josef Tkadlec 

Publication date: 19 October 2009

Published in: Natural Computing (Search for Journal in Brave)

Abstract: The trivalent functions of a trit can be grouped into equipartitions of three elements. We discuss the separation of the corresponding functional classes by quantum state identifications.

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

zbMATH Keywords

EntanglementQuantum computationGeneralized Deutsch problemQuantum decision problemsQuantum state identificationTrivalent decision problems

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Cites Work

• Title not available (Why is that?)
• Quantum algorithms revisited
• Strengths and Weaknesses of Quantum Computing
• Operationally Invariant Information in Quantum Measurements
• Title not available (Why is that?)
• Rapid solution of problems by quantum computation
• Quantum Computer Science
• Title not available (Why is that?)
• Classical recursion theory. The theory of functions and sets of natural numbers
• Quantum lower bounds by polynomials
• Title not available (Why is that?)
• One complexity theorist's view of quantum computing
• Quantum information via state partitions and the context translation principle
• Characterization of quantum computable decision problems by state discrimination

This page was built for publication: On the solution of trivalent decision problems by quantum state identification

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