Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2023 Oct 27;9(43):eadi0204.
doi: 10.1126/sciadv.adi0204. Epub 2023 Oct 25.

Quantum-inspired encoding enhances stochastic sampling of soft matter systems

Affiliations

Quantum-inspired encoding enhances stochastic sampling of soft matter systems

Francesco Slongo et al. Sci Adv. .

Abstract

Quantum advantage in solving physical problems is still hard to assess due to hardware limitations. However, algorithms designed for quantum computers may engender transformative frameworks for modeling and simulating paradigmatically hard systems. Here, we show that the quadratic unconstrained binary optimization encoding enables tackling classical many-body systems that are challenging for conventional Monte Carlo. Specifically, in self-assembled melts of rigid lattice ring polymers, the combination of high density, chain stiffness, and topological constraints results in divergent autocorrelation times for real-space Monte Carlo. Our quantum-inspired encoding overcomes this problem and enables sampling melts of lattice rings with fixed curvature and compactness, unveiling counterintuitive topological effects. Tackling the same problems with the D-Wave quantum annealer leads to substantial performance improvements and advantageous scaling of sampling computational cost with the size of the self-assembled ring melts.

PubMed Disclaimer

Figures

Fig. 1.
Fig. 1.. QUBO encoding of ring assembly.
(A) Schematic representation of active/inactive binary variables corresponding to lattice sites (Γi), edges (Γij), and corners (Γijk). (B) Examples of correct (left) and incorrect (right) solutions on a 5 × 3 lattice of the ring-assembly QUBO problem encoded by ℋN for N = 12, see also section S2.
Fig. 2.
Fig. 2.. QUBO-based sampling of rare states.
Probability density and marginal distributions of the number of corner turns and contacts of self-assembled rings on a 4 × 4 × 3 lattice at 2/3 filling fraction, obtained from 104 samples minimizing N, as exemplified by the circled configuration on the right, where distinct rings are differently colored. The additional Hamiltonian terms of Eq. 2 enable the direct sampling for atypical, and hence very rare, combinations of curvature and contacts, e.g., at the intersection of the shaded bands, as exemplified by the circled configuration on the left.
Fig. 3.
Fig. 3.. Ring melts with fixed and free curvature.
(A) Average number of rings and corner turns (curvature) of space-filling rings assembled in cuboids of size N. Data points are averages over 104 states or more. (B) Probability distribution, with smoothed contour lines, computed from >3 × 105 states minimizing ℋN on a 5 × 5 × 4 cuboid (N = 100). The marginal curvature distribution (top graph) has SD σcorners = 4.3. We addressed rare states, from 3 to >10σs from the average (yellow), by minimizing ℋN + ℋcurvature, typically collecting 104 states at given ncorners (blue bands). Green data points and spline show the average number of rings computed using states without (with) fixed curvature close to (far from) the modal value.
Fig. 4.
Fig. 4.. QUBO-based sampling with and without curvature constraints.
Characteristic run time required by the D-Wave classical solver to generate ring melts filling cuboids of size N with and without the quadratic constraint of minimal curvature. The times refer to the D-Wave classical solver run on standard Intel-based workstations with optimized simulated annealing schedule and coefficients of the potential (see section S8). Estimated relative statistical errors are at most 15%. The indicated scalings are from power-law best fits to the data (solid lines).
Fig. 5.
Fig. 5.. Linking properties of space-filling ring melts.
(A) Probability that all ring pairs in space-filling ring melts of size N are unconcatenaned, i.e., with zero Gaussian linking number. Single rings, i.e., Hamiltonian cycles, are excluded. (B) Complementary linking probability versus curvature for a 5 × 5 × 4 lattice, N = 100, with blue bands denoting sampling at fixed curvature (the line is a spline to the data points). The yellow point marks the equilibrium ensemble average. Circled are typical configurations at the indicated values of N and ncorners, where distinct rings are differently colored. The rings’ linked state is schematically represented on the side. Counterintuitively, increasing the effective ring stiffness can substantially enhance linking.
Fig. 6.
Fig. 6.. QUBO-based sampling versus ad hoc real-space MC.
Characteristic run time per independent sample required by QUBO-based and real-space MC schemes to generate minimal-curvature states filling cuboids of size N. The QUBO-based run time is based on the D-Wave neal classical solver with optimized annealing schedule and Hamiltonian coefficients. The real-space MC run time is based on a replica exchange scheme with optimized temperatures and exchange rates and using plaquette-flip moves ad hoc tailored for cubic lattices at complete filling. The run times were measured on a standard Intel-based workstation, and details of the optimized algorithms are provided in section S8. Estimated relative statistical errors are at most 15%. The indicated scalings are from power-law best fits to the data (solid lines).
Fig. 7.
Fig. 7.. Classical simulated annealing versus hybrid quantum QUBO solver.
Characteristic run times required by D-Wave’s purely classical and hybrid (classical-quantum) solvers to minimize ℋN for filled cuboids of size N. The τ1/2 data for both types of solvers correspond to the run times yielding a 50% hit rate with default parameters. The topt data are the same as in Fig. 4 and correspond to the characteristic run times per independent sample required by the classical solver with an optimized annealing schedule. The indicated scalings are from power-law best fits to the data (solid lines).

References

    1. A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. J. Love, A. Aspuru-Guzik, J. L. O’Brien, A variational eigenvalue solver on a photonic quantum processor. Nat. Commun. 5, 4213 (2014). - PMC - PubMed
    1. F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. S. L. Brandao, D. A. Buell, B. Burkett, Y. Chen, Z. Chen, B. Chiaro, R. Collins, W. Courtney, A. Dunsworth, E. Farhi, B. Foxen, A. Fowler, C. Gidney, M. Giustina, R. Graff, K. Guerin, S. Habegger, M. P. Harrigan, M. J. Hartmann, A. Ho, M. Hoffmann, T. Huang, T. S. Humble, S. V. Isakov, E. Jeffrey, Z. Jiang, D. Kafri, K. Kechedzhi, J. Kelly, P. V. Klimov, S. Knysh, A. Korotkov, F. Kostritsa, D. Landhuis, M. Lindmark, E. Lucero, D. Lyakh, S. Mandrà, J. R. McClean, M. M. Ewen, A. Megrant, X. Mi, K. Michielsen, M. Mohseni, J. Mutus, O. Naaman, M. Neeley, C. Neill, M. Y. Niu, E. Ostby, A. Petukhov, J. C. Platt, C. Quintana, E. G. Rieffel, P. Roushan, N. C. Rubin, D. Sank, K. J. Satzinger, V. Smelyanskiy, K. J. Sung, M. D. Trevithick, A. Vainsencher, B. Villalonga, T. White, Z. J. Yao, P. Yeh, A. Zalcman, H. Neven, J. M. Martinis, Quantum supremacy using a programmable superconducting processor. Nature 574, 505–510 (2019). - PubMed
    1. H.-S. Zhong, H. Wang, Y.-H. Deng, M.-C. Chen, L.-C. Peng, Y.-H. Luo, J. Qin, D. Wu, X. Ding, Y. Hu, P. Hu, X. Y. Yang, W. J. Zhang, H. Li, Y. Li, X. Jiang, L. Gan, G. Yang, L. You, Z. Wang, L. Li, N. L. Liu, C. Y. Lu, J. W. Pan, Quantum computational advantage using photons. Science 370, 1460–1463 (2020). - PubMed
    1. A. J. Daley, I. Bloch, C. Kokail, S. Flannigan, N. Pearson, M. Troyer, P. Zoller, Practical quantum advantage in quantum simulation. Nature 607, 667–676 (2022). - PubMed
    1. A. Fedorov, N. Gisin, S. Beloussov, A. Lvovsky, Quantum computing at the quantum advantage threshold: A down-to-business review. arXiv:2203.17181 [quant-ph] (31 Mar 2022).

LinkOut - more resources