相关论文: Polynomial time quantum computation with advice

We study numerically the imperfection effects in the quantum computing of the kicked rotator model in the regime of quantum chaos. It is shown that there are two types of physical characteristics: for one of them the quantum computation…

In the SEARCH WITH ADVICE problem, a single entry of interest within a database of N entries is to be found assuming that an ordering of the entries, from that with the highest probability of being the entry of interest (as determined by a…

Quantum computing can be employed in computer-aided music composition to control various attributes of the music at different structural levels. This article describes the application of quantum simulation to model compositional decision…

We present an experimental illustration on the quantum sensitivity of decision making machinery. In the decision making process, we consider the role of available information, say hint, whether it influences the optimal choices. To the end,…

State, trace, and moment polynomials are polynomial expressions in several operator or random variables and positive functionals on their products (states, traces or expectations). While these concepts, and in particular their positivity…

QROM (quantum random oracle model), introduced by Boneh et al. (Asiacrypt 2011), captures all generic algorithms. However, it fails to describe non-uniform quantum algorithms with preprocessing power, which receives a piece of bounded…

The ability to extract relevant information is critical to learning. An ingenious approach as such is the information bottleneck, an optimisation problem whose solution corresponds to a faithful and memory-efficient representation of…

Quantum superposition, a cornerstone of quantum mechanics, enables systems to exist in multiple states simultaneously, giving rise to probabilistic outcomes. In quantum information science, conditional entropy has become a key metric for…

Quantum computers are increasingly powerful. Software tools for the development of quantum-enhanced algorithms are maturing. However, the software stack still lacks the connection to applications that would enable hybrid algorithms…

Quantum Decision Theory, advanced earlier by the authors, and illustrated for lotteries with gains, is generalized to the games containing lotteries with gains as well as losses. The mathematical structure of the approach is based on the…

This paper argues that the principal difference between decision aids and most other types of information systems is the greater reliance of decision aids on fallible algorithms--algorithms that sometimes generate incorrect advice. It is…

It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f:A->B, additional structural information about the input x in A (that is any kind of promise that x belongs to a certain subset A'…

In this paper we consider what can be computed by a user interacting with a potentially malicious server, when the server performs polynomial-time quantum computation but the user can only perform polynomial-time classical (i.e.,…

A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not…

Parameterized quantum circuits (PQC, aka, variational quantum circuits) are among the proposals for a computational advantage over classical computation of near-term (not fault tolerant) digital quantum computers. PQCs have to be "trained"…

Real-life agents seldom have unlimited reasoning power. In this paper, we propose and study a new formal notion of computationally bounded strategic ability in multi-agent systems. The notion characterizes the ability of a set of agents to…

For many-particle systems, quantum information in base n can be defined by partitioning the set of states according to the outcomes of n-ary (joint) observables. Thereby, k particles can carry k nits. With regards to the randomness of…

Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. In effect, they follow the same logical paradigm as (multi-particle)…

Quantum capacities are fundamental quantities that are notoriously hard to compute and can exhibit surprising properties such as superadditivity. Thus, a vast amount of literature is devoted to finding tight and computable bounds on these…

We introduce the informational power of a quantum measurement as the maximum amount of classical information that the measurement can extract from any ensemble of quantum states. We prove the additivity by showing that the informational…