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

BRILL eBooks

Quantum Creation

Peter Murphy

Published Jun 6, 2023• 0 citations
Publisher
DOI
10.1163/9789004680128_003

Related papers

Remote creation of quantum coherence

Teng Ma, Ming‐Jing Zhao, Shao-Ming Fei +1 more

We study remote creation of coherence (RCC) for a quantum system, A, with the help of quantum operations on another system, B, and one-way classical communication. We show that all the nonincoherent quantum states are useful for RCC and all the incoherent-quantum states are not. The necessary and sufficient conditions of RCC for the quantum operations on system B are presented for pure states. The upper bound of average RCC is derived, giving a relation among the entanglement (concurrence), the RCC of the given quantum state, and the RCC of the corresponding maximally entangled state. Moreover, for two-qubit systems we find a simple factorization law for the average remote-created coherence.

arXiv:1610.02477•Physical Review A•Oct 7, 2016•17 citations

Quantum Evolution

Archaeopress Publishing Ltd eBooks•May 20, 2021•0 citations

The quantum universe

Tony Hey, Patrick Walters

Cambridge University Press eBooks•Jan 1, 1987•0 citations

Quantum Nodes: Quantum Computing Applied to 3D Modeling

Félix Olart, Eloïse Tassin, Laurine Capdeville +3 more

Quantum Nodes is a Blender add-on that introduces the integration of quantum algorithms into the 3D creation process. Our work focuses on allowing users to experiment both new forms of creation and approaching the concepts of quantum computing through 3D creation.

ACM SIGGRAPH Conference (SIGGRAPH)•Aug 5, 2021•1 citation

The Quantum Universe

J. R. Forshaw, Brian Cox

•Oct 29, 2011•10 citations

Characterization of Quantum States Based on Creation Complexity

Zixuan Hu, Sabre Kais

Abstract The creation complexity of a quantum state is the minimum number of elementary gates required to create it from a basic initial state. The creation complexity of quantum states is closely related to the complexity of quantum circuits, which is crucial in developing efficient quantum algorithms that can outperform classical algorithms. A major question unanswered so far is what quantum states can be created with a number of elementary gates that scales polynomially with the number of qubits. In this work, it is first shown that for an entirely general quantum state it is exponentially hard (requires a number of steps that scales exponentially with the number of qubits) to determine if the creation complexity is polynomial. Then, it is shown that it is possible for a large class of quantum states with polynomial creation complexity to have common coefficient features such that, given any candidate quantum state, an efficient coefficient sampling procedure can be designed to determine if the state belongs to the class or not with arbitrarily high success probability. Consequently, partial knowledge of a quantum state's creation complexity is obtained, which can be useful for designing quantum circuits and algorithms involving such a state.

arXiv:2004.13827•Advanced Quantum Technologies•Aug 28, 2020•7 citations
We study remote creation of coherence (RCC) for a quantum system, A, with the help of quantum operations on another system, B, and one-way classical communication. We show that all the nonincoherent quantum states are useful for RCC and all the incoherent-quantum states are not. The necessary and sufficient conditions of RCC for the quantum operations on system B are presented for pure states. The upper bound of average RCC is derived, giving a relation among the entanglement (concurrence), the RCC of the given quantum state, and the RCC of the corresponding maximally entangled state. Moreover, for two-qubit systems we find a simple factorization law for the average remote-created coherence.
Abstract The creation complexity of a quantum state is the minimum number of elementary gates required to create it from a basic initial state. The creation complexity of quantum states is closely related to the complexity of quantum circuits, which is crucial in developing efficient quantum algorithms that can outperform classical algorithms. A major question unanswered so far is what quantum states can be created with a number of elementary gates that scales polynomially with the number of qubits. In this work, it is first shown that for an entirely general quantum state it is exponentially hard (requires a number of steps that scales exponentially with the number of qubits) to determine if the creation complexity is polynomial. Then, it is shown that it is possible for a large class of quantum states with polynomial creation complexity to have common coefficient features such that, given any candidate quantum state, an efficient coefficient sampling procedure can be designed to determine if the state belongs to the class or not with arbitrarily high success probability. Consequently, partial knowledge of a quantum state's creation complexity is obtained, which can be useful for designing quantum circuits and algorithms involving such a state.