Searcharxiv⌕ Search

arXiv subjects

Jonas Maziero

Publications and source records attributed to Jonas Maziero.

At least 19 recordsLinked to original sources

Crosstalk-Induced Row Hammer Attacks on Quantum Random Access Codes

Quantum processors remain susceptible to crosstalk-induced effects despite the continuous evolution of their underlying hardware architectures. In this work, we experimentally investigate the effectiveness of crosstalk-induced attacks across six IBM superconducting quantum processors and one IQM processor. Our results demonstrate that such attacks can be launched across all the platforms, due to persistance of crosstalk, although their effectiveness varies significantly between devices. The probability of a measurement outcome flip in the victim qubits reaches a maximum value of $60\%$. Also, it is seen that processors sharing identical coupling graphs exhibit different vulnerability profiles, indicating that connectivity alone is insufficient to predict attack efficiency. Finally, to demonstrate the practical relevance of these attacks, we study their impact on quantum random access codes (QRACs), observing a degradation in their average success probabilities.

quant-ph↗

Resource Analysis of Quantum Optimization Algorithms via Variational Methods

Variational Quantum Algorithms (VQAs) are promising approaches for solving combinatorial optimization problems on near-term quantum devices. However, the role played by quantum resources such as entanglement and coherence during the optimization process remains poorly understood. In this work, we investigate the evolution of these resources in two VQAs--the Quantum Approximate Optimization Algorithm (QAOA) and the Feedback-based Algorithm for Quantum Optimization (FALQON)--applied to the Minimum Vertex Cover problem. We employ a variational resource-quantification framework based on the Bures metric and Uhlmann's theorem, in which an auxiliary quantum circuit is optimized to identify the closest resource-free states. This approach allows us to quantify Bures entanglement and Bures coherence of the algorithmic states without requiring full quantum state tomography. For the considered problem instance, QAOA exhibits a pronounced accumulation of entanglement in its initial layers, followed by a progressive reduction as the algorithm converges toward the optimal solution. Its coherence likewise decreases overall with increasing circuit depth, although a finite residual value persists due to the degeneracy of the optimal-solution subspace. In contrast, FALQON exhibits a substantially lower entanglement peak, reached at larger circuit depth, followed by a decay as convergence proceeds. Its coherence decreases smoothly and monotonically together with the optimization error. These results reveal distinct quantum-resource trajectories associated with the two optimization strategies and illustrate how entanglement and coherence evolve as variational quantum states approach solutions of a classical combinatorial optimization problem.

quant-ph↗

Exchange-controlled quantum beats and entanglement in an exciton--bimodal-cavity system

We theoretically demonstrate tunable population transfer and entanglement generation in a two-exciton system coupled to a bimodal optical cavity, including an exciton-exciton exchange interaction. By using dressed-state transformations and Löwdin partitioning, we derive effective Hamiltonians that identify three dynamical time scales: local polaritonic oscillations, long-period dressed-state beats, and direct excitonic exchange. We apply the framework to graphene nanoribbon excitons, using excitonic energies, transition dipoles, and lifetimes obtained from first-principles calculations to parameterize the model. In the small- and moderate-exchange regimes, the dynamics become multiscale, and the beat channel sustains sizable quantum entanglement over long dissipative time windows. In the large-exchange regime, the excitonic Hamiltonian dominates and drives nearly complete population transfer between excitonic states over many coherent cycles. The resulting analytical expressions provide direct design rules connecting the beat period, transfer amplitude, and coherent-cycle number to the exchange interaction, cavity detuning, and light--matter coupling. Our results establish a controllable route for engineering long-lived entanglement and coherent excitonic operations in exciton--bimodal-cavity systems.

cond-mat.mes-hall↗

QPI-DeepONet-MAC: A Scalable and Stable Hybrid Classical-Quantum Architecture for Physics-Informed Deep Operator Networks

General operator learning for parametric partial differential equations (PDEs) is a fundamental challenge at the intersection of artificial intelligence and physics-based modeling. Physics-informed Deep Operator Networks (PI-DeepONets) incorporate governing equations into learning, but face optimization difficulties in high dimensions. Quantum extensions offer additional representational capacity, yet their trainability can be hindered by barren plateaus. Here, we introduce QPI-DeepONet-MAC, a hybrid quantum-classical architecture that integrates parameterized quantum circuits into PI-DeepONets through a multiplicative-and-additive coupling (MAC) of classical representations and quantum expectation values. We prove analytically that the proposed architecture retains universal operator approximation capabilities. Furthermore, we derive bounds on quantum parameter gradients, establishing explicit conditions to avoid barren plateaus alongside a scaling criterion for trainability. Additionally, we derive a lower bound on the number of sensors required for a target accuracy, directly linking sampling requirements to input function regularity, domain dimension, and PDE dynamical growth. Finally, we propose an informational regularization scheme based on quantum coherence and state fidelity dynamics to prevent coherence loss and preserve quantum structure during training. Together, these results establish a theoretical foundation for quantum-enhanced physics-informed operator learning and position QPI-DeepONet-MAC as a scalable, stable framework for solving parametric PDEs.

quant-ph↗

Preparing general mixed quantum states on quantum computers

The preparation of quantum states is a fundamental subroutine for a broad class of quantum information protocols and is critical for both quantum communication and quantum computation. Building upon the quantum algorithms introduced in previous works [M. B. Pozzobom and J. Maziero, Quantum Inf. Process. 18, 142 (2019)] and [E. R. Gårding \textit{et al.}, Entropy 23, 797 (2021)], the authors of [F. Shahbeigi, M. Karimi and V. Karimipour, Phys. Scr. 97, 025101 (2022)] demonstrated the capability to prepare mixed two-qubit X-real states on quantum computers by extending the methodology originally devised for mixed two-qubit Bell diagonal states. In this article, we delve into an overlooked pattern within these quantum circuits, allowing us to present a modular algorithm for the preparation of general $d$-dimensional mixed quantum states using quantum information processors. Our general algorithm has a modular structure, encompassing eigenvalue encoding, entropy injection, and eigenvector preparation. To validate our algorithm, we conduct tests on quantum computers utilizing both X- and non X-states for two mixed-state qubits, two-ququart Bell-diagonal states, as well as arbitrary random density matrices spanning one, two, and three qubits.

quant-ph↗

Prime Number Identification Demonstrated with Quantum Processors Using a New Rescaling-Based Noise Mitigation Technique

We implement a quantum protocol for prime number identification based on entanglement dynamics, using IBM quantum processors. The method links the primality of an integer to specific Fourier components extracted from the time evolution of entanglement in a bipartite quantum system. To mitigate experimental noise, we introduce a noise-mitigation method based on a global rescaling factor, which is calibrated on a subset of circuits and extrapolated across different configurations. Theoretical support is provided by a new analytical bound for the Fourier modes derived assuming an initial uniform superposition state. This new bound enhances the separation between prime and composite numbers under moderate experimental deviations. These results represent a step toward practical number-theoretic applications on noisy intermediate-scale quantum (NISQ) devices.

quant-ph↗

Bohr's complementarity

Quantum complementarity is a fundamental feature of quantum systems and has captivated the physics research community for nearly a century, with significant advancements emerging in recent decades. This review traces the historical evolution of the concept of complementarity, beginning with Bohr's original formulation. It then explores its modern quantification through complementarity relations and its profound connection to the foundational postulates of quantum theory. Furthermore, it delves into key related developments, such as the operational definition of complementarity in the context of incompatible observables, its potential links with quantum uncertainty relations and contextuality, its various applications, and other pertinent topics. This review aims to serve physicists interested in quantum resources, quantum correlations, and the foundational principles of quantum mechanics.

quant-ph↗

Entanglement distribution in quantum networks via swapping of partially entangled pure states

The entanglement swapping protocol (ESP) is a fundamental primitive for distributing quantum correlations across distant nodes in a quantum network. Recent studies have demonstrated that even when the involved qubit pairs are only partially entangled, it is still possible to concentrate and transmit entanglement via Bell-basis measurements. In this work, we extend these ideas to quantum networks with various topologies--including linear, star, and hybrid configurations--by analysing the application of the ESP to initially partially entangled pure states. We investigate how entanglement evolves under such protocols by considering the transformations of the initial states and evaluating the success probabilities for generating maximally entangled states at the output. Our results offer new insights into the dynamics of the entanglement distribution in quantum networks.

quant-ph↗

A variational quantum algorithm for entanglement quantification

Quantum entanglement is a foundational resource in quantum information science, underpinning applications across physics. However, detecting and quantifying entanglement remains a significant challenge. In this article, we introduce a variational quantum algorithm inspired by Uhlmann's theorem to quantify the Bures entanglement of general quantum states, a method that naturally extends to other quantum resources, including genuine multipartite entanglement, quantum discord, quantum coherence, and total correlations, while also enabling reconstruction of the closest free states. The algorithm requires a polynomial number of ancillary qubits and circuit depth relative to the system size, dimensionality, and free state cardinality, making it scalable for practical implementations. Thus, it provides a versatile framework for quantifying quantum resources, demonstrated here through several applications.

quant-ph↗

Digital quantum simulation of bosonic systems and quantum complementarity

Digital quantum simulation (DQS) has emerged as a powerful approach to investigate complex quantum systems using digital quantum computers. Such systems, like many-particle bosonic systems and intricate optical experimental setups, pose significant challenges for classical simulation methods. In this paper, we utilize a general formalism for the DQS of bosonic systems, which consists of mapping bosonic operators to Pauli operators using the Gray code, in order to simulate interferometric variants of Afshar's experiment -- an intricate optical experiment -- on IBM's quantum computers. We investigated experiments analogous to Afshar's double-slit experiment performed by Unruh and Pessoa Júnior, exploring discussions on the apparent violation of Bohr's complementarity principle when considering the entire experimental setup. Based on the aforementioned experiments, we construct a variation of a delayed-choice setup. We also explore another experiment starting with a two-photon initial state. Finally, we analyze these experiments within the framework of an updated quantum complementarity principle, which applies to specific quantum state preparations and remains consistent with the foundational principles of Quantum Mechanics.

quant-ph↗

Screening in the Heitler-London Model: Revisiting the Bonding and Antibonding States of the Hydrogen Molecule

The present manuscript revisits one of the earliest approaches to treating molecular systems within the Schrödinger formalism of quantum mechanics: the Heitler-London (HL) model. Originally proposed in 1927 and based on a linear combination of atomic orbitals, the HL model provided a foundational description of covalent bonds and has served as the basis for numerous variational methods. Focusing on the hydrogen molecule, we begin by revisiting the analytical calculations of the original HL model, from which the qualitative physics of bonding and antibonding states can be obtained. Subsequently, we propose including electronic screening effects directly in the original HL wave function. We then compare our proposal with variational quantum Monte Carlo (VQMC) calculations, whose trial wave function allows us to optimize the electronic screening potential as a function of the inter-proton distance. We obtain the bond length, binding energy, and vibrational frequency of the H$_2$ molecule. Beyond revisiting this foundational approach in quantum mechanics, our proposal can serve as improved input for constructing new, but still analytically simple, variational wave functions to describe dissociation or bond formation.

physics.chem-ph↗

Entanglement swapping for partially entangled qudits and the role of quantum complementarity

We extend the entanglement swapping protocol (ESP) to partially entangled qudit states and analyze the process within the framework of complete complementarity relations (CCRs). Building on previous results for qubits, we show that the average distributed entanglement between two parties via ESP is bounded above by the initial entanglement of one of the input pairs, and also by the product of the initial entanglements. Notably, we find that using initial states with vanishing local quantum coherence is sufficient to capture the essential features of the protocol, simplifying the analysis. By exploring the cases of qubits and qutrits, we observe that the upper bound on the average distributed entanglement -- expressed in terms of the product of the initial entanglements -- can be improved, and we conjecture what this tighter bound might be. Finally, we discuss the role of quantum complementarity in the ESP and show how local predictability constrains the entanglement that can be operationally distributed via ESP.

quant-ph↗

Work distribution of quantum fields in static curved spacetimes

We investigate the formulation of work distributions for quantum scalar fields in static curved spacetimes by extending the Ramsey interferometric protocol originally developed in previous works for flat spacetimes. The use of Unruh-DeWitt particle detectors provides a causally consistent framework to define and measure work statistics, avoiding the limitations of the two-time projective measurement scheme in relativistic quantum field theory. We derive a non-perturbative expression for the characteristic function of the quantum field and apply it to thermal Kubo-Martin-Schwinger (KMS) states, showing that the resulting work distributions satisfy both the Crooks fluctuation theorem and the Jarzynski equality. Furthermore, we analyse the case of a pointlike detector, obtaining compact expressions for the first two moments of the work distribution, allowing us to recover the standard fluctuation-dissipation relation in the high-temperature limit. Our results demonstrate that fluctuation theorems hold for quantum fields interacting with Unruh-DeWitt particle detectors in static curved spacetimes.

quant-ph↗

Hartman Effect from a Geometrodynamic Extension of Bohmian Mechanics

This paper develops a geometrodynamic extension of Bohmian mechanics to describe quantum tunneling through a potential barrier, treating particle trajectories as geodesics in an Alcubierre-type spacetime. The model provides analytical expressions for the quantum potential, particle dynamics, and tunneling time, explicitly linked to the underlying spacetime geometry. For narrow barriers, the tunneling time depends on the barrier width, while for sufficiently wide barriers, it saturates to a constant value-recovering the Hartman effect. This behavior arises from a geometric self-regulation mechanism, where the quantum potential dynamically adjusts the spacetime distortion to maintain a fixed tunneling time, consistent with relativistic causality despite effective superluminal propagation. The results establish a direct connection between quantum tunneling and spacetime geometry, offering a unified framework to interpret the Hartman effect. This approach naturally incorporates relativistic constraints while suggesting that similar geometric mechanisms may underlie other quantum phenomena, such as topological phases in condensed matter systems.

quant-ph↗

Correlating Local Quantum Reality with Causally Disconnected Choices

In 1935, Einstein, Podolsky, and Rosen (EPR) claimed the incompleteness of quantum mechanics based on the notions of realism (``{\it If, without in any way disrupting a system, we can predict with certainty - i.e., with a probability of one - the value of a physical quantity, then an element of physical reality corresponds to this physical quantity.}'') and locality (``{\it ...\,since the two systems no longer interact, no real change can take place in the second system in consequence of anything that may be done to the first system}''). EPR also insisted that ``{\it The elements of physical reality cannot be determined by \emph{a priori} philosophical considerations, but must be found by\,...\,experiments and measurements.}''. Here, employing an operational framework for testing realism in quantum systems, we envisage an experiment -- referred to as the Reality Quantum Correlator (RQC) -- capable of showing that the elements of reality in one laboratory can be correlated with causally disconnected choices, thus questioning EPR's locality. Empirical evidence supporting our theoretical predictions is then provided by implementing the corresponding quantum circuit on IBM's quantum computers.

quant-ph↗

Efficient detection of localization transitions using predictability

Identifying phase transition points is a fundamental challenge in condensed matter physics, particularly for transitions driven by quantum interference effects, such as Anderson and many-body localization. Recent studies have demonstrated that quantum coherence provides an effective means of detecting localization transitions, offering a practical alternative to full quantum state tomography and related approaches. Building on this idea, we investigate localization transitions through complementarity relations that connect local predictability, local coherence, and entanglement in bipartite pure states. Our results show that predictability serves as a robust and efficient marker for localization transitions. Crucially, its experimental determination requires exponentially fewer measurements than coherence or entanglement, making it a powerful tool for probing quantum phase transitions.

quant-ph↗

QuForge: A Library for Qudits Simulation

Quantum computing with qudits, an extension of qubits to multiple levels, is a research field less mature than qubit-based quantum computing. However, qudits can offer some advantages over qubits, by representing information with fewer separated components. In this article, we present QuForge, a Python-based library designed to simulate quantum circuits with qudits. This library provides the necessary quantum gates for implementing quantum algorithms, tailored to any chosen qudit dimension. Built on top of differentiable frameworks, QuForge supports execution on accelerating devices such as GPUs and TPUs, significantly speeding up simulations. It also supports sparse operations, leading to a reduction in memory consumption compared to other libraries. Additionally, by constructing quantum circuits as differentiable graphs, QuForge facilitates the implementation of quantum machine learning algorithms, enhancing the capabilities and flexibility of quantum computing research.

quant-ph↗

Quantum neural network with ensemble learning to mitigate barren plateaus and cost function concentration

The rapid development of quantum computers promises transformative impacts across diverse fields of science and technology. Quantum neural networks (QNNs), as a forefront application, hold substantial potential. Despite the multitude of proposed models in the literature, persistent challenges, notably the vanishing gradient (VG) and cost function concentration (CFC) problems, impede their widespread success. In this study, we introduce a novel approach to quantum neural network construction, specifically addressing the issues of VG and CFC. Our methodology employs ensemble learning, advocating for the simultaneous deployment of multiple quantum circuits with a depth equal to \(1\), a departure from the conventional use of a single quantum circuit with depth \(L\). We assess the efficacy of our proposed model through a comparative analysis with a conventionally constructed QNN. The evaluation unfolds in the context of a classification problem, yielding valuable insights into the potential advantages of our innovative approach.

quant-ph↗