Fetching the paper…
Reading the bibliography…
Gate-based universal quantum computers form a rapidly evolving field of quantum computing hardware technology.
A simplex method for function minimization
Nelder, J. A. and Mead, R. (1965) · 1965
Earlier work this paper cites.
Theory for the folding and stability of globular proteins
Dill, K. A. (1985) · 1985
Earlier work this paper cites.
Estimation of effective interresidue contact energies from protein crystal structures: quasi-chemical approximation
Miyazawa, S. and Jernigan, R. L. (1985) · 1985
Earlier work this paper cites.
A lattice statistical mechanics model of the conformational and sequence spaces of proteins
Lau, K. F. and Dill, K. A. (1989) · 1989
Earlier work this paper cites.
Finding the lowest free energy conformation of a protein is an np-hard problem: proof and implications
Unger, R. and Moult, J. (1993) · 1993
Earlier work this paper cites.
Residue-residue potentials with a favorable contact pair term and an unfavorable high packing density term, for simulation and threading
Miyazawa, S. and Jernigan, R. L. (1996) · 1996
Earlier work this paper cites.
Robust proofs of np-hardness for protein folding: general lattices and energy potentials
Hart, W. E. and Istrail, S. (1997) · 1997
Earlier work this paper cites.
Protein folding in the hydrophobic-hydrophilic (hp) model is np-complete
Berger, B. and Leighton, T. (1998) · 1998
Earlier work this paper cites.
Quantum codes on a lattice with boundary
Bravyi, S. B. and Kitaev, A. Y. (1998) · 1998
Earlier work this paper cites.
Protein folding theory: From lattice to all-atom models
Mirny, L., , and Shakhnovich, E. (2001) · 2001
Earlier work this paper cites.
The Protein Folding Problem
Dill, K. A., Ozkan, S. B., Shell, M. S., and Weikl, T. R. (2008) · 2008
Earlier work this paper cites.
Construction of model hamiltonians for adiabatic quantum computation and its application to finding low-energy conformations of lattice protein models
Perdomo, A., Truncik, C., Tubert-Brohman, I., Rose, G., and Aspuru-Guzik, A. (2008) · 2008
Earlier work this paper cites.
Large-scale structural biology of the human proteome
Edwards, A. (2009) · 2009
Earlier work this paper cites.
Surface code quantum computing with error rates over 1%
Wang, D. S., Fowler, A. G., and Hollenberg, L. C. (2011) · 2011
Cited alongside, same era.
Babbush, R., Perdomo-Ortiz, A., O’Gorman, B., Macready, W., and Aspuru-Guzik, A. (2012) · 2012
Cited alongside, same era.
The Protein-Folding Problem, 50 Years On
Dill, K. A. and MacCallum, J. L. (2012) · 2012
Cited alongside, same era.
Finding low-energy conformations of lattice protein models by quantum annealing
Perdomo-Ortiz, A., Dickson, N., Drew-Brook, M., Rose, G., and Aspuru-Guzik, A. (2012) · 2012
Cited alongside, same era.
A quantum approximate optimization algorithm
Farhi, E., Goldstone, J., and Gutmann, S. (2014) · 2014
Cited alongside, same era.
A quantum algorithm to train neural networks using low-depth circuits
Verdon, G., Broughton, M., and Biamonte, J. (2017) · 2017
Later among the works it cites.
Protein evolution speed depends on its stability and abundance and on chaperone concentrations
Agozzino, L. and Dill, K. A. (2018) · 2018
Closest in time.
Anschuetz, E. R., Olson, J. P., Aspuru-Guzik, A., and Cao, Y. (2018) · 2018
Closest in time.
Coarse-grained lattice protein folding on a quantum annealer
Babej, T., Fingerhuth, M., and Ing, C. (2018) · 2018
Closest in time.
Personal communication
Google (2018) · 2018
Closest in time.
Quantum Approximate Optimization with Parallelizable Gates
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., and O’brien, J. L. (2014) · 2014
Cited alongside, same era.
Quantum supremacy through the quantum approximate optimization algorithm
Farhi, E. and Harrow, A. W. (2016) · 2016
Cited alongside, same era.
Quantum annealing for constrained optimization
Hen, I. and Spedalieri, F. M. (2016) · 2016
Cited alongside, same era.
Coarse-grained protein models and their applications
Kmiecik, S., Gront, D., Kolinski, M., Wieteska, L., Dawid, A. E., and Kolinski, A. (2016) · 2016
Cited alongside, same era.
A practical quantum instruction set architecture
Smith, R. S., Curtis, M. J., and Zeng, W. J. (2016) · 2016
Cited alongside, same era.
Quantum algorithms for fixed qubit architectures
Farhi, E., Goldstone, J., Gutmann, S., and Neven, H. (2017) · 2017
Cited alongside, same era.
From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
Hadfield, S., Wang, Z., O’Gorman, B., Rieffel, E. G., Venturelli, D., and Biswas, R. (2017) · 2017
Cited alongside, same era.
Lechner, W. (2018) · 2018
Closest in time.
Quantum approximate optimization with parallelizable gates
Lechner, W. (2018) · 2018
Closest in time.
Barren plateaus in quantum neural network training landscapes
McClean, J. R., Boixo, S., Smelyanskiy, V. N., Babbush, R., and Neven, H. (2018) · 2018
Closest in time.
Quantum computing in the nisq era and beyond
Preskill, J. (2018) · 2018
Closest in time.
Qubit coupled-cluster method: A systematic approach to quantum chemistry on a quantum computer
Ryabinkin, I. G., Yen, T.-C., Genin, S. N., and Izmaylov, A. F. (2018) · 2018
Closest in time.
Circuit-centric quantum classifiers
Schuld, M., Bocharov, A., Svore, K., and Wiebe, N. (2018) · 2018
Closest in time.
Compiling quantum circuits to realistic hardware architectures using temporal planners
Venturelli, D., Do, M., Rieffel, E., and Frank, J. (2018) · 2018
Closest in time.