scientific article; zbMATH DE number 1776257
From MaRDI portal
Publication:4544834
zbMATH Open1022.68001MaRDI QIDQ4544834FDOQ4544834
Authors: A. Kh. Shen', Alexei Yu. Kitaev, Mikhail Vyalyi 
Publication date: 5 August 2002
Title of this publication is not available (Why is that?)
Recommendations
computational complexitycomplexity classesBoolean circuitsquantum algorithmsquantum computationquantum codesquantum circuitsAbelian hidden subgroup problemquantum NP-completeness
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Research exposition (monographs, survey articles) pertaining to quantum theory (81-02) Other types of codes (94B60) Complexity of computation (including implicit computational complexity) (03D15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to quantum theory (81-01)
Cited In (only showing first 100 items - show all)
- Quantum computation with Turaev-Viro codes
- Error bounds for approximations with deep ReLU networks
- Quantum de Finetti theorems under local measurements with applications
- The ghost in the radiation: robust encodings of the black hole interior
- Fast universal quantum computation with railroad-switch local Hamiltonians
- Quantum commitments from complexity assumptions
- QPCF: higher-order languages and quantum circuits
- Quantum and classical tradeoffs
- Additivity of decoherence measures for multiqubit quantum systems
- Quantum computation vs. firewalls
- Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels
- Undecidability of the Spectral Gap
- Cohering power of quantum operations
- The BQP-hardness of approximating the Jones polynomial
- Approximation algorithms for quantum many-body problems
- Simulation of a multidimensional input quantum perceptron
- Computational complexity of the landscape. I.
- Quantum zero-error algorithms cannot be composed
- Classical verification of quantum computations
- Title not available (Why is that?)
- Adiabatic quantum counting by geometric phase estimation
- Experimentally feasible measures of distance between quantum operations
- Complexity classification of local Hamiltonian problems
- Prime witnesses in the Shor algorithm and the Miller-Rabin algorithm
- Entanglement versus gap for one-dimensional spin systems
- Quantum branching programs and space-bounded nonuniform quantum complexity
- An introduction to quantum computing algorithms
- Fidelity and Fisher information on quantum channels
- Book review of: Phillip Kaye, Raymond Laflamme, Michele Mosca, An introduction to quantum computing
- Impossibility of local state transformation via hypercontractivity
- The quantum complexity of computing Schatten \(p\)-norms
- Random quantum circuits are approximate 2-designs
- On the hitting times of quantum versus random walks
- Quantum algorithm for simulating real time evolution of lattice Hamiltonians
- Everything you always wanted to know about LOCC (but were afraid to ask)
- Comparison between the Cramer-Rao and the mini-max approaches in quantum channel estimation
- Quantum algorithms for finding constant-sized sub-hypergraphs
- Hand-waving and interpretive dance: an introductory course on tensor networks
- Quantum-circuit design for efficient simulations of many-body quantum dynamics
- Claw finding algorithms using quantum walk
- On complexity of the quantum Ising model
- Optimal separation in exact query complexities for Simon's problem
- Classification of quantum phases and topology of logical operators in an exactly solved model of quantum codes
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
- Zeno machines and hypercomputation
- Ancilla dimension in quantum channel discrimination
- Quantum control robust with respect to coupling with an external environment
- On quantum lambda calculi: a foundational perspective
- On efficiently solvable cases of quantum \(k\)-SAT
- On efficiently solvable cases of quantum \(k\)-SAT
- Approximate unitary \(t\)-designs by short random quantum circuits using nearest-neighbor and long-range gates
- Entanglement transmission and generation under channel uncertainty: universal quantum channel coding
- Braiding flux-tubes in topological quantum and classical lattice models from class-D
- Epsilon-net method for optimizations over separable states
- On the universality of the quantum approximate optimization algorithm
- Remarks on geometric quantum mechanics
- A complete characterization of unitary quantum space
- Replica procedure for probabilistic algorithms as a model of gene duplication
- Local random quantum circuits are approximate polynomial-designs
- Quantum 3-SAT Is QMA\(_1\)-complete
- Classically-controlled quantum computation
- The power of quantum systems on a line
- Revisiting the simulation of quantum Turing machines by quantum circuits
- Realizable Hamiltonians for universal adiabatic quantum computers
- General Properties of Quantum Zero-Knowledge Proofs
- A model of discrete quantum computation
- Commuting Pauli Hamiltonians as maps between free modules
- Unitary 2-designs from random \(X\)- and \(Z\)-diagonal unitaries
- Skein theory and topological quantum registers: Braiding matrices and topological entanglement entropy of non-Abelian quantum Hall states
- Termination orders for three-dimensional rewriting
- Quantum algorithms for algebraic problems
- Multiplicativity of completely bounded \(p\)-norms implies a new additivity result
- Quantum alternation: prospects and problems
- Positivity, discontinuity, finite resources, and nonzero error for arbitrarily varying quantum channels
- Characterising the intersection of QMA and coQMA
- Canonical forms for single-qutrit Clifford+\(T\) operators
- Ground-state spaces of frustration-free Hamiltonians
- Quantum path computing: computing architecture with propagation paths in multiple plane diffraction of classical sources of fermion and boson particles
- Complexity of quantum impurity problems
- Shorter unentangled proofs for ground state connectivity
- Dynamical maps beyond Markovian regime
- Stronger methods of making quantum interactive proofs perfectly complete
- Product-state approximations to quantum states
- On the concurrent composition of quantum zero-knowledge
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
- Total functions in QMA
- Quantum probability: a reliable tool for an agent or a reliable source of reality?
- Selecting efficient phase estimation with constant-precision phase shift operators
- Group theory on quantum Boltzmann machine
- Verification of quantum computation: an overview of existing approaches
- The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\)
- Two-dimensional local Hamiltonian problem with area laws is \textsf{QMA}-complete
- On the power of quantum, one round, two prover interactive proof systems
- Can a quantum computer run the von Neumann architecture?
- Mathematics of quantum computing. An introduction. Translated from the German
- Typing in reflective combinatory logic
- Realizations of standard quantum computational circuits by adiabatic evolution
- A linear-algebraic and lattice-theoretical look at the Cleaning Lemma of quantum coding theory
- Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report)
- Simultaneous transmission of classical and quantum information under channel uncertainty and jamming attacks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544834)
