The Quantum Formalization Drive

Deciding whether a bipartite quantum state is entangled is a basic computational problem of quantum information theory, and it is NP-hard in general (Gurvits 2003). The most widely used family of tests is the DPS hierarchy of Doherty, Parrilo and Spedalieri (DPS 2002, DPS 2004): a sequence of semidefinite programs, indexed by an integer level $\ell\ge1$,…

A quantum algorithm for a system of linear equations must turn operations it can implement into an approximation of the inverse of the system matrix. For a Hermitian matrix, time evolution $e^{-iAt}$ is such an operation. Childs, Kothari and Somma use a Fourier expansion of the scalar reciprocal $1/x$ to express an approximation to $A^{-1}$ as a finite linear…

Grover's algorithm finds a marked element among $N$ with $O(\sqrt N)$ queries by alternating two reflections: one about the initial state and one that flips the sign of marked states. In quantum-walk search, the initial state $|\pi\rangle$ encodes the stationary distribution of a Markov chain, and the reflection about $|\pi\rangle$ is too expensive to implement…

Convexity and concavity of trace functions of matrices are a basic tool of mathematical physics and quantum information. Lieb's concavity theorem (Lieb 1973), that $(A,B)\mapsto\operatorname{Tr}K^*A^pKB^{1-p}$ is jointly concave for $0<p\le1$, settled the Wigner–Yanase–Dyson conjecture on the concavity of skew information and underlies the strong subadditivity…

Two parties who share a partially secret string $Z$ can turn it into a short, highly secret key by privacy amplification: one of them publicly picks a hash function $F$ and both compute $S=F(Z)$ (Bennett, Brassard, Robert 1988). The step ends almost every quantum key distribution protocol, so the security of those protocols rests on what an adversary who holds a…

Quantum key distribution lets two parties who share no secret agree on one over a public quantum channel, with security resting on physics and not on a computational assumption. The BB84 scheme of Bennett and Brassard is the standard protocol, and the question that drove the field through the 1990s was whether it stays secure when the eavesdropper applies…

Geometric quantum machine learning builds the symmetries of a learning task into a quantum model. A parametrized circuit is made equivariant when it commutes with a representation of the symmetry group, and a measurement is made invariant in the same way. The tutorial of Ragone et al., Representation Theory for Geometric Quantum Machine Learning, organizes…

Rényi relative entropies $D_\alpha(\rho\|\sigma)$ are one-parameter deformations of the Umegaki relative entropy. In quantum information theory they give the strong converse exponents of hypothesis testing and of channel coding, and the sandwiched Rényi relative entropy

General relativity has no fixed causal structure, and quantum theory has indefiniteness: a theory of quantum gravity may have to be probabilistic about causal structure itself. L. Hardy's causaloid framework addresses this by asking for predictions that make no reference to a background causal order. The 2008 paper Formalism Locality in Quantum Theory and…

Quantum metrology studies how well unknown parameters of a physical process can be estimated when the probe is a quantum system. With $N$ uncorrelated repetitions, or total interrogation time $T$ under noise, the estimation error of a parameter typically scales as $1/\sqrt{T}$ (the standard scaling). Noiseless coherent evolution allows Heisenberg scaling (HS), an…

Schur-Weyl duality says that on $V^{\otimes r}$, with $V=\mathbb C^n$, the general linear group and the symmetric group span each other's commutants. It is the standard route from the representation theory of $\mathfrak S_r$ to that of $\mathrm{GL}_n$. Brauer extended it to orthogonal and symplectic groups, and Benkart, Chakrabarti, Halverson, Leduc, Lee and…

A quantum computer is built from gates acting on one or two qubits, and the two-qubit gates are the expensive ones: they need a physical interaction between qubits, take longer and fail more often than single-qubit gates. Single-qubit gates are comparatively cheap. A question asked by everyone who designs a quantum architecture is therefore: what is left of…

Group schemes of finite type over a field split into two complementary kinds. Affine group schemes are the linear groups, and their theory is extensive. Anti-affine groups are the group schemes $G$ with $\mathcal O(G)=k$: every regular function is constant. Any connected group scheme $G$ has a smallest normal subgroup scheme $G_{\mathrm{ant}}$ with affine quotient,…

Quadratic fermion Hamiltonians $H=\sum C_{ij}b_i^\dagger b_j+\sum(A_{ij}b_i^\dagger b_j^\dagger+\text{h.c.})$ describe BCS superconductivity and the Hubbard model in mean-field approximation, and several exactly solvable spin chains after a Jordan–Wigner transformation. Their ground states, and all their eigenstates with a definite set of quasi-particle…

Qubits that sit close together, closer than the wavelength of the environment modes they couple to, are disturbed by that environment in the same way. The resulting noise is collective decoherence: its error operators are the collective spin operators $S_\alpha=\sum_i\tfrac12\sigma_\alpha^{(i)}$ rather than independent errors on each qubit. Chapter 8 of D. M.…

A weak measurement of a quantum system, or the amplification of a weak signal, always adds noise. The review of Clerk, Devoret, Girvin, Marquardt and Schoelkopf (arXiv:0810.4729, Rev. Mod. Phys. 82, 1155, 2010) derives the size of this unavoidable noise in a linear-response framework that assumes almost nothing about the detector: some stationary quantum…

A non-local unitary transformation of two qubits occurs when some Hamiltonian interaction couples them. Here we characterize the amount, as measured by time, of interaction required to perform two--qubit gates, when also arbitrarily fast, local unitary transformations can be applied on each qubit. The minimal required time of interaction, or interaction…

We generalize the classical shadow tomography scheme to a broad class of finite-depth or finite-time local unitary ensembles, known as locally scrambled quantum dynamics, where the unitary ensemble is invariant under local basis transformations. In this case, the reconstruction map for the classical shadow tomography depends only on the average entanglement…

Ryu and Takayanagi conjectured a formula for the entanglement (von Neumann) entropy of an arbitrary spatial region in an arbitrary holographic field theory. The von Neumann entropy is a special case of a more general class of entropies called Renyi entropies. Using Euclidean gravity, Fursaev computed the entanglement Renyi entropies (EREs) of an arbitrary…

Strong subadditivity of von Neumann entropy, proved in 1973 by Lieb and Ruskai, is a cornerstone of quantum coding theory. All other known inequalities for entropies of quantum systems may be derived from it. Here we prove a new inequality for the von Neumann entropy which we prove is independent of strong subadditivity: it is an inequality which is true…

Motivated by the desire to better understand the class of quantum operations on bipartite systems that preserve positivity of partial transpose (PPT operations) and its relation to the class LOCC (local operations and classical communication), we present some results on deterministic bipartite pure state transformations by PPT operations. Restricting our…

Let G(A,B) denote the 2-qubit gate which acts as the 1-qubit SU(2) gates A and B in the even and odd parity subspaces respectively, of two qubits. Using a Clifford algebra formalism we show that arbitrary uniform families of circuits of these gates, restricted to act only on nearest neighbour (n.n.) qubit lines, can be classically efficiently simulated.…

Self testing is a device independent approach to estimate the state and measurement operators, without the need to assume the dimension of our quantum system. In this paper, we show that one can self test black boxes into any pure entangled two-qubit state, by performing simple Bell type experiments. The approach makes use of only one family of…

Quantum process tomography is a powerful tool for understanding quantum channels and characterizing properties of quantum devices. Inspired by recent advances using classical shadows in quantum state tomography [H.-Y. Huang, R. Kueng, and J. Preskill, Nat. Phys. 16, 1050 (2020).], we have developed ShadowQPT, a classical shadow method for quantum process…

Two quantum information processing protocols are said to be dual under resource reversal if the resources consumed (generated) in one protocol are generated (consumed) in the other. Previously known examples include the duality between entanglement concentration and dilution, and the duality between coherent versions of teleportation and super-dense coding.…