17 problems
- 0 votes0 replies0 views
Kong–Li–Liu's iSWAP optimality conjecture for Hermitian two-local ensembles
Kong–Li–Liu's iSWAP optimality conjecture. For a general fixed connected graph, Kong, Li, and Liu conjectured that maximises the Hermitian second-moment spectral g…
- 0 votes0 replies1 view
The Clifford bound conjecture for unitary 2-designs
Clifford bound conjecture. The cardinality of any unitary 2-design is at least
- 0 votes0 replies0 views
Kong–Li–Liu's ironed-gadget degeneracy conjecture at KAK parameter 5/9
Kong–Li–Liu's ironed-gadget degeneracy conjecture. Every ironed gadget with KAK parameter has the same second-moment spectral gap as .
- 0 votes0 replies0 views
Linear-graph connection optimality conjecture for approximate unitary designs
Linear-graph connection optimality conjecture. No other graph on qudits requires more connections to form an -approximate -design than the linear graph, which requ…
- 0 votes0 replies0 views
Conjecture on random gate placement for designs on connected graphs
Consider random circuits formed by placing random gates on the edges of a connected interaction graph, and let denote the number of qudits. A -design is an ensemble reproduc…
- 0 votes0 replies1 view
Hunter–Jones conjecture on constant-overhead brickwork designs
The 1D brickwork channel is defined by applying random two-qudit unitaries in alternating layers: acts on , acts on …
- 0 votes0 replies0 views
The optimal dimension scaling conjecture for approximate unitary designs
Let be the dimension of the unitary group and let denote the design order in a relation between -nets and -approximate -designs on the space of unitary c…
- 0 votes0 replies0 views
The iSWAP optimality conjecture for the brickwork model
Let be the number of qubits in the brickwork model, let denote the circuit depth or number of layers, and let…
- 0 votes0 replies0 views
The iSWAP equality conjecture for complete-graph gadgets
Let be the complete graph on vertices, and consider a gadget associated with a family of 2-local gates having parameter in the notation of the paper. Let…
- 0 votes0 replies0 views
The iSWAP optimality conjecture for 2-local unitary circuit ensembles
Let , let be a fixed connected graph, and let be a 2-local unitary circuit ensemble. Write…
- 0 votes0 replies0 views
Threshold conjecture for higher-moment star graph gaps
Let be a star graph with vertices, local dimension , and moment , and let denote its spectral gap. Higher-moment star-…
- 0 votes0 replies0 views
Low-moment star graph spectral-gap conjecture
For a star graph with vertices, let denote the spectral gap of its Hamiltonian at moment . Low-moment star graph conjectu…
- 0 votes0 replies0 views
CQA ensemble convergence conjecture for one-dimensional approximate 2-designs
Consider the one-dimensional CQA ensemble on qudits with SU symmetry, and let denote the target approximation precision. CQA convergence conjecture. Based on…
- 0 votes0 replies0 views
CQA circuit depth conjecture for approximate designs on qubits
Let qubits be equipped with a 2-local one-dimensional CQA random circuit, and let denote the circuit depth. For , an ensemble is an -approximate…
- 0 votes0 replies1 view
Conjecture on the optimal scaling of design order for fixed approximation
Optimal-scaling conjecture. With some work, it should be possible to obtain
- 0 votes0 replies0 views
Zhu–Kueng–Grassl–Gross conjecture on Clifford-group projective designs
Let an orbit of the complex Clifford group be a finite set of pure quantum states, and call it a projective -design when its moments up to degree agree with those of the uni…
- 0 votes0 replies0 views
The linear-depth conjecture for unitary t-designs from random quantum circuits
Linear-depth conjecture. For the general random quantum circuit model, a depth of order suffices to approximate -designs.