Validating quantum-classical programming models with tensor network simulations

scientific article published in PLoS ONE

Validating quantum-classical programming models with tensor network simulations is …
instance of (P31):
scholarly articleQ13442814

External links are
P818arXiv ID1807.07914
P356DOI10.1371/JOURNAL.PONE.0206704
P932PMC publication ID6287780
P698PubMed publication ID30532151

P50authorAlexander J McCaskeyQ90287831
P2093author name stringDmitry Lyakh
Eugene Dumitrescu
Mengsu Chen
Travis Humble
P2860cites workA variational eigenvalue solver on a photonic quantum processorQ34014629
Experimental comparison of two quantum computing architecturesQ37737092
Hardware-efficient variational quantum eigensolver for small molecules and quantum magnetsQ47677407
Efficient tree tensor network states (TTNS) for quantum chemistry: generalizations of the density matrix renormalization group algorithmQ51232565
Computational Complexity of Projected Entangled Pair StatesQ59458713
Density matrix formulation for quantum renormalization groupsQ74518299
Class of quantum many-body states that can be efficiently simulatedQ82277756
Cloud Quantum Computing of an Atomic NucleusQ89041532
P275copyright licenseCreative Commons CC0 LicenseQ6938433
P6216copyright statuscopyrighted, dedicated to the public domain by copyright holderQ88088423
P433issue12
P407language of work or nameEnglishQ1860
P304page(s)e0206704
P577publication date2018-12-10
P1433published inPLOS OneQ564954
P1476titleValidating quantum-classical programming models with tensor network simulations
P478volume13

Reverse relations

Q60227814Open source software in quantum computingcites workP2860

Search more.