Encoding lattice structures in Quantum Computational Basis States: Conclusions and References

Table of Links

1. Introduction

2. Lattice models and coordinate space

3. Encoding to qubit states

   3.1 Encoding lattice structure in qubit sta

   3.2 Selection of the plane of turn

   3.3 Extending it to other structures

4. Conclusions and References

4 Conclusions

In this article, we discussed a methodology to encode lattice turns to qubit computational basis states, that could find use in protein structure prediction, polymer structure study and other coarse-grained models. We showed how a combination of qubit states could be used to span the space of directions. These directions could be along planes that are orthogonal or non-orthogonal to each other. We took specific examples of cubic and FCC lattice. However, they could be extended to other lattice structures as well.

References

[1] W. E. Hart and A. Newman, “Protein structure prediction with lattice models,” http://dimacs. rutgers.edu/∼alantha/papers2/alantha-bill-bc.pdf.

[2] S. Kmiecik and et. al., “Coarse-grained protein models and their applications,” ACS Chem. Rev., vol. 116, pp. 7898–7936, June 2016.

[3] M. Fingerhuth, T. Babej, and C. Ing, “A quantum alternating operator ansatz with hard and soft constraints for lattice protein folding,” arXiv preprint arXiv:1810.13411, 2018.

[4] A. Perdomo, C. Truncik, I. Tubert-Brohman, G. Rose, and A. Aspuru-Guzik, “Construction of model hamiltonians for adiabatic quantum computation and its application to finding low-energy conformations of lattice protein models,” Phys. Rev. A, vol. 78, p. 012320, Jul 2008.

[5] A. Robert, P. Barkoutsos, S. Woerner, and I. Tavernelli, “Resource-efficient quantum algorithm for protein folding,” npj Quantum Information, vol. 7:38, 2021.

[6] J. P. Vasavi and et. al., “An approach to solve the coarse-grained protein folding problem in a quantum computer,” arXiv preprint arXiv:2311.14141v1, 2023.