arXiv subjects

C. H. Bennett

Publications and source records attributed to C. H. Bennett.

6 recordsLinked to original sources

arXiv2019

Maximized Lateral Inhibition in Paired Magnetic Domain Wall Racetracks for Neuromorphic Computing

Lateral inhibition is an important functionality in neuromorphic computing, modeled after the biological neuron behavior that a firing neuron deactivates its neighbors belonging to the same layer and prevents them from firing. In most neuromorphic hardware platforms lateral inhibition is implemented by external circuitry, thereby decreasing the energy efficiency and increasing the area overhead of such systems. Recently, the domain wall -- magnetic tunnel junction (DW-MTJ) artificial neuron is demonstrated in modeling to be inherently inhibitory. Without peripheral circuitry, lateral inhibition in DW-MTJ neurons results from magnetostatic interaction between neighboring neuron cells. However, the lateral inhibition mechanism in DW-MTJ neurons has not been studied thoroughly, leading to weak inhibition only in very closely-spaced devices. This work approaches these problems by modeling current- and field- driven DW motion in a pair of adjacent DW-MTJ neurons. We maximize the magnitude of lateral inhibition by tuning the magnetic interaction between the neurons. The results are explained by current-driven DW velocity characteristics in response to external magnetic field and quantified by an analytical model. Finally, the dependence of lateral inhibition strength on device parameters is investigated. This provides a guideline for the optimization of lateral inhibition implementation in DW-MTJ neurons. With strong lateral inhibition achieved, a path towards competitive learning algorithms such as the winner-take-all are made possible on such neuromorphic devices.

physics.app-ph↗

arXiv2002

On the capacities of bipartite Hamiltonians and unitary gates

We consider interactions as bidirectional channels. We investigate the capacities for interaction Hamiltonians and nonlocal unitary gates to generate entanglement and transmit classical information. We give analytic expressions for the entanglement generating capacity and entanglement-assisted one-way classical communication capacity of interactions, and show that these quantities are additive, so that the asymptotic capacities equal the corresponding 1-shot capacities. We give general bounds on other capacities, discuss some examples, and conclude with some open questions.

quant-ph↗

arXiv2001

Optimal simulation of two-qubit Hamiltonians using general local operations

We consider the simulation of the dynamics of one nonlocal Hamiltonian by another, allowing arbitrary local resources but no entanglement nor classical communication. We characterize notions of simulation, and proceed to focus on deterministic simulation involving one copy of the system. More specifically, two otherwise isolated systems $A$ and $B$ interact by a nonlocal Hamiltonian $H \neq H_A+H_B$. We consider the achievable space of Hamiltonians $H'$ such that the evolution $e^{-iH't}$ can be simulated by the interaction $H$ interspersed with local operations. For any dimensions of $A$ and $B$, and any nonlocal Hamiltonians $H$ and $H'$, there exists a scale factor $s$ such that for all times $t$ the evolution $e^{-iH'st}$ can be simulated by $H$ acting for time $t$ interspersed with local operations. For 2-qubit Hamiltonians $H$ and $H'$, we calculate the optimal $s$ and give protocols achieving it. The optimal protocols do not require local ancillas, and can be understood geometrically in terms of a polyhedron defined by a partial order on the set of 2-qubit Hamiltonians.

quant-ph↗

arXiv1999

Unextendible Product Bases and Bound Entanglement

An unextendible product basis (UPB) for a multipartite quantum system is an incomplete orthogonal product basis whose complementary subspace contains no product state. We give examples of UPBs, and show that the uniform mixed state over the subspace complementary to any UPB is a bound entangled state. We exhibit a tripartite 2x2x2 UPB whose complementary mixed state has tripartite entanglement but no bipartite entanglement, i.e. all three corresponding 2x4 bipartite mixed states are unentangled. We show that members of a UPB are not perfectly distinguishable by local POVMs and classical communication.

quant-ph↗

arXiv1996

The Parity Bit in Quantum Cryptography

An $n$-bit string is encoded as a sequence of non-orthogonal quantum states. The parity bit of that $n$-bit string is described by one of two density matrices, $ρ_0^{(n)}$ and $ρ_1^{(n)}$, both in a Hilbert space of dimension $2^n$. In order to derive the parity bit the receiver must distinguish between the two density matrices, e.g., in terms of optimal mutual information. In this paper we find the measurement which provides the optimal mutual information about the parity bit and calculate that information. We prove that this information decreases exponentially with the length of the string in the case where the single bit states are almost fully overlapping. We believe this result will be useful in proving the ultimate security of quantum crytography in the presence of noise.

quant-ph↗

arXiv1995

Elementary gates for quantum computation

We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values $(x,y)$ to $(x,x \oplus y)$) is universal in the sense that all unitary operations on arbitrarily many bits $n$ (U($2^n$)) can be expressed as compositions of these gates. We investigate the number of the above gates required to implement other gates, such as generalized Deutsch-Toffoli gates, that apply a specific U(2) transformation to one input bit if and only if the logical AND of all remaining input bits is satisfied. These gates play a central role in many proposed constructions of quantum computational networks. We derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two-and three-bit quantum gates, the asymptotic number required for $n$-bit Deutsch-Toffoli gates, and make some observations about the number required for arbitrary $n$-bit unitary operations.

quant-ph↗