Oscillatory Tunnel Splittings in Spin Systems: A Discrete Wentzel-Kramers-Brillouin Approach

Certain spin Hamiltonians that give rise to tunnel splittings that are viewed in terms of interfering instanton trajectories, are restudied using a discrete WKB method, that is more elementary, and also yields wavefunctions and preexponential factors for the splittings. A novel turning point inside the classically forbidden region is analysed, and a general formula is obtained for the splittings. The result is appled to the \Fe8 system. A previous result for the oscillation of the ground state splitting with external magnetic field is extended to higher levels.Comment: RevTex, one ps figur

Fair and Efficient Allocations under Subadditive Valuations

We study the problem of allocating a set of indivisible goods among agents with subadditive valuations in a fair and efficient manner. Envy-Freeness up to any good (EFX) is the most compelling notion of fairness in the context of indivisible goods. Although the existence of EFX is not known beyond the simple case of two agents with subadditive valuations, some good approximations of EFX are known to exist, namely $\tfrac{1}{2}$-EFX allocation and EFX allocations with bounded charity. Nash welfare (the geometric mean of agents' valuations) is one of the most commonly used measures of efficiency. In case of additive valuations, an allocation that maximizes Nash welfare also satisfies fairness properties like Envy-Free up to one good (EF1). Although there is substantial work on approximating Nash welfare when agents have additive valuations, very little is known when agents have subadditive valuations. In this paper, we design a polynomial-time algorithm that outputs an allocation that satisfies either of the two approximations of EFX as well as achieves an $\mathcal{O}(n)$ approximation to the Nash welfare. Our result also improves the current best-known approximation of $\mathcal{O}(n \log n)$ and $\mathcal{O}(m)$ to Nash welfare when agents have submodular and subadditive valuations, respectively. Furthermore, our technique also gives an $\mathcal{O}(n)$ approximation to a family of welfare measures, $p$-mean of valuations for $p\in (-\infty, 1]$, thereby also matching asymptotically the current best known approximation ratio for special cases like $p =-\infty$ while also retaining the fairness properties

EFX exists for three agents

We study the problem of distributing a set of indivisible items among agents with additive valuations in a $\mathit{fair}$ manner. The fairness notion under consideration is Envy-freeness up to any item (EFX). Despite significant efforts by many researchers for several years, the existence of EFX allocations has not been settled beyond the simple case of two agents. In this paper, we show constructively that an EFX allocation always exists for three agents. Furthermore, we falsify the conjecture by Caragiannis et al. by showing an instance with three agents for which there is a partial EFX allocation (some items are not allocated) with higher Nash welfare than that of any complete EFX allocation

On Fair Division of Indivisible Items

We consider the task of assigning indivisible goods to a set of agents in a fair manner. Our notion of fairness is Nash social welfare, i.e., the goal is to maximize the geometric mean of the utilities of the agents. Each good comes in multiple items or copies, and the utility of an agent diminishes as it receives more items of the same good. The utility of a bundle of items for an agent is the sum of the utilities of the items in the bundle. Each agent has a utility cap beyond which he does not value additional items. We give a polynomial time approximation algorithm that maximizes Nash social welfare up to a factor of $e^{1/e} \approx 1.445$

Magnetic Field Dependence of Macroscopic Quantum Tunneling and Coherence of Ferromagnetic Particle

We calculate the quantum tunneling rate of a ferromagnetic particle of $\sim 100 \AA$ diameter in a magnetic field of arbitrary angle. We consider the magnetocrystalline anisotropy with the biaxial symmetry and that with the tetragonal symmetry. Using the spin-coherent-state path integral, we obtain approximate analytic formulas of the tunneling rates in the small $\epsilon (=1- H/H_c)$-limit for the magnetic field normal to the easy axis ($\theta_H = \pi/2$), for the field opposite to the initial easy axis ($\theta_H = \pi$), and for the field at an angle between these two orientations ($\pi/2 << \theta_H << \pi$). In addition, we obtain numerically the tunneling rates for the biaxial symmetry in the full range of the angle $\theta_H$ of the magnetic field ($\pi/2 < \theta_H \leq \pi$), for the values of \epsilon =0.01 and 0.001.Comment: 25 pages of text (RevTex) and 4 figures (PostScript files), to be published in Phys. Rev.

Quantum Lightning Never Strikes the Same State Twice

Public key quantum money can be seen as a version of the quantum no-cloning theorem that holds even when the quantum states can be verified by the adversary. In this work, investigate quantum lightning, a formalization of "collision-free quantum money" defined by Lutomirski et al. [ICS'10], where no-cloning holds even when the adversary herself generates the quantum state to be cloned. We then study quantum money and quantum lightning, showing the following results: - We demonstrate the usefulness of quantum lightning by showing several potential applications, such as generating random strings with a proof of entropy, to completely decentralized cryptocurrency without a block-chain, where transactions is instant and local. - We give win-win results for quantum money/lightning, showing that either signatures/hash functions/commitment schemes meet very strong recently proposed notions of security, or they yield quantum money or lightning. - We construct quantum lightning under the assumed multi-collision resistance of random degree-2 systems of polynomials. - We show that instantiating the quantum money scheme of Aaronson and Christiano [STOC'12] with indistinguishability obfuscation that is secure against quantum computers yields a secure quantum money schem

Competitive Allocation of a Mixed Manna

We study the fair division problem of allocating a mixed manna under additively separable piecewise linear concave (SPLC) utilities. A mixed manna contains goods that everyone likes and bads that everyone dislikes, as well as items that some like and others dislike. The seminal work of Bogomolnaia et al. [Econometrica'17] argue why allocating a mixed manna is genuinely more complicated than a good or a bad manna, and why competitive equilibrium is the best mechanism. They also provide the existence of equilibrium and establish its peculiar properties (e.g., non-convex and disconnected set of equilibria even under linear utilities), but leave the problem of computing an equilibrium open. This problem remained unresolved even for only bad manna under linear utilities. Our main result is a simplex-like algorithm based on Lemke's scheme for computing a competitive allocation of a mixed manna under SPLC utilities, a strict generalization of linear. Experimental results on randomly generated instances suggest that our algorithm will be fast in practice. The problem is known to be PPAD-hard for the case of good manna, and we also show a similar result for the case of bad manna. Given these PPAD-hardness results, designing such an algorithm is the only non-brute-force (non-enumerative) option known, e.g., the classic Lemke-Howson algorithm (1964) for computing a Nash equilibrium in a 2-player game is still one of the most widely used algorithms in practice. Our algorithm also yields several new structural properties as simple corollaries. We obtain a (constructive) proof of existence for a far more general setting, membership of the problem in PPAD, rational-valued solution, and odd number of solutions property. The last property also settles the conjecture of Bogomolnaia et al. in the affirmative

Quantum Nucleation in a Ferromagnetic Film Placed in a Magnetic Field at an Arbitrary Angle

We study the quantum nucleation in a thin ferromagnetic film placed in a magnetic field at an arbitrary angle. The dependence of the quantum nucleation and the temperature of the crossover from thermal to quantum regime on the direction and the strength of the applied field are presented. It is found that the maximal value of the rate and that of the crossover temperature are obtained at a some angle with the magnetic field, not in the direction of the applied field opposite to the initial easy axis.Comment: 15 pages, RevTex, 3 PostScript figures. To appear in Phys. Rev.