INTEGRABILITY, ENTROPY AND QUANTUM COMPUTATION

DOI10.1142/S012918319900098XMaRDI QIDQ4502828zbMATH OpenOpenAlexFDO

Authors E. V. Krishnamurthy

Publication date 4 February 2002

Published in International Journal of Modern Physics C (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s012918319900098x

zbMATH Keywords

algorithmic complexitycoherent state evolutionexact solvabilityFeynman path integralsintegrabilityquantum computation

Mathematics Subject Classification ID

Quantum computation (81P68) Path integrals in quantum mechanics (81S40)

Recommendations

• Necessary and Sufficient Conditions for Quantum Computation
• Intrinsic quantum computation
• Integrable quantum computation
• PATH INTEGRALS FOR QUBITS
• A CONTINUITY PROPERTY OF QUANTUM DYNAMICAL ENTROPY

Cites work

• Analytically solvable dynamical systems which are not integrable
• Bulk Spin-Resonance Quantum Computation
• Computational Power of Quantum Machines, Quantum Grammars and Feasible Computation
• Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems
• Hamiltonian structure of dynamical systems which solve linear programming problems
• Merging quantum annealing computation and particle statistics: A prospect in the search of efficient solutions to intractable problems
• Quantum computation
• Quantum computation: from the sequential approach to simulated annealing
• Quantum computers, factoring, and decoherence

Cited in

(5)

• From quantum entropy to iterated function systems
• Entropy flow in near-critical quantum circuits
• CONTROLLING THE QUANTUM COMPUTATIONAL SPEED
• PATH INTEGRALS FOR QUBITS
• MAPPING, PROGRAMMABILITY AND SCALABILITY OF PROBLEMS FOR QUANTUM SPEED-UP

This page was built for publication: INTEGRABILITY, ENTROPY AND QUANTUM COMPUTATION

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