Quantum-inspired Boolean states for bounding engineering network reliability assessment

•Tensor networks (TNs) enable novel algebraic reliability assessments.•Quantum Boolean states on TNs bound reliable network configurations.•Satisfiability (SAT) formulas inform TN contractions for counting-based reliability.•Low-rank tensor contractions efficiently count by simulating quantum system...

Full description

Saved in:

Bibliographic Details
Published in:	Structural safety Vol. 75; pp. 110 - 118
Main Authors:	Dueñas-Osorio, Leonardo, Vardi, Moshe, Rojo, Javier
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier Ltd 01.11.2018 Elsevier BV
Subjects:	Algorithms Analytical methods Approximation Boolean algebra Boolean functions Boolean logic Complex systems Complexity Computer applications Computer simulation Confidence Configurations Counting Cubic lattice Lattices (mathematics) Mathematical models Monte Carlo simulation Network reliability Networks Numerical methods Physicists Polynomials Quantum computing Quantum theory Recursive methods Reliability Reliability analysis Reliability engineering Satisfiability Statistical methods System reliability Tensor networks Upper bounds Quantum computing Network reliability Tensor networks Boolean logic Satisfiability Counting
ISSN:	0167-4730, 1879-3355
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!