scientific article; zbMATH DE number 7204273
From MaRDI portal
Publication:5111152
DOI10.4230/LIPIcs.CCC.2017.22zbMath1451.81157arXiv1612.05903MaRDI QIDQ5111152
Publication date: 26 May 2020
Full work available at URL: https://arxiv.org/abs/1612.05903
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Quantum computation (81P68) Other Turing degree structures (03D28) Quantum algorithms and complexity in the theory of computing (68Q12) Classical models of computation (Turing machines, etc.) (68Q04)
Related Items (18)
Forrelation: A Problem That Optimally Separates Quantum from Classical Computing ⋮ Trading locality for time: certifiable randomness from low-depth circuits ⋮ Entanglement accessibility measures for the quantum Internet ⋮ Fast and scalable quantum computing simulation on multi-core and many-core platforms ⋮ Entanglement concentration service for the quantum Internet ⋮ Decoherence dynamics estimation for superconducting gate-model quantum computers ⋮ Efficient algorithm for full-state quantum circuit simulation with DD compression while maintaining accuracy ⋮ Approximate unitary \(t\)-designs by short random quantum circuits using nearest-neighbor and long-range gates ⋮ Random quantum circuits transform local noise into global white noise ⋮ Quantum science and quantum technology ⋮ The Road to Quantum Computational Supremacy ⋮ Post-processing optimization for continuous-variable quantum key distribution ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Verification of quantum computation: an overview of existing approaches ⋮ Unnamed Item ⋮ Quantum circuit design for objective function maximization in gate-model quantum computers ⋮ State stabilization for gate-model quantum computers
This page was built for publication:
