Pages that link to "Item:Q4832734"
From MaRDI portal
The following pages link to Efficient discrete approximations of quantum gates (Q4832734):
Displaying 21 items.
- Efficient quantum algorithms to construct arbitrary Dicke states (Q481642) (← links)
- How smooth is quantum complexity? (Q825857) (← links)
- Quantum lattice enumeration and tweaking discrete pruning (Q1633464) (← links)
- Universality of single-qudit gates (Q1683949) (← links)
- Quantum branching programs and space-bounded nonuniform quantum complexity (Q1779302) (← links)
- Martin-Löf randomness, invariant measures and countable homogeneous structures (Q1946503) (← links)
- On the spectral gap for finitely-generated subgroups of \(\text{SU}(2)\) (Q2471787) (← links)
- Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets (Q2945496) (← links)
- Quantum algorithms for algebraic problems (Q3077033) (← links)
- Efficient algebraic representation of quantum circuits (Q3400283) (← links)
- Optimal ancilla-free Pauli+V circuits for axial rotations (Q3463254) (← links)
- AN EFFICIENT QUANTUM ALGORITHM FOR COLORED JONES POLYNOMIALS (Q3528503) (← links)
- ACCELERATION OF QUANTUM ALGORITHMS USING THREE-QUBIT GATES (Q4674235) (← links)
- (Q4782728) (← links)
- Floating point representations in quantum circuit synthesis (Q5141571) (← links)
- Calculable lower bounds on the efficiency of universal sets of quantum gates (Q5880295) (← links)
- On the Origins, Nature, and Impact of Bourgain’s Discretized Sum-Product Theorem (Q5886423) (← links)
- (Q5889073) (← links)
- Mathematical etudes on quantum computation (Q6049765) (← links)
- Hay from the haystack: explicit examples of exponential quantum circuit complexity (Q6109366) (← links)
- Groups of diagonal gates in the Clifford hierarchy (Q6663783) (← links)
