Related papers: State Merging with Quantifiers in Symbolic Executi…
Determining the kinetic bottlenecks that make transitions between metastable states difficult is key to understanding important physical problems like crystallization, chemical reactions, or protein folding. In all these phenomena, the…
We shed new light on entanglement measures in multipartite quantum systems by taking a computational-complexity approach toward quantifying quantum entanglement with two familiar notions--approximability and distinguishability. Built upon…
Scientific software is, by its very nature, complex. It is mathematical and highly optimized which makes it prone to subtle bugs not as easily detected by traditional testing. We outline how symbolic execution can be used to write tests…
Entanglement forging based variational algorithms leverage the bi-partition of quantum systems for addressing ground state problems. The primary limitation of these approaches lies in the exponential summation required over the numerous…
Composite commits, which entangle multiple unrelated concerns, are prevalent in software development and significantly hinder program comprehension and maintenance. Existing automated untangling methods, particularly state-of-the-art graph…
Coherence and entanglement are fundamental properties of quantum systems, promising to power the near future quantum computers, sensors and simulators. Yet, their experimental detection is challenging, usually requiring full reconstruction…
Coherent states can be used for diverse applications in quantum physics including the construction of coherent state path integrals. Most definitions make use of a lattice regularization; however, recent definitions employ a continuous-time…
We introduce an alternative approach for the design of quantum repeaters based on generating entangled states of growing size. The scheme utilizes quantum merging operations, also known as fusion type-I operations, that allow the…
Entanglement purification describes a primitive in quantum information processing, where several copies of noisy quantum states are distilled into few copies of nearly-pure states of high quality via local operations and classical…
Quantum entanglement between several particles is essential for applications like quantum metrology or quantum cryptography, but it is also central for foundational phenomena like quantum non-locality. This leads to the problem of…
We address the problem of the minus sign sampling for two electron systems using the path integral approach. We show that this problem can be reexpressed as one of computing free energy differences and sampling the tails of statistical…
Entanglement plays a fundamental role in quantum physics and information processing. Here, we develop an unbiased estimator for mixed-state entanglement in the few-shot scenario and directly estimate it using random unitary evolution in a…
We discuss and generalize multi-particle entanglement based on statistical correlations using Ursell-Mayer type of cluster coefficients. Cluster coefficients are used to distinguish different, independent entangled systems as well as those…
Dynamic Symbolic Execution (DSE) is an important method for the testing of programs. An important system on DSE is KLEE which inputs a C/C++ program annotated with symbolic variables, compiles it into LLVM, and then emulates the execution…
Quantum technologies exploit entanglement to enhance various tasks beyond their classical limits including computation, communication and measurements. Quantum metrology aims to increase the precision of a measured quantity that is…
Although the path-integral formalism is known to be equivalent to conventional quantum mechanics, it is not generally obvious how to implement path-based calculations for multi-qubit entangled states. Whether one takes the formal view of…
We revisit the complexity of procedures on SFAs (such as intersection, emptiness, etc.) and analyze them according to the measures we find suitable for symbolic automata: the number of states, the maximal number of transitions exiting a…
Token merging can effectively accelerate various vision systems by processing groups of similar tokens only once and sharing the results across them. However, existing token grouping methods are often ad hoc and random, disregarding the…
In this article, we investigate the problem of state reconstruction of four-level quantum systems. A realistic scenario is considered with measurement results distorted by random unitary operators. Two frames which define injective…
For any quantum algorithm operating on pure states we prove that the presence of multi-partite entanglement, with a number of parties that increases unboundedly with input size, is necessary if the quantum algorithm is to offer an…