SearcharxivSearch

arXiv subjects

Askery Canabarro

Publications and source records attributed to Askery Canabarro.

At least 19 recordsLinked to original sources

Machine-learned syndrome post-selection for reliable quantum error correction

Quantum error correction can be enhanced by post-selecting out runs that are likely to produce a logical failure, but the most accurate measures for that require costly decoder-level information. We introduce a practical, decoder-agnostic post-selection method that learns directly from syndrome data. The method trains a supervised classifier to distinguish between syndromes from low- and high-noise regimes, and then uses the classifier's output as an abort score for new runs, without requiring logical-error labels, correction operators, or code-specific likelihood calculations. We validate the approach in three complementary settings: circuit-level simulations of the Gross bivariate-bicycle code, code-capacity simulations of the surface code, and experimental logical magic-state distillation data from the QuEra neutral-atom processor. In the Gross and surface codes, learned syndrome post-selection reduces the conditional logical error rate at a fixed acceptance rate, with performance comparable to syndrome-weight filtering. For the surface code, the learned classifier reveals a post-selection transition distinct from the conventional decoding threshold. In the experimental data, the machine-learning score outperforms syndrome-weight post-selection and, when combined with logical-gap filtering, improves the output fidelity beyond using the logical gap alone. These results show that syndrome-only learning provides a scalable and hardware-compatible route to improving the reliability of quantum error correction.

quant-ph

Distinguishing Ordered Phases using Machine Learning and Classical Shadows

Classifying phase transitions is a fundamental and complex challenge in condensed matter physics. This work proposes a framework for identifying quantum phase transitions by combining classical shadows with unsupervised machine learning. We use the axial next-nearest neighbor Ising model as our benchmark and extend the analysis to the Kitaev-Heisenberg model on a two-leg ladder. Even with few qubits, we can effectively distinguish between the different phases of the Hamiltonian models. {Furthermore, by relying on a restricted set of local observables, such as pairwise correlations and plaquette operators, the sample complexity of the classical shadows protocol scales logarithmically with the number of measured features. This makes our approach a scalable and efficient tool for studying phase transitions in larger many-body systems where classical verification becomes intractable.

quant-ph

A competitive NISQ and qubit-efficient solver for the LABS problem

Pauli Correlation Encoding (PCE) is as a qubit-efficient variational approach to combinatorial optimization problems. The method offers a polynomial reduction in qubit count and a super-polynomial suppression of barren plateaus. Here, we extend the PCE-based framework to solve the Low Autocorrelation Binary Sequences (LABS) problem, a notoriously hard problem often used as a benchmark for classical and quantum solvers. To illustrate this,we simulate two variants of the PCE quantum solver for LABS instances of up to $N=45$ binary variables: one with commuting and one with maximally non-commuting sets of Pauli operators. The simulations use $4$ qubits and a circuit Ansatz with a total of $30$ two-qubit gates. We benchmark our method against the state-of-the-art classical solver and other quantum schemes. We observe improved scaling in the total time to reach the exact solution, outperforming the best-performing classical heuristic while using only a fraction of the quantum resources required by other quantum approaches. In addition, we perform proof-of-principle demonstrations on IonQ's Forte quantum processor, showing that the final solution is resilient to noise. Our findings point at PCE-based solvers as a promising quantum-inspired classical heuristic for hard problems as well as a tool to reduce the resource requirements for actual quantum algorithms.

quant-ph

Expressibility, entangling power and quantum average causal effect for causally indefinite circuits

Parameterized quantum circuits are the core of new technologies such as variational quantum algorithms and quantum machine learning, which makes studying its properties a valuable task. We implement parameterized circuits with definite and indefinite causal order and compare their performance under particular descriptors. One of these is the expressibility, which measures how uniformly a given quantum circuit can reach the whole Hilbert space. Another property that we focus on this work is the entanglement capability, more specifically the concurrence and the entangling power. We also find the causal relation between the qubits of our system with the quantum average causal effect measure. We have found that indefinite circuits offer expressibility advantages over definite ones while maintaining the level of entanglement generation. Our results also point to the existence of a correlation between the quantum average causal effect and the entangling power.

quant-ph

Predicting topological invariants and unconventional superconducting pairing from density of states and machine learning

Competition between magnetism and superconductivity can lead to unconventional and topological superconductivity. However, the experimental confirmation of the presence of Majorana edge states and unconventional pairing currently poses a major challenge. Here we consider a two-dimensional lattice model for a superconductor with spin-orbit coupling and exchange coupling to randomly distributed magnetic impurities. Depending on parameters of the model, this system may display topologically trivial or nontrivial edge states. We map out the phase diagram by computing the Bott index, a topological invariant defined in real space. We then use machine learning (ML) algorithms to predict the Bott index from the local density of states (LDOS) at zero energy, obtaining high-accuracy results. We also train ML models to predict the amplitude of odd-frequency pairing in the anomalous Green's function at zero energy. Once the ML models are trained using the LDOS, which is experimentally accessible via scanning tunneling spectroscopy, our method could be applied to predict the number of Majorana edge states and to estimate the magnitude of odd-frequency pairing in real materials.

cond-mat.supr-con

Benchmarking Variational Quantum Eigensolvers for Entanglement Detection in Many-Body Hamiltonian Ground States

Variational quantum algorithms (VQAs) have emerged in recent years as a promise to obtain quantum advantage. These task-oriented algorithms work in a hybrid loop combining a quantum processor and classical optimization. Using a specific class of VQA named variational quantum eigensolvers (VQEs), we choose some parameterized quantum circuits to benchmark them at entanglement witnessing and entangled ground state detection for many-body systems described by Heisenberg Hamiltonian, varying the number of qubits and shots. Quantum circuits whose structure is inspired by the Hamiltonian interactions presented better results on cost function estimation than problem-agnostic circuits.

quant-ph

Detecting quantum phase transitions in a frustrated spin chain via transfer learning of a quantum classifier algorithm

The classification of phases and the detection of phase transitions are central and challenging tasks in diverse fields. Within physics, it relies on the identification of order parameters and the analysis of singularities in the free energy and its derivatives. Here, we propose an alternative framework to identify quantum phase transitions. Using the axial next-nearest neighbor Ising (ANNNI) model as a benchmark, we show how machine learning can detect three phases (ferromagnetic, paramagnetic, and a cluster of the antiphase with the floating phase). Employing supervised learning, we demonstrate the feasibility of transfer learning. Specifically, a machine trained only with nearest-neighbor interactions can learn to identify a new type of phase occurring when next-nearest-neighbor interactions are introduced. We also compare the performance of common classical machine learning methods with a version of the quantum nearest neighbors (QNN) algorithm.

quant-ph

Towards accurate real-time luminescence thermometry: an automated machine learning approach

Luminescence thermometry has been extensively exploited in the last decades both from the fundamental and applied point of views. The application of photoluminescent nanoparticles on the microscopic level based on rare-earth doped (RED) nanostructures is yet a challenge. Distinct underlying physical mechanisms in the RED nanomaterials have been exploited, such as intensity ratio between radiative transitions associated with thermally coupled energy levels, energy peak and lifetime of an excited state variations with the temperature. The drawbacks of such systems are the relatively low thermal sensitivity (Sr), and the large temperature uncertainty. To overcome that, several research groups have been seeking new functionalized materials. The majority of the efforts have been directed towards increasing Sr with record around 10 %°C-1, which is, however, considered unsatisfactory. We propose the use of an automated machine learning tool to retrieve an ideal pipeline improving the response of photoluminescence thermometers. As a proof-of-concept, we used Nd3+-doped YAG nanoparticles, excited at 760 nm, and the photoluminescence spectra in the range from 860 nm to 960 nm as input parameters. In addition to the improvement in the accuracy (> 5.5x over traditional methods), the implementation is very simple, without the requirement of any deconvolution procedure or knowledge of any underlying physical mechanism. Our findings demonstrate that this approach is resilient to natural variances across various spectral acquisitions, which may otherwise lead to an inaccurate estimation of temperature, opening the door for real-time applications. Our open-source code is designed to be accessible to individuals without programming experience.

physics.ins-det

Experimental nonclassicality in a causal network without assuming freedom of choice

In a Bell experiment, it is natural to seek a causal account of correlations wherein only a common cause acts on the outcomes. For this causal structure, Bell inequality violations can be explained only if causal dependencies are modelled as intrinsically quantum. There also exists a vast landscape of causal structures beyond Bell that can witness nonclassicality, in some cases without even requiring free external inputs. Here, we undertake a photonic experiment realizing one such example: the triangle causal network, consisting of three measurement stations pairwise connected by common causes and no external inputs. To demonstrate the nonclassicality of the data, we adapt and improve three known techniques: (i) a machine-learning-based heuristic test, (ii) a data-seeded inflation technique generating polynomial Bell-type inequalities and (iii) entropic inequalities. The demonstrated experimental and data analysis tools are broadly applicable paving the way for future networks of growing complexity.

quant-ph

Quantum Finance: a tutorial on quantum computing applied to the financial market

Previously only considered a frontier area of Physics, nowadays quantum computing is one of the fastest growing research field, precisely because of its technological applications in optimization problems, machine learning, information security and simulations. The goal of this article is to introduce the fundamentals of quantum computing, focusing on a promising quantum algorithm and its application to a financial market problem. More specifically, we discuss the portfolio optimization problem using the \textit{Quantum Approximate Optimization Algorithm} (QAOA). We not only describe the main concepts involved but also consider simple practical examples, involving financial assets available on the Brazilian stock exchange, with codes, both classic and quantum, freely available as a Jupyter Notebook. We also analyze in details the quality of the combinatorial portfolio optimization solutions through QAOA using SENAI/CIMATEC's ATOS QLM quantum simulator.

q-fin.PM

Experimental genuine tripartite nonlocality in a quantum triangle network

Quantum networks are the center of many of the recent advances in quantum science, not only leading to the discovery of new properties in the foundations of quantum theory but also allowing for novel communication and cryptography protocols. It is known that networks beyond that in the paradigmatic Bell's theorem imply new and sometimes stronger forms of nonclassicality. Due to a number of practical difficulties, however, the experimental implementation of such networks remains far less explored. Going beyond what has been previously tested, here we verify the nonlocality of an experimental triangle network, consisting of three independent sources of bipartite entangled photon states interconnecting three distant parties. By performing separable measurements only and evaluating parallel chained Bell inequalities, we show that such networks can lead to a genuine form of tripartite nonlocality, where classical models are unable to mimic the quantum predictions even if some of the parties are allowed to communicate.

quant-ph

Causal Networks and Freedom of Choice in Bell's Theorem

Bell's theorem is typically understood as the proof that quantum theory is incompatible with local-hidden-variable models. More generally, we can see the violation of a Bell inequality as witnessing the impossibility of explaining quantum correlations with classical causal models. The violation of a Bell inequality, however, does not exclude classical models where some level of measurement dependence is allowed, that is, the choice made by observers can be correlated with the source generating the systems to be measured. Here, we show that the level of measurement dependence can be quantitatively upper bounded if we arrange the Bell test within a network. Furthermore, we also prove that these results can be adapted in order to derive nonlinear Bell inequalities for a large class of causal networks and to identify quantumly realizable correlations that violate them.

quant-ph

Inferring galaxy dark halo properties from visible matter with Machine Learning

Next-generation surveys will provide photometric and spectroscopic data of millions to billions of galaxies with unprecedented precision. This offers a unique chance to improve our understanding of the galaxy evolution and the unresolved nature of dark matter (DM). At galaxy scales, the density distribution of DM is strongly affected by the astrophysical feedback processes, which are difficult to fully account for in classical techniques to derive mass models. In this work, we explore the capability of supervised learning algorithms to predict the DM content of galaxies from luminous observational-like parameters, using the public catalog of the TNG100 simulation. In particular, we use Photometric, Structural and Kinematic parameters to predict the total DM mass, DM half-mass radius, DM mass inside one and two stellar half-mass radii. We adopt the coefficient of determination, $R^2$, as a reference metric to evaluate the accuracy of these predictions. We find that the Photometric features alone are able to predict the total DM mass with fair accuracy, while Structural and Photometric features together are more effective to determine the DM inside the stellar half mass radius, and the DM within twice the stellar half mass radius. However, using all observational quantities together (Photometry, Structural and Kinematics) incredibly improves the overall accuracy for all DM quantities. This first test shows that Machine Learning tools are promising approaches to derive predictions of the DM in real galaxies. The next steps will be to improve observational realism of the training sets, by closely select samples which accurately reproduce the typical observed luminous scaling relations. The trained pipelines will be suitable for real galaxy data collected from the next-generation surveys like Rubin/LSST, Euclid, CSST, 4MOST, DESI, to derive, e.g., the properties of their central DM fractions.

astro-ph.GA

Satellite-based photonic quantum networks are small-world

Recent milestone experiments establishing satellite-to-ground quantum communication are paving the way for the development of the quantum internet, a network interconnected by quantum channels. Here we employ network theory to study the properties of the photonic networks that can be generated by satellite-based quantum communication and compare it with the optical-fiber counterpart. We predict that satellites can generate small-world networks, implying that physically distant nodes are actually near from a network perspective. We also analyse the connectivity properties of the network and show, in particular, that they are robust against random failures. This puts satellite-based quantum communication as the most promising technology to distribute entanglement across large distances in quantum networks of growing size and complexity.

quant-ph

Automated Machine Learning can Classify Bound Entangled States with Tomograms

For quantum systems with a total dimension greater than six, the positive partial transposition (PPT) criterion is sufficient but not necessary to decide the non-separability of quantum states. Here, we present an Automated Machine Learning approach to classify random states of two qutrits as separable or entangled using enough data to perform a quantum state tomography, without any direct measurement of its entanglement. We could successfully apply our framework even when the Peres-Horodecki criterion fails. In addition, we could also estimate the Generalized Robustness of Entanglement with regression techniques and use it to validate our classifiers.

quant-ph

Near-infrared holographic photorefractive recording under applied electric field in undoped Bi$_{12}$TiO$_{20}$ sillenite crystal

Direct holographic recording in undoped Bi$_{12}$TiO$_{20}$ crystal at 1064 nm is investigated aiming the characterization of diffraction efficiency under action of applied dc electric field ($E_0$). An enhancement of 12-fold in the diffraction efficiency was revealed when $E_0$ increased from 0.0 to 4.2 kV/cm. The theoretical dependence of the diffraction efficiency upon $E_0$ was investigated using the standard model for photorefractivity and the results showed a good experimental data fitting, allowing the computation of the effective trap concentration $(N_D$$)_{eff}$ $\approx$ $5.3\times 10^{15}$ cm$^{-3}$ which is responsible by the recording mechanism into the BTO crystal sample. The type of charge carrier involved in the recording mechanism in the nearinfrared region is also discussed.

physics.optics

Probing the reciprocal lattice associated with a triangular slit to determine the orbital angular momentum for a photon

The orbital angular momentum conservation of light reveals different diffraction patterns univocally dependent on the topological charge of the incident light beam when passing through a triangular aperture. It is demonstrated that these patterns, which are accessed by observing the far field measurement of the diffracted light, can also be obtained using few photon sources. In order to explain the observed patterns, we introduce an analogy of this optical phenomenon with the study of diffraction for the characterization of the crystal structure of solids. We demonstrate that the finite pattern can be associated to the reciprocal lattice obtained from the direct lattice generated by the primitive vectors composing any two of the sides of the equilateral triangular slit responsible for the diffraction. Using the relation that exists between the direct and reciprocal lattices, we provide a conclusive explanation of why the diffraction pattern of the main maxima is finite. This can shed a new light on the investigation of crystallographic systems.

physics.optics

Statistical properties of the quantum internet

Steady technological advances are paving the way for the implementation of the quantum internet, a network of locations interconnected by quantum channels. Here we propose a model to simulate a quantum internet based on optical fibers and employ network-theory techniques to characterize the statistical properties of the photonic networks it generates. Our model predicts a continuous phase transition between a disconnected and a highly-connected phase characterized by the computation of critical exponents. Moreover we show that, although the networks do not present the small world property, the average distance between nodes is typically small.

quant-ph