相关论文: On the impossibility of extracting classical rando…

A software product line models the variability of highly configurable systems. Complete exploration of all valid configurations (the configuration space) is infeasible as it grows exponentially with the number of features in the worst case.…

The power of quantum computers is still somewhat speculative. While they are certainly faster than classical ones at some tasks, the class of problems they can efficiently solve has not been mapped definitively onto known classical…

In spite of its popularity, it has not been possible to vindicate the conventional wisdom that classical mechanics is a limiting case of quantum mechanics. The purpose of the present paper is to offer an alternative point of view in which…

Stochastic models are highly relevant tools in science, engineering, and society. Recent work suggests emerging quantum computing technologies can substantially decrease the memory requirements for simulating stochastic models. Here we show…

There are inherent limits in classical computation for it to serve as an adequate model of human cognition. In particular, non-commutativity, while ubiquitous in physics and psychology, cannot be sufficiently handled. We propose that we…

An integrable anharmonic oscillator is presumably simulable by a classical computer and therefore by a quantum computer. An integrable anharmonic oscillator whose Hamiltonian is of normal type and quartic in the canonical coordinates is not…

Encryption of data is fundamental to secure communication in the modern world. Beyond encryption of data lies obfuscation, i.e., encryption of functionality. It is well-known that the most powerful means of obfuscating classical programs,…

The impossibility of perfectly copying (or cloning) an arbitrary quantum state is one of the basic rules governing the physics of quantum systems. The processes that perform the optimal approximate cloning have been found in many cases.…

While recent progress in quantum hardware open the door for significant speedup in certain key areas (cryptography, biology, chemistry, optimization, machine learning, etc), quantum algorithms are still hard to implement right, and the…

(Abridged.) Quantum computers promise to solve some problems exponentially faster than traditional computers, but we still do not fully understand why this is the case. While the most studied model of quantum computation uses qubits, which…

How can relevant information be extracted from a quantum process? In many situations, only some part of the total information content produced by an information source is useful. Can one then find an efficient encoding, in the sense of…

Quantum computing promises to help humanity solve problems that would otherwise be intractable on classical computers. Unlike today's machines, quantum computers use a novel computing process that leverages the foundational quantum…

Applications such as simulating complicated quantum systems or solving large-scale linear algebra problems are very challenging for classical computers due to the extremely high computational cost. Quantum computers promise a solution,…

We give a computational complexity argument against the feasibility of quantum computers. We identify a very low complexity class of probability distributions described by noisy intermediate-scale quantum computers, and explain why it will…

The recent discovery of fully-homomorphic classical encryption schemes has had a dramatic effect on the direction of modern cryptography. Such schemes, however, implicitly rely on the assumptions that solving certain computation problems…

Communication scenarios between two parties can be implemented by first encoding messages into some states of a physical system which acts as the physical medium of the communication and then decoding the messages by measuring the state of…

In the present contribution we discuss the role of experimental limitations in the classical limit problem. We studied some simple models and found that Quantum Mechanics does not re-produce classical mechanical predictions, unless we…

Although the emergence of a fully-functional quantum computer may still be far away from today, in the near future, it is possible to have medium-size, special-purpose, quantum devices that can perform computational tasks not efficiently…

We propose an efficient scheme for verifying quantum computations in the `high complexity' regime i.e. beyond the remit of classical computers. Previously proposed schemes remarkably provide confidence against arbitrarily malicious…

Measurements of quantum systems can be used to generate classical data that is truly unpredictable for every observer. However, this true randomness needs to be discriminated from randomness due to ignorance or lack of control of the…