default search action
Monireh Houshmand
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Mohammad Bolokian
, Ali A. Orouji
Advancing quantum broadcast performance in noisy environments: a generalized approach with 4n-qubit cluster states. Quantum Inf. Process. 23(3): 85 (2024) - [j16]Masoumeh Shirichian
A QTCP/IP reference model for partially trusted-node-based quantum-key-distribution-secured optical networks. Quantum Inf. Process. 23(3): 87 (2024) - [j15]Amir Hossein Salari, Saeed Khosroabadi, Monireh Houshmand
A novel design of quantum CNOT based on photonic crystal. Quantum Inf. Process. 23(4): 149 (2024) - [j14]Monireh Houshmand, Safa Jami, Majid Haghparast:
General controlled cyclic remote state preparations and their analysis. Quantum Inf. Process. 23(11): 372 (2024) - 2021
- [j13]David Orrell, Monireh Houshmand:
Quantum Propensity in Economics. Frontiers Artif. Intell. 4 (2021) - [j12]Ismail Ghodsollahee
Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization. Quantum Inf. Process. 20(7): 1-21 (2021)
2010 – 2019
- 2019
- [j11]Shahrokh Heidari
A dual quantum image scrambling method. Quantum Inf. Process. 18(1): 9 (2019) - [j10]Mohammad Sadegh Sadeghi-Zadeh, Monireh Houshmand, Hossein Aghababa, Mohammad Hossein Kochakzadeh, Fatemeh Zarmehi
Bidirectional quantum teleportation of an arbitrary number of qubits over noisy channel. Quantum Inf. Process. 18(11): 353 (2019) - [i9]Mahboobeh Houshmand, Zahra Mohammadi, Mariam Zomorodi Moghadam, Monireh Houshmand:
An Evolutionary Approach to Optimizing Communication Cost in Distributed Quantum Computation. CoRR abs/1910.07877 (2019) - 2018
- [i8]Monireh Houshmand, Mahboobeh Houshmand, Si-Hui Tan, Joseph F. Fitzsimons:
Composable secure multi-client delegated quantum computation. CoRR abs/1811.11929 (2018) - 2017
- [j9]Ali Karimi-Lenji, Monireh Houshmand
A high-performance belief propagation decoding algorithm for codes with short cycles. Int. J. Commun. Syst. 30(13) (2017) - 2016
- [j8]Fatemeh Zarmehi
Controlled Bidirectional Quantum Secure Direct Communication Network Using Classical XOR Operation and Quantum Entanglement. IEEE Commun. Lett. 20(10): 2071-2074 (2016) - [j7]Shima Hassanpour, Monireh Houshmand:
Bidirectional teleportation of a pure EPR state by using GHZ states. Quantum Inf. Process. 15(2): 905-912 (2016) - [i7]Mariam Zomorodi Moghadam, Monireh Houshmand, Mahboobeh Houshmand:
Optimizing Teleportation Cost in Distributed Quantum Circuits. CoRR abs/1605.07935 (2016) - [i6]Moein Sarvaghad-Moghaddam, Ali A. Orouji, Monireh Houshmand:
A multi-objective synthesis methodology in quantum-dot cellular automata technology. CoRR abs/1606.00203 (2016) - 2015
- [j6]Mahboobeh Houshmand
GA-based approach to find the stabilizers of a given sub-space. Genet. Program. Evolvable Mach. 16(1): 57-71 (2015) - [j5]Shima Hassanpour, Monireh Houshmand:
Efficient controlled quantum secure direct communication based on GHZ-like states. Quantum Inf. Process. 14(2): 739-753 (2015) - 2013
- [j4]Razieh Rezaee, Mahboobeh Houshmand
Multi-objective optimization of QCA circuits with multiple outputs using genetic programming. Genet. Program. Evolvable Mach. 14(1): 95-118 (2013) - [j3]Monireh Houshmand, Saied Hosseini-Khayat, Mark M. Wilde
Minimal-Memory, Noncatastrophic, Polynomial-Depth Quantum Convolutional Encoders. IEEE Trans. Inf. Theory 59(2): 1198-1210 (2013) - [j2]Monireh Houshmand, Mark M. Wilde
Recursive Quantum Convolutional Encoders are Catastrophic: A Simple Proof. IEEE Trans. Inf. Theory 59(10): 6724-6731 (2013) - 2012
- [j1]Monireh Houshmand, Saied Hosseini-Khayat, Mark M. Wilde
Minimal-Memory Requirements for Pearl-Necklace Encoders of Quantum Convolutional Codes. IEEE Trans. Computers 61(3): 299-312 (2012) - [i5]Monireh Houshmand, Mark M. Wilde:
Recursive quantum convolutional encoders are catastrophic: A simple proof. CoRR abs/1209.0082 (2012) - 2011
- [c2]Mark M. Wilde
Examples of minimal-memory, non-catastrophic quantum convolutional encoders. ISIT 2011: 450-454 - [i4]Monireh Houshmand, Saied Hosseini-Khayat, Mark M. Wilde:
Minimal-memory, non-catastrophic, polynomial-depth quantum convolutional encoders. CoRR abs/1105.0649 (2011) - 2010
- [c1]Mahboobeh Houshmand
Game Theory Based View to the Quantum Key Distribution BB84 Protocol. IITSI 2010: 332-336 - [i3]Monireh Houshmand, Saied Hosseini-Khayat, Mark M. Wilde:
Minimal memory requirements for pearl necklace encoders of quantum convolutional codes. CoRR abs/1004.5179 (2010) - [i2]Monireh Houshmand, Saied Hosseini-Khayat:
Minimal-memory realization of pearl-necklace encoders of general quantum convolutional codes. CoRR abs/1009.2242 (2010) - [i1]Mark M. Wilde, Monireh Houshmand, Saied Hosseini-Khayat:
Examples of minimal-memory, non-catastrophic quantum convolutional encoders. CoRR abs/1011.5535 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-01 00:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: