Searcharxiv⌕ Search

arXiv subjects

A. J. Scott

Publications and source records attributed to A. J. Scott.

At least 19 recordsLinked to original sources
arXiv2017

SICs: Extending the list of solutions

Zauner's conjecture asserts that $d^2$ equiangular lines exist in all $d$ complex dimensions. In quantum theory, the $d^2$ lines are dubbed a SIC, as they define a favoured standard informationally complete quantum measurement called a SIC-POVM. This note supplements A. J. Scott and M. Grassl [J. Math. Phys. 51 (2010), 042203] by extending the list of published numerical solutions. We provide a putative complete list of Weyl-Heisenberg covariant SICs with the known symmetries in dimensions $d\leq 90$, a single solution with Zauner's symmetry for every $d\leq 121$ and solutions with higher symmetry for $d=124,143,147,168,172,195,199,228,259$ and $323$.

quant-ph↗
arXiv2010

Replacing Quantum Feedback with Open-Loop Control and Quantum Filtering

Feedback control protocols can stabilize and enhance the operation of quantum devices, however, unavoidable delays in the feedback loop adversely affect their performance. We introduce a quantum control methodology, combining open-loop control with quantum filtering, which is not constrained by feedback delays. For the problems studied (rapid purification and rapid measurement) we analytically derive lower bounds on the control performance that are comparable with the best corresponding bounds for feedback protocols.

quant-ph↗
arXiv2009

SIC-POVMs: A new computer study

We report on a new computer study into the existence of d^2 equiangular lines in d complex dimensions. Such maximal complex projective codes are conjectured to exist in all finite dimensions and are the underlying mathematical objects defining symmetric informationally complete measurements in quantum theory. We provide numerical solutions in all dimensions d <= 67 and, moreover, a putatively complete list of Weyl-Heisenberg covariant solutions for d <= 50. A symmetry analysis of this list leads to new algebraic solutions in dimensions d = 24, 35 and 48, which are given together with algebraic solutions for d = 4,..., 15 and 19.

quant-ph↗
arXiv2008

Unitary designs and codes

A unitary design is a collection of unitary matrices that approximate the entire unitary group, much like a spherical design approximates the entire unit sphere. In this paper, we use irreducible representations of the unitary group to find a general lower bound on the size of a unitary t-design in U(d), for any d and t. We also introduce the notion of a unitary code - a subset of U(d) in which the trace inner product of any pair of matrices is restricted to only a small number of distinct values - and give an upper bound for the size of a code of degree s in U(d) for any d and s. These bounds can be strengthened when the particular inner product values that occur in the code or design are known. Finally, we describe some constructions of designs: we give an upper bound on the size of the smallest weighted unitary t-design in U(d), and we catalogue some t-designs that arise from finite groups.

math.CO↗
arXiv2008

Generic local distinguishability and completely entangled subspaces

A subspace of a multipartite Hilbert space is completely entangled if it contains no product states. Such subspaces can be large with a known maximum size, S, approaching the full dimension of the system, D. We show that almost all subspaces with dimension less than or equal to S are completely entangled, and then use this fact to prove that n random pure quantum states are unambiguously locally distinguishable if and only if n does not exceed D-S. This condition holds for almost all sets of states of all multipartite systems, and reveals something surprising. The criterion is identical for separable and for nonseparable states: entanglement makes no difference.

quant-ph↗
arXiv2008

Optimizing quantum process tomography with unitary 2-designs

We show that weighted unitary 2-designs define optimal measurements on the system-ancilla output state for ancilla-assisted process tomography of unital quantum channels. Examples include complete sets of mutually unbiased unitary-operator bases. Each of these specifies a minimal series of optimal orthogonal measurements. General quantum channels are also considered.

quant-ph↗
arXiv2008

Teleportation fidelity as a probe of sub-Planck phase-space structure

We investigate the connection between sub-Planck structure in the Wigner function and the output fidelity of continuous-variable teleportation protocols. When the teleporting parties share a two-mode squeezed state as an entangled resource, high fidelity in the output state requires a squeezing large enough that the smallest sub-Planck structures in an input pure state are teleported faithfully. We formulate this relationship, which leads to an explicit relation between the fine-scale structure in the Wigner function and large-scale extent of the Wigner function, and we treat specific examples, including coherent, number, and random states and states produced by chaotic dynamics. We generalize the pure-state results to teleportation of mixed states.

quant-ph↗
arXiv2007

Weighted complex projective 2-designs from bases: optimal state determination by orthogonal measurements

We introduce the problem of constructing weighted complex projective 2-designs from the union of a family of orthonormal bases. If the weight remains constant across elements of the same basis, then such designs can be interpreted as generalizations of complete sets of mutually unbiased bases, being equivalent whenever the design is composed of d+1 bases in dimension d. We show that, for the purpose of quantum state determination, these designs specify an optimal collection of orthogonal measurements. Using highly nonlinear functions on abelian groups, we construct explicit examples from d+2 orthonormal bases whenever d+1 is a prime power, covering dimensions d=6, 10, and 12, for example, where no complete sets of mutually unbiased bases have thus far been found.

quant-ph↗
arXiv2006

Hypersensitivity and chaos signatures in the quantum baker's maps

Classical chaotic systems are distinguished by their sensitive dependence on initial conditions. The absence of this property in quantum systems has lead to a number of proposals for perturbation-based characterizations of quantum chaos, including linear growth of entropy, exponential decay of fidelity, and hypersensitivity to perturbation. All of these accurately predict chaos in the classical limit, but it is not clear that they behave the same far from the classical realm. We investigate the dynamics of a family of quantizations of the baker's map, which range from a highly entangling unitary transformation to an essentially trivial shift map. Linear entropy growth and fidelity decay are exhibited by this entire family of maps, but hypersensitivity distinguishes between the simple dynamics of the trivial shift map and the more complicated dynamics of the other quantizations. This conclusion is supported by an analytical argument for short times and numerical evidence at later times.

quant-ph↗
arXiv2006

Tight informationally complete quantum measurements

We introduce a class of informationally complete positive-operator-valued measures which are, in analogy with a tight frame, "as close as possible" to orthonormal bases for the space of quantum states. These measures are distinguished by an exceptionally simple state-reconstruction formula which allows "painless" quantum state tomography. Complete sets of mutually unbiased bases and symmetric informationally complete positive-operator-valued measures are both members of this class, the latter being the unique minimal rank-one members. Recast as ensembles of pure quantum states, the rank-one members are in fact equivalent to weighted 2-designs in complex projective space. These measures are shown to be optimal for quantum cloning and linear quantum state tomography.

quant-ph↗
arXiv2006

Optimal fingerprinting strategies with one-sided error

Fingerprinting enables two parties to infer whether the messages they hold are the same or different when the cost of communication is high: each message is associated with a smaller fingerprint and comparisons between messages are made in terms of their fingerprints alone. In the simultaneous message passing model, it is known that fingerprints composed of quantum information can be made exponentially smaller than those composed of classical information. For small message lengths, we present constructions of optimal classical fingerprinting strategies with one-sided error, in both the one-way and simultaneous message passing models, and provide bounds on the worst-case error probability with the help of extremal set theory. The performance of these protocols is then compared to that for quantum fingerprinting strategies constructed from spherical codes, equiangular tight frames and mutually unbiased bases.

quant-ph↗
arXiv2006

Probabilities of failure for quantum error correction

We investigate the performance of a quantum error-correcting code when pushed beyond its intended capacity to protect information against errors, presenting formulae for the probability of failure when the errors affect more qudits than that specified by the code's minimum distance. Such formulae provide a means to rank different codes of the same minimum distance. We consider both error detection and error correction, treating explicit examples in the case of stabilizer codes constructed from qubits and encoding a single qubit.

quant-ph↗
arXiv2005

Classical and quantum fingerprinting with shared randomness and one-sided error

Within the simultaneous message passing model of communication complexity, under a public-coin assumption, we derive the minimum achievable worst-case error probability of a classical fingerprinting protocol with one-sided error. We then present entanglement-assisted quantum fingerprinting protocols attaining worst-case error probabilities that breach this bound.

quant-ph↗
arXiv2004

Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions

We investigate the average bipartite entanglement, over all possible divisions of a multipartite system, as a useful measure of multipartite entanglement. We expose a connection between such measures and quantum-error-correcting codes by deriving a formula relating the weight distribution of the code to the average entanglement of encoded states. Multipartite entangling power of quantum evolutions is also investigated.

quant-ph↗
arXiv2003

Symmetric Informationally Complete Quantum Measurements

We consider the existence in arbitrary finite dimensions d of a POVM comprised of d^2 rank-one operators all of whose operator inner products are equal. Such a set is called a ``symmetric, informationally complete'' POVM (SIC-POVM) and is equivalent to a set of d^2 equiangular lines in C^d. SIC-POVMs are relevant for quantum state tomography, quantum cryptography, and foundational issues in quantum mechanics. We construct SIC-POVMs in dimensions two, three, and four. We further conjecture that a particular kind of group-covariant SIC-POVM exists in arbitrary dimensions, providing numerical results up to dimension 45 to bolster this claim.

quant-ph↗
arXiv2003

Entangling power of the quantum baker's map

We investigate entanglement production in a class of quantum baker's maps. The dynamics of these maps is constructed using strings of qubits, providing a natural tensor-product structure for application of various entanglement measures. We find that, in general, the quantum baker's maps are good at generating entanglement, producing multipartite entanglement amongst the qubits close to that expected in random states. We investigate the evolution of several entanglement measures: the subsystem linear entropy, the concurrence to characterize entanglement between pairs of qubits, and two proposals for a measure of multipartite entanglement. Also derived are some new analytical formulae describing the levels of entanglement expected in random pure states.

quant-ph↗
arXiv2002

The classical limit for a class of quantum baker's maps

We show that the class of quantum baker's maps defined by Schack and Caves have the proper classical limit provided the number of momentum bits approaches infinity. This is done by deriving a semi-classical approximation to the coherent-state propagator.

quant-ph↗