The following pages link to (Q3522587):
Displaying 26 items.
- Efficient quantum algorithms to construct arbitrary Dicke states (Q481642) (← links)
- Radix-independent, efficient arrays for multi-level \(n\)-qudit quantum and reversible computation (Q496886) (← links)
- Controlled gates for multi-level quantum computation (Q548222) (← links)
- General depolarized pure states: identification and properties (Q637121) (← links)
- Efficient quantum circuit for encoding and decoding of the [[8,3,5]] stabilizer code (Q1955881) (← links)
- \(T\)-\textit{depth} reduction method for efficient \textit{SHA}-256 quantum circuit construction (Q2104462) (← links)
- Efficient quantum circuit of Proth number modular multiplication (Q2104467) (← links)
- Entangling capability of multivalued bipartite gates and optimal preparation of multivalued bipartite quantum states (Q2355607) (← links)
- Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count (Q2516141) (← links)
- Quantum circuits for OR and AND of ORs. (Q2703433) (← links)
- Superlinear advantage for exact quantum algorithms (Q2805516) (← links)
- Universal quantum computation with spin-\(1/2\) pairs and Heisenberg exchange (Q2837657) (← links)
- Efficient Algorithms for Universal Quantum Simulation (Q2868433) (← links)
- Quantum Circuits for the Unitary Permutation Problem (Q2948477) (← links)
- Optimal Quantum Circuits for Nearest-Neighbor Architectures (Q2958433) (← links)
- Efficient algebraic representation of quantum circuits (Q3400283) (← links)
- (Q3400469) (← links)
- Optimal ancilla-free Pauli+V circuits for axial rotations (Q3463254) (← links)
- (Q3522431) (← links)
- (Q3522508) (← links)
- (Q4418653) (← links)
- (Q4782728) (← links)
- (Q5020632) (← links)
- (Q5089148) (← links)
- Efficient quantum circuits for diagonal unitaries without ancillas (Q5143192) (← links)
- Fast universal quantum computation with railroad-switch local Hamiltonians (Q5251258) (← links)
