Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Data and simulation files for: "Estimating the electrical energy cost of performing arbitrary state preparation using qubits and qudits in integrated photonic circuits"

Maria Carolina Volpato, Pierre-Louis de Assis

Published Jan 1, 2024• 0 citations
Publisher

Abstract

Data and simulation files for: "Estimating the electrical energy cost of performing arbitrary state preparation using qubits and qudits in integrated photonic circuits"
DOI
10.5281/zenodo.13387079

Related papers

Electrical energy cost of arbitrary state preparation with programmable integrated photonic circuits

Maria Carolina Volpato, Gabriel da Silva Sampaio, Pierre-Louis de Assis

We evaluate the electrical energy cost of arbitrary qubit-state preparation in programmable photonic circuits using state-of-the-art electro-optical modulators, comparing gate-based and measurement-based quantum computation.

Conference on Lasers and Electro-Optics•Jan 1, 2026•0 citations

Research data supporting "Electrically driven and electrically tunable quantum light sources"

James Lee, Murray, E, AJ Bennett +6 more

Data from "Electrically driven and electrically tunable quantum light sources"

•Dec 16, 2016•0 citations

Estimating the electrical energy cost of performing arbitrary state preparation using qubits and qudits in integrated photonic circuits

Maria Carolina Volpato, Gabriel da Silva Sampaio, Pierre-Louis de Assis

As quantum photonic hardware scales toward computationally relevant sizes, energy consumption has emerged as a key constraint. Programmable photonic integrated circuits, composed of interferometer meshes with tunable phase modulators, provide a flexible platform for quantum information processing using both qubits and qudits. In this work, we analyze the energetic cost of such devices by focusing on arbitrary quantum state preparation, a resource-intensive task central to quantum simulation and information processing. Using a common hardware, we benchmark qudit-based implementations, gate-based quantum computation, and measurement-based quantum computation. We find that while qudit encodings are attractive at small scale, their footprint and reconfiguration costs grow rapidly with system size, whereas qubit-based approaches incur significant overhead from entangling operations, feedforward, and reprogramming. Across all paradigms, scaling beyond a few tens of qubits renders either the energy consumption or the total preparation time prohibitive on fully programmable PICs. Our results highlight the need for optimized, task-specific photonic architectures to enable energy-efficient scaling.

arXiv:2402.16603•Feb 26, 2024•3 citations

Simulation Paths for Quantum Circuit Simulation with Decision Diagrams

Lukas Burgholzer, Robert Wille

Springer eBooks•Jan 1, 2026•0 citations

Widening the Bit: Extending QCLAB to Qudits and Generalizing State Preparation

SIMONE IANNICIELLO

The research on qudits, which are the d-level generalization of qubits, as of now is in very early stages, in particular from the software and simulation point of view. This thesis actively extends QCLAB, the MATLAB toolbox for quantum circuits simulation, to qudits of arbitrary dimension d by introducing the necessary circuit representation and simulation as well as gates, building on top of the original functionalities. As a case study, we use the extended tool for qudit state preparation: building a circuit that loads a given vector into a quantum register. We implement the Bullock, O'Leary, and Brennen state preparation construction, which is optimal in gate count, and generalize the KP-Tree data structure and the associated state preparation method of Kerenidis and Prakash to qudits. The generalized method comes in two variants, built on Givens rotations and on Householder reflectors. Under the QRAM model, the Householder variant loads a state with fewer memory queries than the qubit KP-Tree. We validate the correctness of the constructions across several qudit dimensions.

•Oct 10, 2026•0 citations

Interactive Quantum Computing Simulator: Visualization and Exploration of Qubit States and Quantum Circuits

shashidhar macharla, Thirupathi Kandadi

•Jan 1, 2026•0 citations
As quantum photonic hardware scales toward computationally relevant sizes, energy consumption has emerged as a key constraint. Programmable photonic integrated circuits, composed of interferometer meshes with tunable phase modulators, provide a flexible platform for quantum information processing using both qubits and qudits. In this work, we analyze the energetic cost of such devices by focusing on arbitrary quantum state preparation, a resource-intensive task central to quantum simulation and information processing. Using a common hardware, we benchmark qudit-based implementations, gate-based quantum computation, and measurement-based quantum computation. We find that while qudit encodings are attractive at small scale, their footprint and reconfiguration costs grow rapidly with system size, whereas qubit-based approaches incur significant overhead from entangling operations, feedforward, and reprogramming. Across all paradigms, scaling beyond a few tens of qubits renders either the energy consumption or the total preparation time prohibitive on fully programmable PICs. Our results highlight the need for optimized, task-specific photonic architectures to enable energy-efficient scaling.
The research on qudits, which are the d-level generalization of qubits, as of now is in very early stages, in particular from the software and simulation point of view. This thesis actively extends QCLAB, the MATLAB toolbox for quantum circuits simulation, to qudits of arbitrary dimension d by introducing the necessary circuit representation and simulation as well as gates, building on top of the original functionalities. As a case study, we use the extended tool for qudit state preparation: building a circuit that loads a given vector into a quantum register. We implement the Bullock, O'Leary, and Brennen state preparation construction, which is optimal in gate count, and generalize the KP-Tree data structure and the associated state preparation method of Kerenidis and Prakash to qudits. The generalized method comes in two variants, built on Givens rotations and on Householder reflectors. Under the QRAM model, the Householder variant loads a state with fewer memory queries than the qubit KP-Tree. We validate the correctness of the constructions across several qudit dimensions.