scientific article; zbMATH DE number 1776257
From MaRDI portal
Publication:4544834
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)
Recommendations
Cited in
(only showing first 100 items - show all)- Multiplicativity of completely bounded p-norms implies a new additivity result
- Thermalization in Kitaev’s quantum double models via tensor network techniques
- Quantum computation with Turaev-Viro codes
- Quantum algorithms for algebraic problems
- Positivity, discontinuity, finite resources, and nonzero error for arbitrarily varying quantum channels
- Quantum alternation: prospects and problems
- Characterising the intersection of QMA and coQMA
- Error bounds for approximations with deep ReLU networks
- Boolean satisfiability in quantum compilation
- Canonical forms for single-qutrit Clifford+\(T\) operators
- The ghost in the radiation: robust encodings of the black hole interior
- Quantum de Finetti theorems under local measurements with applications
- Quantum commitments from complexity assumptions
- 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
- Fast universal quantum computation with railroad-switch local Hamiltonians
- Shorter unentangled proofs for ground state connectivity
- QPCF: higher-order languages and quantum circuits
- Complete Problem for Perfect Zero-Knowledge Quantum Proof
- Complexity of quantum circuits via sensitivity, magic, and coherence
- scientific article; zbMATH DE number 7561521 (Why is no real title available?)
- Quantum and classical tradeoffs
- scientific article; zbMATH DE number 1669134 (Why is no real title available?)
- Dynamical maps beyond Markovian regime
- Additivity of decoherence measures for multiqubit quantum systems
- Quantum computation vs. firewalls
- Product formulas for exponentials of commutators
- Stronger methods of making quantum interactive proofs perfectly complete
- Preparation of an arbitrary two-qubit quantum gate on two spins with an anisotropic Heisenberg interaction
- A Surprisingly Simple Way of Reversing Trace Distance via Entanglement
- Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels
- On the concurrent composition of quantum zero-knowledge
- Bell's inequality, its physical origins, and generalization
- Product-state approximations to quantum states
- Cohering power of quantum operations
- Total functions in QMA
- Quantum commitments from complexity assumptions
- Undecidability of the Spectral Gap
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
- scientific article; zbMATH DE number 7650098 (Why is no real title available?)
- The BQP-hardness of approximating the Jones polynomial
- Selecting efficient phase estimation with constant-precision phase shift operators
- Group theory on quantum Boltzmann machine
- Homotopy classification of loops of Clifford unitaries
- Complexity limitations on one-turn quantum refereed games
- Quantum probability: a reliable tool for an agent or a reliable source of reality?
- Verification of quantum computation: an overview of existing approaches
- Simulation of a multidimensional input quantum perceptron
- Computational complexity of the landscape. I.
- Approximation algorithms for quantum many-body problems
- scientific article; zbMATH DE number 7758361 (Why is no real title available?)
- The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\)
- Some aspects of remote state restoring in state transfer governed by XXZ-Hamiltonian
- Quantum zero-error algorithms cannot be composed
- The tunable \(0-\pi\) qubit: dynamics and relaxation
- Structured filtering
- Classical verification of quantum computations
- How quantum are non-negative wave functions?
- Two-dimensional local Hamiltonian problem with area laws is \textsf{QMA}-complete
- scientific article; zbMATH DE number 6866233 (Why is no real title available?)
- On the power of quantum, one round, two prover interactive proof systems
- Adiabatic quantum counting by geometric phase estimation
- Experimentally feasible measures of distance between quantum operations
- The face lattice of the set of reduced density matrices and its coatoms
- QMA with subset state witnesses
- Prime witnesses in the Shor algorithm and the Miller-Rabin algorithm
- Complexity classification of local Hamiltonian problems
- Can a quantum computer run the von Neumann architecture?
- Relativized generic classes P and NP
- Mathematics of quantum computing. An introduction. Translated from the German
- Topological quantum gate construction by iterative pseudogroup hashing
- Entanglement versus gap for one-dimensional spin systems
- Decay of quantum conditional mutual information for purely generated finitely correlated states
- Quantum branching programs and space-bounded nonuniform quantum complexity
- Calculable lower bounds on the efficiency of universal sets of quantum gates
- Book review of: Phillip Kaye, Raymond Laflamme, Michele Mosca, An introduction to quantum computing
- Impossibility of local state transformation via hypercontractivity
- Computational complexity of time-dependent density functional theory
- An introduction to quantum computing algorithms
- Realizations of standard quantum computational circuits by adiabatic evolution
- Typing in reflective combinatory logic
- 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)
- Fidelity and Fisher information on quantum channels
- Trading inverses for an irrep in the Solovay-Kitaev theorem
- Universal quantum computation by scattering in the Fermi–Hubbard model
- Random quantum circuits are approximate 2-designs
- The quantum complexity of computing Schatten \(p\)-norms
- Simultaneous transmission of classical and quantum information under channel uncertainty and jamming attacks
- Comparison between the Cramer-Rao and the mini-max approaches in quantum channel estimation
- Quantum algorithms for finding constant-sized sub-hypergraphs
- On the hitting times of quantum versus random walks
- Universal qudit Hamiltonians
- Everything you always wanted to know about LOCC (but were afraid to ask)
- Generalized quantum Arthur-Merlin games
- Quantum algorithm for simulating real time evolution of lattice Hamiltonians
- Ergodic quantum computing
- Diagonal-unitary 2-design and their implementations by quantum circuits
- Hand-waving and interpretive dance: an introductory course on tensor networks
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)
