Some quantum states prepared with polynomial quantum circuit

DOI10.1007/S10773-012-1257-9zbMATH Open1260.81035OpenAlexW2037426566MaRDI QIDQ1936342FDOQ1936342

Authors: Mingxing Luo 

Publication date: 4 February 2013

Published in: International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10773-012-1257-9

Recommendations

• Typical unpreparability of quantum states with quantum circuit model
• Deterministic generations of quantum state with no more than six qubits
• Resources Required for Preparing Graph States
• Classical Communication and Entanglement Cost in Preparing a Class of Multi-qubit States
• Controlled remote preparation of \(n\)-qubit equatorial states

zbMATH Keywords

quantum circuitCNOTquantum state preparation

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Cites Work

• Title not available (Why is that?)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Cited In (9)

• One-qubit reduced states of a pure many-qubit state: polygon inequalities
• Double sparse quantum state preparation
• Quantum circuits for spin and flavor degrees of freedom of quarks forming nucleons
• Deterministic generations of quantum state with no more than six qubits
• Faithful quantum broadcast beyond the no-go theorem
• A quantum probability splitter and its application to qubit preparation
• Percolation, renormalization, and quantum computing with nondeterministic gates
• Transformation of quantum states using uniformly controlled rotations
• An efficient quantum algorithm for preparation of uniform quantum superposition states

This page was built for publication: Some quantum states prepared with polynomial quantum circuit

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1936342)