QuantumComputingBench · graph-grounded exercise book
Follow the roles of input states, operator access, polynomial transformations and output interpretation. Source-only algorithm questions keep their assumptions and query/gate/readout boundaries explicit.
Back to Quantum Scientific Computing
To certify that an (m+n)-qubit unitary U exactly embeds an n-qubit matrix A as its all-zeros block with unit factor, one checks the entrywise identities <0^m, i| U |0^m, j> = A_{ij} for all computational-basis indices i,…
primary source nl only
Let A be any n-qubit matrix, of size N=2^n, with ||A||<=1 and a singular value decomposition A=W Sigma V^dagger, with W,V unitary and Sigma real diagonal with entries in[0,1]. Set S=sqrt(I-Sigma^2) and U_A=diag(W,I)*[[Si…
primary source nl only