Built on

T. Wang and J. Roychowdhury, “Oim: Oscillator-based ising machines for solving combinatorial optimisation problems,” (2019), arXiv:1903.07163 [cs.ET]
Original
1903
Earlier work this paper cites.
M. B. Hastings, “Classical and quantum bounded depth approximation algorithms,” (2019), arXiv:1905.07047 [quant-ph]
Original
1905
Earlier work this paper cites.
O. Shehab, I. H. Kim, N. H. Nguyen, K. Landsman, C. H. Alderete, D. Zhu, C. Monroe, and N. M. Linke, “Noise reduction using past causal cones in variational quantum algorithms,” (2019), arXiv:1906.00476 [quant-ph]
Original
1906
Earlier work this paper cites.
C. Huang, M. Szegedy, F. Zhang, X. Gao, J. Chen, and Y. Shi, “Alibaba cloud quantum development platform: Applications to quantum algorithm design,” (2019), arXiv:1909.02559 [quant-ph]
Original
1909
Earlier work this paper cites.
J. Cook, S. Eidenbenz, and A. Bärtschi, “The quantum alternating operator ansatz on maximum k-vertex cover,” (2020), arXiv:1910.13483 [quant-ph]
Original
1910
Earlier work this paper cites.
R. M. Karp, Reducibility among Combinatorial Problems , edited by B. J. Miller R.E., Thatcher J.W. (Springer US, Boston, MA, 1972)
1972
Earlier work this paper cites.
S. R. White, Phys. Rev. Lett. 69
1992
Earlier work this paper cites.
M. X. Goemans and D. P. Williamson, J. of the ACM 42
1995
Earlier work this paper cites.
K. Aardal and R. Weismantel, Polyhedral combinatorics : an annotated bibliography , Universiteit Utrecht. UU-CS, Department of Computer Science (Utrecht University, Netherlands, 1996)
1996
Earlier work this paper cites.
C. W. Commander, “Maximum cut problem, max-cutmaximum cut problem, max-cut,” in Encyclopedia of Optimization , edited by C. A. Floudas and P. M. Pardalos (Springer US, Boston, MA, 2009) pp. 1991–1999
1999
Earlier work this paper cites.
J. Håstad, J. ACM 48
2001
Earlier work this paper cites.
M. Cerezo, A. Sone, T. Volkoff, L. Cincio, and P. J. Coles, “Cost-function-dependent barren plateaus in shallow quantum neural networks,” (2020b), arXiv:2001.00550
Original
2001
Earlier work this paper cites.
S. Burer, R. D. C. Monteiro, and Y. Zhang, SIAM J. Optim. (2001), 10.1137/S1052623400382467
2001
Earlier work this paper cites.
W. K. Wootters, Quantum Info. Comput. 1
2001
Earlier work this paper cites.
R. Raussendorf and H. J. Briegel, Phys. Rev. Lett. 86
2001
Earlier work this paper cites.
P. Festa, P. Pardalos, M. Resende, and C. Ribeiro, Optimization Methods and Software 17
2002
Earlier work this paper cites.
R. Raussendorf, D. E. Browne, and H. J. Briegel, Phys. Rev. A 68
2003
Earlier work this paper cites.
S. Khot, G. Kindler, E. Mossel, and R. O’Donnell, SIAM 37
2005
Earlier work this paper cites.
L. Zhu, H. L. Tang, G. S. Barron, F. A. Calderon-Vargas, N. J. Mayhall, E. Barnes, and S. E. Economou, “An adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer,” (2020), arXiv:2005.10258 [quant-ph]
Original
2005
Earlier work this paper cites.
M. Fishman, S. R. White, and E. M. Stoudenmire, “The itensor software library for tensor network calculations,” (2020), arXiv:2007.14822 [cs.MS]
Original
2007
Earlier work this paper cites.
A. Wiegele, Biq Mac library – a collection of Max-Cut and quadratic 0-1 programming instances of medium size , Tech. Rep. (2007)
2007
Earlier work this paper cites.
X. Gao, A. Sergio, K. Chen, S. Fei, and X. Li-Jost, Front. Comput. Sci-Chi 2
2008
Earlier work this paper cites.

Similar

C. O. Marrero, M. Kieferová, and N. Wiebe, “Entanglement induced barren plateaus,” (2020), arXiv:2010.15968
Original
2010
Cited alongside, same era.
M. Cerezo, A. Arrasmith, R. Babbush, S. C. Benjamin, S. Endo, K. Fujii, J. R. McClean, K. Mitarai, X. Yuan, L. Cincio, and P. J. Coles, “Variational quantum algorithms,” (2020a), arXiv:2012.09265 [quant-ph]
Original
2012
Cited alongside, same era.
T. L. Patti, K. Najafi, X. Gao, and S. F. Yelin, “Entanglement devised barren plateau mitigation,” (2020), arXiv:2012.12658 [quant-ph]
Original
2012
Cited alongside, same era.
D. Lykov, R. Schutski, A. Galda, V. Vinokur, and Y. Alexeev, “Tensor network quantum simulator with step-dependent parallelization,” (2020), arXiv:2012.02430 [quant-ph]
Original
2012
Cited alongside, same era.
A. Lucas, Frontiers in Physics 2

Then

A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, T. Killeen, Z. Lin, N. Gimelshein, L. Antiga, A. Desmaison, A. Kopf, E. Yang, Z. DeVito, M. Raison, A. Tejani, S. Chilamkurthy, B. Steiner, L. Fang, J. Bai, and S. Chintala, in Advances in Neural Information Processing Systems , Vol. 32, edited by H. Wallach, H. Larochelle, A. Beygelzimer, F. d'Alché-Buc, E. Fox, and R. Garnett (Curran Associates, Inc., 2019)
2019
Later among the works it cites.
S. Hadfield, Z. Wang, B. O’Gorman, E. G. Rieffel, D. Venturelli, and R. Biswas, Algorithms 12
2019
Later among the works it cites.
H. Goto, K. Tatsumura, and A. R. Dixon, Science Advances 5
2019
Later among the works it cites.
W. Li, Y. Ding, Y. Yang, R. S. Sherratt, J. H. Park, and J. Wang, Human-centric Computing and Information Sciences 10
2020
Later among the works it cites.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…

Reading the bibliography…

2021

Variational Quantum Optimization with Multi-Basis Encodings

Patti, Taylor L., Kossaifi, Jean, Anandkumar, Anima et al.

Understand

Despite extensive research efforts, few quantum algorithms for classical optimization demonstrate realizable quantum advantage.

The utility of many quantum algorithms is limited by high requisite circuit depth and nonconvex optimization landscapes.
We tackle these challenges by introducing a new variational quantum algorithm that benefits from two innovations: multi-basis graph encodings and nonlinear activation functions.
Our technique results in increased optimization performance, a factor of two increase in effective quantum resources, and a quadratic reduction in measurement complexity.

Built on

T. Wang and J. Roychowdhury, “Oim: Oscillator-based ising machines for solving combinatorial optimisation problems,” (2019), arXiv:1903.07163 [cs.ET]
Original
1903
Earlier work this paper cites.
M. B. Hastings, “Classical and quantum bounded depth approximation algorithms,” (2019), arXiv:1905.07047 [quant-ph]
Original
1905
Earlier work this paper cites.
O. Shehab, I. H. Kim, N. H. Nguyen, K. Landsman, C. H. Alderete, D. Zhu, C. Monroe, and N. M. Linke, “Noise reduction using past causal cones in variational quantum algorithms,” (2019), arXiv:1906.00476 [quant-ph]
Original
1906
Earlier work this paper cites.
C. Huang, M. Szegedy, F. Zhang, X. Gao, J. Chen, and Y. Shi, “Alibaba cloud quantum development platform: Applications to quantum algorithm design,” (2019), arXiv:1909.02559 [quant-ph]
Original
1909
Earlier work this paper cites.
J. Cook, S. Eidenbenz, and A. Bärtschi, “The quantum alternating operator ansatz on maximum k-vertex cover,” (2020), arXiv:1910.13483 [quant-ph]
Original
1910
Earlier work this paper cites.
R. M. Karp, Reducibility among Combinatorial Problems , edited by B. J. Miller R.E., Thatcher J.W. (Springer US, Boston, MA, 1972)
1972
Earlier work this paper cites.
S. R. White, Phys. Rev. Lett. 69
1992
Earlier work this paper cites.
M. X. Goemans and D. P. Williamson, J. of the ACM 42
1995
Earlier work this paper cites.
K. Aardal and R. Weismantel, Polyhedral combinatorics : an annotated bibliography , Universiteit Utrecht. UU-CS, Department of Computer Science (Utrecht University, Netherlands, 1996)
1996
Earlier work this paper cites.
C. W. Commander, “Maximum cut problem, max-cutmaximum cut problem, max-cut,” in Encyclopedia of Optimization , edited by C. A. Floudas and P. M. Pardalos (Springer US, Boston, MA, 2009) pp. 1991–1999
1999
Earlier work this paper cites.
J. Håstad, J. ACM 48
2001
Earlier work this paper cites.
M. Cerezo, A. Sone, T. Volkoff, L. Cincio, and P. J. Coles, “Cost-function-dependent barren plateaus in shallow quantum neural networks,” (2020b), arXiv:2001.00550
Original
2001
Earlier work this paper cites.
S. Burer, R. D. C. Monteiro, and Y. Zhang, SIAM J. Optim. (2001), 10.1137/S1052623400382467
2001
Earlier work this paper cites.
W. K. Wootters, Quantum Info. Comput. 1
2001
Earlier work this paper cites.
R. Raussendorf and H. J. Briegel, Phys. Rev. Lett. 86
2001
Earlier work this paper cites.
P. Festa, P. Pardalos, M. Resende, and C. Ribeiro, Optimization Methods and Software 17
2002
Earlier work this paper cites.
R. Raussendorf, D. E. Browne, and H. J. Briegel, Phys. Rev. A 68
2003
Earlier work this paper cites.
S. Khot, G. Kindler, E. Mossel, and R. O’Donnell, SIAM 37
2005
Earlier work this paper cites.
L. Zhu, H. L. Tang, G. S. Barron, F. A. Calderon-Vargas, N. J. Mayhall, E. Barnes, and S. E. Economou, “An adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer,” (2020), arXiv:2005.10258 [quant-ph]
Original
2005
Earlier work this paper cites.
M. Fishman, S. R. White, and E. M. Stoudenmire, “The itensor software library for tensor network calculations,” (2020), arXiv:2007.14822 [cs.MS]
Original
2007
Earlier work this paper cites.
A. Wiegele, Biq Mac library – a collection of Max-Cut and quadratic 0-1 programming instances of medium size , Tech. Rep. (2007)
2007
Earlier work this paper cites.
X. Gao, A. Sergio, K. Chen, S. Fei, and X. Li-Jost, Front. Comput. Sci-Chi 2
2008
Earlier work this paper cites.

Similar

C. O. Marrero, M. Kieferová, and N. Wiebe, “Entanglement induced barren plateaus,” (2020), arXiv:2010.15968
Original
2010
Cited alongside, same era.
M. Cerezo, A. Arrasmith, R. Babbush, S. C. Benjamin, S. Endo, K. Fujii, J. R. McClean, K. Mitarai, X. Yuan, L. Cincio, and P. J. Coles, “Variational quantum algorithms,” (2020a), arXiv:2012.09265 [quant-ph]
Original
2012
Cited alongside, same era.
T. L. Patti, K. Najafi, X. Gao, and S. F. Yelin, “Entanglement devised barren plateau mitigation,” (2020), arXiv:2012.12658 [quant-ph]
Original
2012
Cited alongside, same era.
D. Lykov, R. Schutski, A. Galda, V. Vinokur, and Y. Alexeev, “Tensor network quantum simulator with step-dependent parallelization,” (2020), arXiv:2012.02430 [quant-ph]
Original
2012
Cited alongside, same era.
A. Lucas, Frontiers in Physics 2

Then

A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, T. Killeen, Z. Lin, N. Gimelshein, L. Antiga, A. Desmaison, A. Kopf, E. Yang, Z. DeVito, M. Raison, A. Tejani, S. Chilamkurthy, B. Steiner, L. Fang, J. Bai, and S. Chintala, in Advances in Neural Information Processing Systems , Vol. 32, edited by H. Wallach, H. Larochelle, A. Beygelzimer, F. d'Alché-Buc, E. Fox, and R. Garnett (Curran Associates, Inc., 2019)
2019
Later among the works it cites.
S. Hadfield, Z. Wang, B. O’Gorman, E. G. Rieffel, D. Venturelli, and R. Biswas, Algorithms 12
2019
Later among the works it cites.
H. Goto, K. Tatsumura, and A. R. Dixon, Science Advances 5
2019
Later among the works it cites.
W. Li, Y. Ding, Y. Yang, R. S. Sherratt, J. H. Park, and J. Wang, Human-centric Computing and Information Sciences 10
2020
Later among the works it cites.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…

2014

Cited alongside, same era.

A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. J. Love, A. Aspuru-Guzik, and J. L. O’Brien, Nature Communications 5

2014

Cited alongside, same era.

E. Farhi, J. Goldstone, and S. Gutmann, arXiv (2014), arXiv:1411.4028

Original

2014

Cited alongside, same era.

R. Orús, Annals of Physics 349

2014

Cited alongside, same era.

D. Wecker, M. B. Hastings, and M. Troyer, Phys. Rev. A 92

2015

Cited alongside, same era.

J. R. McClean, J. Romero, R. Babbush, and A. Aspuru-Guzik, New Journal of Physics 18

2016

Cited alongside, same era.

E. Crosson and A. W. Harrow, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) (2016), 10.1109/focs.2016.81

Original

2016

Cited alongside, same era.

A. Kandala, A. Mezzacapo, K. Temme, M. Takita, M. Brink, J. M. Chow, and J. M. Gambetta, Nature Publishing Group 549

Original

2017

Cited alongside, same era.

G. Pagano, A. Bapat, P. Becker, K. S. Collins, A. De, P. W. Hess, H. B. Kaplan, A. Kyprianidis, W. L. Tan, C. Baldwin, L. T. Brady, A. Deshpande, F. Liu, S. Jordan, A. V. Gorshkov, and C. Monroe, Proceedings of the National Academy of Sciences 117

2020

Later among the works it cites.

Z. Wang, N. C. Rubin, J. M. Dominy, and E. G. Rieffel, Phys. Rev. A 101

2020

Later among the works it cites.

R. Wiersema, C. Zhou, Y. de Sereville, J. F. Carrasquilla, Y. B. Kim, and H. Yuen, PRX Quantum 1

2020

Later among the works it cites.

S. Bravyi, A. Kliesch, R. Koenig, and E. Tang, Phys. Rev. Lett. 125

2020

Later among the works it cites.

H. Shen, P. Zhang, Y.-Z. You, and H. Zhai, Phys. Rev. Lett. 124