scientific article

zbMath1166.81307arXivquant-ph/0605197MaRDI QIDQ3622244

Daniel Burgarth, Vittorio Giovannetti

Publication date: 28 April 2009

Full work available at URL: https://arxiv.org/abs/quant-ph/0605197

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Quantum computation (81P68) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (20)

Throttling for Zero Forcing and Variants ⋮ On the zero forcing number and spectral radius of graphs ⋮ GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED ⋮ Identifying combinatorially symmetric Hidden Markov Models ⋮ Failed skew zero forcing on a graph ⋮ Non-commutative Markov chains and multi-analytic operators ⋮ k-Forcing number for Cartesian product of some graphs ⋮ Some properties of the closed global shadow graphs and their zero forcing number ⋮ Failed zero forcing and critical sets on directed graphs ⋮ The Zero Forcing Number of Graphs ⋮ Quantum control with spectral constraints ⋮ A New Lower Bound for Positive Zero Forcing ⋮ Propagation time for probabilistic zero forcing ⋮ Rigid linkages and partial zero forcing ⋮ Logic circuits from zero forcing ⋮ Failed power domination on graphs ⋮ A short proof for a lower bound on the zero forcing number ⋮ Skew throttling ⋮ Unnamed Item ⋮ Using Markov chains to determine expected propagation time for probabilistic zero forcing

This page was built for publication: