arXiv subjects

Christopher Perry

Publications and source records attributed to Christopher Perry.

16 recordsLinked to original sources

arXiv2026

LocalScore: Local Density-Aware Similarity Scoring for Biometrics

Open-set biometrics faces challenges with probe subjects who may not be enrolled in the gallery, as traditional biometric systems struggle to detect these non-mated probes. Despite the growing prevalence of multi-sample galleries in real-world deployments, most existing methods collapse intra-subject variability into a single global representation, leading to suboptimal decision boundaries and poor open-set robustness. To address this issue, we propose LocalScore, a simple yet effective scoring algorithm that explicitly incorporates the local density of the gallery feature distribution using the k-th nearest neighbors. LocalScore is architecture-agnostic, loss-independent, and incurs negligible computational overhead, making it a plug-and-play solution for existing biometric systems. Extensive experiments across multiple modalities demonstrate that LocalScore consistently achieves substantial gains in open-set retrieval (FNIR@FPIR reduced from 53% to 40%) and verification (TAR@FAR improved from 51% to 74%). We further provide theoretical analysis and empirical validation explaining when and why the method achieves the most significant gains based on dataset characteristics.

cs.CV↗

arXiv2025

Person Recognition at Altitude and Range: Fusion of Face, Body Shape and Gait

We address the problem of whole-body person recognition in unconstrained environments. This problem arises in surveillance scenarios such as those in the IARPA Biometric Recognition and Identification at Altitude and Range (BRIAR) program, where biometric data is captured at long standoff distances, elevated viewing angles, and under adverse atmospheric conditions (e.g., turbulence and high wind velocity). To this end, we propose FarSight, a unified end-to-end system for person recognition that integrates complementary biometric cues across face, gait, and body shape modalities. FarSight incorporates novel algorithms across four core modules: multi-subject detection and tracking, recognition-aware video restoration, modality-specific biometric feature encoding, and quality-guided multi-modal fusion. These components are designed to work cohesively under degraded image conditions, large pose and scale variations, and cross-domain gaps. Extensive experiments on the BRIAR dataset, one of the most comprehensive benchmarks for long-range, multi-modal biometric recognition, demonstrate the effectiveness of FarSight. Compared to our preliminary system, this system achieves a 34.1% absolute gain in 1:1 verification accuracy (TAR@0.1% FAR), a 17.8% increase in closed-set identification (Rank-20), and a 34.3% reduction in open-set identification errors (FNIR@1% FPIR). Furthermore, FarSight was evaluated in the 2025 NIST RTE Face in Video Evaluation (FIVE), which conducts standardized face recognition testing on the BRIAR dataset. These results establish FarSight as a state-of-the-art solution for operational biometric recognition in challenging real-world conditions.

cs.CV↗

arXiv2023

FarSight: A Physics-Driven Whole-Body Biometric System at Large Distance and Altitude

Whole-body biometric recognition is an important area of research due to its vast applications in law enforcement, border security, and surveillance. This paper presents the end-to-end design, development and evaluation of FarSight, an innovative software system designed for whole-body (fusion of face, gait and body shape) biometric recognition. FarSight accepts videos from elevated platforms and drones as input and outputs a candidate list of identities from a gallery. The system is designed to address several challenges, including (i) low-quality imagery, (ii) large yaw and pitch angles, (iii) robust feature extraction to accommodate large intra-person variabilities and large inter-person similarities, and (iv) the large domain gap between training and test sets. FarSight combines the physics of imaging and deep learning models to enhance image restoration and biometric feature encoding. We test FarSight's effectiveness using the newly acquired IARPA Biometric Recognition and Identification at Altitude and Range (BRIAR) dataset. Notably, FarSight demonstrated a substantial performance increase on the BRIAR dataset, with gains of +11.82% Rank-20 identification and +11.3% TAR@1% FAR.

cs.CV↗

arXiv2020

Thermal Operations in general are not memoryless

So-called Thermal Operations seem to describe the most fundamental and reasonable set of operations allowable for state transformations at an ambient inverse temperature $\beta$. However, a priori, they require experimentalists to manipulate very complex environments and have control over their internal degrees of freedom. For this reason, the community has been working on creating more experimentally-friendly operations. In [Perry, et al., Phys. Rev. X 8, 041049], it was shown that for states diagonal in the energy basis, Thermal Operations can be performed by so-called Coarse Operations, which need just one auxiliary qubit but are otherwise Markovian and classical in spirit. In this work, by providing an explicit counterexample, we show that this one qubit of memory is necessary. We also provide almost full characterization (i.e., full, but with one intriguing exception that remains open) of possible transitions that do not require memory in the case where the system is a qubit. We do this by analyzing arbitrary control sequences comprising level energy changes and partial thermalizations in each step.

quant-ph↗

arXiv2020

The semiring of dichotomies and asymptotic relative submajorization

We study quantum dichotomies and the resource theory of asymmetric distinguishability using a generalization of Strassen's theorem on preordered semirings. We find that an asymptotic variant of relative submajorization, defined on unnormalized dichotomies, is characterized by real-valued monotones that are multiplicative under the tensor product and additive under the direct sum. These strong constraints allow us to classify and explicitly describe all such monotones, leading to a rate formula expressed as an optimization involving sandwiched R\'enyi divergences. As an application we give a new derivation of the strong converse error exponent in quantum hypothesis testing.

quant-ph↗

arXiv2018

Heat-Bath Algorithmic Cooling with optimal thermalization strategies

Heat-Bath Algorithmic Cooling is a set of techniques for producing highly pure quantum systems by utilizing a surrounding heat-bath and unitary interactions. These techniques originally used the thermal environment only to fully thermalize ancillas at the environment temperature. Here we extend HBAC protocols by optimizing over the thermalization strategy. We find, for any $d$-dimensional system in an arbitrary initial state, provably optimal cooling protocols with surprisingly simple structure and exponential convergence to the ground state. Compared to the standard ones, these schemes can use fewer or no ancillas and exploit memory effects to enhance cooling. We verify that the optimal protocols are robusts to various deviations from the ideal scenario. For a single target qubit, the optimal protocol can be well approximated with a Jaynes-Cummings interaction between the system and a single thermal bosonic mode for a wide range of environmental temperatures. This admits an experimental implementation close to the setup of a micromaser, with a performance competitive with leading proposals in the literature. The proposed protocol provides an experimental setup that illustrates how non-Markovianity can be harnessed to improve cooling. On the technical side we 1. introduce a new class of states called maximally active states and discuss their thermodynamic significance in terms of optimal unitary control, 2. introduce a new set of thermodynamic processes, called $\beta$-permutations, whose access is sufficient to simulate a generic thermalization process, 3. show how to use abstract toolbox developed within the resource theory approach to thermodynamics to perform challenging optimizations, while combining it with open quantum system dynamics tools to approximate optimal solutions within physically realistic setups.

quant-ph↗

arXiv2018

All unital qubit channels are $4$-noisy operations

We show that any unital qubit channel can be implemented by letting the input system interact unitarily with a $4$-dimensional environment in the maximally mixed state and then tracing out the environment. We also provide an example where the dimension of such an environment has to be at least $3$.

quant-ph↗

arXiv2017

Entanglement fluctuation theorems

Pure state entanglement transformations have been thought of as irreversible, with reversible transformations generally only possible in the limit of many copies. Here, we show that reversible entanglement transformations do not require processing on the many copy level, but can instead be undertaken on individual systems, provided the amount of entanglement which is produced or consumed is allowed to fluctuate. We derive necessary and sufficient conditions for entanglement manipulations in this case. As a corollary, we derive an equation which quantifies the fluctuations of entanglement, which is formally identical to the Jarzynski fluctuation equality found in thermodynamics. One can also relate a forward entanglement transformation to its reverse process in terms of the entanglement cost of such a transformation, in a manner equivalent to the Crooks relation. We show that a strong converse theorem for entanglement transformations is formally related to the second law of thermodynamics, while the fact that the Schmidt rank of an entangled state cannot increase is related to the third law of thermodynamics. Achievability of the protocols is done by introducing an entanglement battery, a device which stores entanglement and uses an amount of entanglement that is allowed to fluctuate but with an average cost which is still optimal. This allows us to also solve the problem of partial entanglement recovery, and in fact, we show that entanglement is fully recovered. Allowing the amount of consumed entanglement to fluctuate also leads to improved and optimal entanglement dilution protocols.

quant-ph↗

arXiv2016

Elementary Thermal Operations

To what extent do thermodynamic resource theories capture physically relevant constraints? Inspired by quantum computation, we define a set of elementary thermodynamic gates that only act on 2 energy levels of a system at a time. We show that this theory is well reproduced by a Jaynes-Cummings interaction in rotating wave approximation and draw a connection to standard descriptions of thermalisation. We then prove that elementary thermal operations present tighter constraints on the allowed transformations than thermal operations. Mathematically, this illustrates the failure at finite temperature of fundamental theorems by Birkhoff and Muirhead-Hardy-Littlewood-Polya concerning stochastic maps. Physically, this implies that stronger constraints than those imposed by single-shot quantities can be given if we tailor a thermodynamic resource theory to the relevant experimental scenario. We provide new tools to do so, including necessary and sufficient conditions for a given change of the population to be possible. As an example, we describe the resource theory of the Jaynes-Cummings model. Finally, we initiate an investigation into how our resource theories can be applied to Heat Bath Algorithmic Cooling protocols.

quant-ph↗

arXiv2016

Clean quantum and classical communication protocols

By how much must the communication complexity of a function increase if we demand that the parties not only correctly compute the function but also return all registers (other than the one containing the answer) to their initial states at the end of the communication protocol? Protocols that achieve this are referred to as clean and the associated cost as the clean communication complexity. Here we present clean protocols for calculating the Inner Product of two $n$-bit strings, showing that (in the absence of pre-shared entanglement) at most $n+3$ qubits or $n+O(\sqrt{n})$ bits of communication are required. The quantum protocol provides inspiration for obtaining the optimal method to implement distributed CNOT gates in parallel whilst minimizing the amount of quantum communication. For more general functions, we show that nearly all Boolean functions require close to $2n$ bits of classical communication to compute and close to $n$ qubits if the parties have access to pre-shared entanglement. Both of these values are maximal for their respective paradigms.

quant-ph↗

arXiv2016

The second law of quantum thermodynamics as an equality

We investigate the connection between recent results in quantum thermodynamics and fluctuation relations by adopting a fully quantum mechanical description of thermodynamics. By including a work system whose energy is allowed to fluctuate, we derive a set of equalities which all thermodynamical transitions have to satisfy. This extends the condition for maps to be Gibbs-preserving to the case of fluctuating work, providing a more general characterisation of maps commonly used in the information theoretic approach to thermodynamics. For final states, block diagonal in the energy basis, this set of equalities are necessary and sufficient conditions for a thermodynamical state transition to be possible. The conditions serves as a parent equation which can be used to derive a number of results. These include writing the second law of thermodynamics as an equality featuring a fine-grained notion of the free energy. It also yields a generalisation of the Jarzynski fluctuation theorem which holds for arbitrary initial states, and under the most general manipulations allowed by the laws of quantum mechanics. Furthermore, we show that each of these relations can be seen as the quasi-classical limit of three fully quantum identities. This allows us to consider the free energy as an operator, and allows one to obtain more general and fully quantum fluctuation relations from the information theoretic approach to quantum thermodynamics.

quant-ph↗

arXiv2015

Doubly infinite separation of quantum information and communication

We prove the existence of (one-way) communication tasks with a subconstant versus superconstant asymptotic gap, which we call "doubly infinite," between their quantum information and communication complexities. We do so by studying the exclusion game [C. Perry et al., Phys. Rev. Lett. 115, 030504 (2015)] for which there exist instances where the quantum information complexity tends to zero as the size of the input $n$ increases. By showing that the quantum communication complexity of these games scales at least logarithmically in $n$, we obtain our result. We further show that the established lower bounds and gaps still hold even if we allow a small probability of error. However in this case, the $n$-qubit quantum message of the zero-error strategy can be compressed polynomially.

quant-ph↗

arXiv2015

What is the probability of a thermodynamical transition?

If the second law of thermodynamics forbids a transition from one state to another, then it is still possible to make the transition happen by using a sufficient amount of work. But if we do not have access to this amount of work, can the transition happen probabilistically? In the thermodynamic limit, this probability tends to zero, but here we find that for finite-sized systems, it can be finite. We compute the maximum probability of a transition or a thermodynamical fluctuation from any initial state to any final state, and show that this maximum can be achieved for any final state which is block-diagonal in the energy eigenbasis. We also find upper and lower bounds on this transition probability, in terms of the work of transition. As a bi-product, we introduce a finite set of thermodynamical monotones related to the thermo-majorization criteria which governs state transitions, and compute the work of transition in terms of them. The trade-off between the probability of a transition, and any partial work added to aid in that transition is also considered. Our results have applications in entanglement theory, and we find the amount of entanglement required (or gained) when transforming one pure entangled state into any other.

quant-ph↗

arXiv2014

Communication tasks with infinite quantum-classical separation

Quantum resources can be more powerful than classical resources - a quantum computer can solve certain problems exponentially faster than a classical computer, and computing a function of two people's inputs can be done with exponentially less communication with quantum messages than with classical ones. Here we consider a task between two players, Alice and Bob where quantum resources are infinitely more powerful than classical ones. Alice is given a string of length n, and Bob's task is to exclude certain combinations of bits that Alice might have. If Alice must send classical messages, then she must reveal nearly n bits of information to Bob, but if she is allowed to send quantum bits, the amount of information she must reveal goes to zero with increasing n. Next, we consider a version of the task where the parties can only send classical messages but may have access to entanglement. When assisted by entanglement, Alice only needs to send a constant number of bits, while without entanglement, the number of bits Alice must send grows linearly with n. The task is related to the PBR theorem which arises in the context of the foundations of quantum theory.

quant-ph↗

arXiv2013

Compatibility of state assignments and pooling of information

We say that two (or more) state assignments for one and the same quantum system are compatible if they could represent the assignments of observers with differing information about the system. A criterion for compatibility was proposed in [Phys. Rev. A 65, 032315 (2002)]; however, this leaves unanswered the question of whether there are degrees of compatibility which could be represented by some quantitative measure, and whether there is a straightforward procedure whereby the observers can pool their information to arrive at a unique joint state assignment. We argue that such measures are only sensible given some assumption about what kind of information was used in making the state assignments in the first place, and that in general state assignments do not represent all of the information possessed by the observers. However, we examine one particular measure, and show that it has a straightforward interpretation, assuming that the information was acquired from a particular type of measurement, and that in this case there is a natural rule for pooling information. We extend this measure to compatibility of states for k observers, and show that the value is the solution to a semidefinite program. Similar compatibility measures can be defined for alternative notions of state compatibility, including Post-Peierls (PP) and Equal Support (ES) compatibility.

quant-ph↗

arXiv2013

Conclusive Exclusion of Quantum States

In the task of quantum state exclusion we consider a quantum system, prepared in a state chosen from a known set. The aim is to perform a measurement on the system which can conclusively rule that a subset of the possible preparation procedures can not have taken place. We ask what conditions the set of states must obey in order for this to be possible and how well we can complete the task when it is not. The task of quantum state discrimination forms a subclass of this set of problems. Within this paper we formulate the general problem as a Semidefinite Program (SDP), enabling us to derive sufficient and necessary conditions for a measurement to be optimal. Furthermore, we obtain a necessary condition on the set of states for exclusion to be achievable with certainty and give a construction for a lower bound on the probability of error. This task of conclusively excluding states has gained importance in the context of the foundations of quantum mechanics due to a result of Pusey, Barrett and Rudolph (PBR). Motivated by this, we use our SDP to derive a bound on how well a class of hidden variable models can perform at a particular task, proving an analogue of Tsirelson's bound for the PBR experiment and the optimality of a measurement given by PBR in the process. We also introduce variations of conclusive exclusion, including unambiguous state exclusion, and state exclusion with worst case error.

quant-ph↗