Quantum digital-to-analog conversion algorithm using decoherence
From MaRDI portal
Abstract: We consider the problem of mapping digital data encoded on a quantum register to analog amplitudes in parallel. It is shown to be unlikely that a fully unitary polynomial-time quantum algorithm exists for this problem; NP becomes a subset of BQP if it exists. In the practical point of view, we propose a nonunitary linear-time algorithm using quantum decoherence. It tacitly uses an exponentially large physical resource, which is typically a huge number of identical molecules. Quantumness of correlation appearing in the process of the algorithm is also discussed.
Recommendations
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 5320211 (Why is no real title available?)
- A new algorithm for producing quantum circuits using KAK decompositions
- Algorithmic cooling and scalable NMR quantum computers
- An introduction to entanglement measures
- Classical, quantum and total correlations
- Computational Complexity
- Decomposition of unitary matrices and quantum gates
- Efficient 3D shape matching and retrieval using a concrete radialized spherical projection representation
- Encyclopedia of Complexity and Systems Science
- Geometry of Quantum States
- Limitation for linear maps in a class for detection and quantification of bipartite nonclassical correlation
- Molecular scale heat engines and scalable quantum computation
- Probability theory. A comprehensive course.
- Quantum computer with mixed states and four-valued logic
- Quantum discord: a measure of the quantumness of correlations
- Quantum entanglement
- Reversible projective measurement in quantum ensembles
- Smart and flexible digital-to-analog converters.
This page was built for publication: Quantum digital-to-analog conversion algorithm using decoherence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496934)