The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We introduce a notion of universal preparability for a state of a system, more precisely: for a normal state on a von Neumann algebra. It describes a situation where from an arbitrary initial state it is possible to prepare a target state with arbitrary precision by a repeated interaction with a sequence of copies of another system. For $${\mathcal{B}(\mathcal{H})}$$ B ( H ) we give criteria...
Although the filter/flow model is a useful concept for query visualization, the resulting graphs can be quite complex. We aim to reduce this complexity by substituting recurring subgraphs with more compact structures. Based on related work on extensions to the filter/flow concept, we have identified four recurring subgraphs that can be significantly simplified by substitutions. We describe these substitutions...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.