相关论文: Distributed implementation of standard oracle oper…
Many quantum algorithms, such as Harrow-Hassidim-Lloyd (HHL) algorithm, depend on oracles that efficiently encode classical data into a quantum state. The encoding of the data can be categorized into two types; analog-encoding where the…
While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…
One of the crucial generic techniques for quantum computation is amplitude encoding. Although several approaches have been proposed, each of them often requires exponential classical-computational cost or an oracle whose explicit…
The algebra of polynomials in operators that represent generalized coordinate and momentum and depend on the Planck constant is defined. The Planck constant is treated as the parameter taking values between zero and some nonvanishing $h_0$.…
We show how to make quantum networks, both standard and entanglement-based, genuine quantum by providing them with the possibility of handling superposed tasks and superposed addressing. This extension of their functionality relies on a…
We emphasize the fact the evolution of quantum states in the inverted oscillator (IO) is reduced to classical equations of motion, stressing that the corresponding tunnelling and reflexion coefficients addressed in the literature are…
We propose a general security definition for cryptographic quantum protocols that implement classical non-reactive two-party tasks. The definition is expressed in terms of simple quantum-information-theoretic conditions which must be…
We consider two capacity quantities associated with bipartite unitary gates: the entangling and the disentangling power. For two-qubit unitaries these two capacities are always the same. Here we prove that these capacities are different in…
Combining quantum computers with classical compute power has become a standard means for developing algorithms that are eventually supposed to beat any purely classical alternatives. While in-principle advantages for solution quality or…
In this research, we present a quantum circuit design and implementation for a parallel universal linear bounded automata. This circuit is able to accelerate the inference of algorithmic structures in data for discovering causal generative…
We initiate the study of asynchronous quantum distributed systems, focusing on the case of implementing atomic quantum global operations that can be decomposed into a collection of local operations on the components of the system. A simple…
An open problem in communication complexity proposed by several authors is to prove that for every Boolean function f, the task of computing f(x AND y) has polynomially related classical and quantum bounded-error complexities. We solve a…
We prove a trade-off relation between the entanglement cost and classical communication complexity of causal order structure of a protocol in distributed quantum information processing. We consider an implementation of a class of two-qubit…
This paper shows that, in measurement-based quantum computation, it is possible to write any quantum oracle implementing a classical function in constant depth. The result is shown through the equivalence between MBQC and the circuit model…
We consider the fractional oscillator being a generalization of the conventional linear oscillator in the framework of fractional calculus. It is interpreted as an ensemble average of ordinary harmonic oscillators governed by stochastic…
Operator spreading has profound implications in diverse fields ranging from statistical mechanics and blackhole physics to quantum information. The usual way to quantify it is through out-of-time-order correlators (OTOCs), which are the…
We demonstrate a fiber-integrated quantum optical circulator that is operated by a single atom and that relies on the chiral interaction between emitters and transversally confined light. Like its counterparts in classical optics, our…
Let $f$ denote length preserving function on words. A classical algorithm can be considered as $T$ iterated applications of black box representing $f$, beginning with input word $x$ of length $n$. It is proved that if $T=O(2^{n/(7+e)}), e…
Quantum networks are complex systems formed by the interaction among quantum processors through quantum channels. Analogous to classical computer networks, quantum networks allow for the distribution of quantum computation among quantum…
How could quantum cryptography help us achieve what are not achievable in classical cryptography? In this work we study the classical cryptographic problem that two parties would like to perform secure computations with long outputs. As a…