SearcharxivSearch

arXiv subjects

Jeffrey Yang

Publications and source records attributed to Jeffrey Yang.

3 recordsLinked to original sources

An Improved Upper Bound on the Threshold Bias of the Oriented-cycle Game

We study the $b$-biased Oriented-cycle game where two players, OMaker and OBreaker, take turns directing the edges of $K_n$ (the complete graph on $n$ vertices). In each round, OMaker directs one previously undirected edge followed by OBreaker directing between one and $b$ previously undirected edges. The game ends once all edges have been directed, and OMaker wins if and only if the resulting tournament contains a directed cycle. Bollob\'as and Szab\'o asked the following question: what is the largest value of the bias $b$ for which OMaker has a winning strategy? Ben-Eliezer, Krivelevich and Sudakov proved that OMaker has a winning strategy for $b \leq n/2 - 2$. In the other direction, Clemens and Liebenau proved that OBreaker has a winning strategy for $b \geq 5n/6+2$. Inspired by their approach, we propose a significantly stronger strategy for OBreaker which we prove to be winning for $b \geq 0.7841n + O(1)$.

math.CO

Scalable low loss cryogenic packaging of quantum memories in CMOS-foundry processed photonic chips

Optically linked solid-state quantum memories such as color centers in diamond are a promising platform for distributed quantum information processing and networking. Photonic integrated circuits (PICs) have emerged as a crucial enabling technology for these systems, integrating quantum memories with efficient electrical and optical interfaces in a compact and scalable platform. Packaging these hybrid chips into deployable modules while maintaining low optical loss and resiliency to temperature cycling is a central challenge to their practical use. We demonstrate a packaging method for PICs using surface grating couplers and angle-polished fiber arrays that is robust to temperature cycling, offers scalable channel count, applies to a wide variety of PIC platforms and wavelengths, and offers pathways to automated high-throughput packaging. Using this method, we show optically and electrically packaged quantum memory modules integrating all required qubit controls on chip, operating at millikelvin temperatures with < 3dB losses achievable from fiber to quantum memory.

quant-ph

Tradeoffs and Comparison Complexity

Using theory and experiments, this paper shows that the difficulty of making tradeoffs offers a parsimonious explanation for a wide range of behavioral phenomena. We develop a model of imprecise comparisons applicable to multiattribute, lottery, and intertemporal choice, which formalizes the idea that comparisons are difficult when they involve pronounced tradeoffs. Our model rationalizes a range of documented regularities, such as context effects, preference reversals, apparent probability weighting and hyperbolic discounting, and generates novel implications for behavior. We assess the explanatory power of our model in a series of choice experiments. Our model explains a large share of the variation in choice inconsistency across problems, and we document that manipulating tradeoffs reverses classic behavioral regularities, in line with its predictions.

econ.GN