相关论文: State Merging with Quantifiers in Symbolic Executi…
Image processing is one of the most promising applications for quantum machine learning (QML). Quanvolutional Neural Networks with non-trainable parameters are the preferred solution to run on current and near future quantum devices. The…
We present a new approach to automated reasoning about higher-order programs by extending symbolic execution to use behavioral contracts as symbolic values, enabling symbolic approximation of higher-order behavior. Our approach is based on…
We present an approach to characterize genuine multiparticle entanglement using appropriate approximations in the space of quantum states. This leads to a criterion for entanglement which can easily be calculated using semidefinite…
The quantum guesswork quantifies the minimum number of queries needed to guess the state of a quantum ensemble if one is allowed to query only one state at a time. Previous approaches to the computation of the guesswork were based on…
Quantifying entanglement is an important issue in quantum information theory. Here we consider the entanglement measures through the trace norm in terms of two methods, the modified measure and the extended measure for bipartite states. We…
We introduce the entangled coherent state representation, which provides a powerful technique for efficiently and elegantly describing and analyzing quantum optics sources and detectors while respecting the photon number superselection rule…
A good state-time quantized symbolic abstraction of an already input quantized control system would satisfy three conditions: proximity, soundness and completeness. Extant approaches for symbolic abstraction of unstable systems limit to…
Hybrid systems exhibit both continuous and discrete behavior. Analyzing hybrid systems is known to be hard. Inspired by the idea of concolic testing (of programs), we investigate whether we can combine random sampling and symbolic execution…
We investigate the issue of speed-up and the necessity of entanglement in Grover's quantum search algorithm. We find that in a pure state implementation of Grover's algorithm entanglement is present even though the initial and target states…
Symbolic execution is a key technology in software testing, which generates test cases by collecting symbolic path constraints and then solving constraints with SMT solvers. Symbolic execution has been proven helpful in generating…
Quantifying coherence and entanglement is extremely important in quantum information processing. Here, we present numerical and analytical results for the geometric measure of coherence, and also present numerical results for the geometric…
Quantitative program analysis involves computing numerical quantities about individual or collections of program executions. An example of such a computation is quantitative information flow analysis, where one estimates the amount of…
Some quantum algorithms have "quantum speedups": improved time complexity as compared with the best-known classical algorithms for solving the same tasks. Can we understand what fuels these speedups from an entropic perspective? Information…
Despite recent advances in subquadratic attention mechanisms or state-space models, processing long token sequences still imposes significant computational requirements. Token merging has emerged as a solution to increase computational…
Given a multi-modal dynamical system, optimal switching logic synthesis involves generating the conditions for switching between the system modes such that the resulting hybrid system satisfies a quantitative specification. We formalize and…
Encoding in a high-dimensional Hilbert space improves noise resilience in quantum information processing. This approach, however, may result in cross-mode coupling and detection complexities, thereby reducing quantum cryptography…
Recently proposed quantum-chaotic sensors achieve quantum enhancements in measurement precision by applying nonlinear control pulses to the dynamics of the quantum sensor while using classical initial states that are easy to prepare. Here,…
Graph states are a fundamental entanglement resource for multipartite quantum applications which are in general challenging to transform efficiently. While fusion operations for merging entangled states are well-developed, no direct…
The present Thesis covers the subject of the characterization of entangled states by recourse to entropic measures, as well as the description of entanglement related to several issues in quantum mechanics, such as the speed of a quantum…
Loop compilation for Tightly Coupled Processor Arrays (TCPAs), a class of massively parallel loop accelerators, entails solving NP-hard problems, yet depends on the loop bounds and number of available processing elements (PEs), parameters…