Raul O. Vallejos
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Raul O. Vallejos has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
- Celia Anteneodo
PUC-Rio
14 shared publications - Fernando de Melo
Centro Brasileiro de Pesquisas Físicas Rua Dr. Xavier Sigaud 150 Rio de Janeiro RJ Brazil
5 shared publications - Fabricio Toscano
Instituto de Física Universidade Federal do Rio de Janeiro 21941-972 Rio de Janeiro Brazil
4 shared publications - Romulo F. Abreu
Centro Brasileiro de Pesquisas Fisicas (CBPF), Rua Dr. Xavier Sigaud 150, 22290-180 Rio de Janeiro, Brazil
4 shared publications - Diego A. Wisniacki
Universidad de Buenos Aires
3 shared publications - Gabriel G. Carlo
Comisión Nacional de Energía Atómica (CNEA)
3 shared publications
Latest Publications
- Open Access
- 19 May 2025
- Published by Sociedade Brasileira de Computação
- p. 1-6
Security Analysis for the Rio Quantum Network
The Rio Quantum Network (RQN) is a multi-user quantum communication network connecting several research institutions across the city of Rio de Janeiro. Capitalizing on its ring topology, the network implements a Sagnac-based variant of Twin-Field Quantum Key Distribution (TF-QKD)—a protocol that falls under the broader class of Measurement-Device Independent QKD (MDI-QKD). This design eliminates the need to trust the measurement devices, enhancing security against potential vulnerabilities. In the RQN, instead of each user operating a quantum light source in their lab, they perform phase and amplitude modulations on signals distributed by a central node. In this contribution, we employ the security framework of TF-QKD to estimate the secret key rate, ensuring rigorous performance evaluation under realistic conditions.
- 19 May 2025
- Published by Sociedade Brasileira de Computação
- p. 1-6
Open AccessSecurity Analysis for the Rio Quantum Network
The Rio Quantum Network (RQN) is a multi-user quantum communication network connecting several research institutions across the city of Rio de Janeiro. Capitalizing on its ring topology, the network implements a Sagnac-based variant of Twin-Field Quantum Key Distribution (TF-QKD)—a protocol that falls under the broader class of Measurement-Device Independent QKD (MDI-QKD). This design eliminates the need to trust the measurement devices, enhancing security against potential vulnerabilities. In the RQN, instead of each user operating a quantum light source in their lab, they perform phase and amplitude modulations on signals distributed by a central node. In this contribution, we employ the security framework of TF-QKD to estimate the secret key rate, ensuring rigorous performance evaluation under realistic conditions.
- 7 August 2024
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 133 (6) , 060401
Canonical Typicality under General Quantum Channels
With the control of increasingly complex quantum systems, the relevant degrees of freedom we are interested in may not be those traditionally addressed by statistical quantum mechanics. Here, we employ quantum channels to define generalized subsystems, capturing the pertinent degrees of freedom, and obtain their associated canonical state. We show that the generalized subsystem description from almost any microscopic pure state of the whole system will behave similarly to its corresponding canonical state. Such canonical typicality behavior depends on the entropy of the channel used to define the generalized subsystem.
- 7 August 2024
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 133 (6) , 060401
Canonical Typicality under General Quantum Channels
With the control of increasingly complex quantum systems, the relevant degrees of freedom we are interested in may not be those traditionally addressed by statistical quantum mechanics. Here, we employ quantum channels to define generalized subsystems, capturing the pertinent degrees of freedom, and obtain their associated canonical state. We show that the generalized subsystem description from almost any microscopic pure state of the whole system will behave similarly to its corresponding canonical state. Such canonical typicality behavior depends on the entropy of the channel used to define the generalized subsystem.
- 25 July 2022
- Published by American Physical Society (APS) in Physical Review A
- Vol. 106 (1) , 012219
Quantum state inference from coarse-grained descriptions: Analysis and an application to quantum thermodynamics
The characterization of physical systems relies on the observable properties which are measured, and how such measurements are performed. Here we analyze two ways of assigning a description to a quantum system assuming that we only have access to coarse-grained properties. More specifically, we compare the maximum entropy principle method, with the Bayesian-inspired recently proposed average assignment map method [Correia et al., Phys. Rev. A 103, 052210 (2021)]. Despite the fact that the assigned descriptions by both methods respect the measured constraints, and that they share the same conceptual foundations, the descriptions differ in scenarios that go beyond the traditional system-environment structure. The average assignment map is thus shown to be a more sensible choice for the ever more prevalent scenario of complex quantum systems. We discuss the physics behind such a difference, and further exploit it in a quantum thermodynamics process.
- 25 July 2022
- Published by American Physical Society (APS) in Physical Review A
- Vol. 106 (1) , 012219
Quantum state inference from coarse-grained descriptions: Analysis and an application to quantum thermodynamics
The characterization of physical systems relies on the observable properties which are measured, and how such measurements are performed. Here we analyze two ways of assigning a description to a quantum system assuming that we only have access to coarse-grained properties. More specifically, we compare the maximum entropy principle method, with the Bayesian-inspired recently proposed average assignment map method [Correia et al., Phys. Rev. A 103, 052210 (2021)]. Despite the fact that the assigned descriptions by both methods respect the measured constraints, and that they share the same conceptual foundations, the descriptions differ in scenarios that go beyond the traditional system-environment structure. The average assignment map is thus shown to be a more sensible choice for the ever more prevalent scenario of complex quantum systems. We discuss the physics behind such a difference, and further exploit it in a quantum thermodynamics process.
- 7 July 2021
- Published by American Physical Society (APS) in Physical Review A
- Vol. 104 (1) , 012602
Principle of majorization: Application to random quantum circuits
We test the principle of majorization J. I. Latorre and M. A. Martín-Delgado, Phys. Rev. A 66, 022305 (2002). in random circuits. Three classes of circuits were considered: (i) universal, (ii) classically simulatable, and (iii) neither universal nor classically simulatable. The studied families are: {cnot, H, T}, {cnot, H, not}, {cnot, H, S} (Clifford), matchgates, and IQP (instantaneous quantum polynomial-time). We verified that all the families of circuits satisfy on average the principle of decreasing majorization. In most cases the asymptotic state (number of gates ) behaves like a random vector. However, clear differences appear in the fluctuations of the Lorenz curves associated with asymptotic states. The fluctuations of the Lorenz curves discriminate between universal and nonuniversal classes of random quantum circuits, and they also detect the complexity of some nonuniversal but not classically efficiently simulatable quantum random circuits. We conclude that majorization can be used as an indicator of complexity of quantum dynamics, as an alternative to, e.g., entanglement spectrum and out-of-time-order correlators.- 7 July 2021
- Published by American Physical Society (APS) in Physical Review A
- Vol. 104 (1) , 012602
Principle of majorization: Application to random quantum circuits
We test the principle of majorization J. I. Latorre and M. A. Martín-Delgado, Phys. Rev. A 66, 022305 (2002). in random circuits. Three classes of circuits were considered: (i) universal, (ii) classically simulatable, and (iii) neither universal nor classically simulatable. The studied families are: {cnot, H, T}, {cnot, H, not}, {cnot, H, S} (Clifford), matchgates, and IQP (instantaneous quantum polynomial-time). We verified that all the families of circuits satisfy on average the principle of decreasing majorization. In most cases the asymptotic state (number of gates ) behaves like a random vector. However, clear differences appear in the fluctuations of the Lorenz curves associated with asymptotic states. The fluctuations of the Lorenz curves discriminate between universal and nonuniversal classes of random quantum circuits, and they also detect the complexity of some nonuniversal but not classically efficiently simulatable quantum random circuits. We conclude that majorization can be used as an indicator of complexity of quantum dynamics, as an alternative to, e.g., entanglement spectrum and out-of-time-order correlators.- 18 May 2021
- Published by American Physical Society (APS) in Physical Review A
- Vol. 103 (5) , 052210
Macro-to-micro quantum mapping and the emergence of nonlinearity
As a universal theory of physics, quantum mechanics must assign states to every level of description of a system—from a full microscopic description all the way up to an effective macroscopic characterization—and also to describe the interconnections among them. Assuming that we only have a coarse-grained access to a physical system, here we show how to assign to it a microscopic description that abides by all macroscopic constraints. In order to do that, we employ general coarse-graining maps, allowing our approach to be used even when the split between system and environment is not obvious. As a by-product, we show how effective nonlinear dynamics can emerge from the linear quantum evolution, and we readily apply it to a state discrimination task.
- 18 May 2021
- Published by American Physical Society (APS) in Physical Review A
- Vol. 103 (5) , 052210
Macro-to-micro quantum mapping and the emergence of nonlinearity
As a universal theory of physics, quantum mechanics must assign states to every level of description of a system—from a full microscopic description all the way up to an effective macroscopic characterization—and also to describe the interconnections among them. Assuming that we only have a coarse-grained access to a physical system, here we show how to assign to it a microscopic description that abides by all macroscopic constraints. In order to do that, we employ general coarse-graining maps, allowing our approach to be used even when the split between system and environment is not obvious. As a by-product, we show how effective nonlinear dynamics can emerge from the linear quantum evolution, and we readily apply it to a state discrimination task.
- Open Access
Macro-to-micro quantum mapping and the emergence of nonlinearity
As a universal theory of physics, quantum mechanics must assign states to every level of description of a system -- from a full microscopic description, all the way up to an effective macroscopic characterization -- and also to describe the interconnections among them. Assuming that we only have a coarse-grained access to a physical system, here we show how to assign to it a microscopic description that abides by all macroscopic constraints. In order to do that, we employ general coarse-graining maps, allowing our approach to be used even when the split between system and environment is not obvious. As a by-product, we show how effective nonlinear dynamics can emerge from the linear quantum evolution, and we readily apply it to a state discrimination task.
Open AccessMacro-to-micro quantum mapping and the emergence of nonlinearity
As a universal theory of physics, quantum mechanics must assign states to every level of description of a system -- from a full microscopic description, all the way up to an effective macroscopic characterization -- and also to describe the interconnections among them. Assuming that we only have a coarse-grained access to a physical system, here we show how to assign to it a microscopic description that abides by all macroscopic constraints. In order to do that, we employ general coarse-graining maps, allowing our approach to be used even when the split between system and environment is not obvious. As a by-product, we show how effective nonlinear dynamics can emerge from the linear quantum evolution, and we readily apply it to a state discrimination task.
- Open Access
From synchronous to one-time delayed dynamics in coupled maps
We study the completely synchronized states (CSSs) of a system of coupled logistic maps as a function of three parameters: interaction strength ($\varepsilon$), range of the interaction ($\alpha$), that can vary from first-neighbors to global coupling, and a parameter ($\beta$) that allows to scan continuously from non-delayed to one-time delayed dynamics. % We identify in the plane $\alpha$-$\varepsilon$ periodic orbits, limit cycles and chaotic trajectories, and describe how these structures change with the delay. These features can be explained by studying the bifurcation diagrams of a two-dimensional non-delayed map. This allows us to understand the effects of one-time delays on CSSs, e.g, regularization of chaotic orbits and synchronization of short-range coupled maps, observed when the dynamics is moderately delayed. Finally, we substitute the logistic map by cubic and logarithmic maps, in order to test the robustness of our findings.Open AccessFrom synchronous to one-time delayed dynamics in coupled maps
We study the completely synchronized states (CSSs) of a system of coupled logistic maps as a function of three parameters: interaction strength ($\varepsilon$), range of the interaction ($\alpha$), that can vary from first-neighbors to global coupling, and a parameter ($\beta$) that allows to scan continuously from non-delayed to one-time delayed dynamics. % We identify in the plane $\alpha$-$\varepsilon$ periodic orbits, limit cycles and chaotic trajectories, and describe how these structures change with the delay. These features can be explained by studying the bifurcation diagrams of a two-dimensional non-delayed map. This allows us to understand the effects of one-time delays on CSSs, e.g, regularization of chaotic orbits and synchronization of short-range coupled maps, observed when the dynamics is moderately delayed. Finally, we substitute the logistic map by cubic and logarithmic maps, in order to test the robustness of our findings. - Open Access
Importance sampling with imperfect cloning for the computation of generalized Lyapunov exponents
We revisit the numerical calculation of generalized Lyapunov exponents, $L$($q$), in deterministic dynamical systems. The standard method consists of adding noise to the dynamics in order to use importance sampling algorithms. Then $L$($q$) is obtained by taking the limit noise-amplitude $\to$0 after the calculation. We focus on a particular method that involves periodic cloning and pruning of a set of trajectories. However, instead of considering a noisy dynamics, we implement an imperfect (noisy) cloning. This alternative method is compared with the standard one and, when possible, with analytical results. As a workbench, we use the asymmetric tent map, the standard map, and a system of coupled symplectic maps. The general conclusion of this study is that the imperfect-cloning method performs as well as the standard one, with the advantage of preserving the deterministic dynamics.
Open AccessImportance sampling with imperfect cloning for the computation of generalized Lyapunov exponents
We revisit the numerical calculation of generalized Lyapunov exponents, $L$($q$), in deterministic dynamical systems. The standard method consists of adding noise to the dynamics in order to use importance sampling algorithms. Then $L$($q$) is obtained by taking the limit noise-amplitude $\to$0 after the calculation. We focus on a particular method that involves periodic cloning and pruning of a set of trajectories. However, instead of considering a noisy dynamics, we implement an imperfect (noisy) cloning. This alternative method is compared with the standard one and, when possible, with analytical results. As a workbench, we use the asymmetric tent map, the standard map, and a system of coupled symplectic maps. The general conclusion of this study is that the imperfect-cloning method performs as well as the standard one, with the advantage of preserving the deterministic dynamics.
- 18 December 2017
- Published by American Physical Society (APS) in Physical Review E
- Vol. 96 (6) , 062209
Importance sampling with imperfect cloning for the computation of generalized Lyapunov exponents
We revisit the numerical calculation of generalized Lyapunov exponents, , in deterministic dynamical systems. The standard method consists of adding noise to the dynamics in order to use importance sampling algorithms. Then is obtained by taking the limit noise-amplitude 0 after the calculation. We focus on a particular method that involves periodic cloning and pruning of a set of trajectories. However, instead of considering a noisy dynamics, we implement an imperfect (noisy) cloning. This alternative method is compared with the standard one and, when possible, with analytical results. As a workbench we use the asymmetric tent map, the standard map, and a system of coupled symplectic maps. The general conclusion of this study is that the imperfect-cloning method performs as well as the standard one, with the advantage of preserving the deterministic dynamics.- 18 December 2017
- Published by American Physical Society (APS) in Physical Review E
- Vol. 96 (6) , 062209
Importance sampling with imperfect cloning for the computation of generalized Lyapunov exponents
We revisit the numerical calculation of generalized Lyapunov exponents, , in deterministic dynamical systems. The standard method consists of adding noise to the dynamics in order to use importance sampling algorithms. Then is obtained by taking the limit noise-amplitude 0 after the calculation. We focus on a particular method that involves periodic cloning and pruning of a set of trajectories. However, instead of considering a noisy dynamics, we implement an imperfect (noisy) cloning. This alternative method is compared with the standard one and, when possible, with analytical results. As a workbench we use the asymmetric tent map, the standard map, and a system of coupled symplectic maps. The general conclusion of this study is that the imperfect-cloning method performs as well as the standard one, with the advantage of preserving the deterministic dynamics.- 16 June 2017
- Published by American Physical Society (APS) in Physical Review E
- Vol. 95 (6) , 062213
From synchronous to one-time delayed dynamics in coupled maps
We study the completely synchronized states (CSSs) of a system of coupled logistic maps as a function of three parameters: interaction strength (), range of the interaction (), that can vary from first neighbors to global coupling, and a parameter () that allows one to scan continuously from nondelayed to one-time delayed dynamics. In the plane we identify periodic orbits, limit cycles, and chaotic trajectories, and describe how these structures change with delay. These features can be explained by studying the bifurcation diagrams of a two-dimensional nondelayed map. This allows us to understand the effects of one-time delays on CSSs, e.g., regularization of chaotic orbits and synchronization of short-range coupled maps, observed when the dynamics is moderately delayed. Finally, we substitute the logistic map with cubic and logarithmic maps, in order to test the robustness of our findings.- 16 June 2017
- Published by American Physical Society (APS) in Physical Review E
- Vol. 95 (6) , 062213
From synchronous to one-time delayed dynamics in coupled maps
We study the completely synchronized states (CSSs) of a system of coupled logistic maps as a function of three parameters: interaction strength (), range of the interaction (), that can vary from first neighbors to global coupling, and a parameter () that allows one to scan continuously from nondelayed to one-time delayed dynamics. In the plane we identify periodic orbits, limit cycles, and chaotic trajectories, and describe how these structures change with delay. These features can be explained by studying the bifurcation diagrams of a two-dimensional nondelayed map. This allows us to understand the effects of one-time delays on CSSs, e.g., regularization of chaotic orbits and synchronization of short-range coupled maps, observed when the dynamics is moderately delayed. Finally, we substitute the logistic map with cubic and logarithmic maps, in order to test the robustness of our findings.