scientific article; zbMATH DE number 1775384
From MaRDI portal
Publication:4542516
zbMath1028.68054arXivquant-ph/9806029MaRDI QIDQ4542516
Dorit Aharonov, Noam Nisan, Alexei Yu. Kitaev
Publication date: 1 August 2002
Full work available at URL: https://arxiv.org/abs/quant-ph/9806029
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)
Related Items (80)
Optimal form of the Kretschmann–Schlingemann–Werner theorem for energy-constrained quantum channels and operations ⋮ Random measurement bases, quantum state distinction and applications to the hidden subgroup problem ⋮ A new protocol and lower bounds for quantum coin flipping ⋮ Quantum circuits with classical channels and the principle of deferred measurements ⋮ On the Satisfiability of Quantum Circuits of Small Treewidth ⋮ The Toffoli-Hadamard gate system: an algebraic approach ⋮ Complexity of mixed Gaussian states from Fisher information geometry ⋮ Entanglement entropy and complexity for one-dimensional holographic superconductors ⋮ On the satisfiability of quantum circuits of small treewidth ⋮ A first-order epistemic quantum computational semantics with relativistic-like epistemic effects ⋮ Quantum computational structures: Categorical equivalence for square root \(\mathrm{qMV}\)-algebras ⋮ Towards quantum computational logics ⋮ Complexity limitations on one-turn quantum refereed games ⋮ Correlation measures of a quantum state and information characteristics of a quantum channel ⋮ Quantum probability: a reliable tool for an agent or a reliable source of reality? ⋮ Computational Security of Quantum Encryption ⋮ Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete ⋮ Quantum Wasserstein distance of order 1 between channels ⋮ On the energy-constrained diamond norm and its application in quantum information theory ⋮ Complexity of mixed states in QFT and holography ⋮ Commuting quantum circuits and complexity of Ising partition functions ⋮ The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions ⋮ GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls ⋮ Comments on holographic complexity ⋮ Quantum multi-prover interactive proof systems with limited prior entanglement. ⋮ Convex decomposition of dimension-altering quantum channels ⋮ \(\text{Strong}^*\) convergence of quantum channels ⋮ Logics from \(\sqrt{\prime}\) quasi-MV algebras ⋮ Toffoli gate and quantum correlations: a geometrical approach ⋮ Symmetry protection of measurement-based quantum computation in ground states ⋮ Strong convergence of quantum channels: Continuity of the Stinespring dilation and discontinuity of the unitary dilation ⋮ Directed quantum communication ⋮ Computation in finitary stochastic and quantum processes ⋮ Quantum circuit design for accurate simulation of qudit channels ⋮ Generalized Quantum Arthur--Merlin Games ⋮ Subsystem complexity and holography ⋮ Operator -norms and their use ⋮ Subsystem complexity after a local quantum quench ⋮ Computation in generalised probabilisitic theories ⋮ Local random quantum circuits are approximate polynomial-designs ⋮ Fuzzy type representation of the Fredkin gate in quantum computation with mixed states ⋮ Uniform finite-dimensional approximation of basic capacities of energy-constrained channels ⋮ Quantum channel discrimination without entanglement ⋮ Lower bounds for predecessor searching in the cell probe model ⋮ A continuity theorem for Stinespring's dilation ⋮ Ancilla dimension in quantum channel discrimination ⋮ Entanglement as a semantic resource ⋮ Quantum computation with write-only memory ⋮ Multiplicativity of completely bounded \(p\)-norms implies a strong converse for entanglement-assisted capacity ⋮ Unbounded-error quantum computation with small space bounds ⋮ Quantum simulations of classical random walks and undirected graph connectivity ⋮ Fuzzy approach for Toffoli gate in quantum computation with mixed states ⋮ Quantum branching programs and space-bounded nonuniform quantum complexity ⋮ Computation in Sofic Quantum Dynamical Systems ⋮ Global estimates of errors in quantum computation by the Feynman-Vernon formalism ⋮ General Properties of Quantum Zero-Knowledge Proofs ⋮ Quantum Walks with Multiple or Moving Marked Locations ⋮ On completion of the cone of completely positive linear maps with respect to the energy-constrained diamond norm ⋮ Energy-constrained diamond norms and quantum dynamical semigroups ⋮ Exponential separation of quantum and classical online space complexity ⋮ A quantum-inspired version of the nearest mean classifier ⋮ The algebraic structure of an approximately universal system of quantum computational gates ⋮ Subsystem complexity after a global quantum quench ⋮ Some generalizations of fuzzy structures in quantum computational logic ⋮ Improved constructions of mixed state quantum automata ⋮ Mathematical logic and quantum finite state automata ⋮ The Arrow Calculus as a Quantum Programming Language ⋮ Characterizations of one-way general quantum finite automata ⋮ Noisy Interactive Quantum Communication ⋮ Reasoning about faulty quantum programs ⋮ On an explicit representation of the Łukasiewicz sum as a quantum operation ⋮ Susceptible Two-Party Quantum Computations ⋮ Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\) ⋮ Decoy-state quantum key distribution with a leaky source ⋮ Quantum model of computations: Underlying principles and achievements ⋮ Two-way finite automata with quantum and classical states. ⋮ Quantum Programming With Mixed States ⋮ Stationary states of dissipative quantum systems ⋮ Refined diamond norm bounds on the emergence of objectivity of observables ⋮ PSPACE has constant-round quantum interactive proof systems
This page was built for publication:
