Publication:3522420

From MaRDI portal


zbMath1152.81811arXivquant-ph/0205115MaRDI QIDQ3522420

No author found.

Publication date: 3 September 2008

Full work available at URL: https://arxiv.org/abs/quant-ph/0205115


81P68: Quantum computation


Related Items

Forrelation: A Problem That Optimally Separates Quantum from Classical Computing, Generalized Quantum Arthur--Merlin Games, The Classification of Reversible Bit Operations, Unnamed Item, Designable quantum beamsplitter using the two-level InGaAs quantum dot interacting with a Y-Type plasmonic waveguide, Unnamed Item, Classical Verification of Quantum Computations, Quantum algorithms for classical lattice models, A Complete Characterization of Unitary Quantum Space, Three‐Photon Polarization‐Spatial Hyperparallel Quantum Fredkin Gate Assisted by Diamond Nitrogen Vacancy Center in Optical Cavity, Single plasmon routing with the four quantum dots coupled to a cross-type plasmonic waveguide, Robust deterministic controlled phase-flip gate and controlled-not gate based on atomic ensembles embedded in double-sided optical cavities, One-step implementation of the Toffoli gate via quantum Zeno dynamics, Quantum deduction rules, Decompositions of \(n\)-qubit Toffoli gates with linear circuit complexity, Compact quantum gates for hybrid photon-atom systems assisted by Faraday rotation, Efficient experimental design of high-fidelity three-qubit quantum gates via genetic programming, A model of discrete quantum computation, Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2, Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\), Multi-server blind quantum computation protocol with limited classical communication among servers, Some efficient quantum circuit implementations of Camellia, ASM specification and refinement of a quantum algorithm, High-fidelity hybrid universal quantum controlled gates on photons and quantum-dot spins, Quantum and classical tradeoffs, Optically controlled quantum gates for three spin qubits in quantum dot-microcavity coupled systems, Quantum circuit implementations of AES with fewer qubits, Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete, Quantum circuits and low-degree polynomials over ${{\mathbb{F}}_\mathsf{2}}$, Neural networks with quantum architecture and quantum learning, Unnamed Item, Unnamed Item, Unnamed Item