Papers
Topics
Authors
Recent
2000 character limit reached

Benefits of non-adiabatic quantum control in quantum computation through spin qubit systems (2403.11288v1)

Published 17 Mar 2024 in quant-ph

Abstract: This is evident that the controllable quantum systems can be the reliable building blocks for Quantum computation. In reality we are witnessing the progress towards making the idea tractable enough, though optimistic but the threshold is not very near to us. The dawn of quantum computation has begun. In the future, we hope to see a full fledged operationally stable quantum computer which can solve the problems beyond the scope of classical digital computers. We may call it quantum supremacy. Nevertheless, we should not forget that there are problems which demand classical computers to be in the game for a better performance in comparison to the same through quantum devices. In the current stage of computing technology, the most beneficial area is nothing but an hybrid approach and that is for no doubt will reign the market for the next five to ten years. This hybrid aspect has several directions such as simulating quantum computation on a classical computer. Keeping both the aspect, computation through real physical devices and simulation on a classical computer by accessing available quantum computers for cloud computing, some advantages have been discussed in this article which will be elaborated as well in future articles. These advantages are inherent if we can achieve proper non-adiabatic control over the spin system in the laboratory. Otherwise these aspects can always be simulated by using quantum algorithms to see whether they can be useful in comparison to a purely classical computing machine. This is no doubt a new window for progress in the direction of quantum computation.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (15)
  1. Deutsch, D., “Quantum theory, the Church-Turing principle and the universal quantum computer”, Proceedings of the Royal Society, London, vol. A400, 1985, pp. 97 – 117.
  2. Deutsch, D., “Quantum computational networks”, Proceedings of the Royal Society, London, vol. A425, 1989, pp. 73 – 90.
  3. Berthiaume, A. and Brassard, G., “The quantum challenge to structural complexity theory”, Proceedings of 7th IEEE Conference on Structure in Complexity Theory, 1992, pp. 132 – 137.
  4. Berthiaume, A. and Brassard, G., “Oracle quantum computing”, Journal of Modern Optics, vol. 41, no. 12, December 1994, pp. 2521 – 2535.
  5. Harrow, A. W. & Montanaro, A. “Quantum computational supremacy”, Nature 549, 203 (2017).
  6. Aaronson, S. & Chen, L. “Complexity-theoretic foundations of quantum supremacy experiments”, arXiv:1612.05903 (2016).
  7. Preskill, J. “Quantum computing and the entanglement frontier (2012)”, 25th Solvay Conf.
  8. G. E. Santoro and E. Tosatti. “Optimization using quantum mechanics: quantum annealing through adiabatic evolution”, J. Phys. A: Math. Gen., 39, R393 (2006).
  9. Kadowaki, Tadashi and Nishimori, Hidetoshi, “Quantum annealing in the transverse Ising model”, PhysRevE.58. 5355, (1998).
  10. S. Morita and H. Nishimori. “Mathematical foundation of quantum annealing”, J. Math. Phys., 49, 125210 (2008).
  11. Andrew D. King et. al. “Coherent quantum annealing in a programmable 2000-qubit Ising chain”, Nature Physics Vol. 18, 1324-1328 (2022).
  12. Home D, Pan A K, Ali M M and Majumdar A S “Aspects of nonideal Stern–Gerlach experiment and testable ramifications” Journal of Physics A: Mathematical and Theoretical 40 13975 (2007).
  13. M. H. S. Amin Consistency of the Adiabatic Theorem Phys. Rev. Lett. 102, 220401 (2009)
  14. D. M. Tong Quantitative Condition is Necessary in Guaranteeing the Validity of the Adiabatic Approximation Phys. Rev. Lett 104, 120401 (2010)
  15. N. Dutta and A. Dey Blurred path-spin entanglement in Stern-Gerlach apparatus: interplay between magnetic inhomogeneity and Larmor precession arXiv:1410.4396 [nucl-th] (2014)

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.