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.
The efficient characterization and validation of the underlying model of a quantum physical system is a central challenge in the development of quantum devices and for our understanding of foundational quantum physics. However, the impossibility to efficiently predict the behaviour of complex quantum models on classical machines makes this challenge to be intractable to classical approaches. Quantum...
A major hurdle to the deployment of quantum linear systems algorithms and recent quantum simulation algorithms lies in the difficulty to find inexpensive reversible circuits for arithmetic using existing hand coded methods. Motivated by recent advances in reversible logic synthesis, we synthesize arithmetic circuits using classical design automation flows and tools. The combination of classical and...
We survey recent strides made towards building a software framework that is capable of compiling quantum algorithms from a high-level description down to physical gates that can be implemented on a fault-tolerant quantum computer. We discuss why compilation and design automation tools such as the ones in our framework are key for tackling the grand challenge of building a scalable quantum computer...
Today's rapid advances in the physical implementation of quantum computers demand for scalable synthesis methods in order to map practical logic designs to quantum architectures. We present a synthesis algorithm for quantum computing based on k-LUT networks, which can be derived from Verilog netlists using state-of-the-art and of-the-shelf mapping algorithms. We demonstrate the effectiveness of our...
For a mobile robot to be able to communicate usefully with others in a group, the references it makes to points in space must be grounded in concepts that are shared among the group. In the past it has been common to hand-construct a complete set of such groundings, either by individual enumeration or by enforcement of a common coordinate system and origin among all team members. Such assumptions...
It has previously been suggested that small subsystems of closed quantum systems thermalize under some assumptions; however, this has been rigorously shown so far only for systems with very weak interaction between subsystems. In this work, we give rigorous analytic results on thermalization for translation-invariant quantum lattice systems with finite-range interaction of arbitrary strength, in all...
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.