Se presenta una clave con ilustraciones para identificación de machos de 16 géneros de Sarcophagi... more Se presenta una clave con ilustraciones para identificación de machos de 16 géneros de Sarcophagidae de importancia forense en Colombia, así como comentarios acerca de su biología y distribución. Los géneros aquí incluidos son: Argoravinia, Blaesoxipha, Boettcheria, Dexosarcophaga, Engelimyia, Helicobia, Microcerella, Oxysarcodexia, Peckia, Ravinia, Sarcodexia, Sarcofahrtiopsis, Sarcophaga, Titanogrypa, Tricharaea y Oxyvinia. Este último es un nuevo registro para el país.
25th ACM International Conference on Hybrid Systems: Computation and Control
In this work, we propose the use of symbolic automata as formal specifications for reinforcement ... more In this work, we propose the use of symbolic automata as formal specifications for reinforcement learning agents. The use of symbolic automata serves as a generalization of both bounded-time temporal logic-based specifications and deterministic finite automata, allowing us to describe input alphabets over metric spaces. Furthermore, our use of symbolic automata allows us to define non-sparse potential-based rewards which empirically shape the reward surface, leading to better convergence during RL. We also show that our potential-based rewarding strategy still allows us to obtain the policy that maximizes the satisfaction of the given specification.
Our ability to trust that a random number is truly random is essential for fields as diverse as c... more Our ability to trust that a random number is truly random is essential for fields as diverse as cryptography and fundamental tests of quantum mechanics. Existing solutions both come with drawbacks—device-independent quantum random number generators (QRNGs) are highly impractical and standard semi-device-independent QRNGs are limited to a specific physical implementation and level of trust. Here we propose a framework for semi-device-independent randomness certification, using a source of trusted vacuum in the form of a signal shutter. It employs a flexible set of assumptions and levels of trust, allowing it to be applied in a wide range of physical scenarios involving both quantum and classical entropy sources. We experimentally demonstrate our protocol with a photonic setup and generate secure random bits under three different assumptions with varying degrees of security and resulting data rates.
A preparation game is a task whereby a player sequentially sends a number of quantum states to a ... more A preparation game is a task whereby a player sequentially sends a number of quantum states to a referee, who probes each of them and announces the measurement result. Many experimental tasks in quantum information, such as entanglement quantification or magic state detection, can be cast as preparation games. In this paper, we introduce general methods to design n-round preparation games, with tight bounds on the performance achievable by players with arbitrarily constrained preparation devices. We illustrate our results by devising new adaptive measurement protocols for entanglement detection and quantification. Surprisingly, we find that the standard procedure in entanglement detection, namely, estimating n times the average value of a given entanglement witness, is in general suboptimal for detecting the entanglement of a specific quantum state. On the contrary, there exist n-round experimental scenarios where detecting the entanglement of a known state optimally requires adapti...
Quantum information processing has experienced dramatic experimental breakthroughs over the last ... more Quantum information processing has experienced dramatic experimental breakthroughs over the last couple of years in many physical platforms. With current attained metrics, the horizon appears promising for building increasingly powerful quantum processors. In this talk I will review recent progress on quantum error detection and correction on superconducting qubit systems at IBM. Our experiments, which are implemented within the stabilizer formalism present in the surface code architecture, aim at demonstrating quantum error correcting protocols for fault-tolerant quantum computing. As a conclusion, I will describe and reflect on the main experimental hurdles our field will have to tackle in the incoming years.
In Latin America there are more than 6 million people infected with trypanosoma cruzi and about 4... more In Latin America there are more than 6 million people infected with trypanosoma cruzi and about 400,000 immigrants are in Europe and the United States with this disease. Chagasic cardiomyopathy presents with SMVT in 30% of cases with preserved ejection fraction and ventricular aneurysm in 40-60%, which leads to a high risk of embolic events. Surgical treatment when certain conditions are met shows a safe and effective therapy in order to avoid complications in this group of patients.
A detailed study is presented of the expected performance of the ATLAS detector. The reconstructi... more A detailed study is presented of the expected performance of the ATLAS detector. The reconstruction of tracks, leptons, photons, missing energy and jets is investigated, together with the performance of b-tagging and the trigger. The physics potential for a variety of interesting physics processes, within the Standard Model and beyond, is examined. The study comprises a series of notes based on simulations of the detector and physics processes, with particular emphasis given to the data expected from the first years of operation of the LHC at CERN.
It was brought to our attention that Table I of our Letter contains several errors in the fractio... more It was brought to our attention that Table I of our Letter contains several errors in the fraction of states that are positive partial transpose (PPT) as well as in the fraction that is certified to be unfaithful with our criterion. In the following, we provide the corrected table.
We present a new quantum communication complexity protocol, the promise-quantum random access cod... more We present a new quantum communication complexity protocol, the promise-quantum random access code, which allows us to introduce a new measure of unbiasedness for bases of Hilbert spaces. The proposed measure possesses a clear operational meaning and can be used to investigate whether a specific number of mutually unbiased bases exist in a given dimension by employing semidefinite programming techniques.
We report on a new class of dimension witnesses, based on quantum random access codes, which are ... more We report on a new class of dimension witnesses, based on quantum random access codes, which are a function of the recorded statistics and that have different bounds for all possible decompositions of a high-dimensional physical system. Thus, it certifies the dimension of the system and has the new distinct feature of identifying whether the high-dimensional system is decomposable in terms of lower dimensional subsystems. To demonstrate the practicability of this technique, we used it to experimentally certify the generation of an irreducible 1024-dimensional photonic quantum state. Therefore, certifying that the state is not multipartite or encoded using noncoupled different degrees of freedom of a single photon. Our protocol should find applications in a broad class of modern quantum information experiments addressing the generation of high-dimensional quantum systems, where quantum tomography may become intractable.
Quantum key distribution (QKD) is a provably secure way for two distant parties to establish a co... more Quantum key distribution (QKD) is a provably secure way for two distant parties to establish a common secret key, which then can be used in a classical cryptographic scheme. Using quantum entanglement, one can reduce the necessary assumptions that the parties have to make about their devices, giving rise to device-independent QKD (DIQKD). However, in all existing protocols to date the parties need to have an initial (at least partially) random seed as a resource. In this work, we show that this requirement can be dropped. Using recent advances in the fields of randomness amplification and randomness expansion, we demonstrate that it is sufficient for the message the parties want to communicate to be (partially) unknown to the adversaries-an assumption without which any type of cryptography would be pointless to begin with. One party can use her secret message to locally generate a secret sequence of bits, which can then be openly used by herself and the other party in a DIQKD protocol. Hence, our work reduces the requirements needed to perform secure DIQKD and establish safe communication.
Los autores profundamente agradecidos de la tutora: Economista. Sandra Elizabeth Ramón Jaramillo ... more Los autores profundamente agradecidos de la tutora: Economista. Sandra Elizabeth Ramón Jaramillo por su apoyo y dirección en este significativo trabajo. A todos los vocales de los Gobiernos Parroquiales Rurales del Cantón y la Provincia de Zamora Chinchipe. Y a cada uno de los profesores que contribuyeron lealmente en la formación de esta importante carrera.
Crescenciano Grave: Metafísica y tragedia. Un ensayo sobre Schelling, México: Ediciones sin nombr... more Crescenciano Grave: Metafísica y tragedia. Un ensayo sobre Schelling, México: Ediciones sin nombre 2008.
Se presenta una clave con ilustraciones para identificación de machos de 16 géneros de Sarcophagi... more Se presenta una clave con ilustraciones para identificación de machos de 16 géneros de Sarcophagidae de importancia forense en Colombia, así como comentarios acerca de su biología y distribución. Los géneros aquí incluidos son: Argoravinia, Blaesoxipha, Boettcheria, Dexosarcophaga, Engelimyia, Helicobia, Microcerella, Oxysarcodexia, Peckia, Ravinia, Sarcodexia, Sarcofahrtiopsis, Sarcophaga, Titanogrypa, Tricharaea y Oxyvinia. Este último es un nuevo registro para el país.
25th ACM International Conference on Hybrid Systems: Computation and Control
In this work, we propose the use of symbolic automata as formal specifications for reinforcement ... more In this work, we propose the use of symbolic automata as formal specifications for reinforcement learning agents. The use of symbolic automata serves as a generalization of both bounded-time temporal logic-based specifications and deterministic finite automata, allowing us to describe input alphabets over metric spaces. Furthermore, our use of symbolic automata allows us to define non-sparse potential-based rewards which empirically shape the reward surface, leading to better convergence during RL. We also show that our potential-based rewarding strategy still allows us to obtain the policy that maximizes the satisfaction of the given specification.
Our ability to trust that a random number is truly random is essential for fields as diverse as c... more Our ability to trust that a random number is truly random is essential for fields as diverse as cryptography and fundamental tests of quantum mechanics. Existing solutions both come with drawbacks—device-independent quantum random number generators (QRNGs) are highly impractical and standard semi-device-independent QRNGs are limited to a specific physical implementation and level of trust. Here we propose a framework for semi-device-independent randomness certification, using a source of trusted vacuum in the form of a signal shutter. It employs a flexible set of assumptions and levels of trust, allowing it to be applied in a wide range of physical scenarios involving both quantum and classical entropy sources. We experimentally demonstrate our protocol with a photonic setup and generate secure random bits under three different assumptions with varying degrees of security and resulting data rates.
A preparation game is a task whereby a player sequentially sends a number of quantum states to a ... more A preparation game is a task whereby a player sequentially sends a number of quantum states to a referee, who probes each of them and announces the measurement result. Many experimental tasks in quantum information, such as entanglement quantification or magic state detection, can be cast as preparation games. In this paper, we introduce general methods to design n-round preparation games, with tight bounds on the performance achievable by players with arbitrarily constrained preparation devices. We illustrate our results by devising new adaptive measurement protocols for entanglement detection and quantification. Surprisingly, we find that the standard procedure in entanglement detection, namely, estimating n times the average value of a given entanglement witness, is in general suboptimal for detecting the entanglement of a specific quantum state. On the contrary, there exist n-round experimental scenarios where detecting the entanglement of a known state optimally requires adapti...
Quantum information processing has experienced dramatic experimental breakthroughs over the last ... more Quantum information processing has experienced dramatic experimental breakthroughs over the last couple of years in many physical platforms. With current attained metrics, the horizon appears promising for building increasingly powerful quantum processors. In this talk I will review recent progress on quantum error detection and correction on superconducting qubit systems at IBM. Our experiments, which are implemented within the stabilizer formalism present in the surface code architecture, aim at demonstrating quantum error correcting protocols for fault-tolerant quantum computing. As a conclusion, I will describe and reflect on the main experimental hurdles our field will have to tackle in the incoming years.
In Latin America there are more than 6 million people infected with trypanosoma cruzi and about 4... more In Latin America there are more than 6 million people infected with trypanosoma cruzi and about 400,000 immigrants are in Europe and the United States with this disease. Chagasic cardiomyopathy presents with SMVT in 30% of cases with preserved ejection fraction and ventricular aneurysm in 40-60%, which leads to a high risk of embolic events. Surgical treatment when certain conditions are met shows a safe and effective therapy in order to avoid complications in this group of patients.
A detailed study is presented of the expected performance of the ATLAS detector. The reconstructi... more A detailed study is presented of the expected performance of the ATLAS detector. The reconstruction of tracks, leptons, photons, missing energy and jets is investigated, together with the performance of b-tagging and the trigger. The physics potential for a variety of interesting physics processes, within the Standard Model and beyond, is examined. The study comprises a series of notes based on simulations of the detector and physics processes, with particular emphasis given to the data expected from the first years of operation of the LHC at CERN.
It was brought to our attention that Table I of our Letter contains several errors in the fractio... more It was brought to our attention that Table I of our Letter contains several errors in the fraction of states that are positive partial transpose (PPT) as well as in the fraction that is certified to be unfaithful with our criterion. In the following, we provide the corrected table.
We present a new quantum communication complexity protocol, the promise-quantum random access cod... more We present a new quantum communication complexity protocol, the promise-quantum random access code, which allows us to introduce a new measure of unbiasedness for bases of Hilbert spaces. The proposed measure possesses a clear operational meaning and can be used to investigate whether a specific number of mutually unbiased bases exist in a given dimension by employing semidefinite programming techniques.
We report on a new class of dimension witnesses, based on quantum random access codes, which are ... more We report on a new class of dimension witnesses, based on quantum random access codes, which are a function of the recorded statistics and that have different bounds for all possible decompositions of a high-dimensional physical system. Thus, it certifies the dimension of the system and has the new distinct feature of identifying whether the high-dimensional system is decomposable in terms of lower dimensional subsystems. To demonstrate the practicability of this technique, we used it to experimentally certify the generation of an irreducible 1024-dimensional photonic quantum state. Therefore, certifying that the state is not multipartite or encoded using noncoupled different degrees of freedom of a single photon. Our protocol should find applications in a broad class of modern quantum information experiments addressing the generation of high-dimensional quantum systems, where quantum tomography may become intractable.
Quantum key distribution (QKD) is a provably secure way for two distant parties to establish a co... more Quantum key distribution (QKD) is a provably secure way for two distant parties to establish a common secret key, which then can be used in a classical cryptographic scheme. Using quantum entanglement, one can reduce the necessary assumptions that the parties have to make about their devices, giving rise to device-independent QKD (DIQKD). However, in all existing protocols to date the parties need to have an initial (at least partially) random seed as a resource. In this work, we show that this requirement can be dropped. Using recent advances in the fields of randomness amplification and randomness expansion, we demonstrate that it is sufficient for the message the parties want to communicate to be (partially) unknown to the adversaries-an assumption without which any type of cryptography would be pointless to begin with. One party can use her secret message to locally generate a secret sequence of bits, which can then be openly used by herself and the other party in a DIQKD protocol. Hence, our work reduces the requirements needed to perform secure DIQKD and establish safe communication.
Los autores profundamente agradecidos de la tutora: Economista. Sandra Elizabeth Ramón Jaramillo ... more Los autores profundamente agradecidos de la tutora: Economista. Sandra Elizabeth Ramón Jaramillo por su apoyo y dirección en este significativo trabajo. A todos los vocales de los Gobiernos Parroquiales Rurales del Cantón y la Provincia de Zamora Chinchipe. Y a cada uno de los profesores que contribuyeron lealmente en la formación de esta importante carrera.
Crescenciano Grave: Metafísica y tragedia. Un ensayo sobre Schelling, México: Ediciones sin nombr... more Crescenciano Grave: Metafísica y tragedia. Un ensayo sobre Schelling, México: Ediciones sin nombre 2008.
Uploads
Papers by Edgar Aguilar