Searcharxiv⌕ Search

arXiv subjects

David A. Herrera-Martí

Publications and source records attributed to David A. Herrera-Martí.

10 recordsLinked to original sources

Error Thresholds in Presence of Epistatic Interactions

Models for viral populations with high replication error rates (such as RNA viruses) rely on the quasispecies concept, in which mutational pressure beyond the so-called "Error Threshold" leads to a loss of essential genetic information and population collapse, an effect known as the "Error Catastrophe". We explain how crossing this threshold, as a result of increasing mutation rates, can be understood as a second order phase transition, even in the presence of lethal mutations. In particular, we show that, in fitness landscapes with a single peak, this collapse is equivalent to a ferro-paramagnetic transition, where the back-mutation rate plays the role of the external magnetic field. We then generalize this framework to rugged fitness landscapes, like the ones that arise from epistatic interactions, and provide numerical evidence that there is a transition from a high average fitness regime to a low average fitness one, similarly to single-peaked landscapes. The onset of the transition is heralded by a sudden change in the susceptibility to variations in the mutation rate. We use insight from Replica Symmetry Breaking mechanisms in spin glasses, in particular by considering the fluctuations of the genotype similarity distribution as the order parameter.

physics.bio-ph↗

Hamiltonian Forging of a Thermofield Double

We address the variational preparation of the Thermofield Double as the ground state of a suitably engineered Hamiltonian acting on the doubled Hilbert space. Through the use of the Entanglement Forging ansatz, we propose a solution that involves only circuits of width $N$. We illustrate the method with generic fermionic Hamiltonians. The free fermion case can be solved in closed form, and yields a warm start state for the variational circuits whenever interactions are present. As an important side product, this method returns the complete energy spectrum and eigenbasis of the system.

quant-ph↗

Policy Gradient Approach to Compilation of Variational Quantum Circuits

We propose a method for finding approximate compilations of quantum unitary transformations, based on techniques from policy gradient reinforcement learning. The choice of a stochastic policy allows us to rephrase the optimization problem in terms of probability distributions, rather than variational gates. In this framework, the optimal configuration is found by optimizing over distribution parameters, rather than over free angles. We show numerically that this approach can be more competitive than gradient-free methods, for a comparable amount of resources, both for noiseless and noisy circuits. Another interesting feature of this approach to variational compilation is that it does not need a separate register and long-range interactions to estimate the end-point fidelity, which is an improvement over methods which rely on the Hilbert-Schmidt test. We expect these techniques to be relevant for training variational circuits in other contexts.

quant-ph↗

Parameter estimation with efficient photodetectors

Current parameter estimation techniques rely on photodetectors which have low brightness and thus are based on gathering averaged statistics. Recently it was claimed that perfect photodetction will change the nature of sensing algorithms and will increase sensing efficiency beyond the immediate effect of having larger collection efficiency. In this paper we bring up the observation that perfect photodetection implies Heisenberg scaling($\frac{1}{T}$) for parameter estimations. We analyze a specific example in detail.

quant-ph↗

Quantum Error-Correction-Enhanced Magnetometer Overcoming the Limit Imposed by Relaxation

When incorporated in quantum sensing protocols, quantum error correction can be used to correct for high frequency noise, as the correction procedure does not depend on the actual shape of the noise spectrum. As such, it provides a powerful way to complement usual refocusing techniques. Relaxation imposes a fundamental limit on the sensitivity of state of the art quantum sensors which cannot be overcome by dynamical decoupling. The only way to overcome this is to utilize quantum error correcting codes. We present a superconducting magnetometry design that incorporates approximate quantum error correction, in which the signal is generated by a two qubit Hamiltonian term. This two-qubit term is provided by the dynamics of a tunable coupler between two transmon qubits. For fast enough correction, it is possible to lengthen the coherence time of the device beyond the relaxation limit.

quant-ph↗

Loss Tolerance with a Concatenated Graph State

A new way of addressing loss errors is introduced which combines ideas from measurement-based quantum computation and concatenated quantum codes, allowing for universal quantum computation. It is shown that for the case where leakage is detected upon measurement, the scheme performs well under 23% loss rate. For loss rates below 10%, this approach performs better than the best scheme known up to date [Phys. Rev.Lett., 97(12):120501]. If lost qubits are tagged prior to measurement, it can tolerate up to 50% loss. The overhead per logical qubit is shown to be significantly lower than other schemes. The obtention of the threshold is entirely analytic.

quant-ph↗

Tradeoff between Leakage and Dephasing Errors in the Fluxonium Qubit

We present a tradeoff between leakage and pure dephasing errors for the fluxonium circuit. We show that in the insulating regime, i.e., when the persistent current flowing across the circuit is suppressed, the pure dephasing rate decreases exponentially as the impedance of the circuit is increased. In contrast to this exponential decrease, the qubit remains sufficiently anharmonic so that gates times can still be short, allowing for significant reduction in the computational error rates.

quant-ph↗

A Photonic Implementation for the Topological Cluster State Quantum Computer

A new implementation of the topological cluster state quantum computer is suggested, in which the basic elements are linear optics, measurements, and a two-dimensional array of quantum dots. This overcomes the need for non-linear devices to create a lattice of entangled photons. We give estimates of the minimum efficiencies needed for the detectors, fusion gates and quantum dots, from a numerical simulation.

quant-ph↗

Entanglement-Enhanced Classical Communication

This thesis will be focused on the classical capacity of quantum channels, one of the first areas treated by quantum information theorists. The problem is fairly solved since some years. Nevertheless, this work will give me a reason to introduce a consistent formalism of the quantum theory, as well as to review fundamental facts about quantum non-locality and how it can be used to enhance communication. Moreover, this reflects my dwelling in the spirit of classical information theory, and it is intended to be a starting point towards a thorough study of how quantum technologies can help to shape the future of telecommunications. Whenever it was possible, heuristic reasonings were introduced instead of rigorous mathematical proofs. This finds an explanation in that I am a self-taught neophyte in the field, and just about every time I came across a new concept, physical arguments were always more compelling to me than just maths. The technical content of the thesis is twofold. On one hand, a quadratic classification based on optimization programs that I devised for distinguishing entangled states is presented in Chapter 4. In second place, a less difficult yet I hope equally interesting technical part consists of versions of some proofs throughout the text.

quant-ph↗

Scalable Ellipsoidal Classification for Bipartite Quantum States

The Separability Problem is approached from the perspective of Ellipsoidal Classification. A Density Operator of dimension N can be represented as a vector in a real vector space of dimension $N^{2}- 1$, whose components are the projections of the matrix onto some selected basis. We suggest a method to test separability, based on successive optimization programs. First, we find the Minimum Volume Covering Ellipsoid that encloses a particular set of properly vectorized bipartite separable states, and then we compute the Euclidean distance of an arbitrary vectorized bipartite Density Operator to this ellipsoid. If the vectorized Density Operator falls inside the ellipsoid, it is regarded as separable, otherwise it will be taken as entangled. Our method is scalable and can be implemented straightforwardly in any desired dimension. Moreover, we show that it allows for detection of Bound Entangled States

quant-ph↗