相关论文: Distributed implementation of standard oracle oper…
Quantum sampling, a fundamental subroutine in numerous quantum algorithms, involves encoding a given probability distribution in the amplitudes of a pure state. Given the hefty cost of large-scale quantum storage, we initiate the study of…
Quantum mechanics allows operations to be in indefinite causal order. Recently there have been active discussions on enhanced communication strategies through exotic causal structures. In light of this, through the process matrix formalism,…
We discuss controversial results for the statistics of charge transport through coherent conductors. Two distribution functions for the charge transmitted was obtained previously, first by L.Levitov and G.Lesovik, [JETP Letters Vol.55 p.555…
We study bipartite unitary operators which stay invariant under the local actions of diagonal unitary and orthogonal groups. We investigate structural properties of these operators, arguing that the diagonal symmetry makes them suitable for…
Quantum computations operate in the quantum world. For their results to be useful in any way, there is an intrinsic necessity of cooperation and communication controlled by the classical world. As a consequence, full formal descriptions of…
Universal features of chaotic quantum dynamics underlie our understanding of thermalization in closed quantum systems and the complexity of quantum computations. Reversible automaton circuits, comprised of classical logic gates, have…
Fermionic linear optics is a limited form of quantum computation which is known to be efficiently simulable on a classical computer. We revisit and extend this result by enlarging the set of available computational gates: in addition to…
Let a classical algorithm be determined by sequential applications of a black box performing one step of this algorithm. If we consider this black box as an oracle which gives a value F(a) for any query a, we can compute T sequential…
It is a long-standing open question in quantum complexity theory whether the definition of $\textit{non-deterministic}$ quantum computation requires quantum witnesses $(\textsf{QMA})$ or if classical witnesses suffice $(\textsf{QCMA})$. We…
We consider interactions as bidirectional channels. We investigate the capacities for interaction Hamiltonians and nonlocal unitary gates to generate entanglement and transmit classical information. We give analytic expressions for the…
We introduce a new approach to computation on encrypted data -- Encrypted Operator Computing (EOC) -- as an alternative to Fully Homomorphic Encryption (FHE). Given a plaintext vector $|{x}\rangle$, $x\in \{0,1\}^n$, and a function $F(x)$…
We study equivalence determination of unitary operations, a task analogous to quantum state discrimination. The candidate states are replaced by unitary operations given as a quantum sample, i.e., a black-box device implementing a candidate…
Quantum query complexity studies the number of queries needed to learn some property of a black box. A closely related question is how well an algorithm can succeed with this learning task using only a fixed number of queries. In this work,…
In the present paper, we define a new general subclass of bi-univalent functions involving a differential operator in the open unit disk U. For this purpose, we use the Faber polynomial expansions. Several connections to some of the earlier…
Distributed automata are finite-state machines that operate on finite directed graphs. Acting as synchronous distributed algorithms, they use their input graph as a network in which identical processors communicate for a possibly infinite…
We demonstrate that a classical emulation of quantum gate operations, here represented by an actual analog electronic device, can be modeled accurately as a quantum operation in terms of a universal set of Pauli operators. This observation…
Quantum logic gates can perform calculations much more efficiently than their classical counterparts. However, the level of control needed to obtain a reliable quantum operation is correspondingly higher. In order to evaluate the…
Quantum computers provide a fundamentally new computing paradigm that promises to revolutionize our ability to solve broad classes of problems. Surprisingly, the basic mathematical structures of gate-based quantum computing, such as unitary…
We propose two distributed iterative algorithms that can be used to solve, in finite time, the distributed optimization problem over quadratic local cost functions in large-scale networks. The first algorithm exhibits synchronous operation…
Distributed quantum information processing seeks to overcome the scalability limitations of monolithic quantum devices by interconnecting multiple quantum processing nodes via classical and quantum communication. This approach extends the…