Results 21 to 30 of about 236,217 (313)
General Conditions for Universality of Quantum Hamiltonians
PRX Quantum, 2022 Recent work has demonstrated the existence of universal Hamiltonians—simple spin-lattice models that can simulate any other quantum many-body system to any desired level of accuracy. Until now, proofs of universality have relied on explicit constructions,
Tamara Kohler +3 more
doaj +1 more source
New Security Proofs and Complexity Records for Advanced Encryption Standard
IEEE Access, 2023 Common block ciphers like AES specified by the NIST or KASUMI (A5/3) of GSM are extensively utilized by billions of individuals globally to protect their privacy and maintain confidentiality in daily communications.
Orhun Kara
doaj +1 more source
Automatic Function Annotations for Hoare Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 In systems verification we are often concerned with multiple, inter-dependent properties that a program must satisfy. To prove that a program satisfies a given property, the correctness of intermediate states of the program must be characterized. However,
Daniel Matichuk
doaj +1 more source
Proof of a momentum/complexity correspondence [PDF]
Physical Review D, 2020 10 pages, 2 figures.
J. L. F. Barbón +2 more
openaire +4 more sources
Low-Complexity Decoder for Overloaded Uniquely Decodable Synchronous CDMA
IEEE Access, 2022 We consider the problem of designing a low-complexity decoder for antipodal uniquely decodable (UD) /errorless code sets for overloaded synchronous code-division multiple access (CDMA) systems, where the number of signals $K_{\mathrm{max}}^{a}$ is the ...
Michel Kulhandjian +5 more
doaj +1 more source
The Certification Problem Format [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We provide an overview of CPF, the certification problem format, and explain some design decisions. Whereas CPF was originally invented to combine three different formats for termination proofs into a single one, in the meanwhile proofs for several other
Christian Sternagel, René Thiemann
doaj +1 more source
Unbiasing time-dependent Variational Monte Carlo by projected quantum evolution [PDF]
Quantum, 2023 We analyze the accuracy and sample complexity of variational Monte Carlo approaches to simulate the dynamics of many-body quantum systems classically. By systematically studying the relevant stochastic estimators, we are able to: (i) prove that the most ...
Alessandro Sinibaldi +3 more
doaj +1 more source
Interaction and Depth against Nondeterminism in Proof Search [PDF]
Logical Methods in Computer Science, 2014 Deep inference is a proof theoretic methodology that generalizes the standard notion of inference of the sequent calculus, whereby inference rules become applicable at any depth inside logical expressions.
Ozan Kahramanogullari
doaj +1 more source
Multiplicative-Additive Proof Equivalence is Logspace-complete, via Binary Decision Trees [PDF]
Logical Methods in Computer Science, 2017 Given a logic presented in a sequent calculus, a natural question is that of equivalence of proofs: to determine whether two given proofs are equated by any denotational semantics, ie any categorical interpretation of the logic compatible with its cut ...
Marc Bagnol
doaj +1 more source
On the Complexity of Finding Narrow Proofs [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2012 We study the complexity of the following "resolution width problem": Does a given 3-CNF formula have a resolution refutation of width k? For fixed k, refutations of width k can easily be found in polynomial time.
Christoph Berkholz
semanticscholar +1 more source