SearcharxivSearch

arXiv subjects

Alexandre C. Ricardo

Publications and source records attributed to Alexandre C. Ricardo.

6 recordsLinked to original sources

Optimization Algorithm for Inventory Allocation in Gravity-Flow Racks with Classical and Quantum-Hybrid Computing

Warehouses play a central role in industrial logistics, functioning as critical hubs for storing and organizing inventory to support efficient production. Optimizing item allocation within these facilities is essential for reducing operational costs and improving delivery times. In this work, we address the optimization of inventory allocation in warehouses equipped with gravity-flow racks, which are designed for First In, First Out (FIFO) logistics, a configuration that inherently requires item reinsertions during retrieval operations to maintain flow continuity. These reinsertions, however, are time-consuming and costly, so minimizing their occurrence is crucial for operational efficiency. We propose an optimization strategy that simultaneously allocates multiple items, determining their placement across available shelves in a single decision step, explicitly accounting for every item and every shelf in the warehouse. By jointly evaluating multiple items, our approach enables globally optimized placement decisions, minimizing conflicts that arise in sequential methods. The problem is formulated as a QUBO, allowing implementation on both classical metaheuristics and quantum-hybrid solvers. We assess performance by comparing three classical optimization approaches - two variants of Simulated Annealing and the commercial solver Gurobi - with D-Wave's hybrid solver, which uniquely combines quantum annealing with classical metaheuristics. Complementing these benchmarks, a factory-scale simulation based on real operational data shows that considering larger batches of items in the allocation step can significantly reduce reinsertions, highlighting the practical potential of the proposed approach for industrial logistics.

quant-ph

Assessing the Advantages and Limitations of Quantum Neural Networks in Regression Tasks

The development of quantum neural networks (QNNs) has attracted considerable attention due to their potential to surpass classical models in certain machine learning tasks. Nonetheless, it remains unclear under which conditions QNNs provide concrete benefits over classical neural networks (CNNs). This study addresses this question by performing both qualitative and quantitative analyses of classical and quantum models applied to regression problems, using two target functions with contrasting properties. Additionally, the work explores the methodological difficulties inherent in making fair comparisons between QNNs and CNNs. The findings reveal a distinct advantage of QNNs in a specific quantum machine learning context. In particular, QNNs excelled at approximating the sinusoidal function, achieving errors up to seven orders of magnitude lower than their classical counterparts. However, their performance was limited in other cases, emphasizing that QNNs are highly effective for certain tasks but not universally sPuperior. These results reinforce the principles of the ``No Free Lunch'' theorem, highlighting that no single model outperforms all others across every problem domain.

quant-ph

Quantum computation over the vibrational modes of a single trapped ion

Continuous-variable quantum computing utilizes continuous parameters of a quantum system to encode information, promising efficient solutions to complex problems. Trapped-ion systems provide a robust platform with long coherence times and precise qubit control, enabling the manipulation of quantum information through its motional and electronic degrees of freedom. In this work, quantum operations that can be generated in trapped-ion systems are employed to investigate applications aimed at state preparation in continuous-variable quantum systems.

quant-ph

Warehouse optimization using a trapped-ion quantum processor

Warehouse optimization stands as a critical component for enhancing operational efficiency within the industrial sector. By strategically streamlining warehouse operations, organizations can achieve significant reductions in logistical costs such as the necessary footprint or traveled path, and markedly improve overall workflow efficiency including retrieval times or storage time. Despite the availability of numerous algorithms designed to identify optimal solutions for such optimization challenges, certain scenarios demand computational resources that exceed the capacities of conventional computing systems. In this context, we adapt a formulation of a warehouse optimization problem specifically tailored as a binary optimization problem and implement it in a trapped-ion quantum computer.

quant-ph

Trapped Ions as an Architecture for Quantum Computing

In this paper we describe one of the most promising platforms for the construction of a universal quantum computer, which consists of a chain of $N$ ions trapped in a harmonic potential, whose internal states work out as qubits, and are coupled to collective vibrational modes of the chain. From such coupling, it is possible to build interactions between different ions of the chain, that is, qubit-qubit interactions that, together with individual operations on the ions, allow building a quantum computer as first proposed by Cirac and Zoller in the 1990s [Phys. Rev. Lett. 74, 4091 (1995)]. Here we discuss from the physics involved in trapping ions in electromagnetic potentials to the Hamiltonian engineering needed to generate a universal set of logic gates, fundamental for the execution of more complex quantum algorithms. Finally, we present the current state of the art of quantum computing in trapped ion systems, highlighting recent advances made by companies and government projects that use such architecture, such as IonQ and AQTION.

quant-ph

Alternatives to a nonhomogeneous partial differential equation quantum algorithm

Recently J. M. Arrazola et al. [Phys. Rev. A 100, 032306 (2019)] proposed a quantum algorithm for solving nonhomogeneous linear partial differential equations of the form $Aψ(\textbf{r})=f(\textbf{r})$. Its nonhomogeneous solution is obtained by inverting the operator $A$ along with the preparation and measurement of special ancillary modes. In this work we suggest modifications in its structure to reduce the costs of preparing the initial ancillary states and improve the precision of the algorithm for a specific set of inputs. These achievements enable easier experimental implementation of the quantum algorithm based on nowadays technology.

quant-ph