43 citations · 94 across the 7 of their papers we have counts for
8 papers
Faster algorithm for achieving minimal-size quantum decision diagrams
Juul Sanders, Sebastiaan Brand, Arend-Jan Quist +1
The decision diagram (DD) data structure enables fast linear-algebra calculations by bringing vectors into a normal form and subsequently merging equivalent ones, yielding a minima…
Numerical Errors in Quantitative System Analysis With Decision Diagrams
Sebastiaan Brand, Arend-Jan Quist, Richard M. K. van Dijk +1
Decision diagrams (DDs) are a powerful data structure that is used to tackle the state-space explosion problem, not only for discrete systems, but for probabilistic and quantum sys…
Q-Sylvan: A Parallel Decision Diagram Package for Quantum Computing
Sebastiaan Brand, Alfons Laarman
As physical realizations of quantum computers move closer towards practical applications, the need for tools to analyze and verify quantum algorithms grows. Among the algorithms an…
Quantum Graph-State Synthesis with SAT
Sebastiaan Brand, Tim Coopmans, Alfons Laarman
In quantum computing and quantum information processing, graph states are a specific type of quantum states which are commonly used in quantum networking and quantum error correcti…
A Decision Diagram Operation for Reachability
Sebastiaan Brand, Thomas Bäck, Alfons Laarman
Saturation is considered the state-of-the-art method for computing fixpoints with decision diagrams. We present a relatively simple decision diagram operation called REACH that als…
Improved analytical bounds on delivery times of long-distance entanglement
Tim Coopmans, Sebastiaan Brand, David Elkouss
The ability to distribute high-quality entanglement between remote parties is a necessary primitive for many quantum communication applications. A large range of schemes for realiz…
Hybrid divide-and-conquer approach for tree search algorithms
Mathys Rennela, Sebastiaan Brand, Alfons Laarman +1
One of the challenges of quantum computers in the near- and mid- term is the limited number of qubits we can use for computations. Finding methods that achieve useful quantum impro…
Efficient computation of the waiting time and fidelity in quantum repeater chains
Sebastiaan Brand, Tim Coopmans, David Elkouss
Quantum communication enables a host of applications that cannot be achieved by classical communication means, with provably secure communication as one of the prime examples. The…