Enhanced tracking and recognition of moving objects by reasoning about spatio-temporal continuity.

A framework for the logical and statistical analysis and annotation of dynamic scenes containing occlusion and other uncertainties is presented. This framework consists of three elements; an object tracker module, an object recognition/classification module and a logical consistency, ambiguity and error reasoning engine. The principle behind the object tracker and object recognition modules is to reduce error by increasing ambiguity (by merging objects in close proximity and presenting multiple hypotheses). The reasoning engine deals with error, ambiguity and occlusion in a unified framework to produce a hypothesis that satisfies fundamental constraints on the spatio-temporal continuity of objects. Our algorithm finds a globally consistent model of an extended video sequence that is maximally supported by a voting function based on the output of a statistical classifier. The system results in an annotation that is significantly more accurate than what would be obtained by frame-by-frame evaluation of the classifier output. The framework has been implemented and applied successfully to the analysis of team sports with a single camera. Key words: Visua

Checklist of the spiders (Araneae) of British Columbia

In 2006, Royal British Columbia Museum (RBCM; Victoria, British Columbia) researchers began systematically documenting the full diversity of British Columbia’s spider fauna. Initially, museum specimens and literature records were used to update an existing checklist and identify poorly sampled habitats in British Columbia. Annual field surveys of spiders, primarily targeting alpine and subalpine habitats, began in 2008; barcode identification of previously unidentifiable specimens commenced in 2012. These efforts have resulted in significant increases in the area of British Columbia that has been sampled for spiders, the number of species documented in the British Columbia checklist, and the number of specimens in the RBCM collection. Many of the additions to the checklist represent the first Canadian or Nearctic records of those taxa or are undescribed species. The number of species recorded in British Columbia has climbed from 212 in 1967 to 902 in 2021. Here, we present distributions for those taxa by ecoprovince and highlight the need for additional sampling efforts. The lack of conservation concern regarding spiders relative to other taxa is notable, particularly in light of the fact that more than 40% (357) of the native species of spiders in the province are represented by five or fewer collection records. The progress of the RBCM’s work has made the institution an important repository of western Nearctic spiders and shows that British Columbia is an important area of Nearctic spider diversity

Quantum identification system

A secure quantum identification system combining a classical identification procedure and quantum key distribution is proposed. Each identification sequence is always used just once and new sequences are ``refuelled'' from a shared provably secret key transferred through the quantum channel. Two identification protocols are devised. The first protocol can be applied when legitimate users have an unjammable public channel at their disposal. The deception probability is derived for the case of a noisy quantum channel. The second protocol employs unconditionally secure authentication of information sent over the public channel, and thus it can be applied even in the case when an adversary is allowed to modify public communications. An experimental realization of a quantum identification system is described.Comment: RevTeX, 4 postscript figures, 9 pages, submitted to Physical Review

The 50% advanced information rule of the quantum algorithms

The oracle chooses a function out of a known set of functions and gives to the player a black box that, given an argument, evaluates the function. The player should find out a certain character of the function through function evaluation. This is the typical problem addressed by the quantum algorithms. In former theoretical work, we showed that a quantum algorithm requires the number of function evaluations of a classical algorithm that knows in advance 50% of the information that specifies the solution of the problem. Here we check that this 50% rule holds for the main quantum algorithms. In the structured problems, a classical algorithm with the advanced information, to identify the missing information should perform one function evaluation. The speed up is exponential since a classical algorithm without advanced information should perform an exponential number of function evaluations. In unstructured database search, a classical algorithm that knows in advance 50% of the n bits of the database location, to identify the n/2 missing bits should perform Order(2 power n/2) function evaluations. The speed up is quadratic since a classical algorithm without advanced information should perform Order(2 power n) function evaluations. The 50% rule identifies the problems solvable with a quantum sped up in an entirely classical way, in fact by comparing two classical algorithms, with and without the advanced information.Comment: 18 pages, submitted with minor changes to the International Journal of Theoretical Physic

Interaction-free generation of entanglement

In this paper, we study how to generate entanglement by interaction-free measurement. Using Kwiat et al.'s interferometer, we construct a two-qubit quantum gate that changes a particle's trajectory according to the other particle's trajectory. We propose methods for generating the Bell state from an electron and a positron and from a pair of photons by this gate. We also show that using this gate, we can carry out the Bell measurement with the probability of 3/4 at the maximum and execute a controlled-NOT operation by the method proposed by Gottesman and Chuang with the probability of 9/16 at the maximum. We estimate the success probability for generating the Bell state by our procedure under imperfect interaction.Comment: 18 pages, Latex2e, 11 eps figures, v2: minor corrections and one reference added, v3: a minor correctio

Evolution of cosmic string configurations

We extend and develop our previous work on the evolution of a network of cosmic strings. The new treatment is based on an analysis of the probability distribution of the end-to-end distance of a randomly chosen segment of left-moving string of given length. The description involves three distinct length scales: $\xi$, related to the overall string density, $\bar\xi$, the persistence length along the string, and $\zeta$, describing the small-scale structure, which is an important feature of the numerical simulations that have been done of this problem. An evolution equation is derived describing how the distribution develops in time due to the combined effects of the universal expansion, of intercommuting and loop formation, and of gravitational radiation. With plausible assumptions about the unknown parameters in the model, we confirm the conclusions of our previous study, that if gravitational radiation and small-scale structure effects are neglected, the two dominant length scales both scale in proportion to the horizon size. When the extra effects are included, we find that while $\xi$ and $\bar\xi$ grow, $\zeta$ initially does not. Eventually, however, it does appear to scale, at a much lower level, due to the effects of gravitational back-reaction.Comment: 61 pages, requires RevTex v3.0, SUSSEX-TH-93/3-4, IMPERIAL/TP/92-93/4

Improved Bounds on Quantum Learning Algorithms

In this article we give several new results on the complexity of algorithms that learn Boolean functions from quantum queries and quantum examples. Hunziker et al. conjectured that for any class C of Boolean functions, the number of quantum black-box queries which are required to exactly identify an unknown function from C is $O(\frac{\log |C|}{\sqrt{{\hat{\gamma}}^{C}}})$, where $\hat{\gamma}^{C}$ is a combinatorial parameter of the class C. We essentially resolve this conjecture in the affirmative by giving a quantum algorithm that, for any class C, identifies any unknown function from C using $O(\frac{\log |C| \log \log |C|}{\sqrt{{\hat{\gamma}}^{C}}})$ quantum black-box queries. We consider a range of natural problems intermediate between the exact learning problem (in which the learner must obtain all bits of information about the black-box function) and the usual problem of computing a predicate (in which the learner must obtain only one bit of information about the black-box function). We give positive and negative results on when the quantum and classical query complexities of these intermediate problems are polynomially related to each other. Finally, we improve the known lower bounds on the number of quantum examples (as opposed to quantum black-box queries) required for $(\epsilon,\delta)$-PAC learning any concept class of Vapnik-Chervonenkis dimension d over the domain $\{0,1\}^n$ from $\Omega(\frac{d}{n})$ to $\Omega(\frac{1}{\epsilon}\log \frac{1}{\delta}+d+\frac{\sqrt{d}}{\epsilon})$. This new lower bound comes closer to matching known upper bounds for classical PAC learning.Comment: Minor corrections. 18 pages. To appear in Quantum Information Processing. Requires: algorithm.sty, algorithmic.sty to buil

Black Holes from Nucleating Strings

We evaluate the probability that a loop of string that has spontaneously nucleated during inflation will form a black hole upon collapse, after the end of inflation. We then use the observational bounds on the density of primordial black holes to put constraints on the parameters of the model. Other constraints from the distortions of the microwave background and emission of gravitational radiation by the loops are considered. Also, observational constraints on domain wall nucleation and monopole pair production during inflation are briefly discussed.Comment: 27 pages, tutp-92-

All Inequalities for the Relative Entropy

The relative entropy of two n-party quantum states is an important quantity exhibiting, for example, the extent to which the two states are different. The relative entropy of the states formed by reducing two n-party to a smaller number $m$ of parties is always less than or equal to the relative entropy of the two original n-party states. This is the monotonicity of relative entropy. Using techniques from convex geometry, we prove that monotonicity under restrictions is the only general inequality satisfied by relative entropies. In doing so we make a connection to secret sharing schemes with general access structures. A suprising outcome is that the structure of allowed relative entropy values of subsets of multiparty states is much simpler than the structure of allowed entropy values. And the structure of allowed relative entropy values (unlike that of entropies) is the same for classical probability distributions and quantum states.Comment: 15 pages, 3 embedded eps figure

Analysis of Generalized Grover's Quantum Search Algorithms Using Recursion Equations

The recursion equation analysis of Grover's quantum search algorithm presented by Biham et al. [PRA 60, 2742 (1999)] is generalized. It is applied to the large class of Grover's type algorithms in which the Hadamard transform is replaced by any other unitary transformation and the phase inversion is replaced by a rotation by an arbitrary angle. The time evolution of the amplitudes of the marked and unmarked states, for any initial complex amplitude distribution is expressed using first order linear difference equations. These equations are solved exactly. The solution provides the number of iterations T after which the probability of finding a marked state upon measurement is the highest, as well as the value of this probability, P_max. Both T and P_max are found to depend on the averages and variances of the initial amplitude distributions of the marked and unmarked states, but not on higher moments.Comment: 8 pages, no figures. To appear in Phys. Rev.